{"as_of":"2026-08-13T12:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b237fabb3c5c85a08097cb6a37bc25956ab12e728618ac4f751e2a5b5e5b4dc2","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-13T06:32:02.005865+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-12T13:36:18.699031Z","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-12T13:36:18.793442Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.12165","last_updated":"2023-03-14T23:09:37Z","snapshot_observed_at":"2026-07-06T13:13:26.079815Z","submitted_at":"2022-05-24T15:56:15Z","title":"Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing","version":2},"cited_work":{"arxiv_id":"2205.12165","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.12165","snapshot_observed_at":"2026-08-12T13:36:18.793442Z","title":"Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing","venue":"quant-ph","work_id":"6bac843e-8848-4a05-9e0e-b0dccf447cd4","year":2022},"citing_paper":{"arxiv_id":"2411.16138","last_updated":"2024-11-25T06:56:00Z","snapshot_observed_at":"2026-08-12T13:28:47.409225Z","submitted_at":"2024-11-25T06:56:00Z","title":"QUBO Refinement: Achieving Superior Precision through Iterative Quantum Formulation with Limited Qubits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:18.699031Z"},"links":{"cited_paper":"/paper/2205.12165","citing_paper":"/paper/2411.16138"},"observation_digest":"sha256:75b25ec99a31b92231ab52f223f15d8d0dac7a88abcff65d696e1f6190c4796d","observation_id":"e865f219-e137-4411-b08e-b9ef19346357","resolution":{"observed_at":"2026-08-12T13:36:18.797437Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.12165/citation-record","integrity":"/paper/2205.12165/integrity","json":"/paper/2205.12165/citation-record.json","paper":"/paper/2205.12165"},"outbound":[],"paper":{"arxiv_id":"2205.12165","last_updated":"2023-03-14T23:09:37Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T13:13:26.079815Z","submitted_at":"2022-05-24T15:56:15Z","title":"Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2205.12165."}