{"url":"/sota/action-segmentation-on-breakfast-1","task":{"name":"Action Segmentation","url":"/task/action-segmentation","note":null},"dataset":{"name":"Breakfast","url":"/dataset/breakfast"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"**Action Segmentation** is a challenging problem in high-level video understanding. In its simplest form, Action Segmentation aims to segment a temporally untrimmed video by time and label each segmented part with one of pre-defined action labels. The results of Action Segmentation can be further used as input to various applications, such as video-to-text and action localization.\n\n\n<span class=\"description-source\">Source: [TricorNet: A Hybrid Temporal Convolutional and Recurrent Network for Video Action Segmentation ](https://arxiv.org/abs/1705.07818)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Average F1","F1@50%","F1@25%","F1@10%","Edit","Acc","mIoU","F1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Average F1":"higher","F1@50%":"higher","F1@25%":"higher","F1@10%":"higher","Edit":null,"Acc":"higher","mIoU":null,"F1":"higher"}},"counts":{"rows":37,"rows_with_code":27,"rows_with_paper_page":37,"rows_dated":36,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"AdaFocus (newly extracted I3D-features, LT-Context model)","metrics":{"Acc":"78.0","Average F1":"76.2","Edit":"78.3","F1@10%":"82.1","F1@25%":"79.0","F1@50%":"67.5"},"uses_additional_data":false,"paper_date":"2023-11-28","paper":"/paper/adafocus-towards-end-to-end-weakly-supervised","paper_url":"https://arxiv.org/abs/2311.17118v2","paper_title":"Towards Weakly Supervised End-to-end Learning for Long-video Action Recognition","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"FACT (efficient hybrid of convolution and  transformer model)","metrics":{"Acc":"76.2","Average F1":"74.7","Edit":"79.7","F1@10%":"81.4","F1@25%":"76.5","F1@50%":"66.2"},"uses_additional_data":false,"paper_date":"2024-01-01","paper":"/paper/fact-frame-action-cross-attention-temporal","paper_url":"http://openaccess.thecvf.com//content/CVPR2024/html/Lu_FACT_Frame-Action_Cross-Attention_Temporal_Modeling_for_Efficient_Action_Segmentation_CVPR_2024_paper.html","paper_title":"FACT: Frame-Action Cross-Attention Temporal Modeling for Efficient Action Segmentation","code":"https://github.com/zijialewislu/cvpr2024-fact","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"ASQuery","metrics":{"Acc":"77.9","Average F1":"74.6","Edit":"78.4","F1@10%":"80.7","F1@25%":"76.5","F1@50%":"66.5"},"uses_additional_data":false,"paper_date":"2024-09-30","paper":"/paper/asquery-a-query-based-model-for-action","paper_url":"https://ieeexplore.ieee.org/document/10687535","paper_title":"ASQuery: A Query-based Model for Action Segmentation","code":"https://github.com/zlngan/ASQuery","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"BIT","metrics":{"Acc":"75.5","Average F1":"73.7","Edit":"79.0","F1@10%":"80.6","F1@25%":"75.8","F1@50%":"64.7"},"uses_additional_data":false,"paper_date":"2023-08-28","paper":"/paper/bit-bi-level-temporal-modeling-for-efficient","paper_url":"https://arxiv.org/abs/2308.14900v2","paper_title":"BIT: Bi-Level Temporal Modeling for Efficient Supervised Action Segmentation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":5,"model":"DiffAct","metrics":{"Acc":"76.4","Average F1":"73.6","Edit":"78.4","F1@10%":"80.3","F1@25%":"75.9","F1@50%":"64.6"},"uses_additional_data":false,"paper_date":"2023-03-31","paper":"/paper/diffusion-action-segmentation","paper_url":"https://arxiv.org/abs/2303.17959v2","paper_title":"Diffusion Action Segmentation","code":"https://github.com/finspire13/diffact","n_code_links":1,"syntology":{"n_ran":5,"n_unverified":4,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"BaFormer","metrics":{"Acc":"76.6","Average F1":"72.4","Edit":"77.3","F1@10%":"79.2","F1@25%":"74.9","F1@50%":"63.2"},"uses_additional_data":false,"paper_date":"2024-05-25","paper":"/paper/efficient-temporal-action-segmentation-via","paper_url":"https://arxiv.org/abs/2405.15995v1","paper_title":"Efficient Temporal Action Segmentation via Boundary-aware Query Voting","code":"https://github.com/peiyao-w/baformer","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"CETNet","metrics":{"Acc":"74.9","Average F1":"71.8","Edit":"77.8","F1@10%":"79.3","F1@25%":"74.3","F1@50%":"61.9"},"uses_additional_data":false,"paper_date":"2022-05-19","paper":"/paper/cross-enhancement-transformer-for-action","paper_url":"https://arxiv.org/abs/2205.09445v1","paper_title":"Cross-Enhancement Transformer for Action Segmentation","code":"https://github.com/Wangjhdeveloper/CETNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"SF-TMN(ASFormer)","metrics":{"Acc":"77.0","Average F1":"71.6","Edit":"77.0","F1@10%":"78.7","F1@25%":"74.0","F1@50%":"62.2"},"uses_additional_data":false,"paper_date":"2023-06-15","paper":"/paper/sf-tmn-slowfast-temporal-modeling-network-for","paper_url":"https://arxiv.org/abs/2306.08859v1","paper_title":"SF-TMN: SlowFast Temporal Modeling Network for Surgical Phase Recognition","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":9,"model":"ASPnet","metrics":{"Acc":"75.9","Average F1":"70.6","Edit":"76.3","F1@10%":"78.1","F1@25%":"72.9","F1@50%":"60.8"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/aspnet-action-segmentation-with-shared","paper_url":"http://openaccess.thecvf.com//content/CVPR2023/html/van_Amsterdam_ASPnet_Action_Segmentation_With_Shared-Private_Representation_of_Multiple_Data_Sources_CVPR_2023_paper.html","paper_title":"ASPnet: Action Segmentation With Shared-Private Representation of Multiple Data Sources","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":10,"model":"LTContext","metrics":{"Acc":"74.2","Average F1":"70.1","Edit":"77.0","F1@10%":"77.6","F1@25%":"72.6","F1@50%":"60.1"},"uses_additional_data":false,"paper_date":"2023-08-22","paper":"/paper/how-much-temporal-long-term-context-is-needed","paper_url":"https://arxiv.org/abs/2308.11358v2","paper_title":"How Much Temporal Long-Term Context is Needed for Action Segmentation?","code":"https://github.com/ltcontext/ltcontext","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":0,"n_samples":6,"n_pointer_only_licence":6}},{"rank_in_archive_order":11,"model":"EUT","metrics":{"Acc":"75","Average F1":"69.3","Edit":"74.6","F1@10%":"76.2","F1@25%":"71.8","F1@50%":"59.8"},"uses_additional_data":false,"paper_date":"2022-05-26","paper":"/paper/efficient-u-transformer-with-boundary-aware","paper_url":"https://arxiv.org/abs/2205.13425v2","paper_title":"Do we really need temporal convolutions in action segmentation?","code":"https://github.com/ddz16/TUT","n_code_links":1,"syntology":null},{"rank_in_archive_order":12,"model":"UVAST","metrics":{"Acc":"69.7","Average F1":"68.8","Edit":"77.1","F1@10%":"76.9","F1@25%":"71.5","F1@50%":"58"},"uses_additional_data":false,"paper_date":"2022-09-01","paper":"/paper/unified-fully-and-timestamp-supervised","paper_url":"https://arxiv.org/abs/2209.00638v2","paper_title":"Unified Fully and Timestamp Supervised Temporal Action Segmentation via Sequence to Sequence Translation","code":"https://github.com/boschresearch/uvast","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":13,"model":"ASFormer","metrics":{"Acc":"73.5","Average F1":"68.0","Edit":"75.0","F1@10%":"76.0","F1@25%":"70.6","F1@50%":"57.4"},"uses_additional_data":false,"paper_date":"2021-10-16","paper":"/paper/asformer-transformer-for-action-segmentation","paper_url":"https://arxiv.org/abs/2110.08568v1","paper_title":"ASFormer: Transformer for Action Segmentation","code":"https://github.com/chinayi/asformer","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"DPRN","metrics":{"Acc":"71.7","Average F1":"67.9","Edit":"75.1","F1@10%":"75.6","F1@25%":"70.5","F1@50%":"57.6"},"uses_additional_data":false,"paper_date":"2022-05-02","paper":"/paper/maximization-and-restoration-action","paper_url":"https://www.sciencedirect.com/science/article/pii/S003132032200245X","paper_title":"Maximization and restoration: Action segmentation through dilation passing and temporal reconstruction","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"ASRF + HASR","metrics":{"Acc":"69.4","Average F1":"67.1","Edit":"71.9","F1@10%":"74.7","F1@25%":"69.5","F1@50%":"57.0"},"uses_additional_data":false,"paper_date":"2021-01-01","paper":"/paper/refining-action-segmentation-with","paper_url":"http://openaccess.thecvf.com//content/ICCV2021/html/Ahn_Refining_Action_Segmentation_With_Hierarchical_Video_Representations_ICCV_2021_paper.html","paper_title":"Refining Action Segmentation With Hierarchical Video Representations","code":"https://github.com/cotton-ahn/hasr_iccv2021","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"G2L(SSTDA)","metrics":{"Acc":"70.8","Average F1":"66.9","Edit":"74.5","F1@10%":"76.3","F1@25%":"69.9","F1@50%":"54.6"},"uses_additional_data":false,"paper_date":"2021-01-04","paper":"/paper/global2local-efficient-structure-search-for","paper_url":"https://arxiv.org/abs/2101.00910v2","paper_title":"Global2Local: Efficient Structure Search for Video Action Segmentation","code":"https://github.com/ShangHua-Gao/RFNext","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":17,"model":"FIFA + MS-TCN","metrics":{"Acc":"68.6","Average F1":"66.8","Edit":"78.5","F1@10%":"75.5","F1@25%":"70.2","F1@50%":"54.8"},"uses_additional_data":false,"paper_date":"2021-08-09","paper":"/paper/fifa-fast-inference-approximation-for-action","paper_url":"https://arxiv.org/abs/2108.03894v1","paper_title":"FIFA: Fast Inference Approximation for Action Segmentation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":18,"model":"DA","metrics":{"Acc":"71.0","Average F1":"66.4","Edit":"73.6","F1@10%":"74.2","F1@25%":"68.6","F1@50%":"56.5"},"uses_additional_data":false,"paper_date":"2021-04-15","paper":"/paper/action-segmentation-with-mixed-temporal","paper_url":"https://arxiv.org/abs/2104.07461v2","paper_title":"Action Segmentation with Mixed Temporal Domain Adaptation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":19,"model":"ETSN","metrics":{"Acc":"67.8","Average F1":"66.4","Edit":"70.3","F1@10%":"74.0","F1@25%":"69.0","F1@50%":"56.2"},"uses_additional_data":false,"paper_date":"2021-04-30","paper":"/paper/efficient-two-step-networks-for-temporal","paper_url":"https://www.sciencedirect.com/science/article/pii/S0925231221006998","paper_title":"Efficient Two-Step Networks for Temporal Action Segmentation","code":"https://github.com/lyhisme/ETSN","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"ASRF","metrics":{"Acc":"67.6","Average F1":"66.4","Edit":"72.4","F1@10%":"74.3","F1@25%":"68.9","F1@50%":"56.1"},"uses_additional_data":false,"paper_date":"2020-07-14","paper":"/paper/alleviating-over-segmentation-errors-by","paper_url":"https://arxiv.org/abs/2007.06866v1","paper_title":"Alleviating Over-segmentation Errors by Detecting Action Boundaries","code":"https://github.com/yiskw713/asrf","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":11,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"SSTDA","metrics":{"Acc":"70.2","Average F1":"66.4","Edit":"73.7","F1@10%":"75.0","F1@25%":"69.1","F1@50%":"55.2"},"uses_additional_data":false,"paper_date":"2020-03-05","paper":"/paper/action-segmentation-with-joint-self","paper_url":"https://arxiv.org/abs/2003.02824v3","paper_title":"Action Segmentation with Joint Self-Supervised Temporal Domain Adaptation","code":"https://github.com/cmhungsteve/SSTDA","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"C2F-TCN","metrics":{"Acc":"76.0","Average F1":"66.2","Edit":"69.6","F1@10%":"72.2","F1@25%":"68.7","F1@50%":"57.6"},"uses_additional_data":false,"paper_date":"2021-05-23","paper":"/paper/coarse-to-fine-multi-resolution-temporal","paper_url":"https://arxiv.org/abs/2105.10859v1","paper_title":"Coarse to Fine Multi-Resolution Temporal Convolutional Network","code":"https://github.com/dipika-singhania/C2F-TCN","n_code_links":1,"syntology":null},{"rank_in_archive_order":23,"model":"BCN","metrics":{"Acc":"70.4","Average F1":"63.1","Edit":"66.2","F1@10%":"68.7","F1@25%":"65.5","F1@50%":"55.0"},"uses_additional_data":false,"paper_date":null,"paper":"/paper/boundary-aware-cascade-networks-for-temporal","paper_url":"https://www.ecva.net/papers/eccv_2020/papers_ECCV/html/4845_ECCV_2020_paper.php","paper_title":"Boundary-Aware Cascade Networks for Temporal Action Segmentation","code":"https://github.com/MCG-NJU/BCN","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"MuCon","metrics":{"Acc":"62.8","Average F1":"62.6","Edit":"76.3","F1@10%":"73.2","F1@25%":"66.1","F1@50%":"48.4"},"uses_additional_data":false,"paper_date":"2019-04-05","paper":"/paper/weakly-supervised-action-segmentation-using","paper_url":"https://arxiv.org/abs/1904.03116v4","paper_title":"Fast Weakly Supervised Action Segmentation Using Mutual Consistency","code":"https://github.com/yassersouri/MuCon","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"DS-TCN","metrics":{"Acc":"70.75","Average F1":"59.6","Edit":"69.02","F1@10%":"67.70","F1@25%":"62.05","F1@50%":"49.18"},"uses_additional_data":false,"paper_date":"2021-01-19","paper":"/paper/depthwise-separable-temporal-convolutional","paper_url":"https://ieeexplore.ieee.org/document/9320343","paper_title":"Depthwise Separable Temporal Convolutional Network for Action Segmentation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":26,"model":"DTGRM","metrics":{"Acc":"68.3","Average F1":"59.1","Edit":"68.9","F1@10%":"68.7","F1@25%":"61.9","F1@50%":"46.6"},"uses_additional_data":false,"paper_date":"2020-12-14","paper":"/paper/temporal-relational-modeling-with-self","paper_url":"https://arxiv.org/abs/2012.07508v1","paper_title":"Temporal Relational Modeling with Self-Supervision for Action Segmentation","code":"https://github.com/redwang/DTGRM","n_code_links":1,"syntology":null},{"rank_in_archive_order":27,"model":"MS-TCN++ (I3D)","metrics":{"Acc":"67.6","Average F1":"56.2","Edit":"65.6","F1@10%":"64.1","F1@25%":"58.6","F1@50%":"45.9"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/ms-tcn-multi-stage-temporal-convolutional-2","paper_url":"https://arxiv.org/abs/2006.09220v2","paper_title":"MS-TCN++: Multi-Stage Temporal Convolutional Network for Action Segmentation","code":"https://github.com/sj-li/MS-TCN2","n_code_links":1,"syntology":null},{"rank_in_archive_order":28,"model":"MS-TCN++(I3D) (sh)","metrics":{"Acc":"67.3","Average F1":"55.2","Edit":"64.9","F1@10%":"63.3","F1@25%":"57.7","F1@50%":"44.5"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/ms-tcn-multi-stage-temporal-convolutional-2","paper_url":"https://arxiv.org/abs/2006.09220v2","paper_title":"MS-TCN++: Multi-Stage Temporal Convolutional Network for Action Segmentation","code":"https://github.com/sj-li/MS-TCN2","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"GTRM","metrics":{"Acc":"65.0","Average F1":"51.6","Edit":"58.7","F1@10%":"57.5","F1@25%":"54.0","F1@50%":"43.3"},"uses_additional_data":false,"paper_date":"2020-06-01","paper":"/paper/improving-action-segmentation-via-graph-based","paper_url":"http://openaccess.thecvf.com/content_CVPR_2020/html/Huang_Improving_Action_Segmentation_via_Graph-Based_Temporal_Reasoning_CVPR_2020_paper.html","paper_title":"Improving Action Segmentation via Graph-Based Temporal Reasoning","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":30,"model":"MS-TCN (IDT)","metrics":{"Acc":" 65.1","Average F1":"50.6","Edit":" 61.4","F1@10%":"58.2","F1@25%":"52.9","F1@50%":"40.8"},"uses_additional_data":false,"paper_date":"2019-03-05","paper":"/paper/ms-tcn-multi-stage-temporal-convolutional","paper_url":"http://arxiv.org/abs/1903.01945v2","paper_title":"MS-TCN: Multi-Stage Temporal Convolutional Network for Action Segmentation","code":"https://github.com/yabufarha/ms-tcn","n_code_links":2,"syntology":null},{"rank_in_archive_order":31,"model":"MS-TCN (I3D)","metrics":{"Acc":"66.3","Average F1":"46.2","Edit":" 61.7","F1@10%":"52.6","F1@25%":"48.1","F1@50%":"37.9"},"uses_additional_data":false,"paper_date":"2019-03-05","paper":"/paper/ms-tcn-multi-stage-temporal-convolutional","paper_url":"http://arxiv.org/abs/1903.01945v2","paper_title":"MS-TCN: Multi-Stage Temporal Convolutional Network for Action Segmentation","code":"https://github.com/yabufarha/ms-tcn","n_code_links":2,"syntology":null},{"rank_in_archive_order":32,"model":"UDE","metrics":{"Acc":"47.4","F1@50%":"31.9"},"uses_additional_data":false,"paper_date":"2021-04-30","paper":"/paper/unsupervised-discriminative-embedding-for-sub","paper_url":"https://arxiv.org/abs/2105.00067v1","paper_title":"Unsupervised Discriminative Embedding for Sub-Action Learning in Complex Activities","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":33,"model":"RF++-SSTDA","metrics":{"Acc":"70.8"},"uses_additional_data":false,"paper_date":"2022-06-14","paper":"/paper/rf-next-efficient-receptive-field-search-for","paper_url":"https://arxiv.org/abs/2206.06637v2","paper_title":"RF-Next: Efficient Receptive Field Search for Convolutional Neural Networks","code":"https://github.com/ShangHua-Gao/G2L-search","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":34,"model":"TSA (FINCH)","metrics":{"Acc":"65.1","mIoU":"52.1"},"uses_additional_data":false,"paper_date":"2023-04-13","paper":"/paper/leveraging-triplet-loss-for-unsupervised","paper_url":"https://arxiv.org/abs/2304.06403v2","paper_title":"Leveraging triplet loss for unsupervised action segmentation","code":"https://github.com/elenabbbuenob/tsa-actionseg","n_code_links":1,"syntology":null},{"rank_in_archive_order":35,"model":"TSA (Kmeans)","metrics":{"Acc":"63.7","F1":"58","mIoU":"53.3"},"uses_additional_data":false,"paper_date":"2023-04-13","paper":"/paper/leveraging-triplet-loss-for-unsupervised","paper_url":"https://arxiv.org/abs/2304.06403v2","paper_title":"Leveraging triplet loss for unsupervised action segmentation","code":"https://github.com/elenabbbuenob/tsa-actionseg","n_code_links":1,"syntology":null},{"rank_in_archive_order":36,"model":"TSA (Spectral)","metrics":{"Acc":"63.2","F1":"57.8","mIoU":"52.7"},"uses_additional_data":false,"paper_date":"2023-04-13","paper":"/paper/leveraging-triplet-loss-for-unsupervised","paper_url":"https://arxiv.org/abs/2304.06403v2","paper_title":"Leveraging triplet loss for unsupervised action segmentation","code":"https://github.com/elenabbbuenob/tsa-actionseg","n_code_links":1,"syntology":null},{"rank_in_archive_order":37,"model":"TW-FINCH (K=avg/activity)","metrics":{"Acc":"62.7","mIoU":"42.3"},"uses_additional_data":false,"paper_date":"2021-03-20","paper":"/paper/temporally-weighted-hierarchical-clustering","paper_url":"https://arxiv.org/abs/2103.11264v4","paper_title":"Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation","code":"https://github.com/ssarfraz/FINCH-CLustering","n_code_links":1,"syntology":{"n_ran":5,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":1}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":9,"rows_with_any_sample_ran":8,"distinct_papers_with_graph_line":9,"distinct_papers_with_any_sample_ran":8,"samples_over_distinct_papers":{"n_ran":27,"n_unverified":18,"n_samples":45,"n_pointer_only_licence":15,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":27,"n_unverified":18,"n_samples":45,"n_pointer_only_licence":15,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}