{"as_of":"2026-08-17T06:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f8d7821f74027c21e99d76ad039b37338d3fac6ede174916ec713ec0f60ccc6","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:24:57.423732Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T20:33:25.972540Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.01908","last_updated":"2024-06-06T09:07:37Z","snapshot_observed_at":"2026-08-16T13:46:28.797452Z","submitted_at":"2024-06-04T02:39:42Z","title":"PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming","version":2},"cited_work":{"arxiv_id":"2406.01908","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01908","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fc1a5e8c-d679-4f6d-bceb-5d2762226209","year":2024},"citing_paper":{"arxiv_id":"2410.04043","last_updated":"2026-07-03T21:50:23Z","snapshot_observed_at":"2026-08-16T13:12:22.673197Z","submitted_at":"2024-10-05T05:35:09Z","title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-23T20:29:07.895240Z"},"links":{"cited_paper":"/paper/2406.01908","citing_paper":"/paper/2410.04043"},"observation_digest":"sha256:4b9959b8227ffb0e11b6b111e2e8ff348156159a6086eddfb89f1f7b22376ade","observation_id":"8e858feb-a8f9-495f-bc11-344756c00ea4","resolution":{"observed_at":"2026-05-23T20:33:25.974817Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01908","last_updated":"2024-06-06T09:07:37Z","snapshot_observed_at":"2026-08-16T13:46:28.797452Z","submitted_at":"2024-06-04T02:39:42Z","title":"PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01908","snapshot_observed_at":"2026-08-10T23:12:21.466744Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.21068","last_updated":"2024-12-30T16:35:47Z","snapshot_observed_at":"2026-08-15T17:24:11.178615Z","submitted_at":"2024-12-30T16:35:47Z","title":"Finite Horizon Optimization: Framework and Applications","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-10T23:12:21.466744Z"},"links":{"cited_paper":"/paper/2406.01908","citing_paper":"/paper/2412.21068"},"observation_digest":"sha256:3badc50c160b093e6b8f1d1d6e8122a4f1386a0a1fed6f56930a724fa11653df","observation_id":"63f3c640-103c-470d-8dc5-588a0c7a6f96","resolution":{"observed_at":"2026-08-10T23:12:21.466744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01908","last_updated":"2024-06-06T09:07:37Z","snapshot_observed_at":"2026-08-16T13:46:28.797452Z","submitted_at":"2024-06-04T02:39:42Z","title":"PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01908","snapshot_observed_at":"2026-08-15T19:24:57.423732Z","title":"Pdhg-unrolled learning-to-optimize method for large-scale linear programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16790","last_updated":"2025-07-15T05:21:45Z","snapshot_observed_at":"2026-08-15T19:16:14.713591Z","submitted_at":"2025-06-20T07:14:31Z","title":"Exploring and Improving Initialization for Deep Graph Neural Networks: A Signal Propagation Perspective","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-15T19:24:57.423732Z"},"links":{"cited_paper":"/paper/2406.01908","citing_paper":"/paper/2506.16790"},"observation_digest":"sha256:7a20a31c45d4e80dd0b262570aa1c11294e733840baacd79609403f3affa91eb","observation_id":"97b0ae74-eba1-43c8-b21b-d8d2188dd870","resolution":{"observed_at":"2026-08-15T19:24:57.423732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01908","last_updated":"2024-06-06T09:07:37Z","snapshot_observed_at":"2026-08-16T13:46:28.797452Z","submitted_at":"2024-06-04T02:39:42Z","title":"PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01908","snapshot_observed_at":"2026-07-13T16:24:28.182375Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.28345","last_updated":"2026-07-06T13:50:25Z","snapshot_observed_at":"2026-08-15T08:46:51.836299Z","submitted_at":"2026-03-30T12:14:24Z","title":"Reachability Across the NL/PL Boundary: A Taxonomy-Driven Dataflow Model for LLM-Integrated Applications","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-13T16:24:28.182375Z"},"links":{"cited_paper":"/paper/2406.01908","citing_paper":"/paper/2603.28345"},"observation_digest":"sha256:699b021a0350ab58876abb82b99d00bdd64bc1f2c8bb9db757c6ed7bbc594414","observation_id":"207d76ad-6ed0-491a-9b38-8072cd9cb5f9","resolution":{"observed_at":"2026-07-13T16:24:28.182375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.01908/citation-record","integrity":"/paper/2406.01908/integrity","json":"/paper/2406.01908/citation-record.json","paper":"/paper/2406.01908"},"outbound":[],"paper":{"arxiv_id":"2406.01908","last_updated":"2024-06-06T09:07:37Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:46:28.797452Z","submitted_at":"2024-06-04T02:39:42Z","title":"PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2406.01908."}