Event owner lens
Use this record to benchmark whether a comparable event makes the work after the room visible. The score is 24/100, so the next move is to benchmark the weakest pillars before repeating the format.
mixed-format event agenda agenda analysis
~focs 2018 Workshops
This mixed-format event agenda in Unknown shows 52 visible agenda rows from irif.fr and scores 24/100: a weak visible outcome architecture. The clearest public signals sit in Future-of-Work Fit and Problem Specificity; the main limits are Follow Through and Learning Transfer. Visible mechanisms include Participant work, Network design, and Learning transfer. The public record does not show follow-up or tracking, so the score should be read as design intent rather than durable impact. A practical reading: For a reader, this is mainly a warning or source-evidence record: it reads as a mixed-format event agenda, with the strongest visible signal in future-of-work fit and problem specificity and the biggest open question around follow through and learning transfer. The practical test is whether the published agenda connects the room to post-event continuation and evidence. This page is an original public-evidence analysis, not a copy of the source agenda or an endorsement of the event. The score places the visible agenda in the weak visible effectiveness evidence band. The strongest visible pillars are Future-of-Work Fit, Problem Specificity, and Evidence Maturity; the thinnest visible pillars are Follow Through, Learning Transfer, and Network Design. Visible mechanisms include Participant work, Network design, and Learning transfer. The extracted agenda preview includes 52 visible rows. The most common formats are Unknown, Meal, and Workshop; the most common inferred purposes are Unknown, Wellbeing, and Co Creation.
Eight-pillar fingerprint
Hover any pillar to see what it measures and, where it scored low, what the agenda is missing.
Participation Architecture?26
Participation Architecture - 26/100. Participant work, contribution, interaction, and alternatives to passive broadcast.
Follow Through?5
Follow Through - 5/100. Owners, dates, commitments, progress checks, and accountability after the room.Missing: Add named owners, dates, implementation checkpoints, and a visible post-event continuation path.
Problem Specificity?41
Problem Specificity - 41/100. A clear costly problem, objective, decision, or performance target.
Personalization?27
Personalization - 27/100. Role, path, goal, preparation, or connection tailoring for participants.
Network Design?20
Network Design - 20/100. Structured weak ties, bridge-building, mixers, and relationship persistence.Missing: Replace generic networking blocks with designed introductions, ask-offer exchanges, peer groups, or bridge-building rituals.
Learning Transfer?12
Learning Transfer - 12/100. Applied practice, feedback, workplace use, refreshers, and 30-90 day transfer.Missing: Build transfer into the agenda through practice, feedback, job aids, reflection, and 30-90 day use cases.
Evidence Maturity?41
Evidence Maturity - 41/100. Baseline, comparison, follow-up, isolation, and attribution confidence.
Future-of-Work Fit?52
Future-of-Work Fit - 52/100. Value against time, hybrid reality, accessibility, AI, and meeting load.
Fix the gaps
Field-tested exercises matched to this agenda's weakest pillars, from the exercise library.
Follow Through (5/100)
Exercises that strengthen it: Mental Toughness Workshop • WorkshopBank · 15% Solutions • WorkshopBank · Network Patches
Learning Transfer (12/100)
Exercises that strengthen it: Team Challenge Activity for Group Problem-Solving: Don't... · Thrilling, Quick Elimination Game to Boost Energy - Match... · Creative Brain Teaser & Fun Geometric Team Puzzle - T-Puzzle
Network Design (20/100)
Exercises that strengthen it: Fun Trust-Building Group Game for Team Connection - Izzat... · Exciting Group Trust Activity for Building Confidence... · PFP: September 2005
Agenda Preview
The actual agenda we captured. Every block is classified by format and purpose. Open any block to see how we read it; the colored edge shows whether it is participant work, broadcast, logistics, or a showcase.
Room vs wrapper
2 percent of the 52 classified blocks put participants to work; the rest broadcast, show, or handle logistics. That mix is what drives the participation score.
Participant workBroadcastShowcaseLogistics
8:30-18:00Workshops/TutorialsWorkshopCo Creation+
Format · Participant workWorkshopParticipants work on a problem and produce something. The strongest signal of participation architecture.
Evidence basisMediumRead from source
19:30-21:30Reception At the "patio" of the Jussieu campus, 4 place Jussieu 75005 ParisReceptionRelationship Building+
Format · LogisticsReceptionA social or hospitality block. Pacing and informal connection, not participant work.
Evidence basisMediumRead from source
09:00-09:20Balancing Vectors in Any NormsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:25-09:45Metric Sublinear Algorithms via Linear SamplingUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:50-10:10Approximating the Permanent of a Random Matrix with Vanishing MeanUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:15-10:35Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of MatroidsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:35-10:55Coffee BreakBreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
10:55-11:15A Faster Isomorphism Test for Graphs of Small DegreeUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:20-11:40Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree AlgorithmUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:45-12:05Faster Exact and Approximate Algorithms for k -CutUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:05-14:00Lunch (Hall 8)MealWellbeing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisMediumRead from source
14:00-14:20Hölder Homeomorphisms and Approximate Nearest NeighborsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
14:25-14:45Near-Optimal Approximate Decremental All Pairs Shortest PathsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
14:50-15:10Bloom Filters, Adaptivity, and the Dictionary ProblemUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
15:30-15:50An Improved Bound for Weak Epsilon-Nets in the PlaneUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
15:55-16:15Non-black-box Worst-case to Average-case Reductions within NP(best student paper)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
16:20-16:40Classical Verification of Quantum Computations(best student paper and best paper)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
16:45-18:45Business MeetingUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:00-09:20Contextual Search via Intrinsic VolumesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:25-09:45Towards Learning Sparsely Used Dictionaries with Arbitrary SupportsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:50-10:10Learning Sums of Independent Random Variables with Sparse Collective SupportUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:15-10:35Recharging BanditsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:55-11:15Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle DecompositionsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:20-11:40A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning TreesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:45-12:05Spectral Subspace SparsificationUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
12:05-14:00Lunch (on your own)MealWellbeing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisMediumRead from source
14:00-14:20Improved Online Algorithm for Weighted Flow TimeUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
14:25-14:45Fusible HSTs and the randomized k-server conjectureUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
14:50-15:10An ETH-Tight Exact Algorithm for Euclidean TSPUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
15:15-15:350/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT AlgorithmsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
15:40-16:00On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphsExhibitionShowcase+
Format · ShowcaseExhibitionA showcase or expo floor. Browsing and light interaction rather than structured participant work.
Evidence basisMediumRead from source
16:20-16:40Perfect L p Sampling in a Data StreamUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
16:45-17:05The Sketching Complexity of Graph and Hypergraph CountingUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
17:10-17:30Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion(best paper)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
17:35-18:35Knuth Prize Lecture:On the difficulty of approximating Boolean Max-CSPs Johan Håstad (KTH)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:00-09:20Dispersion for Data-Driven Algorithm Design, Online Learning, and Private OptimizationUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:25-09:45Efficient Density Evaluation for Smooth KernelsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
09:50-10:10Efficiently Learning Mixtures of Mallows ModelsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:15-10:35Efficient Statistics, in High Dimensions, from Truncated SamplesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:55-11:151-factorizations of pseudorandom graphsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:20-11:40Sublinear algorithms for local graph centrality estimationUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:45-12:05Efficient polynomial-time approximation scheme for the genus of dense graphsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
14:00-14:20Beating the integrality ratio for s-t-tours in graphsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
14:25-14:45Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial timeUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
14:50-15:10Random Order Contention Resolution SchemesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
15:15-15:35Strong Coresets for k-Median and Subspace Approximation: Goodbye DimensionUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
15:40-16:00Ɛ -Coresets for Clustering (with Outliers) in Doubling MetricsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
16:20-16:40Efficient algorithms for tensor scaling, quantum marginals, and moment polytopesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
16:45-17:05Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU FactorizationsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
17:10-17:30The diameter of the fractional matching polytope and its hardness implicationsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
17:35-17:55Coordinate Methods for Accelerating $\ell\infty$ Regression and Faster Approximate Maximum FlowUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
18:00-18:20Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time(best paper)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
The Full Reading
Why It Ranks This Way +
Calibrated from GES design 27/100 and verified 28/100 with no fourth-loop cap.
Reader Takeaway. For a reader, this is mainly a warning or source-evidence record: it reads as a mixed-format event agenda, with the strongest visible signal in future-of-work fit and problem specificity and the biggest open question around follow through and learning transfer. The practical test is whether the published agenda connects the room to post-event continuation and evidence.
Strongest signals: Future-of-Work Fit, Problem Specificity, and Evidence Maturity. Weakest signals: Follow Through, Learning Transfer, and Network Design.
How This Agenda Could Improve +
- Add named owners, dates, implementation checkpoints, and a visible post-event continuation path.
- Build transfer into the agenda through practice, feedback, job aids, reflection, and 30-90 day use cases.
- Replace generic networking blocks with designed introductions, ask-offer exchanges, peer groups, or bridge-building rituals.
Fastest next move: Add named owners, dated next steps, and a visible continuation path before treating the event as outcome-ready.
Role-Specific Reading +
Sponsor lens
Look beyond exposure. Strong sponsor value would show qualified interaction, problem work, buyer learning, customer evidence, or follow-up. The practical sponsor move is to look for structured introductions, buyer-seller fit, and relationship persistence.
Designer lens
The agenda is useful as a pattern sample from irif.fr. Redesign attention should go first to the lowest-scoring pillars; in practice, turn the thinnest agenda blocks into participant work.
Executive lens
Treat the visible agenda as an operating plan. The executive move is to require owners, dates, and evidence before treating the event as strategic. If owners, proof, and follow-through are not visible, the public record does not yet prove strategic movement.
Aggregator lens
Treat the source URL as evidence, not decoration. The data-product move is to label the source boundary clearly before ranking the record before ranking or syndicating the record.
What GES Means Here +
The Gathering Effectiveness Score is a strict 0-100 public-evidence reading of the agenda across eight pillars. It rewards visible participant work, follow-through, transfer, network design, and proof mechanisms more than polish, speaker fame, attendance, or satisfaction.
Visible mechanisms: Participant work, Network design, Learning transfer.
Evidence boundary: Scores reflect visible agenda/source evidence and should not be read as proof of causal event impact.
Limitations, Score Caps, and Review Flags +
Limitations
- No visible follow-up, progress monitoring, or longitudinal tracking.
- No baseline measurement is visible.
Score caps
- No fourth-loop score cap applied.
Review flags
- Agenda is useful as a source record but weak as evidence of gathering effectiveness.
- No source-backed follow-up, validation, baseline, tracking, or impact evidence.
Is this proof the event worked? +
No. This is a strict public-evidence reading of the agenda. Proof would require baseline, comparison, follow-up, attribution, and impact evidence beyond the listing.
What should a reader inspect first? +
Start with the source URL, then compare the eight pillar scores against the agenda rows. The biggest opportunities usually sit in follow-through, evidence maturity, and participant work.
Why publish weak records? +
Weak records are part of the map. They show where public agendas still describe sessions and speakers more often than outcomes, commitments, transfer, or proof.
How should I use the rows? +
Read the agenda rows as the visible design trace: formats, purposes, and evidence labels show what the public source made inspectable, not everything that happened in the room. This is a source-grounded interpretation of the public agenda record, not a copy of the source, and not an endorsement of the event.
Embed the verified badge +
This record is in the hand-verified gold set. Copy the snippet below to embed the verified badge on your own site.
<a href="https://unitedwetransform.com/events/evt_2018_www_irif_fr_focs2018_workshops_irif_fr"><img src="https://unitedwetransform.com/badge/ges-verified.svg" alt="GES verified by United We Transform" height="40"></a>Where To Go Next
Compare this agenda against other Unknown events scored on the same eight pillars.