{"as_of":"2026-08-16T08:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7350b59a978bc151d494a4b81d50b33c40151d119dba562f09cfc199bc5f18e3","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:44:31.197091Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2412.17330/citation-record","integrity":"/paper/2412.17330/integrity","json":"/paper/2412.17330/citation-record.json","paper":"/paper/2412.17330"},"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-11T05:44:31.490237Z","title":null,"venue":null,"work_id":"f3a115f0-dd4d-4d16-9f35-349fdd3f93dd","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.122447Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:9b55a123424dc536f1b7a0a49a263141634d0dd5d7f624695a24bbf9d2d7c63a","observation_id":"1e78ee7d-79b7-4b7e-bb62-fa4822b18bbc","resolution":{"observed_at":"2026-08-11T05:44:31.495667Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.470941Z","title":null,"venue":null,"work_id":"4f9371b5-0d09-49aa-8513-01f7fbc944a7","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.128961Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:10bb6bfede5bfc260f107940bae4fdebdc5a55d5a02e279112fc79a2356d4a83","observation_id":"a9513881-fb15-468d-809e-05b1879d3587","resolution":{"observed_at":"2026-08-11T05:44:31.476384Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.453580Z","title":"Before returning p′, we need to update the data structures, lines 12 to 16","venue":null,"work_id":"3d93ce74-d7e5-4510-a90c-8b763a548d64","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.135154Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:c7ccc2bc215b8c3e63aa6c15a576e609e46273032ce33c051ed3eb87b4d375bc","observation_id":"f3c65733-21dc-4d84-bd9f-eab021255b22","resolution":{"observed_at":"2026-08-11T05:44:31.459298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.436883Z","title":"Before returning p′, we need to update the data structures, lines 12 to 16","venue":null,"work_id":"ed140aef-7fc1-4bcf-8523-027614a149f3","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.140606Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:34f131ca2cba0e73d07bb2ba0282bbd266b24f6ceeeb97c4d5e43c304f563fb3","observation_id":"287538da-1494-49cf-b4f0-3a5bd36ae496","resolution":{"observed_at":"2026-08-11T05:44:31.442371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.354736Z","title":"We try generating programs: Generated[Index2Cost[0]] = {H}","venue":null,"work_id":"eb1fc37f-2221-4408-920f-a171b965a80a","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.168774Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:adfd0a569711e55cfb9a95d9c7a970bc9f2db7adf51bd908837c42d2ebed0357","observation_id":"f0ad00e9-5949-43e6-b91f-5207831d7ca5","resolution":{"observed_at":"2026-08-11T05:44:31.360481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.337853Z","title":"We try generating programs: Generated[Index2Cost[1]] = {var}","venue":null,"work_id":"927e0fcb-379c-4012-a62e-4e87b9d3683d","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.176336Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:98549dd49dd1715c74e7b56cb5e2a1e6c27f669effdd78622141cc5e359470b5","observation_id":"b8d64203-1854-4992-b7e2-40aeff11faa1","resolution":{"observed_at":"2026-08-11T05:44:31.342986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.420933Z","title":null,"venue":null,"work_id":"96b2f3b6-2d53-43f7-a375-4a101c020157","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.146627Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:2538958924710d6372da028bbb1c2af1e35a09d8a2e38e0403c3a966f991c0e0","observation_id":"ea19e9ae-780b-4709-b128-82f53064539c","resolution":{"observed_at":"2026-08-11T05:44:31.425872Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.405626Z","title":null,"venue":null,"work_id":"1930d2f0-8715-432a-8cc8-7fa86129f266","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.152782Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:b3e3def7534877f410050d5bdd7c22e311c37fc35ab10786379c43800f324762","observation_id":"dc1b152b-1240-460f-aad5-676ab31cfa43","resolution":{"observed_at":"2026-08-11T05:44:31.410497Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.390402Z","title":null,"venue":null,"work_id":"e6219a3f-ead4-40dd-86da-eeebbfc60df4","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.158379Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:f21cc13412b6c0d1a8e34d33242c6011402aa74b6d42e7dce1d602c94e99eb93","observation_id":"efe13fd6-e5f7-44c4-89db-aaa5e6b4c158","resolution":{"observed_at":"2026-08-11T05:44:31.395141Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.372721Z","title":"At this point we have Index2Cost = {1.1, 1.8, 2.0, 3.3}","venue":null,"work_id":"9a538680-b146-48d5-b243-a322ea797111","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.163440Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:0347503a630a83b0328e0ff8f548e85ccb414a452b5929c5bc587043af56739c","observation_id":"6f3b8a80-5145-4641-87b4-a9de433db94f","resolution":{"observed_at":"2026-08-11T05:44:31.379037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.320855Z","title":null,"venue":null,"work_id":"360fabcf-7f40-4fcb-b7d2-8c0b18198cb5","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.182336Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:3425c039665eaedf9869f8447cb5244f830706042c09dea9629fd68e277a1a9f","observation_id":"4de84273-a704-40b8-9aa4-5d469cb99f17","resolution":{"observed_at":"2026-08-11T05:44:31.325931Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.305161Z","title":null,"venue":null,"work_id":"86631680-1524-4132-af5d-1534f6bbd62b","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.187185Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:00fc9de0c096bd2a3ad827fd4ebc4d4520392f08a9dfc913a289a2a659d1541a","observation_id":"862b4f8f-8735-42fc-b86c-c6dab05d5734","resolution":{"observed_at":"2026-08-11T05:44:31.310077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.288349Z","title":"Line 19 triggers a call to Output(I, 0)","venue":null,"work_id":"c7023d86-36a1-4af6-b7c9-cc394979ecac","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.191985Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:376e829ab3b233d87907930b83411e290c4928f29e59451a82b3b3f52d2a001c","observation_id":"fe0969af-f879-4872-81fe-3c52049d9c8e","resolution":{"observed_at":"2026-08-11T05:44:31.293668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T05:44:31.269958Z","title":"Line 19 triggers a call toOutput(S, 0), already computed: GeneratedS[0] = {H}","venue":null,"work_id":"7cc6a9cf-1ae4-4765-b715-3dea64c88d7f","year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.197091Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:935c03968ca8d8a74c5ea600aa35028ff5243f6edb39a88bf63278f848dd16e6","observation_id":"de9f4d31-27c6-43cd-ac7c-23166a067c6b","resolution":{"observed_at":"2026-08-11T05:44:31.276587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07353","last_updated":"2024-04-10T21:16:59Z","snapshot_observed_at":"2026-08-15T19:45:15.388872Z","submitted_at":"2024-04-10T21:16:59Z","title":"Addressing the Abstraction and Reasoning Corpus via Procedural Example Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07353","snapshot_observed_at":"2026-08-11T05:44:31.109648Z","title":"URL https://ojs.aaai.org/index","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.109648Z"},"links":{"cited_paper":"/paper/2404.07353","citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:b2629a138a781d6e1e6605e6fde9b5679393f77eccfa6e4c92882f6e8ce63a92","observation_id":"4d187335-4b3c-4224-aa04-64d8431bd3d3","resolution":{"observed_at":"2026-08-11T05:44:31.109648Z","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.1137/s0097539795288246","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:44:31.231076Z","title":"Hello\", and W =","venue":null,"work_id":"1d7b1330-ff91-478e-ad8a-74b4dc4f7c52","year":2022},"citing_paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T05:44:31.116006Z"},"links":{"citing_paper":"/paper/2412.17330"},"observation_digest":"sha256:ad9def27be477bdf131966a86096ab81a05649ae6f803f5adc7ff792511c4724","observation_id":"ce8b2ae5-2e80-440d-ac9b-4fac184c0b8d","resolution":{"observed_at":"2026-08-11T05:44:31.237950Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.17330","last_updated":"2024-12-23T06:48:47Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T02:03:54.186591Z","submitted_at":"2024-12-23T06:48:47Z","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":7},"total_outbound_references":16},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2412.17330."}