{"as_of":"2026-08-09T08:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a38b84ba8d5f8b1e272f0cdca85fd081ca780ffc49cf296f29d78cdb8d2e63f4","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-09T06:31:02.800959+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-07T13:05:03.426135Z","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-06T17:00:13.990063Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.14836","last_updated":"2023-12-22T17:09:34Z","snapshot_observed_at":"2026-07-06T17:07:14.412645Z","submitted_at":"2023-12-22T17:09:34Z","title":"Learning Lagrangian Multipliers for the Travelling Salesman Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14836","snapshot_observed_at":"2026-08-07T13:05:03.426135Z","title":"Learning lagrangian multipliers for the travelling salesman problem, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22825","last_updated":"2025-05-28T20:10:04Z","snapshot_observed_at":"2026-08-08T06:28:22.371765Z","submitted_at":"2025-05-28T20:10:04Z","title":"PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T13:05:03.426135Z"},"links":{"cited_paper":"/paper/2312.14836","citing_paper":"/paper/2505.22825"},"observation_digest":"sha256:f777f8e92400dc964940dac1633e7666e7fe040b4e3cd5bb0c13b7cdb392e56c","observation_id":"bdfd7c1b-0dc7-41e5-8c85-7cca35060f47","resolution":{"observed_at":"2026-08-07T13:05:03.426135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14836","last_updated":"2023-12-22T17:09:34Z","snapshot_observed_at":"2026-07-06T17:07:14.412645Z","submitted_at":"2023-12-22T17:09:34Z","title":"Learning Lagrangian Multipliers for the Travelling Salesman Problem","version":1},"cited_work":{"arxiv_id":"2312.14836","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.14836","snapshot_observed_at":"2026-08-06T17:00:13.990063Z","title":"Learning Lagrangian Multipliers for the Travelling Salesman Problem","venue":"cs.AI","work_id":"14278459-c689-4d21-9116-1ff1f826f2d3","year":2023},"citing_paper":{"arxiv_id":"2507.12159","last_updated":"2025-08-11T04:20:55Z","snapshot_observed_at":"2026-08-06T16:50:07.221590Z","submitted_at":"2025-07-16T11:39:47Z","title":"Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T17:00:12.765704Z"},"links":{"cited_paper":"/paper/2312.14836","citing_paper":"/paper/2507.12159"},"observation_digest":"sha256:f90aecf8790aac4438fb4400fc426abb222d218fa206d6402b874d97965e772b","observation_id":"bb23ed84-eab3-4e8b-aaaa-d23fb2401ebe","resolution":{"observed_at":"2026-08-06T17:00:14.029541Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.14836/citation-record","integrity":"/paper/2312.14836/integrity","json":"/paper/2312.14836/citation-record.json","paper":"/paper/2312.14836"},"outbound":[],"paper":{"arxiv_id":"2312.14836","last_updated":"2023-12-22T17:09:34Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T17:07:14.412645Z","submitted_at":"2023-12-22T17:09:34Z","title":"Learning Lagrangian Multipliers for the Travelling Salesman Problem"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.14836."}