{"as_of":"2026-08-08T21:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15666a4efe9d7bcc192a3b2660a870b8af9ae8b5aef315decff141c0f5d75006","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:20:15.867586Z","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-07-02T08:26:48.556148Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.02589","last_updated":"2023-11-07T03:28:09Z","snapshot_observed_at":"2026-07-06T13:49:23.138584Z","submitted_at":"2022-09-06T15:45:04Z","title":"An Improved Approximation Algorithm for Quantum Max-Cut","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02589","snapshot_observed_at":"2026-08-07T05:16:58.379901Z","title":"[https://arxiv.org/abs/2209.02589]","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08547","last_updated":"2025-06-10T08:12:14Z","snapshot_observed_at":"2026-08-07T05:05:05.575864Z","submitted_at":"2025-06-10T08:12:14Z","title":"A Refined Algorithm For the EPR model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:16:58.379901Z"},"links":{"cited_paper":"/paper/2209.02589","citing_paper":"/paper/2506.08547"},"observation_digest":"sha256:9597bd625a88d888b9801df83391db77f6815cb1cea770d779fe37d557e3acb4","observation_id":"90ca42e9-32bd-48c5-b27d-acbc9b501732","resolution":{"observed_at":"2026-08-07T05:16:58.379901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.02589","last_updated":"2023-11-07T03:28:09Z","snapshot_observed_at":"2026-07-06T13:49:23.138584Z","submitted_at":"2022-09-06T15:45:04Z","title":"An Improved Approximation Algorithm for Quantum Max-Cut","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02589","snapshot_observed_at":"2026-08-06T17:49:46.654275Z","title":"[https://arxiv.org/abs/2209.02589]","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.10050","last_updated":"2025-07-14T08:31:08Z","snapshot_observed_at":"2026-08-07T02:35:12.044748Z","submitted_at":"2025-07-14T08:31:08Z","title":"Testing APS conjecture on regular graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:49:46.654275Z"},"links":{"cited_paper":"/paper/2209.02589","citing_paper":"/paper/2507.10050"},"observation_digest":"sha256:f66c5bba53029f7bcb9d7f4442a2487d25b5fba452f070c862554b0334dc5642","observation_id":"5cd3b916-7c27-4d87-b655-802d11e6d2ea","resolution":{"observed_at":"2026-08-06T17:49:46.654275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.02589","last_updated":"2023-11-07T03:28:09Z","snapshot_observed_at":"2026-07-06T13:49:23.138584Z","submitted_at":"2022-09-06T15:45:04Z","title":"An Improved Approximation Algorithm for Quantum Max-Cut","version":3},"cited_work":{"arxiv_id":"2209.02589","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.02589","snapshot_observed_at":"2026-07-02T08:26:48.556148Z","title":"An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs","venue":null,"work_id":"9c9a7bce-694b-4e39-a9f5-4ea9f6b2e36d","year":2023},"citing_paper":{"arxiv_id":"2606.04940","last_updated":"2026-06-03T14:30:52Z","snapshot_observed_at":"2026-07-06T23:44:57.208389Z","submitted_at":"2026-06-03T14:30:52Z","title":"Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T05:59:12.615897Z"},"links":{"cited_paper":"/paper/2209.02589","citing_paper":"/paper/2606.04940"},"observation_digest":"sha256:62d903674b6cb8f0adf3f4a906598ad8a12f61e2cadd9db0e38f370d8339e544","observation_id":"d8aa8da4-40a6-4724-8fa2-838495f71e38","resolution":{"observed_at":"2026-07-02T08:26:48.557755Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2209.02589","last_updated":"2023-11-07T03:28:09Z","snapshot_observed_at":"2026-07-06T13:49:23.138584Z","submitted_at":"2022-09-06T15:45:04Z","title":"An Improved Approximation Algorithm for Quantum Max-Cut","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02589","snapshot_observed_at":"2026-08-08T15:20:15.867586Z","title":"Quantum , volume =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-08T20:14:43.919512Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":114,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.867586Z"},"links":{"cited_paper":"/paper/2209.02589","citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:8f69df5a07615fdcc7a501a582f2243c5b8c43550aae55e12c5d1ada3864bc96","observation_id":"0aa28c59-e6a8-4d52-a877-6d3008a5c980","resolution":{"observed_at":"2026-08-08T15:20:15.867586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2209.02589/citation-record","integrity":"/paper/2209.02589/integrity","json":"/paper/2209.02589/citation-record.json","paper":"/paper/2209.02589"},"outbound":[],"paper":{"arxiv_id":"2209.02589","last_updated":"2023-11-07T03:28:09Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T13:49:23.138584Z","submitted_at":"2022-09-06T15:45:04Z","title":"An Improved Approximation Algorithm for Quantum Max-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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2209.02589."}