{"as_of":"2026-08-18T07:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c958efbdd045b7e061bfef70b8fa7b35aa48264a2a95852e99ef07c244119224","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:32:41.870865Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-06T17:05:19.225310Z","title":"Regal: Refactoring programs to discover generalizable abstractions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22069","last_updated":"2025-07-31T07:33:11Z","snapshot_observed_at":"2026-08-14T01:12:15.925950Z","submitted_at":"2025-07-16T03:11:43Z","title":"A Compute-Matched Re-Evaluation of TroVE on MATH","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T17:05:19.225310Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2507.22069"},"observation_digest":"sha256:c0d08ff72e8034b1a64f8482335d5442ef897edbbf9f40b5fd243db1a64570b0","observation_id":"f8597cc1-fa2f-4bb1-9d95-4a35e18771ef","resolution":{"observed_at":"2026-08-06T17:05:19.225310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":"2401.16467","doi":"10.48550/arxiv.2401.16467","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Regal: Refactoring programs to discover generalizable abstractions.arXiv preprint arXiv:2401.16467","venue":"arXiv (Cornell University)","work_id":"6f03a7f2-44ba-4523-8e38-526d565495e2","year":2024},"citing_paper":{"arxiv_id":"2604.20759","last_updated":"2026-04-22T16:48:24Z","snapshot_observed_at":"2026-08-14T12:06:51.344036Z","submitted_at":"2026-04-22T16:48:24Z","title":"Autark: A Serverless Toolkit for Prototyping Urban Visual Analytics Systems","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-09T23:25:06.889072Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2604.20759"},"observation_digest":"sha256:b07f6ddc6771b1168fbe936cebf145e143ad8f5a1f7ebf06d5db7c247b55da24","observation_id":"553609ce-fa96-4206-a8a9-6349200fcb33","resolution":{"observed_at":"2026-05-11T14:11:03.892722Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":"2401.16467","doi":"10.48550/arxiv.2401.16467","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Regal: Refactoring programs to discover generalizable abstractions.arXiv preprint arXiv:2401.16467","venue":"arXiv (Cornell University)","work_id":"6f03a7f2-44ba-4523-8e38-526d565495e2","year":2024},"citing_paper":{"arxiv_id":"2604.20759","last_updated":"2026-04-22T16:48:24Z","snapshot_observed_at":"2026-08-14T12:06:51.344036Z","submitted_at":"2026-04-22T16:48:24Z","title":"Autark: A Serverless Toolkit for Prototyping Urban Visual Analytics Systems","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-09T23:25:06.889072Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2604.20759"},"observation_digest":"sha256:54a51caa303f9233f294a5ade4dd06c9a19884235be4e099ddb9699a3c6ce884","observation_id":"76111945-835c-4727-ac4e-2b489c07648e","resolution":{"observed_at":"2026-05-09T23:29:43.693097Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":"2401.16467","doi":"10.48550/arxiv.2401.16467","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Regal: Refactoring programs to discover generalizable abstractions.arXiv preprint arXiv:2401.16467","venue":"arXiv (Cornell University)","work_id":"6f03a7f2-44ba-4523-8e38-526d565495e2","year":2024},"citing_paper":{"arxiv_id":"2605.05485","last_updated":"2026-05-06T22:08:17Z","snapshot_observed_at":"2026-08-13T23:34:21.164749Z","submitted_at":"2026-05-06T22:08:17Z","title":"ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T16:13:09.447000Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2605.05485"},"observation_digest":"sha256:e63342b4d118aca57d3b57904911bb0230d6c8c52dc372c915d5b2c169cab669","observation_id":"02d050cb-b46d-4130-8496-b491bf93fefe","resolution":{"observed_at":"2026-05-11T18:21:09.019307Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":"2401.16467","doi":"10.48550/arxiv.2401.16467","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Regal: Refactoring programs to discover generalizable abstractions.arXiv preprint arXiv:2401.16467","venue":"arXiv (Cornell University)","work_id":"6f03a7f2-44ba-4523-8e38-526d565495e2","year":2024},"citing_paper":{"arxiv_id":"2605.08468","last_updated":"2026-05-08T20:39:32Z","snapshot_observed_at":"2026-08-02T16:12:56.247576Z","submitted_at":"2026-05-08T20:39:32Z","title":"PYTHALAB-MERA: Validation-Grounded Memory, Retrieval, and Acceptance Control for Frozen-LLM Coding Agents","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-12T01:12:37.970638Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2605.08468"},"observation_digest":"sha256:3b792e5bc87a1ff9c8846e0f247ae1e3672d1b67b8a28debbecce102e3df6d4e","observation_id":"a71a6710-b92f-4ae6-888a-a4a258a18e4b","resolution":{"observed_at":"2026-05-12T08:26:23.038371Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":"2401.16467","doi":"10.48550/arxiv.2401.16467","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Regal: Refactoring programs to discover generalizable abstractions.arXiv preprint arXiv:2401.16467","venue":"arXiv (Cornell University)","work_id":"6f03a7f2-44ba-4523-8e38-526d565495e2","year":2024},"citing_paper":{"arxiv_id":"2605.16046","last_updated":"2026-07-02T08:35:02Z","snapshot_observed_at":"2026-08-16T14:33:00.443216Z","submitted_at":"2026-05-15T15:17:43Z","title":"XSearch: Explainable Code Search via Concept-to-Code Alignment","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-20T16:31:27.989614Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2605.16046"},"observation_digest":"sha256:53add56406d3bb04df6fe04d37f4d2097a1b7567756215169caf451f9f405338","observation_id":"80b07c8c-0477-4696-8562-e5730446168e","resolution":{"observed_at":"2026-05-20T16:33:34.054734Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":"2401.16467","doi":"10.48550/arxiv.2401.16467","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Regal: Refactoring programs to discover generalizable abstractions.arXiv preprint arXiv:2401.16467","venue":"arXiv (Cornell University)","work_id":"6f03a7f2-44ba-4523-8e38-526d565495e2","year":2024},"citing_paper":{"arxiv_id":"2605.16046","last_updated":"2026-07-02T08:35:02Z","snapshot_observed_at":"2026-08-16T14:33:00.443216Z","submitted_at":"2026-05-15T15:17:43Z","title":"XSearch: Explainable Code Search via Concept-to-Code Alignment","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-07-04T00:55:50.772103Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2605.16046"},"observation_digest":"sha256:7ea4fcdfc85383cb180ef2370dedb99888b4075a20202648a7e80604a4edf35b","observation_id":"6b951fb3-df08-48e1-8ac2-eb1590ba0c54","resolution":{"observed_at":"2026-07-04T00:59:18.937487Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-15T14:32:41.870865Z","title":"arXiv preprint arXiv:2401.16467 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07395","last_updated":"2026-08-07T16:40:03Z","snapshot_observed_at":"2026-08-17T00:02:03.026365Z","submitted_at":"2026-08-07T16:40:03Z","title":"PACE: Primitive-Aware Code Evolution for Automated Algorithm Design","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T14:32:41.870865Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2608.07395"},"observation_digest":"sha256:c97b367ccaf1b29ba2adf1640f1f6de21316f0b6b2560840b6a39d3e5702d473","observation_id":"5bc5e9f2-f0e4-445c-98a2-8a7b14900422","resolution":{"observed_at":"2026-08-15T14:32:41.870865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16467","snapshot_observed_at":"2026-08-15T14:18:10.656502Z","title":"doi:10.48550/arXiv.2401.16467 , abstract =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11338","last_updated":"2026-08-11T18:42:23Z","snapshot_observed_at":"2026-08-15T23:10:00.230580Z","submitted_at":"2026-08-11T18:42:23Z","title":"Better, Faster, Stronger: Programmatic Skill Learning Best Reduces Agent Cost","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T14:18:10.656502Z"},"links":{"cited_paper":"/paper/2401.16467","citing_paper":"/paper/2608.11338"},"observation_digest":"sha256:c6f0eceb5c739789e045271cede0529aa56294d1d6510d15a760cfc638f19414","observation_id":"bdf2e2c6-595d-4173-8673-57103881a41d","resolution":{"observed_at":"2026-08-15T14:18:10.656502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.16467/citation-record","integrity":"/paper/2401.16467/integrity","json":"/paper/2401.16467/citation-record.json","paper":"/paper/2401.16467"},"outbound":[],"paper":{"arxiv_id":"2401.16467","last_updated":"2024-06-06T17:31:07Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T14:23:32.260876Z","submitted_at":"2024-01-29T18:45:30Z","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2401.16467."}