{"as_of":"2026-08-15T09:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:86123f87ec357fc9d5fa13d84c9edbee3d55c9c0982dab5b4f73e93842632876","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:36:32.625471Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2509.09900/citation-record","integrity":"/paper/2509.09900/integrity","json":"/paper/2509.09900/citation-record.json","paper":"/paper/2509.09900"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:36:32.614000Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09900","last_updated":"2025-09-11T23:31:39Z","snapshot_observed_at":"2026-08-08T04:18:01.488290Z","submitted_at":"2025-09-11T23:31:39Z","title":"NISQ Security and Complexity via Simple Classical Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:36:32.614000Z"},"links":{"citing_paper":"/paper/2509.09900"},"observation_digest":"sha256:bc2b577e9d7e55a93afd1d65d504c04f81f5006299fa005e5e29e6cc70299efa","observation_id":"f8043bee-2153-4b86-b0bc-08717fda7423","resolution":{"observed_at":"2026-08-04T18:36:32.614000Z","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-04T18:36:32.619700Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09900","last_updated":"2025-09-11T23:31:39Z","snapshot_observed_at":"2026-08-08T04:18:01.488290Z","submitted_at":"2025-09-11T23:31:39Z","title":"NISQ Security and Complexity via Simple Classical Reasoning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T18:36:32.619700Z"},"links":{"citing_paper":"/paper/2509.09900"},"observation_digest":"sha256:6629baa0ea2295bd6dd95dfd9b880f861513fb15092e5e29dae852eb6295ec72","observation_id":"347c1c0f-12ab-48c3-91ce-16b994271242","resolution":{"observed_at":"2026-08-04T18:36:32.619700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14944","last_updated":"2023-09-26T14:00:23Z","snapshot_observed_at":"2026-08-13T10:04:41.652125Z","submitted_at":"2023-09-26T14:00:23Z","title":"Quantum Search with Noisy Oracle","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14944","snapshot_observed_at":"2026-08-04T18:36:32.607696Z","title":"Probabilistic Hash-and-Sign with Retry in the Quan- tum Random Oracle Model","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09900","last_updated":"2025-09-11T23:31:39Z","snapshot_observed_at":"2026-08-08T04:18:01.488290Z","submitted_at":"2025-09-11T23:31:39Z","title":"NISQ Security and Complexity via Simple Classical Reasoning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T18:36:32.607696Z"},"links":{"cited_paper":"/paper/2309.14944","citing_paper":"/paper/2509.09900"},"observation_digest":"sha256:18dea989d0c43b4a3fbb74adc6a4659602c57ca389423cd9a52240b94339c3fa","observation_id":"0a95bb78-7faa-47eb-a16a-2c982194249a","resolution":{"observed_at":"2026-08-04T18:36:32.607696Z","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-04T18:36:32.625471Z","title":"Lemma A.6(Hybrid Security of Salted Game against Classical Advice).Let𝒢be a multi-output𝑘- search game (as defined in Def","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09900","last_updated":"2025-09-11T23:31:39Z","snapshot_observed_at":"2026-08-08T04:18:01.488290Z","submitted_at":"2025-09-11T23:31:39Z","title":"NISQ Security and Complexity via Simple Classical Reasoning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:36:32.625471Z"},"links":{"citing_paper":"/paper/2509.09900"},"observation_digest":"sha256:e53420f46b501a94b210e8cfb4b0136053fc22f5839adba47a6c3c6877245dcf","observation_id":"f6b8ad8d-4f86-44c3-bbb1-e58a47f3f5e4","resolution":{"observed_at":"2026-08-04T18:36:32.625471Z","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-04T18:36:32.601337Z","title":"The bitcoin backbone proto- col: Analysis and applications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09900","last_updated":"2025-09-11T23:31:39Z","snapshot_observed_at":"2026-08-08T04:18:01.488290Z","submitted_at":"2025-09-11T23:31:39Z","title":"NISQ Security and Complexity via Simple Classical Reasoning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T18:36:32.601337Z"},"links":{"citing_paper":"/paper/2509.09900"},"observation_digest":"sha256:816e9782106ec379d16fd01b86ebbf57db8c568e45f41e0bc99f53906f583f6a","observation_id":"9c1e8c08-a97d-45bc-9d0c-6cc8bb28cf7d","resolution":{"observed_at":"2026-08-04T18:36:32.601337Z","resolver_source":null,"status":"malformed_identifier"},"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-04T18:36:32.587552Z","title":"Tight Characterizations for Preprocess- ing against Cryptographic Salting","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09900","last_updated":"2025-09-11T23:31:39Z","snapshot_observed_at":"2026-08-08T04:18:01.488290Z","submitted_at":"2025-09-11T23:31:39Z","title":"NISQ Security and Complexity via Simple Classical Reasoning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-04T18:36:32.587552Z"},"links":{"citing_paper":"/paper/2509.09900"},"observation_digest":"sha256:9505a24e609b204b13baed9defd38eb0e5808c0081507e9ad7ee1a8c49a8eb94","observation_id":"33e22fcb-33b3-4bdd-b8d3-1e19d38c05af","resolution":{"observed_at":"2026-08-04T18:36:32.587552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09900","last_updated":"2025-09-11T23:31:39Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T04:18:01.488290Z","submitted_at":"2025-09-11T23:31:39Z","title":"NISQ Security and Complexity via Simple Classical Reasoning"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":6},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2509.09900."}