{"as_of":"2026-08-17T16:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e72df3897ea5880d62f08c0f50900b6a89ccc9bc082d159c368a3e2ac5aa41a9","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-17T06:30:58.91139+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-04T00:48:33.528792Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.10957","last_updated":"2024-02-21T04:29:01Z","snapshot_observed_at":"2026-08-17T05:36:37.236548Z","submitted_at":"2023-09-19T22:53:17Z","title":"Approximation Algorithms for Quantum Max-$d$-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10957","snapshot_observed_at":"2026-08-04T00:48:33.528792Z","title":"Approximation Algorithms for Quantum Max-d-Cut","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.528792Z"},"links":{"cited_paper":"/paper/2309.10957","citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:b738682c73da17f96daa73a9fab8510d2d48859c648c8046cd8f405c223af063","observation_id":"bacbe87a-506d-4a3a-a7e7-917f46a8ff3b","resolution":{"observed_at":"2026-08-04T00:48:33.528792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.10957/citation-record","integrity":"/paper/2309.10957/integrity","json":"/paper/2309.10957/citation-record.json","paper":"/paper/2309.10957"},"outbound":[],"paper":{"arxiv_id":"2309.10957","last_updated":"2024-02-21T04:29:01Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T05:36:37.236548Z","submitted_at":"2023-09-19T22:53:17Z","title":"Approximation Algorithms for Quantum Max-$d$-Cut"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2309.10957."}