{"as_of":"2026-08-09T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6e3848fd076d1deddbba58522cfbe6d7be513cc2b2cf7fd03f7d6304c07ac6bc","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T13:53:04.260789Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.18260/citation-record","integrity":"/paper/2607.18260/integrity","json":"/paper/2607.18260/citation-record.json","paper":"/paper/2607.18260"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:02.201912Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.201912Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:af5aa28de0abe77b3789a2c1c1d8c0de076eaa2f309c0b9e9e6d2aace82f7809","observation_id":"f6492574-59b8-4d31-bc79-d3ef76b92028","resolution":{"observed_at":"2026-08-02T13:53:02.201912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:02.268546Z","title":"Notices of the American Mathematical Society , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.268546Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:59bcf35b5146459f84651eafff6c227b21f3ee36a79aa888f1f6c22101f43054","observation_id":"ddc26d80-a986-4b36-a98b-15442a2c33b5","resolution":{"observed_at":"2026-08-02T13:53:02.268546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:02.359388Z","title":"Mathematics in Computer Science , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.359388Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:7b1050ad9d5f57b79063d4eb5f4194e54297f16c8354cd851359fd4261ba858c","observation_id":"ec655c0a-6d43-4d5c-9988-163541020be6","resolution":{"observed_at":"2026-08-02T13:53:02.359388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:02.525440Z","title":"Foundations and Trends in Programming Languages , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.525440Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:7013120b8d4c2b0a6b2cd28e99c16193cc51d4826df6d486ecdd22c64cc87455","observation_id":"df237279-c32f-4cb1-be20-dab31291a370","resolution":{"observed_at":"2026-08-02T13:53:02.525440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:02.620070Z","title":"2021 , eprint =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.620070Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:062362a15855457c2825a7c191aa6e6f027ae8b4af18614748889f5a1c762ae5","observation_id":"c0254d3a-abb2-444a-825e-32862e5f3a83","resolution":{"observed_at":"2026-08-02T13:53:02.620070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:02.720666Z","title":"2021 , eprint =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.720666Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:eda5ce1b01f71dc466d16efb133361cb464fc712132a71bcaa0ff33b5f230d0d","observation_id":"a837078f-45ec-4b5a-b04c-841a41469f23","resolution":{"observed_at":"2026-08-02T13:53:02.720666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09938","last_updated":"2021-11-08T21:16:44Z","snapshot_observed_at":"2026-08-04T23:13:25.514661Z","submitted_at":"2021-05-20T17:58:42Z","title":"Measuring Coding Challenge Competence With APPS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09938","snapshot_observed_at":"2026-08-02T13:53:02.811964Z","title":"Measuring Coding Challenge Competence With","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.811964Z"},"links":{"cited_paper":"/paper/2105.09938","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:a01d08d50d6652c46d544f3c0d1729da166cd2f5886638369a200e80e7097107","observation_id":"f06c28be-c323-4151-8228-a53268b3543f","resolution":{"observed_at":"2026-08-02T13:53:02.811964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:02.900914Z","title":"and Yu, Tao , booktitle =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:02.900914Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:b585a0cba348ef26606302ff220802a9fa5d62d92b008d2020fb6601d509ff58","observation_id":"78be9fde-35fb-43a0-afef-fd4c1bf21bcb","resolution":{"observed_at":"2026-08-02T13:53:02.900914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15877","last_updated":"2025-04-01T08:36:44Z","snapshot_observed_at":"2026-07-31T19:00:59.311189Z","submitted_at":"2024-06-22T15:52:04Z","title":"BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15877","snapshot_observed_at":"2026-08-02T13:53:03.007019Z","title":"2406.15877 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.007019Z"},"links":{"cited_paper":"/paper/2406.15877","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:e273fdec9234e7294c51c3bf7ff687115c081b893dd5b2b64305ee0bac9ac628","observation_id":"d62ff8fa-f42b-46d6-905b-25f4c692b26a","resolution":{"observed_at":"2026-08-02T13:53:03.007019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:03.122196Z","title":"Competition-level code generation with","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.122196Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:9738118bd009b3b1b210b84bbaf42acbd978780029fd8a27d519e36efe58c622","observation_id":"8f55fe7d-dd95-472a-aad1-6e788a427f88","resolution":{"observed_at":"2026-08-02T13:53:03.122196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-02T13:53:03.155244Z","title":"2403.07974 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.155244Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:be2160809121be09a25b3152ab0b9aeadff640d9c2465a7784bb3105f17f0db3","observation_id":"aa93c4b2-4f74-4570-8359-570762374dac","resolution":{"observed_at":"2026-08-02T13:53:03.155244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04664","last_updated":"2021-03-16T08:28:37Z","snapshot_observed_at":"2026-07-06T10:39:42.676631Z","submitted_at":"2021-02-09T06:16:25Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04664","snapshot_observed_at":"2026-08-02T13:53:03.229863Z","title":"2102.04664 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.229863Z"},"links":{"cited_paper":"/paper/2102.04664","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:03cf6f7c9fd97bae692d3e176596185c7b7ac9043681115d08f9797c2d5c2a69","observation_id":"9fb3a808-6dc0-4b5d-9a08-8c40b4ec61e9","resolution":{"observed_at":"2026-08-02T13:53:03.229863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.08227","last_updated":"2022-12-19T10:30:12Z","snapshot_observed_at":"2026-08-09T09:48:07.734660Z","submitted_at":"2022-08-17T11:16:52Z","title":"MultiPL-E: A Scalable and Extensible Approach to Benchmarking Neural Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.08227","snapshot_observed_at":"2026-08-02T13:53:03.342870Z","title":"and Guha, Arjun and Greenberg, Michael and Jangda, Abhinav , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.342870Z"},"links":{"cited_paper":"/paper/2208.08227","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:2ced8453e5f6c9e3deda753913dd0c42637a4fb2db9217e68d0a81735a2afc27","observation_id":"d612cc47-3909-41de-b7e0-6c70d99a0fa7","resolution":{"observed_at":"2026-08-02T13:53:03.342870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:03.462855Z","title":"Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.462855Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:ce00783535959ae7881da21e294e772445d163dd2a1c19611ddbdd6d02617579","observation_id":"f9bc12ab-3607-4df5-9788-d0b7c07f46f1","resolution":{"observed_at":"2026-08-02T13:53:03.462855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:03.631101Z","title":"2019 , volume =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.631101Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:5c54292e41cb523197d8f95b31bb76cdb58b03c61694918b05fe4a62b38a78fc","observation_id":"70a700fc-ce84-483e-9e2d-b91be1c6ea4a","resolution":{"observed_at":"2026-08-02T13:53:03.631101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-02T13:53:03.780302Z","title":"Measuring Mathematical Problem Solving With the","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.780302Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:1f507d68fa7ecc2d4fb8410b4f46e81521d36405b008712f5eec3c090db874cc","observation_id":"bcb5b616-d203-4c83-b7bd-5fc62da92ebe","resolution":{"observed_at":"2026-08-02T13:53:03.780302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00110","last_updated":"2022-02-28T06:03:23Z","snapshot_observed_at":"2026-08-09T06:26:57.793642Z","submitted_at":"2021-08-31T23:21:12Z","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00110","snapshot_observed_at":"2026-08-02T13:53:03.836999Z","title":"2109.00110 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.836999Z"},"links":{"cited_paper":"/paper/2109.00110","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:b7352f3e8544a9161f90b12548a753a858fc4c8ff7cd0a8ce5ac8667430b5387","observation_id":"d0e71e36-f0bd-4e85-b363-8f1f98f49ce5","resolution":{"observed_at":"2026-08-02T13:53:03.836999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-02T13:53:03.983462Z","title":"2409.12186 , archivePrefix =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:03.983462Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:60af626877db85a052c2985e9aebea81a7f7e4671dbac0761b5d6502b877ce95","observation_id":"b345c434-eecb-4b91-8189-77adedb24b7a","resolution":{"observed_at":"2026-08-02T13:53:03.983462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-02T13:53:04.111192Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:04.111192Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:8c8b6fc956d107753962b47ab1ba4b81d9ec3610cb54ca5f149ab2284e64ca5f","observation_id":"ddd997c8-3ceb-4db1-83b3-d66d8459ef9e","resolution":{"observed_at":"2026-08-02T13:53:04.111192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:53:04.260789Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T13:53:04.260789Z"},"links":{"citing_paper":"/paper/2607.18260"},"observation_digest":"sha256:b11709b16b46b5f3ba18353c2ed0668bd9c546ae7546534ede32186297d59dd0","observation_id":"bdd718c2-ec26-4a05-a36e-f79141b069ac","resolution":{"observed_at":"2026-08-02T13:53:04.260789Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18260","last_updated":"2026-05-16T02:55:06Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T09:54:49.710927Z","submitted_at":"2026-05-16T02:55:06Z","title":"FindStatBench: Evaluating Large Language Models on Combinatorial Code Synthesis"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.18260."}