{"as_of":"2026-08-19T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8120511b2e9bb03ca2d305e020460e61cafe642dbaec5c245eee5deacd66bdd4","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:50:08.175341Z","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-18T14:26:28.518366Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.12288","last_updated":"2023-05-25T20:00:12Z","snapshot_observed_at":"2026-08-16T16:30:03.505733Z","submitted_at":"2022-09-25T18:27:33Z","title":"On Representing Linear Programs by Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12288","snapshot_observed_at":"2026-08-12T04:52:22.094467Z","title":"On representing linear programs by graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-17T03:09:44.346907Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.094467Z"},"links":{"cited_paper":"/paper/2209.12288","citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:f40782ba6537c8d48c08442a6020d4dab4001a9819496fe0e1538caff7c6c95d","observation_id":"479d97be-f505-442e-b098-bfe9ca77d1d3","resolution":{"observed_at":"2026-08-12T04:52:22.094467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12288","last_updated":"2023-05-25T20:00:12Z","snapshot_observed_at":"2026-08-16T16:30:03.505733Z","submitted_at":"2022-09-25T18:27:33Z","title":"On Representing Linear Programs by Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12288","snapshot_observed_at":"2026-08-15T20:50:08.175341Z","title":"On representing linear programs by graph neural networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.01988","last_updated":"2025-05-17T09:44:37Z","snapshot_observed_at":"2026-08-18T03:20:41.225935Z","submitted_at":"2025-05-17T09:44:37Z","title":"Surrogate Interpretable Graph for Random Decision Forests","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T20:50:08.175341Z"},"links":{"cited_paper":"/paper/2209.12288","citing_paper":"/paper/2506.01988"},"observation_digest":"sha256:3620eb95e36e393dc2da8fbe402cd1702cc1f06eb3b50d6955e8fb867c4e50bf","observation_id":"b3f90e38-664f-49b4-ba62-0fdc7d2cb157","resolution":{"observed_at":"2026-08-15T20:50:08.175341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12288","last_updated":"2023-05-25T20:00:12Z","snapshot_observed_at":"2026-08-16T16:30:03.505733Z","submitted_at":"2022-09-25T18:27:33Z","title":"On Representing Linear Programs by Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2209.12288","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.12288","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On representing linear pro- grams by graph neural networks.arXiv preprint arXiv:2209.12288","venue":null,"work_id":"d81ba688-7d15-4bc1-bac5-db84c8edef6c","year":null},"citing_paper":{"arxiv_id":"2509.21000","last_updated":"2026-05-11T17:06:09Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T10:50:22Z","title":"Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T14:23:46.287363Z"},"links":{"cited_paper":"/paper/2209.12288","citing_paper":"/paper/2509.21000"},"observation_digest":"sha256:3ef7b3e98a5dd0130f33e25bedb865db93ad130adfe6c360a24d29bfefdac1e7","observation_id":"ddff2300-10e5-4d69-84a7-63c03233bb7e","resolution":{"observed_at":"2026-05-18T14:26:28.521047Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2209.12288/citation-record","integrity":"/paper/2209.12288/integrity","json":"/paper/2209.12288/citation-record.json","paper":"/paper/2209.12288"},"outbound":[],"paper":{"arxiv_id":"2209.12288","last_updated":"2023-05-25T20:00:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:30:03.505733Z","submitted_at":"2022-09-25T18:27:33Z","title":"On Representing Linear Programs by Graph Neural Networks"},"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 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2209.12288."}