{"as_of":"2026-08-10T12:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a281307a9c73d56c341c54ec205295eb3b820c2c6071483c6f50b514ccc6d42d","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:00:58.731688Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:58:22.699754Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.00312","last_updated":"2025-01-18T06:02:08Z","snapshot_observed_at":"2026-08-06T05:54:29.164028Z","submitted_at":"2024-06-29T04:29:03Z","title":"UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00312","snapshot_observed_at":"2026-08-07T14:00:58.731688Z","title":"heuristics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20242","last_updated":"2025-05-26T17:21:16Z","snapshot_observed_at":"2026-08-10T07:51:40.999994Z","submitted_at":"2025-05-26T17:21:16Z","title":"RedAHD: Reduction-Based End-to-End Automatic Heuristic Design with Large Language Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:00:58.731688Z"},"links":{"cited_paper":"/paper/2407.00312","citing_paper":"/paper/2505.20242"},"observation_digest":"sha256:10b961604a74748d9c9b948ea17b19189260b430cb39bb563fc06d9c1b4c58d2","observation_id":"1b618215-ba0f-4dcb-8b29-2b9eafb5c2ff","resolution":{"observed_at":"2026-08-07T14:00:58.731688Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00312","last_updated":"2025-01-18T06:02:08Z","snapshot_observed_at":"2026-08-06T05:54:29.164028Z","submitted_at":"2024-06-29T04:29:03Z","title":"UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems","version":4},"cited_work":{"arxiv_id":"2407.00312","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.00312","snapshot_observed_at":"2026-08-07T04:58:22.699754Z","title":"UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems","venue":"cs.AI","work_id":"51e8ea1f-e0cc-4495-9774-ec29e07833f1","year":2024},"citing_paper":{"arxiv_id":"2506.09404","last_updated":"2025-06-11T05:17:30Z","snapshot_observed_at":"2026-08-10T01:30:25.846964Z","submitted_at":"2025-06-11T05:17:30Z","title":"Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T04:58:22.562491Z"},"links":{"cited_paper":"/paper/2407.00312","citing_paper":"/paper/2506.09404"},"observation_digest":"sha256:b26aa64187a0b42c0b4712225306279094e1b9b02df848cab276207e173387ac","observation_id":"8189e4ee-e886-4f2c-9ff5-3084f9072452","resolution":{"observed_at":"2026-08-07T04:58:22.753264Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2407.00312/citation-record","integrity":"/paper/2407.00312/integrity","json":"/paper/2407.00312/citation-record.json","paper":"/paper/2407.00312"},"outbound":[],"paper":{"arxiv_id":"2407.00312","last_updated":"2025-01-18T06:02:08Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T05:54:29.164028Z","submitted_at":"2024-06-29T04:29:03Z","title":"UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.00312."}