{"as_of":"2026-08-20T11:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4b8288c88122bc2abfff798f9ffaa6260e674b35d3a0de466cd64d40237eb4e","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:20:46.689091Z","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-05T11:09:29.613424Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.17193","last_updated":"2022-04-19T12:14:13Z","snapshot_observed_at":"2026-08-16T18:34:52.701561Z","submitted_at":"2021-03-31T16:20:51Z","title":"QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.17193","snapshot_observed_at":"2026-08-09T22:03:41.547242Z","title":"QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18905","last_updated":"2025-01-31T05:51:04Z","snapshot_observed_at":"2026-08-18T08:39:18.221010Z","submitted_at":"2025-01-31T05:51:04Z","title":"From Bits to Qubits: Challenges in Classical-Quantum Integration","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T22:03:41.547242Z"},"links":{"cited_paper":"/paper/2103.17193","citing_paper":"/paper/2501.18905"},"observation_digest":"sha256:23b968afccd85810df8ccaea50f9ebb80dd1bb96f98acd6db302a18401cc748d","observation_id":"bfb45e75-6e7a-4b3a-b84c-541efd5d59e8","resolution":{"observed_at":"2026-08-09T22:03:41.547242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.17193","last_updated":"2022-04-19T12:14:13Z","snapshot_observed_at":"2026-08-16T18:34:52.701561Z","submitted_at":"2021-03-31T16:20:51Z","title":"QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers","version":3},"cited_work":{"arxiv_id":"2103.17193","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.17193","snapshot_observed_at":"2026-08-05T11:09:29.613424Z","title":"QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers","venue":"cs.ET","work_id":"c1e57161-70a1-473c-81ed-7fdaae963e82","year":2021},"citing_paper":{"arxiv_id":"2509.03078","last_updated":"2025-09-03T07:13:52Z","snapshot_observed_at":"2026-08-13T23:12:26.283594Z","submitted_at":"2025-09-03T07:13:52Z","title":"Quantum Computer Benchmarking: An Explorative Systematic Literature Review","version":1},"reference_index":264,"source":"pdf_text","source_observed_at":"2026-08-05T11:09:29.099568Z"},"links":{"cited_paper":"/paper/2103.17193","citing_paper":"/paper/2509.03078"},"observation_digest":"sha256:b7806102396870243a7647c97b6245d0d0e7ae698f53a278aab3b911e3eb5972","observation_id":"287ebb20-1c3f-4749-954a-25455e90ad8d","resolution":{"observed_at":"2026-08-05T11:09:29.617654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.17193","last_updated":"2022-04-19T12:14:13Z","snapshot_observed_at":"2026-08-16T18:34:52.701561Z","submitted_at":"2021-03-31T16:20:51Z","title":"QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.17193","snapshot_observed_at":"2026-08-15T16:20:46.689091Z","title":"XACC: a system-level software infrastructure for heterogeneous quantum–classical computing","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08718","last_updated":"2025-09-10T16:13:41Z","snapshot_observed_at":"2026-08-19T14:21:24.948722Z","submitted_at":"2025-09-10T16:13:41Z","title":"Adaptive Quantum Computers: decoding and state preparation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T16:20:46.689091Z"},"links":{"cited_paper":"/paper/2103.17193","citing_paper":"/paper/2509.08718"},"observation_digest":"sha256:d56deb79a999f1db0fff711eaaea0a9e377fbec81f61108c849edb5d8d21d0bd","observation_id":"53824a17-43f9-4b56-83f5-f72047d4f2bb","resolution":{"observed_at":"2026-08-15T16:20:46.689091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.17193/citation-record","integrity":"/paper/2103.17193/integrity","json":"/paper/2103.17193/citation-record.json","paper":"/paper/2103.17193"},"outbound":[],"paper":{"arxiv_id":"2103.17193","last_updated":"2022-04-19T12:14:13Z","latest_version":3,"primary_category":"cs.ET","snapshot_observed_at":"2026-08-16T18:34:52.701561Z","submitted_at":"2021-03-31T16:20:51Z","title":"QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2103.17193."}