{"as_of":"2026-08-10T14:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:762412761ffbe287ec7ac80e3a70b7b82b0c9b051cd40e006d34a43d4ce42293","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-10T06:31:04.303077+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-09T19:18:27.102890Z","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:e089ff31ef29097477c5427582ab33aef4eaf8b3b646d51acca7fa44a156560d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:a20f37783b2cd38d056218559c2ac8626cc6bfc3b5c9ab6053e24fb30350fdd8","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-09T19:18:27.102890Z","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:27d887c2a7891f233afd0a989e72f0ea1a358eef9085606cd3e604d90a9f42a0","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-09T19:18:27.102890Z","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:abbe005cbc8289576065ff7a9783e5605ab753f06ef129ee63a1769647d657e7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:e3b30b14ed7e571392cf2ee2f6bf53883eeb92c64e7bc3e038e02795f6bbf34a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T11:59:11.481480Z","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-09T19:18:27.102890Z","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:9cb5a24a50bb4edba23ef190b042e33eab0aab21f2a0b746161332da9a47c607","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-09T19:18:27.102890Z","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:8cd8f4ca0c7ba68a84c0df8b6ef1b87f2b6fa6fa6e55802e22678755ba87dfde","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:cda1e0e1d70b9997c217660827f81690140e902f009e6c8ff96eab77a15d236c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:6d20527e59f87b2c0f34e3f6d909335998e415d7d64b8cf443a059e4204458e9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:a81aed332198e7eb52ed456192fe142ed67a1652f14cd5fb1f1913c666c3473a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:70796515510042ef5d695714799dd6e8123e9262cb80e08002241e9da0abd2a1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:3f35ee0eb7bbb641979c7f54aa4b5dc7d7d5c59023a4890d6f534a62995244e2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:203f80ed50cd529d6c15daf33941968351b3bdad792c71fb5b94b27018860f19","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:8d98257b9d1b2c69e9ff5a47c319745f165747fb66f4230cc8bc78cf3389d7f9","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-09T19:18:27.102890Z","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:893c0e367873973c4ce5aacedbf038ed77333b60704168632c8789caa247dc75","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:f43376b18aeda4c585b670c21bfff1e35ab8d61f8d30205229f3c51e3afd9497","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:cbfc839a69f27fa9b425fe674a9eeefc889522773895039855aae7d5e6e8548b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:16ccfc585951db3d8be7fd0d8d4b4989a7a50aa364c616ceda49b5211010b6cb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:441eb784dfcfa31be3b9f49761a14c1cced09fd9d1ce46d6cc988add485a1d68","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:46f58295a29e0bfecd80e04ce9d3b108f060c3b77b43b2fc777055a2b1376a67","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:1a70db31c197312a823be1d3db021c3653b6ca4bed0f43cf41a4e6c0cd9ad975","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:2cb0ffeefe63f18ac3ca5dbdb8ba2339838943f8dc6f5cfe69ccdb7cc12c328a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v40i1.37030","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Proceedings of the AAAI Conference on Artificial Intelligence","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-09T19:18:27.102890Z","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:04227232de65a59103d4fe2ad23ee41eca6614b40b0bb7ffbeda6e856ac38ad6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:62b32db3fbe36ffa09245d01c4d639365aab82ff8aabbf8878a33460f2299f60","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:3918bc073a278f8f07b8ae206d3f35df4487152a2da5ef688d3b4d6ca06a4f2f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:b6debed906882855cea0488a0c45a80f850054736558cbf9719cfa4aff9ec14a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:82262d4587393ece17b0c0f7d80369c3d2aff3171a775d1c65082b13bc9b65b3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:316106f0f29f15953b9369d316bec45eb99ef07b9ae47a29ae18160da762dded","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-09T19:18:27.102890Z","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:1f56ab37373a0badc3eebeab10a745a4b283ce45fd1ea8f26bf98f01ed5003e1","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-09T19:18:27.102890Z","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:ee5880d4e105db46b877c6dc3abd92b6c4a8fb9c39c8f42aae9e77ef5961a7a3","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-09T19:18:27.102890Z","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:5fe6a8323e2874dc77668be2ada221cb8b4d7e660cfd75b77a64a7cea0cbbfb6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:fc1756a5cc4629c78d01df7c36c836ce1f10af5c99c9718da104b62e770eb663","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:24609dd98035c12911493d763c876589c056cf08d49b94bd46ba53a4cb8ee987","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:7f848eaa80912a4b1b0200066adeade6f3f47815f2033429054cec886114cc75","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:5593ee74dd07c4d2805bf13df119c50e3265cf2cdab57f73d3032869dd4103d1","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-09T19:18:27.102890Z","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:22b3307de84b3e21bf376f070a57d943bc9476d6ebe2e4901c0100319a1ca932","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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","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-09T19:18:27.102890Z","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:4c9497a37c30b92c03af760c0829f9702ad04597f6cce3d1562ed2a0d5b856cf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:14fb7d2089ce43325634b21f2798115fcfb0ed5508f98513e22017b9e14222ea","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:88d0d8efd864dbf0e66f4aef73305bffd6ef495860304d62294d0a00d568cb1c","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-09T19:18:27.102890Z","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:98332d7e428d5de3f5eb8f242a449de55138135ee06fb44e9d7045bc38fd881e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:2baeae8c83502be9b45786db36dcf5082bb6b06fcccfc05c4f98028ac62cb501","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:f971d8e3a228cae96f13f5938cfb0036ef87205f6cde4c5cc4917f9494b58d6a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:d98a728cae4a5b6a07eaea769fb9ce54262247b3cbc8930fc30418f0b4112978","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-09T19:18:27.102890Z","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:2fcc9e69eafca55ad7080a58f258f8b57127fb059ae01899a8250239267936f1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:9846cae2beacd9baa6f92726c930e603e3286ca1f22eda15567e7f24f28969a8","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-09T19:18:27.102890Z","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:5cd3e50cf5e591458b2e40eacce95fe4ae84fcc5fc9a2b08c219d5680888df91","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-09T19:18:27.102890Z","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:873665f9e2246dbdd9109b36b2497c78ec29a935d28b4b07826d63a1b01ca1b6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:0efe3ff1542e5008d79a848610a442adc26eb56c5ac0b511456d62bde9a199b2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:4072d0c394d4d8a858d5e5387e57437d14d0b41180e87be5812a8659c6e8a433","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-09T19:18:27.102890Z","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:612cd3b0d0b1b8e0992fad634205632736211e8a30be647f7a2f3e3773f06aac","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-09T19:18:27.102890Z","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:1049c2cda07c3c258e53603b45cb271d3f7a14485607e3f56b324daba860d485","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-09T19:18:27.102890Z","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:a12cb28ff1359f4f5aa9361714c88eb750766e2a8c998a2c16c82b570bd3513e","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-09T19:18:27.102890Z","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:31184240d317897f867e4d804e31ebf4f2d76be4fd823814d371447e518cbaa2","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-09T19:18:27.102890Z","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:993675061aa93feecb04b516d3e938cb485f8609c598da161709f7e0639ed18d","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-09T19:18:27.102890Z","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:efa105d2e443943ab630e9d5155a8333f069822e3b336f4b758f7e405e394281","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:8d89dec0fcfcde8e8cab7f14d10474aaddd2c26f5dbe45aec4da9e0f3bd233a4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:e3f7cf16d27e8b774361780284470c34d69c0ff1ebf38bf6475574c6ac17c19e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:59befa458b25b51455871f7b6c0ef84bf657ed21fa44ca39bedc7eefbd182bf7","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-09T19:18:27.102890Z","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:872fbf032ce89c3d33bdfd97a9f6a3bc8c169d0584cf569b448ad90225058ec4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:5917ee2f7c69754baf4bbdcdb69fc0120f665b92d29514bd2f4bb55ab939e5a7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:296e8a5eb904d214a9db71536c76ccf5798c0d2218acf9d37ea7f29663897544","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:ffbcc607b5b8e335dc88bcfff02adf58666179fa6ad87f342bee4cd4e46b98d4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:baacf322b4fedd0e6cc98eb29402d8138fa11037a7bd277bba4659ad160fadff","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-09T19:18:27.102890Z","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:65496e0663eba7cc6a082941060f3c03601235aa9fc6a34ecc9ef98c57486eef","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:4fbc7e5ffd6a8b22b9404b198ce5d4b5a48ebf539a9b7015630a0e4cdf596b18","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-09T19:18:27.102890Z","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:79bf6ad85944271599bdb408d2400acbddd25c00df67f3e7beb0b92fde6ae22a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:2132848884a63b889c50b16afcca7da3c9624b94d67c206168ab0cc5495cf6d3","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-09T19:18:27.102890Z","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:a79a8bbae59f56bdc968afcf212ddbef59d303e08fb815320af6411983dd4a88","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-09T19:18:27.102890Z","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:05c29e979836eaa064f31af447b86fa507e63d5773358df56b5d189b682d945a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:4e3a594de37de84b04784f4f9f20d7dc922edc0ab51c19290a1478406d38075b","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-09T19:18:27.102890Z","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:26127260da9d8c669ebe7949b5dd5c9dc0e4f23ac4c9243a2be488c13456fbcf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:c11c971621f8a55de1c37ffe5938a31f30244659bcfefd38da1e8aac84b7abf7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:6d5556cb0f928d73e6831b86c0f5734c90fc8b1a6ee6bf3abb708f6af39e4282","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:35991966dfaac28df5948723e88a9a699a0d3788df99c64808bbd231eab5b961","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:50303446dba73112e14a3561448d1c40faaa1fd76eee14e90c6688bd18c42f78","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-09T19:18:27.102890Z","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:f91b67647de24216e4a0fc4a26ecca74cc2b6d18f1f555f9b05a7bc518391507","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-09T19:18:27.102890Z","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:b7e325a8eeac78e79f1759c7c23b7777a6be62ff105ecc158811d5ea7e67ce72","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-09T19:18:27.102890Z","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:da5bd28161b25abbf355c38404770c1d0980172cc56d2c54cbd98119293483f4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:082c5a34dca58df23e944d05dc4de341945cb1727da93ff61a04503808f85e95","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T19:18:27.102890Z","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:eb5a73663e21668a7a4bbdc446506bd5230619732535298ce7c6c0d67e17125d","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-09T19:18:27.102890Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 80 of 80 outbound references and 0 inbound Pith citation observations for arXiv:2608.04336."}