{"as_of":"2026-08-19T06:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58f4b0925e13e060786d4bb269cad799e576ba60f511ba46bb3683fddcca59e0","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:45:48.452583Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T05:16:01.880382Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T05:16:01.957378Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"cited_work":{"arxiv_id":"2505.23881","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.23881","snapshot_observed_at":"2026-08-08T05:16:01.957378Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","venue":"cs.AI","work_id":"c1e77842-df46-47bd-8a32-c012e85ee306","year":2025},"citing_paper":{"arxiv_id":"2502.08424","last_updated":"2025-07-15T17:06:38Z","snapshot_observed_at":"2026-08-14T08:55:56.105161Z","submitted_at":"2025-02-12T14:07:18Z","title":"Constructions of Covering Sequences and Arrays","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T05:16:01.880382Z"},"links":{"cited_paper":"/paper/2505.23881","citing_paper":"/paper/2502.08424"},"observation_digest":"sha256:d5637a22c2fb9e1c3f597f02f28a89c7f9ca21d06572b5b58459d34ea51012f4","observation_id":"2da14302-5292-4a9a-b9da-a437714fbc1f","resolution":{"observed_at":"2026-08-08T05:16:01.963881Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23881","snapshot_observed_at":"2026-08-03T03:49:17.061731Z","title":"Using reasoning models to generate search heuristics that solve open instances of combinatorial design problems.arXiv preprint arXiv:2505.23881, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-14T16:05:42.470375Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.061731Z"},"links":{"cited_paper":"/paper/2505.23881","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:c2d74e1ac3495b97c3b5ade1c33e85895a0ef5dcc30d037459f9eb3cdec2dd80","observation_id":"235b6e40-67d0-46dd-ac27-8af72ffc6bdb","resolution":{"observed_at":"2026-08-03T03:49:17.061731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23881","snapshot_observed_at":"2026-08-02T01:03:35.071473Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14840","last_updated":"2026-07-21T06:38:43Z","snapshot_observed_at":"2026-08-17T11:30:16.809920Z","submitted_at":"2026-07-16T11:06:17Z","title":"Covering Sequences and Covering-Sequences Codes","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T01:03:35.071473Z"},"links":{"cited_paper":"/paper/2505.23881","citing_paper":"/paper/2607.14840"},"observation_digest":"sha256:9d5b51093656015922866faedd599d7bd1d0750a9438b6b0c5d373c1b14177f0","observation_id":"e9819ae3-dde1-48f4-babf-f46e9d0d1a54","resolution":{"observed_at":"2026-08-02T01:03:35.071473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23881","snapshot_observed_at":"2026-08-01T07:17:10.629745Z","title":"Using reasoning models to generate search heuristics that solve open instances of combinatorial design problems.arXiv preprint arXiv:2505.23881, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-14T08:55:51.869176Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.629745Z"},"links":{"cited_paper":"/paper/2505.23881","citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:47779a6071ac7d9b158a06abd10e2b21892c31a7ad475ac8d587b412cceabff5","observation_id":"4f218138-a712-4ec1-bb41-59768e675d55","resolution":{"observed_at":"2026-08-01T07:17:10.629745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.23881/citation-record","integrity":"/paper/2505.23881/integrity","json":"/paper/2505.23881/citation-record.json","paper":"/paper/2505.23881"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.03350","last_updated":"2025-03-05T10:22:49Z","snapshot_observed_at":"2026-08-16T12:52:55.214367Z","submitted_at":"2025-03-05T10:22:49Z","title":"Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.03350","snapshot_observed_at":"2026-08-07T12:45:42.232890Z","title":"Bömer, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:42.232890Z"},"links":{"cited_paper":"/paper/2503.03350","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:3bbc8a00a0f55eb769b0dc347ff119ec787237c8834ffa6d811bb4158c0820a1","observation_id":"986d6ccd-fd48-4eb4-98ac-c36747ba80a2","resolution":{"observed_at":"2026-08-07T12:45:42.232890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00566","last_updated":"2024-11-01T13:23:58Z","snapshot_observed_at":"2026-08-16T19:04:17.849917Z","submitted_at":"2024-11-01T13:23:58Z","title":"PatternBoost: Constructions in Mathematics with a Little Help from AI","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.00566","snapshot_observed_at":"2026-08-07T12:45:42.328152Z","title":"Charton, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:42.328152Z"},"links":{"cited_paper":"/paper/2411.00566","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:c1aa2aed5c1b1d5dac439c20d2aed31ff0777167adde5484381d460374785602","observation_id":"317ecc2e-92b9-4256-b2c8-f05b54da7dd8","resolution":{"observed_at":"2026-08-07T12:45:42.328152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06366","last_updated":"2025-03-09T00:11:40Z","snapshot_observed_at":"2026-08-17T08:19:32.225215Z","submitted_at":"2025-03-09T00:11:40Z","title":"Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics","version":1},"cited_work":{"arxiv_id":"2503.06366","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.06366","snapshot_observed_at":"2026-08-07T12:45:49.461389Z","title":"Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics","venue":"cs.LG","work_id":"01c73aa5-4151-4ec5-8acc-c62fa50ae8ef","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:42.477556Z"},"links":{"cited_paper":"/paper/2503.06366","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:94b5254d8fc55c5c5d5198305b6b18cf71632bb90421ef979cf0762321897fcb","observation_id":"6cd80de2-c5a0-4097-a8a9-074dcac4d94f","resolution":{"observed_at":"2026-08-07T12:45:49.585467Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:57.488439Z","title":null,"venue":null,"work_id":"72a21175-0709-4efa-ab58-77f7eec43ac9","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:42.624582Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:6a8f4978ac2359bfac8593657dcfc28aab8b4b99ada6550207064ec0a2b9c72f","observation_id":"2650682a-6fbe-4bf2-8427-d36bb55ac207","resolution":{"observed_at":"2026-08-07T12:45:57.613811Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:57.279963Z","title":null,"venue":null,"work_id":"6754cbde-61e5-4844-a6dd-ec8b9b6c07cd","year":null},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:42.774794Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:a3da2d4999b5c148437d4e65d745945e38b60f64ad6c8d0f70bdb7645ea0aaa6","observation_id":"1d2ac09f-5486-4495-bcce-9d25cbcaf6cc","resolution":{"observed_at":"2026-08-07T12:45:57.402016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20694","last_updated":"2025-02-21T03:28:49Z","snapshot_observed_at":"2026-08-16T10:06:52.924132Z","submitted_at":"2024-12-30T04:05:22Z","title":"QUBE: Enhancing Automatic Heuristic Design via Quality-Uncertainty Balanced Evolution","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20694","snapshot_observed_at":"2026-08-07T12:45:42.916167Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:42.916167Z"},"links":{"cited_paper":"/paper/2412.20694","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:f6f4981db9305afa81efa5530141d82d32f969599402409369aa150f7e1b9477","observation_id":"3fcca14b-afe5-4338-88a6-98e6d0627ff0","resolution":{"observed_at":"2026-08-07T12:45:42.916167Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:57.028941Z","title":null,"venue":null,"work_id":"b139ae54-710e-4f15-803c-6093345ac872","year":2006},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.032821Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:5c48380d504ef2d374c4c30ee501dfbce5b69238fa0d1649a90cfba2cb2c85cb","observation_id":"fa142f43-e334-449d-8114-cecee28393d5","resolution":{"observed_at":"2026-08-07T12:45:57.140105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:56.717860Z","title":null,"venue":null,"work_id":"26cf2941-7f0f-4752-ad24-94dfc430d2b2","year":2018},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.144237Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:bbfb51d39c8c8135c332eba8423711ee4486de455f757b9efc2c0a9a188c504e","observation_id":"cfcb2d3b-a7dd-4189-bc77-42d3831a9a4b","resolution":{"observed_at":"2026-08-07T12:45:56.872760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:56.504412Z","title":null,"venue":null,"work_id":"608da7f3-fdf8-4649-b1af-c4037a6c38c2","year":2018},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.255743Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:f70cdb2327cdd111c20d05d29ad3a3934b21e3504bf5a65fa353b756b8b3d914","observation_id":"7b0f8790-e11e-4ad0-8e99-b8250573081d","resolution":{"observed_at":"2026-08-07T12:45:56.617912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11061","last_updated":"2025-03-17T01:42:26Z","snapshot_observed_at":"2026-08-18T16:11:20.111968Z","submitted_at":"2025-03-14T03:54:43Z","title":"Generative Modeling for Mathematical Discovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.11061","snapshot_observed_at":"2026-08-07T12:45:43.373622Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.373622Z"},"links":{"cited_paper":"/paper/2503.11061","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:d7638f0e84d6e30993c0515b9aec95cb929c99b3aa30c6985796b56deed5ec26","observation_id":"34338bc4-9758-4550-8e09-6ff31493dadd","resolution":{"observed_at":"2026-08-07T12:45:43.373622Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:56.181839Z","title":"AI benchmarking hub – FrontierMath, 2025","venue":null,"work_id":"046f81b4-910c-4776-9424-c6557a7a42a4","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.493995Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:d463f9dec0c2e671cbab4edb1086c0c40607b4bd5e5a09b3a2790d637e3727c9","observation_id":"f5bd7e4c-ee67-4630-bb6a-78e330de9f4c","resolution":{"observed_at":"2026-08-07T12:45:56.301235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:55.942885Z","title":null,"venue":null,"work_id":"f8405afe-a416-440e-824f-a500f3ea7b58","year":1995},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.636177Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:35ebc64be6595df5c2d33c2a68ea7795c1c7ffd5de9a9dfcadf1f12f4d1c5f58","observation_id":"2814758c-beeb-43ee-8805-e6eefda3a832","resolution":{"observed_at":"2026-08-07T12:45:56.072778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:55.685559Z","title":null,"venue":null,"work_id":"763de66d-29f2-4dac-8488-1a21a4d08a04","year":2023},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.762910Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:f00cb9d7856fcea093c98fd726a8ac24850449d09557ff0b909da850e61c58b2","observation_id":"8f81bf22-84c6-4d70-884c-e14ea4ef5c8f","resolution":{"observed_at":"2026-08-07T12:45:55.840335Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04872","last_updated":"2025-12-23T02:23:47Z","snapshot_observed_at":"2026-08-13T13:45:44.430193Z","submitted_at":"2024-11-07T17:07:35Z","title":"FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04872","snapshot_observed_at":"2026-08-07T12:45:43.891256Z","title":"Glazer, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:43.891256Z"},"links":{"cited_paper":"/paper/2411.04872","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:ddb853397d8774802886370d6ec601afe3f37023a38c759349d1f4876bd53c6d","observation_id":"1fa19fda-577b-4940-af64-d789bac285dc","resolution":{"observed_at":"2026-08-07T12:45:43.891256Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:55.436261Z","title":"Glover and M","venue":null,"work_id":"f9349c44-1430-4d63-8d58-4c18c664fd33","year":1997},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.013014Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:54cd0c10493407e8b036a0dee3315eba558deb16b788424c166cb34b5acd9acd","observation_id":"b98ee91d-9e40-40cb-9a36-523aef5c13ee","resolution":{"observed_at":"2026-08-07T12:45:55.569198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:55.212065Z","title":null,"venue":null,"work_id":"c4fa65a1-2a66-4366-af22-60173861c083","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.109367Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:f6ccd173c091c9113644150efcf82b880f9ad1b1a8f5672168844bc1a306bbab","observation_id":"26a5ee38-fe7e-46ce-ad38-38cbfb10c7ae","resolution":{"observed_at":"2026-08-07T12:45:55.321305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:54.895951Z","title":null,"venue":null,"work_id":"10a173c9-b5f4-4880-a772-64863d7b51a3","year":2002},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.249245Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:6a89f2c0d5bc9f54ddb61b3df23ca677c02e2e273cdf2e877c2a68b5117a8ca6","observation_id":"fe79eaf4-160e-4e85-8ade-256ff7c952ca","resolution":{"observed_at":"2026-08-07T12:45:55.048257Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:54.649959Z","title":null,"venue":null,"work_id":"5ac11e46-56f5-401e-b913-bc906c76e52f","year":2020},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.368810Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:2c9f7f7ba95dd004f6b3f9ea928f1912804c05cfd95aec69d3658c264f91fbb1","observation_id":"721f5529-93bb-4c89-9bab-0a1fa7b59e82","resolution":{"observed_at":"2026-08-07T12:45:54.766979Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T12:45:44.488271Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.488271Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:53eb70577c6e927dae1f6f2eb7b8ccb5a0a4966f32908528075eeda4b6dfc3c1","observation_id":"c287add6-9f4d-4216-8f26-184030720784","resolution":{"observed_at":"2026-08-07T12:45:44.488271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14008","last_updated":"2024-06-06T13:19:44Z","snapshot_observed_at":"2026-08-03T03:39:09.398343Z","submitted_at":"2024-02-21T18:49:26Z","title":"OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14008","snapshot_observed_at":"2026-08-07T12:45:44.593037Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.593037Z"},"links":{"cited_paper":"/paper/2402.14008","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:e7964a6c6019c2b40efca1b8f0d0f8d88859a0d64fcb52d3d053d40ec39fab7a","observation_id":"5bea777a-e664-4def-b2e1-d249ff5ebeea","resolution":{"observed_at":"2026-08-07T12:45:44.593037Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:54.428671Z","title":"Hendrycks, C","venue":null,"work_id":"005188ea-f2be-4022-b493-07f7e54c9144","year":2021},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.733221Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:ef704a583722bb4938e193a0de6b1e85928ffbfffef3089555bf1152053e45e3","observation_id":"c8c02d23-8d03-446a-b529-c9af073cee9f","resolution":{"observed_at":"2026-08-07T12:45:54.526188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:44.872411Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.872411Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:df44b7c076213de1fbedb7a73204e6e9f2fc76d6824531ba10fc1a22f9148c85","observation_id":"5acd8272-4d96-4946-b8f1-f7ce9490dbf7","resolution":{"observed_at":"2026-08-07T12:45:44.872411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-08-15T14:02:47.366139Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-07T12:45:44.966298Z","title":"Hurst, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:44.966298Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:3bd81f7484147c5fc831a2f2e484774c2e12166523afe4f637fd81dee42f2461","observation_id":"a127f745-3f6b-4b61-b82f-ad3a6f911863","resolution":{"observed_at":"2026-08-07T12:45:44.966298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00515","last_updated":"2024-11-10T22:02:27Z","snapshot_observed_at":"2026-08-14T16:40:35.729198Z","submitted_at":"2024-06-01T17:48:15Z","title":"A Survey on Large Language Models for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.00515","snapshot_observed_at":"2026-08-07T12:45:45.065288Z","title":"Jiang, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.065288Z"},"links":{"cited_paper":"/paper/2406.00515","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:a2d34baafb4f056b9b187f1a66fa5095094013efba2d82f914d87a2b523a9119","observation_id":"87af1389-2a6c-47f0-b5ec-0ec705c79e64","resolution":{"observed_at":"2026-08-07T12:45:45.065288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15019","last_updated":"2025-02-20T20:14:31Z","snapshot_observed_at":"2026-08-17T05:20:44.007775Z","submitted_at":"2025-02-20T20:14:31Z","title":"On the clique covering numbers of Johnson graphs","version":1},"cited_work":{"arxiv_id":"2502.15019","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.15019","snapshot_observed_at":"2026-08-07T12:45:49.214167Z","title":"On the clique covering numbers of Johnson graphs","venue":"math.CO","work_id":"b69a921a-ec73-4853-bede-aeafbbf6b828","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.183253Z"},"links":{"cited_paper":"/paper/2502.15019","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:4f3ca868b5ffdf83228ce0bf91235e1bbfd71790eca2cb64aa5e4d121262d754","observation_id":"58edbea6-ca5c-41fc-ac80-751db4dc6818","resolution":{"observed_at":"2026-08-07T12:45:49.269664Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:45.327012Z","title":"Kirkpatrick, C","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.327012Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:6398fb53846947a40e695fe8cf889b8f51aabb0266971c6d42b951105104df2e","observation_id":"371c67f4-cde9-4992-aa97-a1e81b40405d","resolution":{"observed_at":"2026-08-07T12:45:45.327012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0011047","last_updated":"2000-11-15T00:00:00Z","snapshot_observed_at":"2026-08-18T07:16:10.733258Z","submitted_at":"2000-11-15T00:00:00Z","title":"Dancing links","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0011047","snapshot_observed_at":"2026-08-07T12:45:45.421543Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.421543Z"},"links":{"cited_paper":"/paper/cs/0011047","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:592d0907e884724048fb2cbc5845336b67981eee7babdc80f379386cb7ea2a24","observation_id":"6550c7b7-9ac4-42d2-af8e-6921467a1f95","resolution":{"observed_at":"2026-08-07T12:45:45.421543Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:54.172459Z","title":null,"venue":null,"work_id":"9481c43b-3748-4101-b03f-02e8fb32b61d","year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.543041Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:b03ddc7ece8077a7957beb514aff482b29e1862ee28e7dce95f921774cbb1f42","observation_id":"e9fb8ba6-e7a7-48e5-ae49-37b2b373d4b7","resolution":{"observed_at":"2026-08-07T12:45:54.267850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2408.10268","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:49.070454Z","title":null,"venue":null,"work_id":"b3cd1fad-7092-493d-9c3a-52ec5dc0a78c","year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.679489Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:38dc29a0367e571a8c3776831225e3644f2a8ca91808430b12f499097709bf92","observation_id":"fd57ef27-6ffc-456b-9464-06f6b5201a97","resolution":{"observed_at":"2026-08-07T12:45:49.133098Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-07T12:45:45.804899Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.804899Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:c2275c9adf856907e416ff666d7bbbaf354bbfda522a0eb5cd3b6d7dabdf0304","observation_id":"afa26eea-fd01-4f0f-b282-3c0315185717","resolution":{"observed_at":"2026-08-07T12:45:45.804899Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:53.983361Z","title":"LiveBench leaderboard, 2025","venue":null,"work_id":"515500d8-93a7-43c2-b272-e6edd5bb9641","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.891497Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:0e9518700f2f4d5d1e4879f5764f0ceac7d759183e0c8433cac14abf00cf093c","observation_id":"4b9ab7fa-96f4-479b-85d3-11501f2d15d4","resolution":{"observed_at":"2026-08-07T12:45:54.081764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:53.754222Z","title":"Mehrabian, A","venue":null,"work_id":"385f8e1e-4310-4eab-b7cb-c6ac509df00e","year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.976857Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:453c95ffbb647b251d12d539843a7ed548991e6f1e34bfa2aa244bee73b62bec","observation_id":"4a0472b2-910a-4dc6-adee-da4600c25738","resolution":{"observed_at":"2026-08-07T12:45:53.876135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:53.555859Z","title":"Mitchell.An introduction to genetic algorithms","venue":null,"work_id":"e2e734bc-65cc-4565-8aff-37efcd3ee49a","year":1998},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.077200Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:3aefb85841376ad5a84d38314fda81a6f85c87cecb30b06b8fa419019e4a7d8f","observation_id":"a27ea5bc-0777-40cd-abba-553a5c9f3845","resolution":{"observed_at":"2026-08-07T12:45:53.658489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:53.346116Z","title":"Nejjar, L","venue":null,"work_id":"c1ba210e-27de-4f7b-8a5a-c197fd5861f1","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.144409Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:2fcb78e77c02fdd91136f03faf1cb9437d552fa46cee450d40ad3a3e860a692b","observation_id":"f43d492f-f240-425d-ad5d-c0d14431ba0f","resolution":{"observed_at":"2026-08-07T12:45:53.451837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:53.057598Z","title":"Noritake, M","venue":null,"work_id":"7313cfd9-1bbc-4b94-a940-908d2ade11f0","year":2014},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.197852Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:a02c21b8e29b4e23934022de0c0d2a7faa1a99ec60b44ccb9f7dccc3fcba8d30","observation_id":"60c8a676-25c2-4082-9bc7-659a664caa30","resolution":{"observed_at":"2026-08-07T12:45:53.191469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:52.803363Z","title":"Novikov, N","venue":null,"work_id":"b635bbfd-fe39-4ccb-a51d-5de2e4debd8a","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.260234Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:59efda0edfcb3dbd08fa6111b2add4a2ba149a1bd682a9b799d476b24c073cd5","observation_id":"7ee5abba-b97b-4a64-a27f-87fcb9ce9429","resolution":{"observed_at":"2026-08-07T12:45:52.913062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:52.578493Z","title":"OpenAI o3-mini system card, 2025","venue":null,"work_id":"b07b5034-fb81-4e56-917b-16db30cff133","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.355663Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:1e3cfdb90f25c1a85541c1746818eab8cc8ef9b6b5e0ced9d6d723fa82f3a1ac","observation_id":"5949a6fb-8480-49d1-8559-7e2f6d202fb2","resolution":{"observed_at":"2026-08-07T12:45:52.674623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21934","last_updated":"2025-09-04T19:36:32Z","snapshot_observed_at":"2026-08-16T12:46:09.609350Z","submitted_at":"2025-03-27T19:21:05Z","title":"Proof or Bluff? Evaluating LLMs on 2025 USA Math Olympiad","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21934","snapshot_observed_at":"2026-08-07T12:45:46.479498Z","title":"Petrov, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.479498Z"},"links":{"cited_paper":"/paper/2503.21934","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:fc259c2854ae1218e2b7f490b00245838410c4a9358b31356026130f81fb30a3","observation_id":"dcbe21ce-9286-46e4-961d-606652a4cf72","resolution":{"observed_at":"2026-08-07T12:45:46.479498Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:52.364212Z","title":"Romera-Paredes, M","venue":null,"work_id":"d2d1b266-064f-496a-92f1-d78339d08363","year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.574950Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:c9a1acea223dede6efe27286e65d8bdfdcce073595fe4c38718a99b71356a2a6","observation_id":"2357aeec-496c-4c47-a09e-456796cebc5d","resolution":{"observed_at":"2026-08-07T12:45:52.476676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:52.158138Z","title":null,"venue":null,"work_id":"c28137ab-76ce-4ef8-b667-f83e5a446df0","year":null},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.718396Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:adae5ea0271ca2eea4149290eef0936267e440d7528e3afce3ed0b360013086a","observation_id":"2ce966e9-e0c1-4801-b741-d313347a54c7","resolution":{"observed_at":"2026-08-07T12:45:52.259034Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19517","last_updated":"2025-06-09T20:15:16Z","snapshot_observed_at":"2026-08-16T12:54:52.877721Z","submitted_at":"2025-02-26T19:32:55Z","title":"New Difference Triangle Sets by an FPGA-Based Search Technique","version":2},"cited_work":{"arxiv_id":"2502.19517","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.19517","snapshot_observed_at":"2026-08-07T12:45:48.901144Z","title":"New Difference Triangle Sets by an FPGA-Based Search Technique","venue":"cs.IT","work_id":"2d3a0263-034f-4b85-9e81-c5bacf561335","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.812872Z"},"links":{"cited_paper":"/paper/2502.19517","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:926abf8206e80186d017573326bdc5709bda552bd042fae83bd0c94692a23033","observation_id":"44d33e2f-b6de-444b-9369-b506b08244e0","resolution":{"observed_at":"2026-08-07T12:45:48.950638Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:51.962852Z","title":"Shokri and L","venue":null,"work_id":"67313ce9-4d78-455e-8c26-3552e81fea17","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.890540Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:2735f320502929ad5984ae01e477f738ec9dce35b322f84a02874c4c46d6daf0","observation_id":"9b0679d1-50bc-4fde-949f-6a351928d9b8","resolution":{"observed_at":"2026-08-07T12:45:52.052088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:51.713131Z","title":null,"venue":null,"work_id":"44de252a-ca01-405c-92a2-d5ec682d6bdb","year":2001},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:46.989422Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:b2a065a0a492419efb029de185c32861551c1dda6bafb1ecf850d4df5fdadb3f","observation_id":"100b820a-4321-4755-ade7-5fa02e1c7cc9","resolution":{"observed_at":"2026-08-07T12:45:51.829478Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:47.103141Z","title":"Stroebl, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.103141Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:4e990914e47a69ee3f0793c50bfa8a216235e3ed871324a0c506729a4e3f7a61","observation_id":"b2b348a2-4ca3-45f7-9c3d-9b61c545a53c","resolution":{"observed_at":"2026-08-07T12:45:47.103141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04310","last_updated":"2025-08-22T08:00:53Z","snapshot_observed_at":"2026-08-16T12:43:41.206650Z","submitted_at":"2025-04-06T00:47:43Z","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04310","snapshot_observed_at":"2026-08-07T12:45:47.190532Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.190532Z"},"links":{"cited_paper":"/paper/2504.04310","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:4a69a170c7683fde50716dbe192603d9b9c9956c9c91fe019ea4487e802a8f22","observation_id":"1796364f-e346-46e6-9fbd-1dab9b64ceb0","resolution":{"observed_at":"2026-08-07T12:45:47.190532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05199","last_updated":"2025-01-30T19:43:34Z","snapshot_observed_at":"2026-08-15T20:19:14.056873Z","submitted_at":"2025-01-30T19:43:34Z","title":"Advancing Geometry with AI: Multi-agent Generation of Polytopes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05199","snapshot_observed_at":"2026-08-07T12:45:47.269752Z","title":"Swirszcz, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.269752Z"},"links":{"cited_paper":"/paper/2502.05199","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:d575999a12e4f88dfe8b64f5923c90563308b87765fd3c7f214e6424afcbf712","observation_id":"da1dde70-0fa3-4a5c-8cea-a2b5559ecacd","resolution":{"observed_at":"2026-08-07T12:45:47.269752Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:51.495606Z","title":"Torres-Jimenez and E","venue":null,"work_id":"55a56162-7efd-41f4-840c-9c115bebab7c","year":2012},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.369500Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:35659e02d282d0cfe660e9f3b7b9733aa79ad46fca739208da12ac3867ac7bcd","observation_id":"14bd675e-d984-4e80-ad45-c24a800ee006","resolution":{"observed_at":"2026-08-07T12:45:51.612648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:51.293038Z","title":"Torres-Jimenez, H","venue":null,"work_id":"848cf18e-4f40-44eb-93a5-b1f93fb42151","year":2017},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.521749Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:0ab0e38eb7866d4148a7406cac44c77ae5c4e3e7faecb7c674bbff53b93e2778","observation_id":"db96e615-7181-4c15-b2a8-3fa78b6e0b77","resolution":{"observed_at":"2026-08-07T12:45:51.381894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:51.038808Z","title":"Torres-Jimenez, I","venue":null,"work_id":"97788779-1148-4e56-8684-e5f0c10512be","year":2019},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.642777Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:cf3fc034286fa6efc235a80f5b613bc3921eeb53fcf3836ce1816087249d9603","observation_id":"9f2431e5-038a-4365-97a4-c1012a4ca98d","resolution":{"observed_at":"2026-08-07T12:45:51.192941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-16T18:28:07.901444Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-08-07T12:45:47.770405Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.770405Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:ee3f24fcb10083281ef78bdecfd635e1c35731540eba41c468c1f481ebf67315","observation_id":"cffcac38-add9-4570-a9f4-017dce64b0a0","resolution":{"observed_at":"2026-08-07T12:45:47.770405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00613","last_updated":"2026-06-05T17:17:48Z","snapshot_observed_at":"2026-08-19T00:18:28.019986Z","submitted_at":"2025-04-01T10:11:32Z","title":"LLM-Guided Search for Deletion-Correcting Codes","version":2},"cited_work":{"arxiv_id":"2504.00613","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.00613","snapshot_observed_at":"2026-08-07T12:45:48.610331Z","title":"LLM-Guided Search for Deletion-Correcting Codes","venue":"cs.AI","work_id":"c42b25fc-6df0-4936-8b4d-c67c9791b320","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.884561Z"},"links":{"cited_paper":"/paper/2504.00613","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:b5b2d2b65556ad584becb872f8faae8fc1410c3b0d7954550a4833ee9837a8ac","observation_id":"9ec041f0-74e7-481b-af8e-8968c655b036","resolution":{"observed_at":"2026-08-07T12:45:48.720990Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:50.790149Z","title":"White, S","venue":null,"work_id":"bedc38c2-4399-442c-b592-a4a88ec9f2a6","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.987574Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:3ea744dfc678c4cfd188e309bce1cf925b4397462298b58a803b265bda0e884e","observation_id":"e0691acc-0b80-4179-b53a-065b0aef63c4","resolution":{"observed_at":"2026-08-07T12:45:50.934291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:50.526996Z","title":null,"venue":null,"work_id":"5589b754-f79b-4efe-a22c-e5d771247875","year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:48.090285Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:6a141ed4e937ae2c349ed87950d0a24f4e8f4bca83a2f194e124f562b98bb0ea","observation_id":"673fe7d3-fe62-4447-b65d-b4c42f34a89e","resolution":{"observed_at":"2026-08-07T12:45:50.668698Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:50.277980Z","title":"Balanced Incomplete Block Design","venue":null,"work_id":"faa384ec-30dd-46d9-8130-adb9a5166cb5","year":2024},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:48.207160Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:bc1076a2d3e39e6aece339460f14d6679c4471303f30d86215efab11de395ac3","observation_id":"01ee01b9-7cbf-4071-868c-19eb6f262a0c","resolution":{"observed_at":"2026-08-07T12:45:50.410768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:49.998556Z","title":null,"venue":null,"work_id":"50329c32-2709-4fe1-9e52-0bb48cad119d","year":null},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:48.335906Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:a5ba8f92eb58cb139a2deed0555a7e1b1893f75e59b4f11fc609728a6fee040b","observation_id":"49450714-f0d4-4218-80a5-309f79676ee9","resolution":{"observed_at":"2026-08-07T12:45:50.149350Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:45:49.735148Z","title":"Costas Array","venue":null,"work_id":"75a9c835-275d-44ac-b4fa-f63748cddbe8","year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:48.452583Z"},"links":{"citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:806e30745957f7ce5798ec8f6b1309701e297f40c5019065762fa328eb4eaf05","observation_id":"2fdc0800-2252-4fae-a977-86cdd5c5a208","resolution":{"observed_at":"2026-08-07T12:45:49.839455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":5,"verified_fuzzy":18},"total_outbound_references":56},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 4 inbound Pith citation observations for arXiv:2505.23881."}