{"as_of":"2026-08-09T18:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ef884c2cb72a83a514ebbe21e411c4650279631934b5538e0cd2a13b65db077","coverage":[{"denominator":80,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":80,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:35:27.887301Z","state":"measured"},{"denominator":80,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":80,"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/2608.04336/citation-record","integrity":"/paper/2608.04336/integrity","json":"/paper/2608.04336/citation-record.json","paper":"/paper/2608.04336"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:35:29.667817Z","title":"Information and software Technology , volume=","venue":null,"work_id":"2dd1c42a-ff53-44c2-b9a8-e2a9d679bbff","year":2001},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.601605Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:08da295fe27f7e1fc5d89051a4cf6cef7cf53f205d5b37f493e7ac228378ad05","observation_id":"9f26b010-23b9-4033-ae78-1b5835d1fc5a","resolution":{"observed_at":"2026-08-08T19:35:29.671378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.607739Z","title":"Advances in computers , volume=","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.607739Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:e799ec1ed1a38661c1e3f02cc690907e07f4f6d460154322a35f332e07aa80c6","observation_id":"69daed82-22ca-47a0-b7d9-0a711791b515","resolution":{"observed_at":"2026-08-08T19:35:27.607739Z","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-08T19:35:27.611765Z","title":"Journal of artificial intelligence research , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.611765Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:7418c19b82a070a1446eeadaff2a3e67c8ebfa757a8f7652079a1efc12fb7f93","observation_id":"070d8e3a-19ff-4ff2-a8bb-3c4c6b62c187","resolution":{"observed_at":"2026-08-08T19:35:27.611765Z","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-08T19:35:29.645143Z","title":"Journal of Artificial Intelligence Research , volume=","venue":null,"work_id":"48d41491-5528-4662-b2be-c713da20f46e","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.615525Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:379194971dbc1b9534bc54f3777f3a9d9ed581e0163068f3b639e86c901da897","observation_id":"8b7a6b90-d04f-4121-9feb-04833258d500","resolution":{"observed_at":"2026-08-08T19:35:29.648687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.635243Z","title":"and Kadous, M","venue":null,"work_id":"0f2698a4-9813-49f9-9f5b-e02eb89b546a","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.619208Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:c4e5f3b1f9f182bb512780bdff5643f6e63a87d1d82db46e164a268a30aa6aac","observation_id":"2bbb6524-72e7-4468-8b8d-cd590cbad6d5","resolution":{"observed_at":"2026-08-08T19:35:29.638801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-07-31T18:33:34.529799Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-08T19:35:27.623161Z","title":"arXiv preprint arXiv:2305.05176 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.623161Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:9ffb444bb06420594ea6bbc4b0ea4c5060d27ca96f15496e61bbaf9241b821c2","observation_id":"2b4b124d-ddb9-4085-9f0c-eba56f705fe2","resolution":{"observed_at":"2026-08-08T19:35:27.623161Z","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-08T19:35:29.624377Z","title":"International Conference on Learning Representations , volume=","venue":null,"work_id":"8b5b9f20-7b20-4ca5-86d1-da31621b77f0","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.627204Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:1f148afdf940725e6b5c6065383bcf78eb2056555ae77b5b69af9376c407d1d3","observation_id":"8cc4ea01-9349-4e49-8f02-7c01316404eb","resolution":{"observed_at":"2026-08-08T19:35:29.628432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.613893Z","title":"AutoML Conference 2023 , year=","venue":null,"work_id":"80dda045-6e56-44be-a6e9-f006e1a4d84a","year":2023},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.630965Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:53ca554a79dd52b3a1d5c5e2acf8ef74fc59b2561f1413eb579844a0ffe1627e","observation_id":"325f65df-1082-4508-89d6-1df17c19b37e","resolution":{"observed_at":"2026-08-08T19:35:29.617633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.596710Z","title":"Router-R1: Teaching","venue":null,"work_id":"d5652705-4830-4010-852a-1e781a0df94a","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.634671Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:f58047865c4505daa405caf4e92cb0eb8116796e082442a9e89e8bc0b202e183","observation_id":"557d1fd2-417b-4efc-980f-0f0c282de758","resolution":{"observed_at":"2026-08-08T19:35:29.600502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.584745Z","title":"RouterArena: An Open Platform for Comprehensive Comparison of","venue":null,"work_id":"e12fe9a3-bfa4-4e5d-bec2-8c4e3af3ef7a","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.638330Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:32a8f163778155dd63277be8c5b394cee44860443908f1a05e7f5c7fd94b017a","observation_id":"8eb5547d-65dc-4a51-9db4-75f59b6182ea","resolution":{"observed_at":"2026-08-08T19:35:29.588646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.573545Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"5a2a8e14-1b9d-495d-a209-291651b6412f","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.641835Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:e09f6e13c37d6f9aa2c7c9f45ceadc83fde1639874a6ef77faa756d0e7ae15c4","observation_id":"eb4d75ea-b69d-44ec-9bc1-2da82b48da8e","resolution":{"observed_at":"2026-08-08T19:35:29.577513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.562364Z","title":"Cost-Aware Contrastive Routing for","venue":null,"work_id":"ecce75a8-dc0a-493c-b394-a68f47d69679","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.645550Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:310b48c2c2631e1a068c6ac8fc4a67b0b4424df40a11803294f58967679ddd66","observation_id":"f1ab21c5-086f-4c01-8a1a-c0a13f5bb8c8","resolution":{"observed_at":"2026-08-08T19:35:29.566305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.550892Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"55e0abcc-61f2-470c-8ce0-3ecdca906fcb","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.649490Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:1e9f367e4f822d0dc3d241db485aad69f1994006e098a016a1e24fdfb31a76ea","observation_id":"f28ea0bb-154f-4b2a-ba34-917bbcd4ed0d","resolution":{"observed_at":"2026-08-08T19:35:29.555048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.652789Z","title":"LLMR outer B ench: A Massive Benchmark and Unified Framework for LLM Routing","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.652789Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:ffb80a4d71ccfc310fc81a3aff55a979cd804b4d58e9c40fcca8ab7aed66c8cd","observation_id":"d1af4d75-fa89-4cf0-aa5e-0da50c2c4c00","resolution":{"observed_at":"2026-08-08T19:35:27.652789Z","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-08T19:35:29.539842Z","title":"AutoML Conference 2023 (Journal Track) , year=","venue":null,"work_id":"4948d2fa-5cfc-4fd8-b5ac-78df206cfb1c","year":2023},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.656326Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:98354e3e0021636918bcfffde3e677012edc355d82d27174fc52e9f6683fe37c","observation_id":"65d5c02f-f951-43c6-a379-55f0e2bf62a9","resolution":{"observed_at":"2026-08-08T19:35:29.543564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.528002Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"021d4259-989f-45cf-a915-61f59d7ff35c","year":2015},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.660112Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:23cd1487058a24ec8c117890e86167dcae00f861f49fbe20dfd40fbae117c945","observation_id":"86d12234-efa9-4a06-badb-976b6959fbd5","resolution":{"observed_at":"2026-08-08T19:35:29.532663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.517123Z","title":"and Desai, Nishkrit and Bae, Juhan and Lorraine, Jonathan and Ba, Jimmy , title =","venue":null,"work_id":"b5bcaf9b-e167-4762-bf48-c447dda374df","year":2023},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.663748Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:425044fb1f2f8e8bdd1dcd57aecb4d707c3710f56b201752a3e7733a7ea21f55","observation_id":"da565d21-872e-4da5-92ff-46df43950805","resolution":{"observed_at":"2026-08-08T19:35:29.520785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.505298Z","title":"The Twelfth International Conference on Learning Representations , year=","venue":null,"work_id":"83f409e9-cc81-4e96-978f-cce6c20a45d5","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.667721Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:d015cb65dc0db092e95e0e45da406941f23cc8196a434cfbed79a4345dc8cf1a","observation_id":"5355492d-d96b-4e07-b37c-3b46f48d2ee4","resolution":{"observed_at":"2026-08-08T19:35:29.509214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.493314Z","title":"2018 , editor =","venue":null,"work_id":"182c69c8-9829-4225-a8e9-d49bf4d5ac99","year":2018},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.671358Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:287be314516ffede5d996a549495c3c07df07f788468b9ccb47ce28a42081af7","observation_id":"43a36316-9135-450f-b208-55e76e603370","resolution":{"observed_at":"2026-08-08T19:35:29.497670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.482225Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":"2f45c515-7a7f-4098-a01c-a643bbe3c8a5","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.674972Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:51dda2526da94f3e257d50ddc19d5e48af8288ba32b98b75b10be263fa9ab716","observation_id":"b0f87f90-86e9-4390-9f78-2a442c3a2c95","resolution":{"observed_at":"2026-08-08T19:35:29.486045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.470497Z","title":"48th International Conference on Software Engineering , year=","venue":null,"work_id":"5f7209d2-771a-4f6b-901e-74d42f5792ce","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.678312Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:71c6366c290d7cbc0cbc61b1827bfeba1941bcc7cd142dbbc61aa7804606e3cd","observation_id":"116dbef8-84ff-47b6-8e74-bb6f7746f59a","resolution":{"observed_at":"2026-08-08T19:35:29.474324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.459487Z","title":"Forty-third International Conference on Machine Learning , year=","venue":null,"work_id":"543b0c56-93c0-497c-8324-80a8fb792e0a","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.681957Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:13a791e6615df18e58fd3942f32072cfdf1cf1107e3c9b9649795fe7564e9c17","observation_id":"fe695222-e638-4ff9-a3bc-54a3ab80e8a4","resolution":{"observed_at":"2026-08-08T19:35:29.462912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v40i1.37030","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:35:27.971136Z","title":null,"venue":null,"work_id":"f90e1c18-e390-4cc4-a8d8-88e3bbdc2681","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.685431Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:1cde9abe8d83ccd4132aad2e62eced7df8e8bc71c7344abcd3d0fffe1a90bd1a","observation_id":"f076785e-1542-4b03-8600-670d57299ce9","resolution":{"observed_at":"2026-08-08T19:35:27.974844Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.448170Z","title":"Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing , pages=","venue":null,"work_id":"7b71a61c-b338-426c-a38a-9f8e44c49dac","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.689003Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:9b7dfa0c7a2c73a4ba7c5132a8b9f91d9c49704aa753be0381063df95fda0c4e","observation_id":"298f4a71-0a92-425c-8e16-9efa9145e1ba","resolution":{"observed_at":"2026-08-08T19:35:29.452057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.436228Z","title":"Science , volume=","venue":null,"work_id":"46970c2a-b9b9-40a6-8b0b-dbb212a46936","year":2015},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.692781Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:6bdc78cee7a961ffc7cdf49ffaac37d4bf04d0a6d05026156b7de6a662145f09","observation_id":"54c44216-4616-49ef-a014-6351841e9428","resolution":{"observed_at":"2026-08-08T19:35:29.440226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.424799Z","title":"2025 IEEE/ACM 33rd International Conference on Program Comprehension (ICPC) , year=","venue":null,"work_id":"1d3b21fa-f92c-422d-8040-f980d324543e","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.696478Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:6824045c42c404dbfcd9151c44e7da1700021cf30535a6317f1452b7a247b23b","observation_id":"92d7adf9-4c2d-4655-8a01-9b10401fdd86","resolution":{"observed_at":"2026-08-08T19:35:29.428599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.413523Z","title":"Optimizing LLMs for Code Generation: Which Hyperparameter Settings Yield the Best Results? , year=","venue":null,"work_id":"f418cf5b-843a-4d20-a3fb-efc9b00e58a6","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.699907Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:5e7ccd776ef4ab51a9af139bf0505f8fa8860726e28b71d27c6e1f32945be117","observation_id":"724befe5-0435-4af9-bb0f-36f8bbb8f14c","resolution":{"observed_at":"2026-08-08T19:35:29.417293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13131","last_updated":"2025-06-16T06:37:18Z","snapshot_observed_at":"2026-08-07T04:21:43.190472Z","submitted_at":"2025-06-16T06:37:18Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13131","snapshot_observed_at":"2026-08-08T19:35:27.703288Z","title":"arXiv preprint arXiv:2506.13131 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.703288Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:14a3a43eec29ed761dad9742dc4d64a746384c5d371cf284959da985f455f33c","observation_id":"556a62fd-dc21-41a7-9c6e-89c85f12620d","resolution":{"observed_at":"2026-08-08T19:35:27.703288Z","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-08T19:35:27.707106Z","title":"The Fourteenth International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.707106Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:93404a67a0111111f9d168540d7af219ea028e19e58302003813304751475373","observation_id":"bb93a0c4-7cce-43dc-8ef9-c540c86f086e","resolution":{"observed_at":"2026-08-08T19:35:27.707106Z","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-08T19:35:27.710539Z","title":"arXiv preprint arXiv:2512.09108 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.710539Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:f72b148a59bbef0acd441de6a8bfd1ff005b6827c29082038c76088cd3f9b1ca","observation_id":"6a273ba9-d9f2-4270-825e-7cc3086b959f","resolution":{"observed_at":"2026-08-08T19:35:27.710539Z","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-08T19:35:29.394194Z","title":"Issue Localization via LLM-Driven Iterative Code Graph Searching , year=","venue":null,"work_id":"3e57d3d3-668e-4aa7-b819-a9bef0ae3db0","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.713754Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:e6805c6b7323d8faede4c7c9a2a954c3d5b3883bf682ce328f2182c2a87b631a","observation_id":"d0a58ce5-1327-4e43-ab96-1f1d51307b74","resolution":{"observed_at":"2026-08-08T19:35:29.397998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-032-24839-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:35:27.959161Z","title":"GA4GC: Greener Agent for Greener Code via Multi-objective Configuration Optimization","venue":null,"work_id":"75c2bfbb-d340-4360-b450-129c90c61009","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.717183Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:436166aa467d1237015215bc6163d656729381edfd15499bbcd4b9beefaa495a","observation_id":"e00d0c0f-e713-45a2-b6ad-3edbbb3e7f36","resolution":{"observed_at":"2026-08-08T19:35:27.963916Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.382359Z","title":"Proceedings of the 31st International Conference on Computational Linguistics , pages=","venue":null,"work_id":"fee9ad3d-10dd-441a-af8f-24cd8414437e","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.720507Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:78b47286987c9d93dd535056fd31f26796e13f08aa0f992d0b6818920515ca33","observation_id":"86956abb-d706-433c-ac56-e1506563c254","resolution":{"observed_at":"2026-08-08T19:35:29.386304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.370949Z","title":"Forty-second International Conference on Machine Learning , year=","venue":null,"work_id":"36d6a9c9-588e-41ac-bcd1-ebb24ebfd4ae","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.724145Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:548adc83aaab2b5d7bedbdc9bbc8a9f2d4f1a07e83969bafa808854c0ab1438f","observation_id":"25ee5b44-373b-48ce-916f-0b8e628beafa","resolution":{"observed_at":"2026-08-08T19:35:29.374811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.727651Z","title":"Exploring the Impact of Temperature on Large Language Models: Hot or Cold? , journal =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.727651Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:b1b45b09834240d6937e883394eac7177368072fbac0760a4e334fc1d9ca0413","observation_id":"d2c8b2e0-1604-41f4-9f83-f65a13e785c2","resolution":{"observed_at":"2026-08-08T19:35:27.727651Z","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-08T19:35:27.731087Z","title":"International Conference on Learning Representations (ICLR) , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.731087Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:c86c8dfb512ab7eca302dc99adfccb19a7bffb6b52e8930376e6dea529b6ce36","observation_id":"58f4aeff-71cb-490d-9fb7-d6fb2c78b97c","resolution":{"observed_at":"2026-08-08T19:35:27.731087Z","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":"10.1145/3808347","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:35:27.938744Z","title":null,"venue":null,"work_id":"dbbe5f86-94ad-4ea8-9272-38d3c30b20aa","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.734296Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:b1efcda0388e59bcd53ca1a21c9b68569242d590fc2b163d1076cfd790952077","observation_id":"1a77c1b4-39fb-4458-a715-23bcbf856144","resolution":{"observed_at":"2026-08-08T19:35:27.943863Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.351986Z","title":"LiveBench: A Challenging, Contamination-Limited","venue":null,"work_id":"4174c8d5-fc5f-41ab-b27c-5b26c726cad0","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.737822Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:ce67f24bffd994d6108aa119ae0d3c7e164463f44746e6d10c36dbf46eb28be2","observation_id":"016e7a6d-000f-4a4a-9922-1be2e2a5bf3f","resolution":{"observed_at":"2026-08-08T19:35:29.356437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02906","last_updated":"2024-12-03T23:19:40Z","snapshot_observed_at":"2026-07-06T20:01:14.493111Z","submitted_at":"2024-12-03T23:19:40Z","title":"Does Few-Shot Learning Help LLM Performance in Code Synthesis?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.02906","snapshot_observed_at":"2026-08-08T19:35:27.741292Z","title":"arXiv preprint arXiv:2412.02906 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.741292Z"},"links":{"cited_paper":"/paper/2412.02906","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:ed94c8c178b739f6fb7b206650f02a3f2b28464d1057a11dd34c8dab3f25715c","observation_id":"3741cfa5-17be-488c-95ca-c17c0dd599d9","resolution":{"observed_at":"2026-08-08T19:35:27.741292Z","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-08T19:35:29.340247Z","title":"IEEE Transactions on Software Engineering , year=","venue":null,"work_id":"0a4e53b6-b02d-41fd-aaa2-a4e6c96f9dbc","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.745168Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:5ba3df096547fa86d86f3057ec8cb520122ec89c30d2ad57e8713dcfa6015f00","observation_id":"4037b304-3806-46dc-ac14-d674c02ffce0","resolution":{"observed_at":"2026-08-08T19:35:29.344288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.329110Z","title":"ACM Transactions on Software Engineering and Methodology , year=","venue":null,"work_id":"4f266533-1e3a-4f65-a3c8-d49e10b92d55","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.748625Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:cebfbb79e8e50157cc4eef79c1a1538e117ee6c844eca1c9fe1b5ca4d0d08684","observation_id":"fccec30c-abb3-4030-98e1-3a7bb05813a3","resolution":{"observed_at":"2026-08-08T19:35:29.332669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.317793Z","title":"ACM Transactions on Software Engineering and Methodology , year=","venue":null,"work_id":"330ea661-b6e8-42a7-9d45-8ab2ac322262","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.752320Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:74d7032b91b367e8234f6f3349ab4e689485b6f20d9e9a1152c8e2e2180ba59e","observation_id":"dcf48e54-bf50-4d83-8023-ef8e601c49b4","resolution":{"observed_at":"2026-08-08T19:35:29.321565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.755933Z","title":"Demystifying","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.755933Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:70d3b0c330c874d935ac53a83e9db67f689e62adfee4df3a95522de56807f117","observation_id":"063a3528-6852-4e2f-8ba2-c6e4ecd375a3","resolution":{"observed_at":"2026-08-08T19:35:27.755933Z","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-08T19:35:29.299652Z","title":"Where Do LLMs Still Struggle? An In-Depth Analysis of Code Generation Benchmarks , year=","venue":null,"work_id":"dcf5dc8b-9666-4b18-906d-d8a038df6b43","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.759310Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:c81dcd0dcf7ae7bf1fdef133077032308b1afb3742fa47b634831316883f5f4f","observation_id":"8a6d72ae-85a8-4282-a168-b00bd66ebdf7","resolution":{"observed_at":"2026-08-08T19:35:29.304043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.762742Z","title":"Thirty-seventh Conference on Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.762742Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:410a4075300f642be6b154209b84a0347d0cf3399bf81e0b364f1f8a5b73d78a","observation_id":"18ae03a7-a24e-482c-b7d8-b309f0b6408b","resolution":{"observed_at":"2026-08-08T19:35:27.762742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.23491","last_updated":"2026-05-25T03:01:24Z","snapshot_observed_at":"2026-08-04T15:39:28.066531Z","submitted_at":"2026-05-22T10:53:17Z","title":"CoSPlay: Cooperative Self-Play at Test-Time with Self-Generated Code and Unit Test","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.23491","snapshot_observed_at":"2026-08-08T19:35:27.766215Z","title":"arXiv preprint arXiv:2605.23491 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.766215Z"},"links":{"cited_paper":"/paper/2605.23491","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:fc441e1422cc049a59b23686594baa63a4946a85ce5d5ceddbfb78a9d4f1706b","observation_id":"c0b236fd-d225-4031-a85e-b065bb9227f4","resolution":{"observed_at":"2026-08-08T19:35:27.766215Z","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-08T19:35:29.281329Z","title":"2025 40th IEEE/ACM International Conference on Automated Software Engineering (ASE) , pages=","venue":null,"work_id":"9dada328-eccc-4629-9a13-9d4c5d9ceaf5","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.770165Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:c505b9cd5c019d9ed205a60018b22c61e1996dc69499b91dde3cb360b6a570e4","observation_id":"9bdb4023-2c62-4535-bef1-5e5cde734e08","resolution":{"observed_at":"2026-08-08T19:35:29.285366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.269333Z","title":"Trinity: An Evolved","venue":null,"work_id":"cb59b8f2-4eb9-4db5-8185-6327fd8f5823","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.773499Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:7bc288b28d54e3c4e6ad82c1f27182c393ac0f4dbaece5d7fb6154ef756921aa","observation_id":"f6a73865-8b76-453c-a321-ab669568cf50","resolution":{"observed_at":"2026-08-08T19:35:29.273578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-08T19:35:27.776772Z","title":"arXiv preprint arXiv:2107.03374 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.776772Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:2751438960c1f81b1f79444d1afaccd2de64a44c2d158da8dc6c669390c9612b","observation_id":"dc6fce9e-8aa2-4636-a686-aff04bf60514","resolution":{"observed_at":"2026-08-08T19:35:27.776772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-08T19:35:27.780853Z","title":"arXiv preprint arXiv:2108.07732 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.780853Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:ce3878f363f6903748563b534a187542fb97e94ec721a99321e54942d09fb06e","observation_id":"b8896a5d-bd08-4b41-8c38-dfbba19b0ff2","resolution":{"observed_at":"2026-08-08T19:35:27.780853Z","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-08T19:35:27.784521Z","title":"The Thirteenth International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.784521Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:45b1cffa60f34a847e06a8a9267c8e686cc0506cd82fdb3898f20c657feb5079","observation_id":"1bb47ccf-b9fd-4b62-aef6-77b56fad7ec0","resolution":{"observed_at":"2026-08-08T19:35:27.784521Z","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-08T19:35:27.788030Z","title":"arXiv preprint arXiv:2606.19348 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.788030Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:d855c776bf065f203ab89203f28ac3d67d2afd53aac5ef29623a1f38cfa69a08","observation_id":"6a4be247-0857-4a74-9c05-c006a113f96f","resolution":{"observed_at":"2026-08-08T19:35:27.788030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-08T19:35:27.791406Z","title":"arXiv preprint arXiv:2412.19437 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.791406Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:1576990c0360e4c4810c9678182899b39a16ea7b2243eb63558c861497048826","observation_id":"03b37636-1531-4337-a3cd-cd222bbe65c9","resolution":{"observed_at":"2026-08-08T19:35:27.791406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.02556","last_updated":"2025-12-02T09:25:14Z","snapshot_observed_at":"2026-07-31T23:49:25.878472Z","submitted_at":"2025-12-02T09:25:14Z","title":"DeepSeek-V3.2: Pushing the Frontier of Open Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.02556","snapshot_observed_at":"2026-08-08T19:35:27.795189Z","title":"2: Pushing the frontier of open large language models , author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.795189Z"},"links":{"cited_paper":"/paper/2512.02556","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:fb16fdc92fc02e4c787630a31aeaaccb36a08c888d42de981b39071ed6149549","observation_id":"5a7136b0-bfdc-4b32-ab8a-b0e540bcb51b","resolution":{"observed_at":"2026-08-08T19:35:27.795189Z","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-08T19:35:29.251183Z","title":"2025 , month =","venue":null,"work_id":"8270158f-86ff-44d1-bdb6-95749df7ccf0","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.798785Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:24b5169c98fe6fcca4b8b5ec4378b0c525c911a463aad28167ff0d9401893b69","observation_id":"63d7c516-38f2-4696-9bc2-4f424da6fe82","resolution":{"observed_at":"2026-08-08T19:35:29.254924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.239157Z","title":"2026 , month =","venue":null,"work_id":"8c0eb77d-92aa-4a18-9446-b3aba349158f","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.802138Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:3ecb663df67b2800841d05ff081abf9864486d3f6bad1f73f94a7d1b6d8ed20f","observation_id":"9a48e9b0-44cc-446e-ad1a-5e219ec6c37f","resolution":{"observed_at":"2026-08-08T19:35:29.242954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.227332Z","title":"Findings of the Association for Computational Linguistics: ACL 2025 , pages=","venue":null,"work_id":"e8d32f71-1b49-4e5c-bdd8-a6c7ba6dc97b","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.805521Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:6903aaaa2428c6961887124e0981ab1c533eebb0af576bb45cfa73e059ebb6b1","observation_id":"fec53546-7593-44b7-8935-fd99767b411e","resolution":{"observed_at":"2026-08-08T19:35:29.231530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.809287Z","title":"2024 , url=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.809287Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:df39856fc7d93532ee14b134ad8d79e4c6e82859f9c9cb9d5c18932422c4bb68","observation_id":"13d178a0-cce0-41dc-b8b7-821561485adc","resolution":{"observed_at":"2026-08-08T19:35:27.809287Z","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-08T19:35:29.203079Z","title":"2026 , url=","venue":null,"work_id":"4c8d2d6e-3ade-400c-9ef3-827e3f34635d","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.812656Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:e8f212d0587eacc1e15f1a5f2c835130e34e5ae3dfb403328e17468c8329d1ce","observation_id":"7100f7a3-881d-4bed-afc3-3b1ef34c8eca","resolution":{"observed_at":"2026-08-08T19:35:29.208298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.188774Z","title":"Holistic Agent Leaderboard: The Missing Infrastructure for","venue":null,"work_id":"a630d5f4-ffdf-4306-b190-1375b63535f9","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.815917Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:76c122fd860463b0592541d951a6cac9d6e4231944123efa7e8fdbbedb0c6607","observation_id":"b20a7191-3069-4cd9-9b2b-16b9e1d1d662","resolution":{"observed_at":"2026-08-08T19:35:29.194291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.174645Z","title":"2025 , booktitle=","venue":null,"work_id":"aaab9140-e7f7-4cc7-85a3-bc6abea85020","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.819518Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:89873b6d89a5106a781fb9a28e1f1d36af1b0cd003e771261d9d2ef69c000998","observation_id":"24cae133-6dca-4e36-aaac-4e3dffcf460a","resolution":{"observed_at":"2026-08-08T19:35:29.179994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:35:28.555172Z","title":"Proceedings of the 2026 International Workshop on Agentic Engineering , pages =","venue":null,"work_id":"7ecd0e38-dafd-4068-b9c3-f4a3b0ca83a1","year":2026},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.822923Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:3db782f8cf3db06441e9da86642b8de8a5750eceb1430a5dcd73837961c3ca4b","observation_id":"2847671e-5df2-49c6-b271-c170ebccbf73","resolution":{"observed_at":"2026-08-08T19:35:28.558921Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.07900","last_updated":"2026-04-09T13:23:28Z","snapshot_observed_at":"2026-07-06T22:45:00.816348Z","submitted_at":"2026-02-08T10:26:31Z","title":"Rethinking the Value of Agent-Generated Tests for LLM-Based Software Engineering Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.07900","snapshot_observed_at":"2026-08-08T19:35:27.826377Z","title":"arXiv preprint arXiv:2602.07900 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.826377Z"},"links":{"cited_paper":"/paper/2602.07900","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:85af877a2d275f9f22f48f547d2fa86a68af96434aaab38669ad046751ccc201","observation_id":"7fd32b74-6ca1-4ef3-9164-6b50a2aa5a49","resolution":{"observed_at":"2026-08-08T19:35:27.826377Z","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-08T19:35:29.158858Z","title":"The Fourteenth International Conference on Learning Representations , year=","venue":null,"work_id":"2afba4ab-c168-4cb1-acbb-42c45b3998b6","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.829986Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:23beb7a9a3b35a3029be43110988416f758f3de783f359593a79f4847404f558","observation_id":"12a77217-c44c-4a6f-8253-acb90dc68976","resolution":{"observed_at":"2026-08-08T19:35:29.164526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.833463Z","title":"2024 , url=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.833463Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:f97db3dd8e30a047a1a4b07ba8fa63e6ea40d79349f7cda4ebeb07c96f1f9692","observation_id":"d21b65e5-d807-4081-ab1c-77f3323b073e","resolution":{"observed_at":"2026-08-08T19:35:27.833463Z","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-08T19:35:29.137180Z","title":"Xu and Xiangru Tang and Mingchen Zhuge and others , booktitle=","venue":null,"work_id":"4cc8a980-7b77-4cdb-b0ef-661b0b596b3a","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.837012Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:43c13e240fc377f09beb158fc45fd4f755f6f7d6c64d48f9e430542333af2c85","observation_id":"7a0a2090-3a91-4178-899d-0f914c82db7a","resolution":{"observed_at":"2026-08-08T19:35:29.141585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.25850","last_updated":"2026-05-18T15:11:47Z","snapshot_observed_at":"2026-07-06T23:11:39.318906Z","submitted_at":"2026-04-28T16:55:02Z","title":"Agentic Harness Engineering: Observability-Driven Automatic Evolution of Coding-Agent Harnesses","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.25850","snapshot_observed_at":"2026-08-08T19:35:27.840200Z","title":"arXiv preprint arXiv:2604.25850 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.840200Z"},"links":{"cited_paper":"/paper/2604.25850","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:dcd491bb5dbd657986770332b71010cc162fecaa82ff14ddab1145d70699c064","observation_id":"76b173c5-9e07-4e8a-a364-2c207ba121ea","resolution":{"observed_at":"2026-08-08T19:35:27.840200Z","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-08T19:35:27.843931Z","title":"2025 , url=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.843931Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:453538201031960383de7b200e626c32df765f6b708e4f6f3a6757e3d7a37cb2","observation_id":"0e429a89-cfb7-4476-87b9-1fa686516227","resolution":{"observed_at":"2026-08-08T19:35:27.843931Z","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-08T19:35:29.115707Z","title":"Biometrics Bulletin , volume=","venue":null,"work_id":"b1d4d37d-0da8-4538-b8d3-3e3238b893e4","year":1945},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.847250Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:3e3ff444dc946c128c08efb4a8460b6ffd5b6811e982901ee4dcfba3f50b6155","observation_id":"69966916-bae5-40c2-9df3-420d97bac841","resolution":{"observed_at":"2026-08-08T19:35:29.120005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.850637Z","title":"The Annals of Statistics , volume=","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.850637Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:f7858f6ee21100b94c2a2e08ad4a837815029a254bfbca7a0ffa2a19d9d2e18b","observation_id":"26006e14-fe3c-4bf1-80ee-217e7caf27e7","resolution":{"observed_at":"2026-08-08T19:35:27.850637Z","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-08T19:35:29.094426Z","title":", journal=","venue":null,"work_id":"2090dfff-03f0-45e2-801a-9fec73f27b9c","year":2000},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.854017Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:1bf821b545dcbd56111af1130f8979b033a700906eec997f2ee4ac4c7655a4a9","observation_id":"bc0f5339-9fbc-4f12-87c1-5b383192b746","resolution":{"observed_at":"2026-08-08T19:35:29.098717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.081421Z","title":"Psychological Bulletin , volume=","venue":null,"work_id":"fbb6fd70-9d5b-46aa-bba0-60b0f652745f","year":1993},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.857360Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:97fbdbed1993b511fdceb15cccac5ebd585347ef60e531ab3ebb4ac1465cf827","observation_id":"c9042a31-c4e2-40b4-8245-882b5ce560e7","resolution":{"observed_at":"2026-08-08T19:35:29.086032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.064740Z","title":"IEEE Transactions on Software Engineering , volume=","venue":null,"work_id":"b17f9991-226d-4f60-979b-a5ccb54f2ae3","year":2019},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.860754Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:07482da4af7f8baaf95e6b693c8ff9b7cd32093753c778b90f998f65210dbdfa","observation_id":"e6054859-b0ab-436b-88fe-c06a23356d47","resolution":{"observed_at":"2026-08-08T19:35:29.072835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:29.051615Z","title":null,"venue":null,"work_id":"03374617-84b1-4756-9f30-1308391b14db","year":null},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.864948Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:63f999448cb5b01d56ed74a494effd83812a8fba9dc19b08ddf2b2025099f099","observation_id":"6ce64432-1525-499f-af88-eacbe1e7d581","resolution":{"observed_at":"2026-08-08T19:35:29.056330Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T19:35:27.868563Z","title":"The Hitchhiker ' s Guide to Testing Statistical Significance in Natural Language Processing","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.868563Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:ba0fd86565de82d3491bdd488a0283147877d27dd5afe03b9b7e7dee2ff17df2","observation_id":"00992696-0d21-4e3a-9e27-0ad465da8fd4","resolution":{"observed_at":"2026-08-08T19:35:27.868563Z","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-08T19:35:27.872238Z","title":"Revisit Self-Debugging with Self-Generated Tests for Code Generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.872238Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:8160109eb70f131bbfc39244ff629dad7abba95e06cb936f45d5de2815027b2f","observation_id":"091d0332-e611-42f0-bc70-71686230e2ea","resolution":{"observed_at":"2026-08-08T19:35:27.872238Z","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-08T19:35:27.876009Z","title":"Zhang, Jie and Bu, Qingwen and Xie, Xiaofei and Chen, Junjie and Cui, Heming , title =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.876009Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:6afd2a2bbf1fa29f70d4cd3a8080ac186aef665316ab0c5f7190f4b20007ea64","observation_id":"640b3f1b-0371-4a4e-95d8-fbb821eab94e","resolution":{"observed_at":"2026-08-08T19:35:27.876009Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:35:28.331406Z","title":"2025 40th IEEE/ACM International Conference on Automated Software Engineering (ASE) , pages =","venue":null,"work_id":"80158b4f-ba2c-409f-ba21-38f51af43611","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.879615Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:f75f63c0a0bb86ac0cad6154b51d8c43bf008b8736fbc733b683ba90994c289e","observation_id":"9440df1e-f919-47d6-ab4a-9a67b4084181","resolution":{"observed_at":"2026-08-08T19:35:28.335342Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:35:28.149225Z","title":"Proceedings of the 1st International Workshop on Responsible Software Engineering , pages =","venue":null,"work_id":"e76ef6a2-14a0-4fac-b07c-5032ca812ce5","year":2025},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.883409Z"},"links":{"citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:081c62e4774062bc9333bebe1c4e82741d678497dba87bc8c590eb9611166078","observation_id":"efe60e23-d8fb-49e8-85e7-a33ce6798d06","resolution":{"observed_at":"2026-08-08T19:35:28.154196Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-08T19:35:27.887301Z","title":"arXiv preprint arXiv:2001.08361 , year=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-08T19:35:27.887301Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2608.04336"},"observation_digest":"sha256:f10f5b86727ac5d99a2484c285bae968c7ff60e6ed8f3d7e3c09172c81b5c5ae","observation_id":"d3ce37ac-8eeb-47e0-bda0-7ab965df12c5","resolution":{"observed_at":"2026-08-08T19:35:27.887301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.04336","last_updated":"2026-08-05T01:28:43Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-09T00:17:00.257446Z","submitted_at":"2026-08-05T01:28:43Z","title":"COMPAS: Difficulty-Aware Joint Search for Optimizing Code Generation"},"reference_resolution":{"displayed":80,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":6,"verified_fuzzy":44},"total_outbound_references":80},"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 80 of 80 outbound references and 0 inbound Pith citation observations for arXiv:2608.04336."}