{"as_of":"2026-08-04T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e2207b3f9b7759150920e9e89553ac43bc98cfdf0b6f0ae346fbaffb7fe175b5","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:27:31.172118Z","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-04T06:34:03.388597+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-05-22T11:42:34.456807Z","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-05-22T11:44:50.196413Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.20376","last_updated":"2026-07-18T21:06:06Z","snapshot_observed_at":"2026-08-02T21:27:28.294716Z","submitted_at":"2026-02-23T21:29:47Z","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","version":3},"cited_work":{"arxiv_id":"2602.20376","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.20376","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploiting Low-Rank Structure in Max-K-Cut Problems","venue":"cs.DS","work_id":"f85f7bbc-62e6-4886-af0c-ff235ca91955","year":2026},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/2602.20376","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e542e6251530a041b5337bcdc26d984e7d55adca6f8844b5911defc1589d348a","observation_id":"c480a680-160f-4ad3-8773-3dd9ac099917","resolution":{"observed_at":"2026-05-22T11:44:50.198002Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.20376/citation-record","integrity":"/paper/2602.20376/integrity","json":"/paper/2602.20376/citation-record.json","paper":"/paper/2602.20376"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:27:30.835740Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.20376","last_updated":"2026-07-18T21:06:06Z","snapshot_observed_at":"2026-08-02T21:27:28.294716Z","submitted_at":"2026-02-23T21:29:47Z","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T21:27:30.835740Z"},"links":{"citing_paper":"/paper/2602.20376"},"observation_digest":"sha256:ea3f9bd41f054803790e759df78456cc1fb5791671ee0fbd20f545be93703694","observation_id":"ed1e997a-74df-4c9f-83a7-5dee660301e2","resolution":{"observed_at":"2026-08-02T21:27:30.835740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:27:31.029570Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.20376","last_updated":"2026-07-18T21:06:06Z","snapshot_observed_at":"2026-08-02T21:27:28.294716Z","submitted_at":"2026-02-23T21:29:47Z","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T21:27:31.029570Z"},"links":{"citing_paper":"/paper/2602.20376"},"observation_digest":"sha256:4d97d44b137a27455589de7917f460075a67f55a3c707c23500d29ae3c4dd47b","observation_id":"a0474c28-4e90-48e4-825f-8cd8846f2bca","resolution":{"observed_at":"2026-08-02T21:27:31.029570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:27:31.172118Z","title":"These graphs either have binary (0 or 1) edge weights or have edge weights in{−1,0,+1}","venue":null,"work_id":null,"year":2082},"citing_paper":{"arxiv_id":"2602.20376","last_updated":"2026-07-18T21:06:06Z","snapshot_observed_at":"2026-08-02T21:27:28.294716Z","submitted_at":"2026-02-23T21:29:47Z","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T21:27:31.172118Z"},"links":{"citing_paper":"/paper/2602.20376"},"observation_digest":"sha256:0edf921204c0a625f2da44fffb31192931c5f4e7dd06b078834f5947645967c7","observation_id":"c9156c7f-ec6c-44d2-afcc-96a78e08e753","resolution":{"observed_at":"2026-08-02T21:27:31.172118Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.20376","last_updated":"2026-07-18T21:06:06Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T21:27:28.294716Z","submitted_at":"2026-02-23T21:29:47Z","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":3},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 1 inbound Pith citation observation for arXiv:2602.20376."}