{"as_of":"2026-08-09T23:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7a0d64c009f467404e44e8478db9e2ee5c1b43e80a985e8c17490dc5bc887f3f","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-09T06:31:02.800959+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-08T17:16:31.403111Z","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-08T17:16:33.043034Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.00075","last_updated":"2024-08-24T07:20:29Z","snapshot_observed_at":"2026-08-06T14:38:47.783168Z","submitted_at":"2024-08-24T07:20:29Z","title":"A survey on combinatorial optimization","version":1},"cited_work":{"arxiv_id":"2409.00075","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.00075","snapshot_observed_at":"2026-08-08T17:16:33.043034Z","title":"A survey on combinatorial optimization","venue":"math.OC","work_id":"96a84e57-f7ea-45cb-b42c-0dde12e7652c","year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-08T17:07:01.677947Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.403111Z"},"links":{"cited_paper":"/paper/2409.00075","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:c77bdfe5ffc9d16009f06712c57c8f356605942cd215c8411da49a43a9dd987c","observation_id":"bc3bee52-4e61-4e2d-9b20-6755b8151808","resolution":{"observed_at":"2026-08-08T17:16:33.047485Z","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/2409.00075/citation-record","integrity":"/paper/2409.00075/integrity","json":"/paper/2409.00075/citation-record.json","paper":"/paper/2409.00075"},"outbound":[],"paper":{"arxiv_id":"2409.00075","last_updated":"2024-08-24T07:20:29Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T14:38:47.783168Z","submitted_at":"2024-08-24T07:20:29Z","title":"A survey on combinatorial optimization"},"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 1 inbound Pith citation observation for arXiv:2409.00075."}