Event owner lens
Use this record to benchmark whether a comparable event makes the work after the room visible. The score is 33/100, so the next move is to benchmark the weakest pillars before repeating the format.
academic research science agenda agenda analysis
Program & Papers
This academic research science agenda in Academic / Research / Science shows 58 visible agenda rows from ieee-focs.org and scores 33/100: a thin but inspectable design signal. The clearest public signals sit in Future-of-Work Fit and Problem Specificity; the main limits are Follow Through and Network Design. 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... A practical reading: For a reader, this is a comparison record more than a model to copy: it reads as an academic research science agenda, with the strongest visible signal in future-of-work fit and problem specificity and the biggest open question around follow through and network design. 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 thin outcome architecture band. The strongest visible pillars are Future-of-Work Fit, Problem Specificity, and Personalization; the thinnest visible pillars are Follow Through, Network Design, and Learning Transfer. Visible mechanisms include Participant work, Network design, and Learning transfer. The extracted agenda preview includes 58 visible rows. The most common formats are Unknown, Workshop, and Break; 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?30
Participation Architecture - 30/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?40
Problem Specificity - 40/100. A clear costly problem, objective, decision, or performance target.
Personalization?37
Personalization - 37/100. Role, path, goal, preparation, or connection tailoring for participants.
Network Design?18
Network Design - 18/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?22
Learning Transfer - 22/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?35
Evidence Maturity - 35/100. Baseline, comparison, follow-up, isolation, and attribution confidence.
Future-of-Work Fit?72
Future-of-Work Fit - 72/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
Network Design (18/100)
Exercises that strengthen it: Fun Trust-Building Group Game for Team Connection - Izzat... · Exciting Group Trust Activity for Building Confidence... · PFP: September 2005
Learning Transfer (22/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
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
5 percent of the 58 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 - 10:00Workshop: Beyond worst case analysis of algorithms Workshop: A TCS Quiver Tutorial: High-dimensional ExpandersWorkshopCo Creation+
Format · Participant workWorkshopParticipants work on a problem and produce something. The strongest signal of participation architecture.
Evidence basisMediumRead from source
10:00 - 10:15Coffee BreakBreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
10:15 - 11:45Workshop: Beyond worst case analysis of algorithms Workshop: A TCS Quiver Workshop: TCS Early Career MentoringWorkshopCo Creation+
Format · Participant workWorkshopParticipants work on a problem and produce something. The strongest signal of participation architecture.
Evidence basisMediumRead from source
11:45 - 1:00Lunch (on your own)MealWellbeing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisMediumRead from source
1:00 - 2:30Tutorial: Theoretical Foundations of Active Learning Workshop: A TCS Quiver Workshop: TCS Early Career MentoringWorkshopCo Creation+
Format · Participant workWorkshopParticipants work on a problem and produce something. The strongest signal of participation architecture.
Evidence basisMediumRead from source
3:00 - 6:00ShafiFestUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
6:00 - 8:00Welcome ReceptionOpening RemarksOrientation+
Format · BroadcastOpening RemarksFraming or welcome from the stage. Orients the room, not participatory.
Evidence basisMediumRead from source
7:30 - 8:30Breakfast (Atrium)MealWellbeing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisMediumRead from source
8:30 - 8:50Tight Bounds for Online Edge Coloring How to Use Heuristics for Differential PrivacyUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:55 - 9:15Online Matching with General Arrivals The Role of Interactivity in Local Differential PrivacyUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:20 - 9:40Polylogarithmic Guarantees for Generalized Reordering Buffer Management Learning from Outcomes: Evidence-Consistent RankingsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:45 - 10:05General Framework for Metric Optimization Problems with Delay or with Deadlines Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed BanditsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:25 - 10:45Derandomization from Algebraic Hardness: Treading the Borders Adversarial Bandits with KnapsacksUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:50 - 11:10Expander Graphs -- Both local and global Approximation Schemes for a Buyer with Independent Items via SymmetriesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40 - 12:00Approximating Constraint Satisfaction Problems on High-Dimensional Expanders Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive BuyersUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
1:45 - 2:05Reed-Muller codes polarize Fully Dynamic Maximal Independent Set in Expected Poly-Log Update TimeUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:10 - 2:30SETH-hardness of Coding Problems A New Deterministic Algorithm for Dynamic Set CoverUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:35 - 2:55Quasilinear time list-decodable codes for space bounded channels Sensitive Distance and Reachability Oracles for Large Batch UpdatesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:00 - 3:20An Optimal Document Exchange Protocol Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update TimeUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:25 - 3:45Radio Network Coding Requires Logarithmic Overhead Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower BoundsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:05 - 4:25Lower bounds for maximal matchings and maximal independent setsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:30 - 4:50Automating Resolution is NP-HardUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:55 - 5:15NEEXP is contained in MIPUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
all eventBreakBreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
5:3060th FOCS Celebration (Constellation CDEF, dinner in Atrium at )MealWellbeing+
Format · LogisticsMealA pacing block. Can carry unstructured networking, not scored as participant work.
Evidence basisMediumRead from source
8:00Business Meeting (Constellation CDEF)UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:30 - 8:50Inapproximability of Clustering in Lp-metrics Perfect zero knowledge for quantum multiprover interactive proofsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:55 - 9:15Near-Linear-Time Approximation Schemes for Clustering in Doubling Metrics Leakage-Resilient Secret Sharing Against Colluding PartiesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:20 - 9:40A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs Laconic Conditional Disclosure of Secrets and ApplicationsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:45 - 10:05Smoothed Analysis in Unsupervised Learning via Decoupling Non-Malleable Commitments using Goldreich-Levin List DecodingUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:25 - 10:45Distributed local approximation algorithms for maximum matching in graphs and hypergraphs Fast generalized DFTs for all finite groupsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:50 - 11:10Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications Waring Rank, Parameterized and Exact AlgorithmsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:15 - 11:35Beyond trace reconstruction: Population recovery from the deletion channel More barriers for rank methods, via a "numeric to symbolic" transferUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40 - 12:00Multi-Resolution Hashing for Fast Pairwise Summations Towards a theory of non-commutative optimization: geodesic 1st and 2nd order methods for moment maps and polytopesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
1:45 - 2:05Planar Graphs have Bounded Queue-Number A Quantum Query Complexity Trichotomy for Regular LanguagesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
2:10 - 2:30Parametric Shortest Paths in Planar Graphs Exponential Separation between Quantum Communication and Logarithm of Approximate RankExhibitionShowcase+
Format · ShowcaseExhibitionA showcase or expo floor. Browsing and light interaction rather than structured participant work.
Evidence basisMediumRead from source
2:35 - 2:55Random k-out subgraph leaves only O(n/k) inter-component edges Quantum advantage with noisy shallow circuits in 3DUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:00 - 3:20New Notions and Constructions of Sparsification for Graphs and Hypergraphs Stoquastic PCP vs. RandomnessUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:25 - 3:45Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces Computationally-secure and composable remote state preparationUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:45 - 4:45Job Market Posters and Coffee Break (Atrium)Poster SessionShowcase+
Format · ShowcasePoster SessionPresenters display work; attendees browse and ask questions. Some interaction, not structured work.
Evidence basisMediumRead from source
4:45 - 5:05Efficient Construction of Rigid Matrices Using an NP OracleUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
5:10 - 5:30Faster Minimum k-cut of a Simple GraphUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
5:35 - 5:55Truly Optimal Euclidean SpannersUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:30 - 8:50Sublinear Algorithms for Gap Edit Distance Spectral analysis of matrix scaling and operator scalingUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
8:55 - 9:15Approximation Algorithms for LCS and LIS with Truly Improved Running Times Noise Sensitivity on the p-Biased HypercubeUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:20 - 9:40Faster Matroid Intersection The complexity of 3-colouring H-colourable graphsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
9:45 - 10:05Balancing Straight-Line Programs Hardness Magnification for all Sparse NP LanguagesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:25 - 10:45The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs Faster polytope rounding, sampling, and volume computation via a sublinear "Ball Walk"UnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
10:50 - 11:10Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits Modified log-Sobolev inequalities for strongly log-concave distributionsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:15 - 11:35Why are Proof Complexity Lower Bounds Hard? Fast uniform generation of random graphs with given degree sequencesUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
11:40 - 12:00Polynomial calculus space and resolution width A Deterministic Algorithm for Counting Colorings with 2Δ ColorsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
1:45 - 2:05Breaking of 1RSB in random MAX-NAE-SAT Finding monotone patterns in sublinear timeBreakWellbeing+
Format · LogisticsBreakA pacing or recovery block between sessions.
Evidence basisMediumRead from source
2:10 - 2:30Optimization of the Sherrington-Kirkpatrick Hamiltonian Agreement testing theorems on layered set systemsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:00 - 3:20The Kikuchi Hierarchy and Tensor PCA Junta-correlation is testableUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
3:40 - 4:00An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices Near-Optimal Massively Parallel Graph ConnectivityUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:05 - 4:25(Nearly) Sample Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless Exponentially Faster Massively Parallel Maximal MatchingExhibitionShowcase+
Format · ShowcaseExhibitionA showcase or expo floor. Browsing and light interaction rather than structured participant work.
Evidence basisMediumRead from source
4:30 - 4:50Efficient Truncated Statistics with Unknown Truncation Conditional Hardness Results for Massively Parallel Computation from Distributed Lower BoundsUnknownUnknown+
Format · BroadcastUnknownFormat not classified from the source; treated as a broadcast block by default.
Evidence basisMediumRead from source
4:55 - 5:15Residual Based Sampling for Online Low Rank Approximation Parallel Reachability in Almost Linear Work and Square Root DepthUnknownUnknown+
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 32/100 and verified 32/100 with no fourth-loop cap.
Reader Takeaway. For a reader, this is a comparison record more than a model to copy: it reads as an academic research science agenda, with the strongest visible signal in future-of-work fit and problem specificity and the biggest open question around follow through and network design. 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 Personalization. Weakest signals: Follow Through, Network Design, and Learning Transfer.
How This Agenda Could Improve +
- Add named owners, dates, implementation checkpoints, and a visible post-event continuation path.
- Replace generic networking blocks with designed introductions, ask-offer exchanges, peer groups, or bridge-building rituals.
- Build transfer into the agenda through practice, feedback, job aids, reflection, and 30-90 day use cases.
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 ieee-focs.org. 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
- No source-backed follow-up, validation, baseline, tracking, or impact evidence.
- Satisfaction/NPS signal found, but it is excluded from effectiveness scoring.
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.
Where To Go Next
Compare this agenda against other Academic / Research / Science events scored on the same eight pillars.