{"as_of":"2026-08-13T07:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:983181fecc9bfce31b7ae8ee908098618822ec9e9bbef4b160a1e439ddce3140","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T22:33:05.770461Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2607.03983/citation-record","integrity":"/paper/2607.03983/integrity","json":"/paper/2607.03983/citation-record.json","paper":"/paper/2607.03983"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:33:05.770461Z","title":"Interactive proofs for quantum computation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:12e1a6a3eeb0b6f0804ff0b0709de59511d84f99b3e544a6572b0de6a198be1d","observation_id":"ae6d1501-afac-4f13-9c84-32b7be3cd6f7","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04487","last_updated":"2017-04-14T17:17:08Z","snapshot_observed_at":"2026-08-07T23:56:27.679139Z","submitted_at":"2017-04-14T17:17:08Z","title":"Interactive Proofs for Quantum Computations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04487","snapshot_observed_at":"2026-07-11T22:33:05.770461Z","title":"Interactive proofs for quantum computations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"cited_paper":"/paper/1704.04487","citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:5a2c0d4f8ac18ca7b116fa4a2272050cdc81c15de9fe7150760db4e91b014e28","observation_id":"d10a9992-bed1-45d4-b609-e35dd8baea5b","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Requirements for a processing-node quantum repeater on a real-world fiber grid","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:1e305581382519ae35305be8cb92bd3c0500b284137c51088d3479906098dcd4","observation_id":"31a2a7f3-9753-47ad-912c-2541492deb7e","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Quantum accuracy threshold for concatenated distance-3 codes","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:5c41950f4939b6e33d8920fbb4d8cc9f4a78a0031724712047692f2936132eb4","observation_id":"a0289552-96a2-45a7-ab0a-e2ac447708b7","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Vazirani","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:5dc70bb2b0ac3adb4e12f8cc6b83f863d523db6822f1097658eff9e033d4301e","observation_id":"b8920803-d12f-4760-9405-de22d6c3a2d5","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Security Limitations of Classical-Client Delegated Quantum Computing , page 667–696","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:a448fd724e778ac075c2a0665439d13d18c482436e0e54f432697df33f6b6a7a","observation_id":"679ceff2-f532-41df-bbb7-91690aa0323c","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Universal blind quantum computation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:b0ef8a7db690caf11a2599c291154ac1aa782427593cac6f6c422afa3a02b7ff","observation_id":"a968a8d8-5ab0-45d8-87a1-67a54ddb9bdc","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Generalized flow and determinism in measurement-based quantum computation","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:0ed2f7810fb4e468981aebe76ad2994ca89f0fec6cdd55420d85cf039f0871c5","observation_id":"a25fdfec-0f42-4062-b6c8-997e12272063","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Secure multiparty quantum computation with (only) a strict honest majority","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:78daa5f792f9d5b12ac35d4ebd8f9fc1021ed0e2ebc1002f69493cc82a1c85f2","observation_id":"aad9bbfc-3a23-4f19-9877-6d789cf7c9ca","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"How to verify a quantum computation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:59f42209752e368fa91e1ab28be499658d0f4366431950d7029f057f6d0f6c9b","observation_id":"59cc8fbd-b07c-460b-851b-0b5290d94669","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Secure multi-party quantum computation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:fb0dca58bc5a03fa1e578084844715db183a6f319f044e308a2e99dcf1ca8b5e","observation_id":"68ab2ac8-86e3-424b-9f29-60f9f4d987c9","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Exact and approximate unitary 2-designs and their application to fidelity estimation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:8115df87cdf94b63a637d11a9ae4c6ca5101c084185ee460a854a311076d5ba7","observation_id":"7c7424cf-49ac-49fb-8f32-9da7a687eb69","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Fitzsimons, Christopher Portmann, and Renato Renner","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:b4ea748c750ea79a484f744e9467353a143432a6b7066fb727d4a9085322dd90","observation_id":"024e9061-1722-4356-8845-f53ba1b3dd49","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Grilo, Stacey Jeffery, Christian Majenz, and Christian Schaffner","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:8373f3aca9558ead3cd9f063f0c0bf8caa227433f1b2ba6802c5a036ddb80625","observation_id":"e2aa33b0-b07e-4bf2-993f-b9b2827b9bca","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Determinism in the one-way model","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:01b6f388866bc547ca1b8a06663ff75d782033dc1b138ca591d5b001010ba0c0","observation_id":"919face4-c1e3-4a7b-a614-bf046f8c28dd","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Universal blind quantum computing with weak coherent pulses","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:6d765b3238bc6184c25ef9f6b8978be1f2ae74886a111d0fa48a20557f2c0677","observation_id":"7573dffe-36f8-4cdb-9f16-f518682aec4c","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"The measurement calculus","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:bdbc92370a15f0735c39dbc769b69c59956f12f705a86ee85c18eaf727c2ca33","observation_id":"ae823946-0ef4-425a-87b9-74f7b774970c","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Actively secure two-party evaluation of any quantum operation","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:39325c2b97e5f09bce8b3d0f579943bd1eb0ea2418c94ec0585732fb0cc6a5ae","observation_id":"c5d8f7c5-7d00-4dcd-af56-39158e6ab805","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Fitzsimons, Michal Hajdu s s ek, and Tomoyuki Morimae","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:9c984a628d59576e8e76c33023213346fe5c8e2d5e8cda6f8b30b67c285947f2","observation_id":"164b3799-cec2-42bc-8831-556be398bc80","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Fitzsimons and Elham Kashefi","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:b5a8e1ad268ad58a7ea70d2426d137d649bb4659d9466e6575997eacfe7e3a52","observation_id":"25309adb-bda0-42f6-b444-42ecebab7812","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Reducing resources for verification of quantum computations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:f4d3d2bc396f28a6e73fc6db2f9eaccb3f1130a5c31bcf054f05e92ccd4b4d39","observation_id":"0ab6fb45-80e9-4eee-8504-5bc4fa371655","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Accrediting outputs of noisy intermediate-scale quantum computing devices","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:ef7a05ad12c7bfb93a64ca52ed720a4fcc6734e603f97d9fc65652d243916d30","observation_id":"2b161e9d-4493-431b-ae43-db5aa24024dd","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Robustness and device independence of verifiable blind quantum computing","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:cb8d666ee7362678dfdfab3f3445547234b3cf9623f006a3581fbe55d9919278","observation_id":"456514f3-9723-479c-9ba3-6072dc98befc","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Composably secure delegated quantum computation with weak coherent pulses","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:417267ce67f238d5493572275bdc499e480d369e9b393856c015faf9ddf7a78c","observation_id":"1652c0dd-d57d-4feb-a6c9-5a9f5270e52c","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Multi-pulse protocol for securely preparing a single (qu)bit (in preparation), 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:10d3794873627619eea82c65d28864489f719461c2a716e48a8a2d76f6790e0f","observation_id":"19f066cb-2c3e-457e-aed1-b13e6d4a4bd4","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Direct certification of a class of quantum simulations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:1b87e5f21e5e50acf9d4541d7379ef2d59bfaf5dfc394a999c8a9495bccb2193","observation_id":"de7fabb9-8465-4bb4-a7cd-6558b556a76a","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Remote blind state preparation with weak coherent pulses in the field","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:5991b23ace613d3d754d5583ce4a454ba91951dd8500e1e1cf76a3ac546863af","observation_id":"354ce427-74e7-4e5c-ab0e-ecb212d4db27","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Efficient verification of universal and intermediate quantum computing","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:424c1843f6aee960df5a2903f16f76f11566a0cd637140767503aea46591b047","observation_id":"227b4296-559d-45fd-9349-d96a28d2283c","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.06943","last_updated":"2015-06-23T11:09:59Z","snapshot_observed_at":"2026-07-06T04:21:43.822715Z","submitted_at":"2015-06-23T11:09:59Z","title":"On optimising quantum communication in verifiable quantum computing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.06943","snapshot_observed_at":"2026-07-11T22:33:05.770461Z","title":"On optimising quantum communication in verifiable quantum computing, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"cited_paper":"/paper/1506.06943","citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:e966ca7298c6a890f04430e06e12365b48c30357d06a478a12baca989f2af799","observation_id":"5549952b-c3ae-48bb-a8ff-56d8903fccc9","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Unifying quantum verification and error-detection: Theory and tools for optimisations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:abc96b7a7fc6bcff01a775ccaadd9a59da41e4483cf887ad08ffa7c63635be07","observation_id":"a075d8e7-e3d6-4eca-8b6b-d7dde9b9d5ac","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Asymmetric quantum secure multi-party computation with weak clients against dishonest majority","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:a05d57fac639e234371de8b05d4a0b06e730d8b0242c81abafa98b55b38088e6","observation_id":"030a04ef-af97-4502-9da6-69003f46ebae","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Verification of quantum computations without trusted preparations or measurements","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:2898f35f381bfcb4603d5d06ebb98884c18786c7c252acbd7af51455e29c9696","observation_id":"58f0874a-bac1-49cd-bde4-e5f060463eb3","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Plugging leaks in fault-tolerant quantum computation and verification, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:7f344ec93a81dec8ee00d9cccb20723423189c14a39465609b0a4963bf43e3ea","observation_id":"66fe31e9-0847-45b3-b9af-12f419528be9","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Multiparty delegated quantum computing","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:bf7c5847c228e61c079feb5e5a588bdc570c1681e227413cfb13c6a3a5159256","observation_id":"145ea7ea-f289-4795-b03d-0a56df589b6a","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.07408","last_updated":"2015-10-26T09:05:54Z","snapshot_observed_at":"2026-07-06T04:34:13.232331Z","submitted_at":"2015-10-26T09:05:54Z","title":"Optimised resource construction for verifiable quantum computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.07408","snapshot_observed_at":"2026-07-11T22:33:05.770461Z","title":"Optimised resource construction for verifiable quantum computation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"cited_paper":"/paper/1510.07408","citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:1cb70e45e9087066ea5b30a5c5be93c355a9669a363808cb05a393bf4a5d6bd3","observation_id":"9fb66105-fa46-46f2-856f-8738e5c0ba3c","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Verifying BQP computations on noisy devices with minimal overhead","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:c4db98ab6ff61d32929faa8990f9338091671553bc1913bcd87ab20643bed685","observation_id":"24138941-e78a-4278-a72e-059cd58c2210","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Classical-communication cost in distributed quantum-information processing: A generalization of quantum-communication complexity","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:3015fba6f88ed70a17a972f56436f9140ba8fab4607b3723bff53b42ecbf89bf","observation_id":"c8444c8a-31cb-4e73-9e1a-d188657fbbca","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Leung and Peter W","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:5a75c2a8306089356f4548b1fc1489ea36345f68e240997468ff94b7632f7874","observation_id":"af4a2adc-90a3-412d-bd69-ff930329181a","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Classical verification of quantum computations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:e5cedf2c027552c5f904a2e783c2631fb08b209e10962731308e4e2955f8330b","observation_id":"3c7ff3aa-648d-45f7-9819-92821e4eefd0","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Constructive cryptography -- a new paradigm for security definitions and proofs","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:9988a49a86f2d9e46ed21d3d736de4a6098a8ac790122af8e16a4fc2e873b8de","observation_id":"b75a5fd3-de53-4dec-b73d-001959a785d5","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Fitzsimons","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:f0501b9960ac0a6b9754c90d57e07591e09d9935fce1577be1a7f86042f12546","observation_id":"56531c88-5ea2-4d10-b267-2e9e2172dca3","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"QEnclave -- a practical solution for secure quantum cloud computing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:55662729c179678635e83115189ebf06f3660934f7b61e7af652f4b4e59fa39d","observation_id":"871941d2-31c7-40ae-8a31-145de9d30018","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Shadow pauli flow: Characterising determinism in mbqcs involving pauli measurements","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:1a4fd7e0cef3a3100179b027b9c1cf05998790d1814595aa9f3bf627c39e90ff","observation_id":"f1de5aa8-2f0e-4ded-8262-ee31fdc589fe","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Abstract cryptography","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:4967e609c946b46d04ad1f3958c2a2abba1e0953e084648e8f346598c60709a7","observation_id":"0f102ed7-95b4-428b-bb53-9bb36fe1e662","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"A quantum linearity test for robustly verifying entanglement","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:3a0feaf5e4b03ff0f2637767b972d487ecc0d617f411d66f321f173a2bdcc638","observation_id":"2205237f-a6b5-4bab-8772-bf0dc675fac5","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Multi-client distributed blind quantum computation with the qline architecture, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:da64bb29529924ee2e9a5837ed2bb13d6a7572ebd9c1ba3943f598778ab9ec70","observation_id":"b63d453f-b181-4ab4-85e8-62cf83140900","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:8e1f33b98f91fe7c0d89af86372ec3e811b7e092447f815e752363cef6b575a7","observation_id":"4898c3f9-d2a1-4899-ba44-85c7761df32c","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Reichardt, Reichardt Falk Unger, and Umesh Vazirani","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:ff90173faf87cf6df2a4a86b195d87eb878a9c24ffb95b54987f3fe3c2fdca79","observation_id":"fba074a1-9daf-4b70-81da-c362fcdbcbcb","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","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-07-11T22:33:05.770461Z","title":"Relating measurement patterns to circuits via pauli flow","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-11T22:33:05.770461Z"},"links":{"citing_paper":"/paper/2607.03983"},"observation_digest":"sha256:0b069ca3e44a105f24c15d3c961d6db401bbff0ca224dea8f33949cc55bbad30","observation_id":"618e6260-c43c-4627-a12d-bc0ccf215d8d","resolution":{"observed_at":"2026-07-11T22:33:05.770461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03983","last_updated":"2026-07-04T18:44:43Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T07:55:24.673799Z","submitted_at":"2026-07-04T18:44:43Z","title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":49},"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 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2607.03983."}