{"as_of":"2026-08-09T01:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f37af7be8f188f4f4a76084e56eb534519214cda85ee08e43d9ca95fb741d06","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:42:59.810710Z","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-06T05:42:59.955157Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.08401","last_updated":"2025-04-17T09:01:57Z","snapshot_observed_at":"2026-08-07T22:45:43.897106Z","submitted_at":"2025-04-11T10:08:38Z","title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application","version":2},"cited_work":{"arxiv_id":"2504.08401","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.08401","snapshot_observed_at":"2026-08-06T05:42:59.955157Z","title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application","venue":"cs.LG","work_id":"898d54ac-088d-4fa1-bb40-1ad4bb390ff2","year":2025},"citing_paper":{"arxiv_id":"2508.01557","last_updated":"2025-08-03T03:03:05Z","snapshot_observed_at":"2026-08-07T22:45:43.378325Z","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T05:42:59.810710Z"},"links":{"cited_paper":"/paper/2504.08401","citing_paper":"/paper/2508.01557"},"observation_digest":"sha256:898706165ffd4f4502a4f2eb7f9fb3d89bfb19ee5777fe8b781623ce51574582","observation_id":"f1b3e53b-4549-4b98-9a41-54afdf22430d","resolution":{"observed_at":"2026-08-06T05:42:59.960653Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.08401/citation-record","integrity":"/paper/2504.08401/integrity","json":"/paper/2504.08401/citation-record.json","paper":"/paper/2504.08401"},"outbound":[],"paper":{"arxiv_id":"2504.08401","last_updated":"2025-04-17T09:01:57Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T22:45:43.897106Z","submitted_at":"2025-04-11T10:08:38Z","title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2504.08401."}