{"as_of":"2026-08-18T23:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d2c986f3ab198face799b07c29fd35b0c0754d017c697658fd4d29e10e56319","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T01:34:45.323277Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.03561/citation-record","integrity":"/paper/2607.03561/integrity","json":"/paper/2607.03561/citation-record.json","paper":"/paper/2607.03561"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"Proceedings of the 41st International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:0e8571dc920d51313a5f124b4d1112e26ee2a9901c530b0587b970cbcd732d1f","observation_id":"c09b2296-df50-4441-86d4-f22ccdec75ad","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.00899","last_updated":"2018-10-22T17:36:07Z","snapshot_observed_at":"2026-08-14T21:47:20.607853Z","submitted_at":"2018-05-02T16:27:32Z","title":"AI safety via debate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.00899","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:1805.00899 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/1805.00899","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:b6d4893ff9ddac9ee6537a0c72a633cca73e1c87d982b9fe9a4adf43fc0172b4","observation_id":"1e8c4855-9a8d-4fc8-b678-98bf86b19bfd","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13609","last_updated":"2026-07-21T18:13:56Z","snapshot_observed_at":"2026-08-18T03:48:06.454732Z","submitted_at":"2025-06-16T15:37:33Z","title":"Avoiding Obfuscation with Prover-Estimator Debate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13609","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2506.13609 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2506.13609","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d4a4ce588203a3c2f8f181c3e01d2b17efcf99dd239aef5755ed821bbbdd7cb8","observation_id":"838e1ac5-d873-4f93-8c28-77023b7fdd42","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03989","last_updated":"2025-05-23T16:45:17Z","snapshot_observed_at":"2026-08-16T08:06:16.457406Z","submitted_at":"2025-05-06T21:53:44Z","title":"An alignment safety case sketch based on debate","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03989","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2505.03989 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2505.03989","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:ac57975c99da2ad2bab43aab89cf7475fc8af8e8753f1a0c1f99f08c76620253","observation_id":"728c425f-07fe-443b-98f3-dfb4b839a690","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.08575","last_updated":"2018-10-19T16:30:48Z","snapshot_observed_at":"2026-08-15T08:21:23.508749Z","submitted_at":"2018-10-19T16:30:48Z","title":"Supervising strong learners by amplifying weak experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.08575","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:1810.08575 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/1810.08575","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f98aac579f3fd9e3827a5020360cb82b4ac3d59b9126714a8f6f1b6bc645ecd9","observation_id":"7c7702fa-57df-497f-a8f6-397bc8f9f242","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.07871","last_updated":"2018-11-19T18:48:04Z","snapshot_observed_at":"2026-08-17T18:33:55.039901Z","submitted_at":"2018-11-19T18:48:04Z","title":"Scalable agent alignment via reward modeling: a research direction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.07871","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:1811.07871 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/1811.07871","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:c72fd136ba39eecf0b38204971161a2d314f3a4eb72f71902a24f7566086bd98","observation_id":"fcaf0638-9baf-4b6f-ba54-6d5a5ed255e1","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2405.15722 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:4c2af2d47119198243983968e2317acbbbc654e17e1665bb8880922304a877c4","observation_id":"eda47fe1-6cd3-49e5-84d2-b0b999ad3924","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08897","last_updated":"2025-03-17T17:16:02Z","snapshot_observed_at":"2026-08-15T13:54:54.389170Z","submitted_at":"2024-12-12T03:21:53Z","title":"Neural Interactive Proofs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08897","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2412.08897 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2412.08897","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:0ccdeea94223cf9165b3c8a8c1073a22725d772d3b6f59e374cc0e952a8033af","observation_id":"015756c0-d47b-4743-82ee-262561cbdc22","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2410.08864 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:529e388613cde34a2560a18a9e5167dc8009865b93fa17fd255d07cb0dc0b8a3","observation_id":"d75fdfcd-475d-4d3e-9385-a6d4fd019261","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.12099","last_updated":"2021-08-27T02:56:06Z","snapshot_observed_at":"2026-08-18T14:37:02.517030Z","submitted_at":"2021-08-27T02:56:06Z","title":"Learning to Give Checkable Answers with Prover-Verifier Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.12099","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2108.12099 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2108.12099","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:7e3694cfb1f1bddd45a2f5fa7182ff107d2dda4ea8d0bd11e2212802b85abf47","observation_id":"9adf0a7d-5438-4598-9a42-50946701fb78","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:2419cd34417c2813651fa56c41bea9c212e064028cea4ea5ea7d0a18708ca74c","observation_id":"d56fe3f5-b33d-4020-867f-5579795df7e1","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.13692","last_updated":"2024-08-01T17:18:54Z","snapshot_observed_at":"2026-08-18T23:52:17.487601Z","submitted_at":"2024-07-18T16:58:18Z","title":"Prover-Verifier Games improve legibility of LLM outputs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.13692","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2407.13692 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2407.13692","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:dcc3b58a83a60aefd05e521655ca9f377e0f044a86cd287bfebd45e4bebaedf9","observation_id":"c6bb3969-3f35-4845-9ea6-b0113ad472b7","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:cf17c78351cce467717079b69d856f394c5b68ca74187d42fa840b4d5b211829","observation_id":"310374a9-addc-476a-a9f5-cb637cfcbfe8","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.04664","last_updated":"2025-09-04T21:26:31Z","snapshot_observed_at":"2026-08-16T21:03:22.901798Z","submitted_at":"2025-09-04T21:26:31Z","title":"Why Language Models Hallucinate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.04664","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2509.04664 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2509.04664","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d2db9680476680a3fc55e020da6a79d891c9319fa4d529620dab0e73f91dfc98","observation_id":"80a56620-8aac-4f65-9014-275c53e7c094","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11817","last_updated":"2025-02-13T08:11:25Z","snapshot_observed_at":"2026-08-16T19:44:00.811684Z","submitted_at":"2024-01-22T10:26:14Z","title":"Hallucination is Inevitable: An Innate Limitation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11817","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2401.11817 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2401.11817","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d759a9dacd27db5a64f7887455e4f0a479afb5cba97071dd05c7504509b501ab","observation_id":"f66c1c1d-f355-42e0-9993-d0e97b9a40c2","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Findings of the Association for Computational Linguistics: EACL 2024 , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:ae167d6d1383f68e6c938e482934715406e7a8f78e8b1976cc42082b6c7b9161","observation_id":"8876ec61-ee07-4589-87f9-c273ae00f735","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10162","last_updated":"2024-06-29T00:28:47Z","snapshot_observed_at":"2026-08-18T14:49:13.384384Z","submitted_at":"2024-06-14T16:26:20Z","title":"Sycophancy to Subterfuge: Investigating Reward-Tampering in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10162","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2406.10162 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2406.10162","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:6d8c81f11f48285487818d647ed46384180a9322af01e5136df053b36d46181c","observation_id":"2cebb91a-2087-4052-a83f-eebe9b816bef","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.03544","last_updated":"2022-02-14T09:05:38Z","snapshot_observed_at":"2026-08-16T03:45:29.671274Z","submitted_at":"2022-01-10T18:58:52Z","title":"The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.03544","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2201.03544 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2201.03544","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:e3133d0986a32967df46d243e07171facf001b696c1ee18032c368f7b209e242","observation_id":"e6760f9a-430f-4eab-a449-805382435cba","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.05566","last_updated":"2024-01-17T20:26:01Z","snapshot_observed_at":"2026-08-15T14:10:05.296241Z","submitted_at":"2024-01-10T22:14:35Z","title":"Sleeper Agents: Training Deceptive LLMs that Persist Through Safety Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.05566","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2401.05566 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2401.05566","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:5f2705260456671039ebe023b4dd2ef1e4ab5c77a4c2f53c713af8bb57a5a4a9","observation_id":"ddc3f4a8-4076-4478-a108-f3cdbe66c9c4","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2509.15541 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:a6f6346aafa8d5b810575efb206dfa6c0ed5b5f27aa8855bc15868239bc2da5f","observation_id":"26c577bd-0c9f-4934-a409-54ef986312b8","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04984","last_updated":"2025-01-14T20:16:01Z","snapshot_observed_at":"2026-08-15T04:02:05.429942Z","submitted_at":"2024-12-06T12:09:50Z","title":"Frontier Models are Capable of In-context Scheming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04984","snapshot_observed_at":"2026-07-12T01:34:45.323277Z","title":"arXiv preprint arXiv:2412.04984 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"cited_paper":"/paper/2412.04984","citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:a26ac0c6bbb9d849fcec28f8ebd8ea724e1ddefce64dace5b5c6ab7ee5dc82a1","observation_id":"743c23ad-6d91-4fb6-8d21-53394d1ef0fe","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:442f875cf06b2c8b2b87a9fcd95272f795e7d8fcfb0d87beba2ee7edb7467018","observation_id":"4a625bad-60fc-4c4a-b6f1-0107e78a4a88","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:23bb388692b1e3404379d8f7239115fd02223ef674c630d644ac39545c904ec0","observation_id":"ee1bf300-9f7f-49f7-b311-7e54ecc81022","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:36d483ca2a2ac5dd84dbc01db89011867fa7e64a50a0926e363a37176d2f0aaf","observation_id":"a1abcd86-41d5-4a72-ac62-ba4f522edebc","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:ef57d19901aa1804bbdc54411417882db6a51ecfd223b362114a2bcbde416355","observation_id":"6e91e02b-8738-4615-813e-d162bcd2986a","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:26053c5907f5d2473ca216cb1154959de8a33b5d251d070ec98c5db61d3041d8","observation_id":"f5fb2a36-980e-4359-80ce-dcb5dcb7d282","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Theory of Cryptography Conference , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:ac859a58cf71ae62e2be000c7e8b39b181b0028b15f9df79e4b1514ed33cae35","observation_id":"6df94fcb-2a08-4161-99af-f43f724b748e","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"2025 , month =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:ab1c7e252ce60b219c0ba87074806ab7a10341beb7334981153643ae7e4b0780","observation_id":"fa167037-a338-42f1-9d9d-ae654f2ce1dd","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"2020 , month =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f1efdbdfad2ae45bca5258b259dc91ed30c0a30f0be48b0078065579828f92cc","observation_id":"4616be1c-fe3b-43bc-8f11-7628d39b4551","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:5fe9c357fd52bb1a246ea525cc6689aadd958f46e396be769520f8f37f9229c1","observation_id":"14d97d50-fb19-4e9c-bc2d-efc15795d528","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:58554081ffc05c18a32984fa3b9e250ee966729bef331815d777a30b54be8c4b","observation_id":"0b4cbdf2-f3d0-4c10-aec6-4c7730b7dbb8","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Information and Computation , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f3e0b26fac10e08f0dc0f69303849406602985080a5e487e20622aa218dc1b08","observation_id":"965fffce-392a-4a52-b1ea-5d91299f4503","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:8c6a0c50c49451639a435ddf9c08d51105e0d59f2fae424af048b4bb1ef371de","observation_id":"e40e57c3-daff-4375-bce4-ed935a8e1bb0","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:666d0110573f9b4c074eb0dacaf6dc8296596165686a7c185c2d7ec587e128d3","observation_id":"fbbbd785-4c01-4a22-858f-d48e1d0558ee","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:bc256f864cd32fe817b9539567cde4367df2914e1849b30ae6d683803ec43b6d","observation_id":"7ffc6004-762e-4f6f-9f65-c7224445e0a8","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d79f85ef379af50037538976ad4a411422a1a027698624b24b112f84d383a570","observation_id":"c0cdddc3-e8e3-4f06-b90e-ac683047546e","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d8540b7ee22e5daba91dde0aae85406bd7a2221dcd72b87240be673bcef249be","observation_id":"94df45a3-15c3-4e81-84e0-ba0bd358e846","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Zaverucha and Ian Goldberg , editor =","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:3c2e8c510c9a84bc9e66222071348a45ac00aea762b2ea4bfddad4742ce6d3ad","observation_id":"ab96eb58-78f6-4926-86ae-f944be22973b","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Transactions of the Association for Computational Linguistics , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:4ddf2269a067bab09191d29bb0c8c5150ceb9cbeb4bbc4ebb4bb84e34d42a32e","observation_id":"3aa7e7bc-3a7a-4304-963c-d3436feb2f0d","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) , booktitle =","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:9995652a21475335d013f8cba6e787f27ae8579825e0024d8f84d335016204bb","observation_id":"45f85804-8432-4ae3-bf84-12e0190a298d","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Trading Group Theory for Randomness , booktitle =","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:a702a417bcc6e024750da05cbe493e43f755a02fc433a5edb834cc31bd9829b3","observation_id":"649e314d-8da4-4e99-af49-dbdfac93a599","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:c99791f46b77ddba66b7e55263f7bb4aa56991710c869e9ef6619d128925985b","observation_id":"a246fda5-2a16-46f1-bed6-a4c96d412083","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Annual Cryptology Conference , pages=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:18f74338ebd6313e24c704a0d45ca6e389dc1d5195ebf134bde249ad7a75a65f","observation_id":"11b79b08-5aca-4a0d-8cbc-01612323130c","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Foundations and Trends","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:64185b44a6ae872c76da8da608dcfffb9d23109ba18fa784241e130ca83e26eb","observation_id":"de2785e4-50d0-4e89-a211-a40aa3b2b743","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Forgery Attacks on SipHash","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:00c13ef76cfcf154cdb18e2c5900abe95b60a6f827b964cc5130847b29aba834","observation_id":"ed39ee35-3f67-4acb-95b2-4ad77d72ed44","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Cryptanalysis of Fruit- F : Exploiting Key-Derivation Weaknesses and Initialization Vulnerabilities","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f4a38d89d637d6fd15063293982ae7adf53f2763fbb9deaecd4c8b5ec6d1f219","observation_id":"ee30b804-eacb-4969-be31-3c4005df2411","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Exploring Key-Recovery-Friendly Differential Distinguishers for SM4 and Their Performance in Differential Attacks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:cc1d22c6ee62239b3c5b7c24cbfd5ddb26facfbb3d47b3519430974bf25dcc2a","observation_id":"a57338de-6c5d-4d8d-8b05-611b40984240","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Inner Product Masked Integral Distinguishers and Integral Sets over Large Finite Fields - Applications to MiMC , CIMINION and Chaghri","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d5f82ae944101a602c45bcb57877e858e3b856de071be84190a42d6bee4a0388","observation_id":"136884d5-b8b8-41b6-9da0-444ba422ada3","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Improved Differential Meet-in-the-Middle Cryptanalysis on SIMON and Piccolo","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:92eb38c28a67f2c86e11b743bbbeeadf6699540d6374ea8d0df1ab61f0704481","observation_id":"0405de39-532d-4701-bb0a-590c703892d0","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Strengthening Key Scheduling of AES -256 with Minimal Software Modifications","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:42b65a2aeaedddbda35b19a76511ad9b041e7a8288dba371f1397adafc3b65e0","observation_id":"3cfa7a86-09f9-4e67-be96-ab6adba83f85","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Ideal Transformations for Public Key Encryption","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f696fd8285dc2fb187b4a5eff92e8b61860c97c80183f36bb8029e455604126c","observation_id":"043e6158-f92c-4bd8-bb19-42a8c06ade0a","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Indifferentiability Separations in Ideal Public Key Encryption: Explicit vs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:4c82fb0f85df0fc71f6f825f20dfad312d0016644ffe3ed2d32827aec9dcd4d0","observation_id":"9dbbc8bd-8539-4459-9ca1-7cb3da449146","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Compressed Sigma Protocols: New Model and Aggregation Techniques","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:66cfbc9bb1dda0e85b9d96f392370eac10abd0a55784e24e0d954cae192e9bbc","observation_id":"beb0f0c1-b311-49ee-a88b-2de782e723e6","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Glitter : A Fully Adaptive and Tightly Secure Threshold Signature","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:90d6bd549225d797d6ee2f705d5a688b3fdb75e6989e2ebcb1900c272243d85b","observation_id":"6f44f560-047c-49b7-871b-7883b916f162","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Faster VOLEitH Signatures from All-But-One Vector Commitment and Half-Tree","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f5a7659882aad6b2a0145bfcc52b7fa6106285a1bc9fd11ef132f50d7a892585","observation_id":"faa6edd4-2b27-4f46-914b-8ddacb7ba24b","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Three-Round (Robust) Threshold ECDSA from Threshold CL Encryption","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:3ac0d1f29de15675861991490cf069c6f833c541cfcfc3d7c27c560067d462de","observation_id":"bf58db56-c825-4c10-95cc-92cd98525648","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Lattice Attack with EHNP : Key Recovery from Two ECDSA Signatures and Breaking the Information-Theoretic Limit","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:32a1c5bd77961fbf770fbbcbef9c003fc5274ae36b84c2dbaff740ecd0a63118","observation_id":"c130917a-8765-4661-883b-d901fcbfb031","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"FlexiADKG : A Flexible Asynchronous Distributed Key Generation Protocol with Constant Round Complexity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:39b9be640207d167a25208f6dfbdbdfc9ec6e9abf4892acabeb36684adae8596","observation_id":"48924546-c045-4fe3-9639-4366ebd1aff9","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"TEAKEX : TESLA -Authenticated Group Key Exchange","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:aa23dedbacec2a83411aa5e4bcf4ba65595e63d363c22a0d2696bbb2d3245d09","observation_id":"0912ff96-50e1-4315-a1b7-851b5b0918c8","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Liu and Shirui Pan and Tsz Hon Yuen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:5ae3c9be484edc32c6b0a3920b3c47dbb7c0c6a99e9e1172720b6307d112122a","observation_id":"cca7a3fa-1a1a-4826-a351-3649f93de878","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Advanced Temporal Graph Embedding for Detecting Fraudulent Transactions on Complex Blockchain Transactional Networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:40ba71750c26f91049a9b7533f604825959196e857871a9232729d9a12429bba","observation_id":"2623b188-0c14-4523-8c93-b852a18e985a","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Walnut: A Generic Framework with Enhanced Scalability for BFT Protocols","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:9030d22862914099efbe176a72b767300907549f62e67075290cb23c8e162e24","observation_id":"39d6e79a-c4e3-425c-a8ea-81cb146765a7","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"PPSCCC : Privacy-Preserving Scalable Cross-Chain Communication Among Multiple Blockchains Based on Parent-Child Blockchain","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:0f6424fa880a194920bdcc45309ba9335ddbdd34447f0664cb77dd6c20609a67","observation_id":"b9ef5426-da72-4bab-9f1f-55d8f9ea92df","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Towards Quantum Security of Hirose Compression Function and Romulus- H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:8ef183f1f740188333dc2d6582275a565e2965e3eb929fee088a898ec5b9f367","observation_id":"7f1f2fbe-1059-40c3-a565-cbdf0088232c","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Efficient Multi-instance Vector Commitment and Application to Post-quantum Signatures","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:96e13461176888230a7b214c6f81e9b90db824459e10424e394c94caea26677a","observation_id":"96d80807-82a4-4a3f-bb17-ae8e9df955c6","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Breaking the Shield: Novel Fault Attacks on CRYSTALS -Dilithium","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:c6274ae117ae965d039b160a024c55c755d6504b3a01d26f115e5fcc7f65d0a6","observation_id":"acf16fea-34bf-4bd2-8adb-0284c0dde5d5","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Efficient Revocable Identity-Based Encryption from Middle-Product LWE","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:ec9f4c30ed5021600b9cb6f061057bd21f9441e183cdd13835b5759bb04aeb2b","observation_id":"c7330cc4-b19c-482d-96d7-d5d462690bff","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Code-Based Fully Dynamic Accountable Ring Signatures and Group Signatures Using the Helper Methodology","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:2217a36f02a9f4d91328046e4f1b2e8eda6a90a30b3a3d06ddf3e439b1a24343","observation_id":"55bd5bd5-b6da-4cc6-9e6f-ccc327298843","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Partial Key Exposure Attacks on UOV and Its Variants","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d635ed4ff74dd834f38d9359235fa65ed3f4bb434bc2d204f978a838581ffacf","observation_id":"6c54de36-61af-45e5-8614-322b1215f87e","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Unbounded Multi-hop Proxy Re-encryption with HRA Security: An LWE -Based Optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:5f0fe3455a7bd51543df80b3b1b086e7136a37222800920b2cc8cf97a60f495a","observation_id":"5ddb31ce-4c6b-4d7f-a969-5d0989f466bd","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Fiat-Shamir with Rejection and Rotation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:32c306ee4f6744d0c03fe46fbd8bd39436645e461d9bf107ef977a7db807edd3","observation_id":"7b7c0e0f-68a1-4066-bd01-07c22cc1efe4","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Amoeba: More Flexible RLWE -Based KEM","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:e6b5962d1c47a74d80ca9fb33d4e4045812b8b6381e60996fbb7d1180f3b9d70","observation_id":"d5bcec41-c8e6-4d32-b5b2-99a1de90243f","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Get Rid of Templates: A Chosen-Ciphertext Attack on ML - KEM with a DPA -Based Self-comparison Oracle","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:38137e325acba0314e55a3081826eeb1877c9e802ff8b6e34668fd76e8ca4b20","observation_id":"bdb7f981-c539-4a5d-8702-b288a717e679","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Accountability for Server Misbehavior in Homomorphic Secret Sharing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:b5397e246685a7fd4641f5d2dcf94d66e1217802dc515057ec73c9f8b6c59a18","observation_id":"3050a2fd-e4b4-4a7d-8978-d48267d1b961","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Jiang and Jingjing Fan and Man Ho Au and Siu Ming Yiu","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:01b18a70e9dd761782b25ae57db26f37b0715bd8fab7994596221e60ed5be685","observation_id":"ed9f52e2-ddbf-4dab-9430-cb9f89b11372","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Refined Error Management for Gate Bootstrapping","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f61bcb83aff9ccd19b675b9e8ef41ba1c869b89bad00babe8d7d2cb7667a784f","observation_id":"ab28f6bf-1089-4530-b1ce-e7bebe28cccc","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Compact Lifting for NTT -Unfriendly Modulus","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:85e330779a438053b50af63acf8809dcab5f114b598c94d1aa3d581fad9b715f","observation_id":"63962e71-f54a-4109-9692-a2e939f05d5f","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:d819beff449a7b5bcb0092b30d987a076e32f68e91d39c05d6d02fd455881372","observation_id":"e9ab5e7a-24a4-4df2-844a-1cf1a1b2f72e","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Solving Generalized Approximate Divisor Multiples Problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:2f9bf8fb6c1f9f1bb3efaae3eb1458e6f4b1aafc3a6da8e9ddaf9bb1702634da","observation_id":"af310697-76a7-4922-bc31-2c98370e3349","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Comparing and Improving Frequency Estimation Perturbation Mechanisms Under Local Differential Privacy","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:6b9d7f8469e6db20247b663ceda517cf2e541e27b19a0a6abd985ccbb8b4e0d1","observation_id":"548c0f3d-e886-4d50-9be6-a5f8de1f7860","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:b67f6d69831d30a1900561d075c4f9c5256d47ab8c14ffe912ea8ebf2519b93b","observation_id":"de3f08cf-c7d2-429d-b52c-5b50d5c3750f","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Anonymous Credentials with Credential Redaction and Its Application to SSI -Based Plug& Charge for Shared Vehicles","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:1781d86ca98d82888b839fda620e92a0d7970891410ccfc7bf91c6e202996012","observation_id":"b1b21127-66dc-4153-8f07-4585fd8597bd","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Direction-Oriented Smooth Sensitivity and Its Application to Genomic Statistical Analysis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:a87e51cd6f9ef0e1a60e0c923d3e782d00b85dd3c0e132888c6098ea9281dc05","observation_id":"51313e71-85f8-4e75-a6fd-e61d6f4b981c","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Sentence Embedding Generation Method for Differential Privacy Protection","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:26413e775d4d0c152a0851a640c880da453116301429ed752d97df12156aecca","observation_id":"35d93b47-d051-4cfd-bbaa-640c625cbeca","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"KD - IBMRKE - PPFL : A Privacy-Preserving Federated Learning Framework Integrating Knowledge Distillation and Identity-Based Multi-receiver Key Encapsulation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:6d2ee529c8f616b8da7276476093c67bbbda8358a24634beaef89a1e3256d383","observation_id":"4e675782-da7f-42f0-9664-a0868ee66826","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Ebron Jr","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:9d0b4870a72cf12a7efa32d913ae8d16b14c270d6f81556389a73989d091b1ca","observation_id":"642d0156-aef8-488c-8e33-8373b1c7f9c2","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"RAGLeak : Membership Inference Attacks on RAG -Based Large Language Models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:f548c79eb1b8aca23317bc1765f250c81129a418f2886301be73395425f94127","observation_id":"e166100f-0e79-465f-80c9-4b6acf724e15","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:1cdf8fedd185c3dc918f44e97b30b8704d1ae86e58dcfec45a0792fcc8db0fb6","observation_id":"32d95098-e9d8-4b8e-b4f6-94cc467fea30","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"FRFL : Fair and Robust Federated Learning Incentive Model Based on Game Theory","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:8e6fd241ab6515eb3a8ff90b2484d887d15c45031a955507a88932d427d61327","observation_id":"cf9d5f22-a18b-4738-9144-7c2330a15943","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"DPFedSub : A Differentially Private Federated Learning with Randomized Subspace Descend","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:0a731303b883b9de09fe8072c1d32a11ab0d1574847751e4f3b42fefa30ea245","observation_id":"8e841c8a-81aa-4134-94c4-e162e043f638","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"MG -Det: Deepfake Detection with Multi-granularity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:b9021ffa6e279791205fc5b9d8205e02623be92c9e5c42b31a8f4426c774246c","observation_id":"3ac822cd-308a-4d4e-8649-26d56caa8486","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"LPIA : Label Preference Inference Attack Against Federated Graph Learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:1e937328bf6e964f701d504c3d720dc702c6ce1890e0c07e0f061968454cee64","observation_id":"af547fff-1f1a-4d78-b8bc-237c4d834008","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Kanhere and Jiamou Sun and Sanjay K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:88a863f8ea272edee371bf40d6e1663636d57579ef5766916eaa47fb8c59570f","observation_id":"df3522c5-abe4-4ade-8cd2-f0fc877dbc7e","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Zeroth-Order Federated Private Tuning for Pretrained Large Language Models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:e5ab641da53b9329697555efe36174b76806347e465d0467ac79be5dc460f499","observation_id":"cfc37329-90eb-4562-96fe-776c575e285d","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:07d6c0713ffeb2490f955a1d511f2a950a5607196f969f80c61c39ff1411d7be","observation_id":"93b2558b-c135-4db9-a78a-24febc9ba7e7","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Mitigating the Unprivileged User Namespaces Based Privilege Escalation Attacks with Linux Capabilities","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:96a56dc6b8e01b12a1e414a9e2aad2be5d6c20866ea943fd4ba99a9c07af1bf4","observation_id":"07dfbbc5-abcc-4f3e-a5b8-f937e144ea5f","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"SoK : From Systematization to Best Practices in Fuzz Driver Generation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:5fc0ac68856bb4702f0a1590d36b9464427e68a7b575dad2cd006ae55c10ee2a","observation_id":"4ff59652-feff-499e-8baa-8fcc18bd782a","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"Facial Authentication Security Evaluation Against Deepfake Attacks in Mobile Apps","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:6d0ac721e419ce33057fd2c01a35b5df1da702085bdb5bf22dbe972e275d93c9","observation_id":"6d6ccfc4-08a5-49c9-aeee-e7c9aac0c530","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":"EAPIR : Efficient and Authenticated Private Information Retrieval with Fast Server Processing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:0e4ca3108c3275113e86f0e8c4a26e376d59bb9f7f334732e1fb1f3e2e27af95","observation_id":"568c58fa-f965-4562-ab90-fc5124be77ac","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","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-12T01:34:45.323277Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-07-12T01:34:45.323277Z"},"links":{"citing_paper":"/paper/2607.03561"},"observation_digest":"sha256:68d4936fd8febd9953da90f4b14531f92f0a0207342b35ad6903f90d591b2f7e","observation_id":"79bfe8a3-240b-4550-8831-d308f5bb1170","resolution":{"observed_at":"2026-07-12T01:34:45.323277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03561","last_updated":"2026-07-03T18:49:20Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T03:24:41.529429Z","submitted_at":"2026-07-03T18:49:20Z","title":"How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":300},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2607.03561."}