How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs | Paper Citation Record

Observation c09b2296-df50-4441-86d4-f22ccdec75ad · outbound

This paper cites Proceedings of the 41st International Conference on Machine Learning , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Proceedings of the 41st International Conference on Machine Learning , pages=

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e8c4855-9a8d-4fc8-b678-98bf86b19bfd · outbound

This paper cites AI safety via debate.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs AI safety via debate

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 838e1ac5-d873-4f93-8c28-77023b7fdd42 · outbound

This paper cites Avoiding Obfuscation with Prover-Estimator Debate.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Avoiding Obfuscation with Prover-Estimator Debate

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 728c425f-07fe-443b-98f3-dfb4b839a690 · outbound

This paper cites An alignment safety case sketch based on debate.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs An alignment safety case sketch based on debate

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c7702fa-57df-497f-a8f6-397bc8f9f242 · outbound

This paper cites Supervising strong learners by amplifying weak experts.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Supervising strong learners by amplifying weak experts

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcaf0638-9baf-4b6f-ba54-6d5a5ed255e1 · outbound

This paper cites Scalable agent alignment via reward modeling: a research direction.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Scalable agent alignment via reward modeling: a research direction

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eda47fe1-6cd3-49e5-84d2-b0b999ad3924 · outbound

This paper cites arXiv preprint arXiv:2405.15722 , year=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs arXiv preprint arXiv:2405.15722 , year=

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 015756c0-d47b-4743-82ee-262561cbdc22 · outbound

This paper cites Neural Interactive Proofs.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Neural Interactive Proofs

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d75fdfcd-475d-4d3e-9385-a6d4fd019261 · outbound

This paper cites arXiv preprint arXiv:2410.08864 , year=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs arXiv preprint arXiv:2410.08864 , year=

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9adf0a7d-5438-4598-9a42-50946701fb78 · outbound

This paper cites Learning to Give Checkable Answers with Prover-Verifier Games.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Learning to Give Checkable Answers with Prover-Verifier Games

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d56fe3f5-b33d-4020-867f-5579795df7e1 · outbound

This paper cites 2024 , eprint=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs 2024 , eprint=

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6bb3969-3f35-4845-9ea6-b0113ad472b7 · outbound

This paper cites Prover-Verifier Games improve legibility of LLM outputs.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Prover-Verifier Games improve legibility of LLM outputs

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 310374a9-addc-476a-a9f5-cb637cfcbfe8 · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Advances in Neural Information Processing Systems , volume=

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80a56620-8aac-4f65-9014-275c53e7c094 · outbound

This paper cites Why Language Models Hallucinate.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Why Language Models Hallucinate

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f66c1c1d-f355-42e0-9993-d0e97b9a40c2 · outbound

This paper cites Hallucination is Inevitable: An Innate Limitation of Large Language Models.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Hallucination is Inevitable: An Innate Limitation of Large Language Models

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8876ec61-ee07-4589-87f9-c273ae00f735 · outbound

This paper cites Findings of the Association for Computational Linguistics: EACL 2024 , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Findings of the Association for Computational Linguistics: EACL 2024 , pages=

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2cebb91a-2087-4052-a83f-eebe9b816bef · outbound

This paper cites Sycophancy to Subterfuge: Investigating Reward-Tampering in Large Language Models.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Sycophancy to Subterfuge: Investigating Reward-Tampering in Large Language Models

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6760f9a-430f-4eab-a449-805382435cba · outbound

This paper cites The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Models.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Models

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ddc3f4a8-4076-4478-a108-f3cdbe66c9c4 · outbound

This paper cites Sleeper Agents: Training Deceptive LLMs that Persist Through Safety Training.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Sleeper Agents: Training Deceptive LLMs that Persist Through Safety Training

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 26c577bd-0c9f-4934-a409-54ef986312b8 · outbound

This paper cites arXiv preprint arXiv:2509.15541 , year=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs arXiv preprint arXiv:2509.15541 , year=

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 743c23ad-6d91-4fb6-8d21-53394d1ef0fe · outbound

This paper cites Frontier Models are Capable of In-context Scheming.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Frontier Models are Capable of In-context Scheming

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a625bad-60fc-4c4a-b6f1-0107e78a4a88 · outbound

This paper cites Journal of the ACM (JACM) , volume=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Journal of the ACM (JACM) , volume=

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee1bf300-9f7f-49f7-b311-7e54ecc81022 · outbound

This paper cites Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a1abcd86-41d5-4a72-ac62-ba4f522edebc · outbound

This paper cites 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6e91e02b-8738-4615-813e-d162bcd2986a · outbound

This paper cites 2025 , eprint=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs 2025 , eprint=

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5fb2a36-980e-4359-80ce-dcb5dcb7d282 · outbound

This paper cites Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6df94fcb-2a08-4161-99af-f43f724b748e · outbound

This paper cites Theory of Cryptography Conference , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Theory of Cryptography Conference , pages=

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa167037-a338-42f1-9d9d-ae654f2ce1dd · outbound

This paper cites 2025 , month =.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs 2025 , month =

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4616be1c-fe3b-43bc-8f11-7628d39b4551 · outbound

This paper cites 2020 , month =.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs 2020 , month =

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14d97d50-fb19-4e9c-bc2d-efc15795d528 · outbound

This paper cites Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , pages=

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b4cbdf2-f3d0-4c10-aec6-4c7730b7dbb8 · outbound

This paper cites Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 965fffce-392a-4a52-b1ea-5d91299f4503 · outbound

This paper cites Information and Computation , volume=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Information and Computation , volume=

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e40e57c3-daff-4375-bce4-ed935a8e1bb0 · outbound

This paper cites an unresolved cited work.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Unresolved cited work

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fbbbd785-4c01-4a22-858f-d48e1d0558ee · outbound

This paper cites Journal of the ACM (JACM) , volume=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Journal of the ACM (JACM) , volume=

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ffc6004-762e-4f6f-9f65-c7224445e0a8 · outbound

This paper cites an unresolved cited work.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0cdddc3-e8e3-4f06-b90e-ac683047546e · outbound

This paper cites SIAM Journal on Computing , volume=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs SIAM Journal on Computing , volume=

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94df45a3-15c3-4e81-84e0-ba0bd358e846 · outbound

This paper cites Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , pages=

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab96eb58-78f6-4926-86ae-f944be22973b · outbound

This paper cites Zaverucha and Ian Goldberg , editor =.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Zaverucha and Ian Goldberg , editor =

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3aa7e7bc-3a7a-4304-963c-d3436feb2f0d · outbound

This paper cites Transactions of the Association for Computational Linguistics , volume=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Transactions of the Association for Computational Linguistics , volume=

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45f85804-8432-4ae3-bf84-12e0190a298d · outbound

This paper cites The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) , booktitle =.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) , booktitle =

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 649e314d-8da4-4e99-af49-dbdfac93a599 · outbound

This paper cites Trading Group Theory for Randomness , booktitle =.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Trading Group Theory for Randomness , booktitle =

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a246fda5-2a16-46f1-bed6-a4c96d412083 · outbound

This paper cites an unresolved cited work.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Unresolved cited work

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11b79b08-5aca-4a0d-8cbc-01612323130c · outbound

This paper cites Annual Cryptology Conference , pages=.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Annual Cryptology Conference , pages=

Reference 43

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de2785e4-50d0-4e89-a211-a40aa3b2b743 · outbound

This paper cites Foundations and Trends.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Foundations and Trends

Reference 44

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed39ee35-3f67-4acb-95b2-4ad77d72ed44 · outbound

This paper cites Forgery Attacks on SipHash.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Forgery Attacks on SipHash

Reference 45

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee30b804-eacb-4969-be31-3c4005df2411 · outbound

This paper cites Cryptanalysis of Fruit- F : Exploiting Key-Derivation Weaknesses and Initialization Vulnerabilities.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Cryptanalysis of Fruit- F : Exploiting Key-Derivation Weaknesses and Initialization Vulnerabilities

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a57338de-6c5d-4d8d-8b05-611b40984240 · outbound

This paper cites Exploring Key-Recovery-Friendly Differential Distinguishers for SM4 and Their Performance in Differential Attacks.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Exploring Key-Recovery-Friendly Differential Distinguishers for SM4 and Their Performance in Differential Attacks

Reference 47

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 136884d5-b8b8-41b6-9da0-444ba422ada3 · outbound

This paper cites Inner Product Masked Integral Distinguishers and Integral Sets over Large Finite Fields - Applications to MiMC , CIMINION and Chaghri.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Inner Product Masked Integral Distinguishers and Integral Sets over Large Finite Fields - Applications to MiMC , CIMINION and Chaghri

Reference 48

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0405de39-532d-4701-bb0a-590c703892d0 · outbound

This paper cites Improved Differential Meet-in-the-Middle Cryptanalysis on SIMON and Piccolo.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Improved Differential Meet-in-the-Middle Cryptanalysis on SIMON and Piccolo

Reference 49

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3cfa7a86-09f9-4e67-be96-ab6adba83f85 · outbound

This paper cites Strengthening Key Scheduling of AES -256 with Minimal Software Modifications.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Strengthening Key Scheduling of AES -256 with Minimal Software Modifications

Reference 50

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 043e6158-f92c-4bd8-bb19-42a8c06ade0a · outbound

This paper cites Ideal Transformations for Public Key Encryption.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Ideal Transformations for Public Key Encryption

Reference 51

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9dbbc8bd-8539-4459-9ca1-7cb3da449146 · outbound

This paper cites Indifferentiability Separations in Ideal Public Key Encryption: Explicit vs.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Indifferentiability Separations in Ideal Public Key Encryption: Explicit vs

Reference 52

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation beb0f0c1-b311-49ee-a88b-2de782e723e6 · outbound

This paper cites Compressed Sigma Protocols: New Model and Aggregation Techniques.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Compressed Sigma Protocols: New Model and Aggregation Techniques

Reference 53

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f44f560-047c-49b7-871b-7883b916f162 · outbound

This paper cites Glitter : A Fully Adaptive and Tightly Secure Threshold Signature.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Glitter : A Fully Adaptive and Tightly Secure Threshold Signature

Reference 54

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation faa6edd4-2b27-4f46-914b-8ddacb7ba24b · outbound

This paper cites Faster VOLEitH Signatures from All-But-One Vector Commitment and Half-Tree.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Faster VOLEitH Signatures from All-But-One Vector Commitment and Half-Tree

Reference 55

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf58db56-c825-4c10-95cc-92cd98525648 · outbound

This paper cites Three-Round (Robust) Threshold ECDSA from Threshold CL Encryption.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Three-Round (Robust) Threshold ECDSA from Threshold CL Encryption

Reference 56

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c130917a-8765-4661-883b-d901fcbfb031 · outbound

This paper cites Lattice Attack with EHNP : Key Recovery from Two ECDSA Signatures and Breaking the Information-Theoretic Limit.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Lattice Attack with EHNP : Key Recovery from Two ECDSA Signatures and Breaking the Information-Theoretic Limit

Reference 57

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48924546-c045-4fe3-9639-4366ebd1aff9 · outbound

This paper cites FlexiADKG : A Flexible Asynchronous Distributed Key Generation Protocol with Constant Round Complexity.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs FlexiADKG : A Flexible Asynchronous Distributed Key Generation Protocol with Constant Round Complexity

Reference 58

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0912ff96-50e1-4315-a1b7-851b5b0918c8 · outbound

This paper cites TEAKEX : TESLA -Authenticated Group Key Exchange.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs TEAKEX : TESLA -Authenticated Group Key Exchange

Reference 59

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cca7a3fa-1a1a-4826-a351-3649f93de878 · outbound

This paper cites Liu and Shirui Pan and Tsz Hon Yuen.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Liu and Shirui Pan and Tsz Hon Yuen

Reference 60

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2623b188-0c14-4523-8c93-b852a18e985a · outbound

This paper cites Advanced Temporal Graph Embedding for Detecting Fraudulent Transactions on Complex Blockchain Transactional Networks.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Advanced Temporal Graph Embedding for Detecting Fraudulent Transactions on Complex Blockchain Transactional Networks

Reference 61

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 39d6e79a-c4e3-425c-a8ea-81cb146765a7 · outbound

This paper cites Walnut: A Generic Framework with Enhanced Scalability for BFT Protocols.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Walnut: A Generic Framework with Enhanced Scalability for BFT Protocols

Reference 62

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9ef5426-da72-4bab-9f1f-55d8f9ea92df · outbound

This paper cites PPSCCC : Privacy-Preserving Scalable Cross-Chain Communication Among Multiple Blockchains Based on Parent-Child Blockchain.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs PPSCCC : Privacy-Preserving Scalable Cross-Chain Communication Among Multiple Blockchains Based on Parent-Child Blockchain

Reference 63

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f1f2fbe-1059-40c3-a565-cbdf0088232c · outbound

This paper cites Towards Quantum Security of Hirose Compression Function and Romulus- H.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Towards Quantum Security of Hirose Compression Function and Romulus- H

Reference 64

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96d80807-82a4-4a3f-bb17-ae8e9df955c6 · outbound

This paper cites Efficient Multi-instance Vector Commitment and Application to Post-quantum Signatures.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Efficient Multi-instance Vector Commitment and Application to Post-quantum Signatures

Reference 65

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation acf16fea-34bf-4bd2-8adb-0284c0dde5d5 · outbound

This paper cites Breaking the Shield: Novel Fault Attacks on CRYSTALS -Dilithium.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Breaking the Shield: Novel Fault Attacks on CRYSTALS -Dilithium

Reference 66

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c7330cc4-b19c-482d-96d7-d5d462690bff · outbound

This paper cites Efficient Revocable Identity-Based Encryption from Middle-Product LWE.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Efficient Revocable Identity-Based Encryption from Middle-Product LWE

Reference 67

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55bd5bd5-b6da-4cc6-9e6f-ccc327298843 · outbound

This paper cites Code-Based Fully Dynamic Accountable Ring Signatures and Group Signatures Using the Helper Methodology.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Code-Based Fully Dynamic Accountable Ring Signatures and Group Signatures Using the Helper Methodology

Reference 68

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c54de36-61af-45e5-8614-322b1215f87e · outbound

This paper cites Partial Key Exposure Attacks on UOV and Its Variants.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Partial Key Exposure Attacks on UOV and Its Variants

Reference 69

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ddb31ce-4c6b-4d7f-a969-5d0989f466bd · outbound

This paper cites Unbounded Multi-hop Proxy Re-encryption with HRA Security: An LWE -Based Optimization.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Unbounded Multi-hop Proxy Re-encryption with HRA Security: An LWE -Based Optimization

Reference 70

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b7c0e0f-68a1-4066-bd01-07c22cc1efe4 · outbound

This paper cites Fiat-Shamir with Rejection and Rotation.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Fiat-Shamir with Rejection and Rotation

Reference 71

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d5bcec41-c8e6-4d32-b5b2-99a1de90243f · outbound

This paper cites Amoeba: More Flexible RLWE -Based KEM.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Amoeba: More Flexible RLWE -Based KEM

Reference 72

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bdb7f981-c539-4a5d-8702-b288a717e679 · outbound

This paper cites Get Rid of Templates: A Chosen-Ciphertext Attack on ML - KEM with a DPA -Based Self-comparison Oracle.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Get Rid of Templates: A Chosen-Ciphertext Attack on ML - KEM with a DPA -Based Self-comparison Oracle

Reference 73

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3050a2fd-e4b4-4a7d-8978-d48267d1b961 · outbound

This paper cites Accountability for Server Misbehavior in Homomorphic Secret Sharing.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Accountability for Server Misbehavior in Homomorphic Secret Sharing

Reference 74

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed9f52e2-ddbf-4dab-9430-cb9f89b11372 · outbound

This paper cites Jiang and Jingjing Fan and Man Ho Au and Siu Ming Yiu.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Jiang and Jingjing Fan and Man Ho Au and Siu Ming Yiu

Reference 75

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab28f6bf-1089-4530-b1ce-e7bebe28cccc · outbound

This paper cites Refined Error Management for Gate Bootstrapping.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Refined Error Management for Gate Bootstrapping

Reference 76

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63962e71-f54a-4109-9692-a2e939f05d5f · outbound

This paper cites Compact Lifting for NTT -Unfriendly Modulus.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Compact Lifting for NTT -Unfriendly Modulus

Reference 77

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9ab5e7a-24a4-4df2-844a-1cf1a1b2f72e · outbound

This paper cites Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience

Reference 78

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af310697-76a7-4922-bc31-2c98370e3349 · outbound

This paper cites Solving Generalized Approximate Divisor Multiples Problems.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Solving Generalized Approximate Divisor Multiples Problems

Reference 79

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 548c0f3d-e886-4d50-9be6-a5f8de1f7860 · outbound

This paper cites Comparing and Improving Frequency Estimation Perturbation Mechanisms Under Local Differential Privacy.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Comparing and Improving Frequency Estimation Perturbation Mechanisms Under Local Differential Privacy

Reference 80

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de3f08cf-c7d2-429d-b52c-5b50d5c3750f · outbound

This paper cites Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption

Reference 81

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1b21127-66dc-4153-8f07-4585fd8597bd · outbound

This paper cites Anonymous Credentials with Credential Redaction and Its Application to SSI -Based Plug& Charge for Shared Vehicles.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Anonymous Credentials with Credential Redaction and Its Application to SSI -Based Plug& Charge for Shared Vehicles

Reference 82

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51313e71-85f8-4e75-a6fd-e61d6f4b981c · outbound

This paper cites Direction-Oriented Smooth Sensitivity and Its Application to Genomic Statistical Analysis.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Direction-Oriented Smooth Sensitivity and Its Application to Genomic Statistical Analysis

Reference 83

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35d93b47-d051-4cfd-bbaa-640c625cbeca · outbound

This paper cites Sentence Embedding Generation Method for Differential Privacy Protection.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Sentence Embedding Generation Method for Differential Privacy Protection

Reference 84

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e675782-da7f-42f0-9664-a0868ee66826 · outbound

This paper cites KD - IBMRKE - PPFL : A Privacy-Preserving Federated Learning Framework Integrating Knowledge Distillation and Identity-Based Multi-receiver Key Encapsulation.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs KD - IBMRKE - PPFL : A Privacy-Preserving Federated Learning Framework Integrating Knowledge Distillation and Identity-Based Multi-receiver Key Encapsulation

Reference 85

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 642d0156-aef8-488c-8e33-8373b1c7f9c2 · outbound

This paper cites Ebron Jr.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Ebron Jr

Reference 86

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e166100f-0e79-465f-80c9-4b6acf724e15 · outbound

This paper cites RAGLeak : Membership Inference Attacks on RAG -Based Large Language Models.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs RAGLeak : Membership Inference Attacks on RAG -Based Large Language Models

Reference 87

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32d95098-e9d8-4b8e-b4f6-94cc467fea30 · outbound

This paper cites an unresolved cited work.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Unresolved cited work

Reference 88

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf9d5f22-a18b-4738-9144-7c2330a15943 · outbound

This paper cites FRFL : Fair and Robust Federated Learning Incentive Model Based on Game Theory.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs FRFL : Fair and Robust Federated Learning Incentive Model Based on Game Theory

Reference 89

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e841c8a-81aa-4134-94c4-e162e043f638 · outbound

This paper cites DPFedSub : A Differentially Private Federated Learning with Randomized Subspace Descend.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs DPFedSub : A Differentially Private Federated Learning with Randomized Subspace Descend

Reference 90

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ac822cd-308a-4d4e-8649-26d56caa8486 · outbound

This paper cites MG -Det: Deepfake Detection with Multi-granularity.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs MG -Det: Deepfake Detection with Multi-granularity

Reference 91

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af547fff-1f1a-4d78-b8bc-237c4d834008 · outbound

This paper cites LPIA : Label Preference Inference Attack Against Federated Graph Learning.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs LPIA : Label Preference Inference Attack Against Federated Graph Learning

Reference 92

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df3522c5-abe4-4ade-8cd2-f0fc877dbc7e · outbound

This paper cites Kanhere and Jiamou Sun and Sanjay K.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Kanhere and Jiamou Sun and Sanjay K

Reference 93

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cfc37329-90eb-4562-96fe-776c575e285d · outbound

This paper cites Zeroth-Order Federated Private Tuning for Pretrained Large Language Models.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Zeroth-Order Federated Private Tuning for Pretrained Large Language Models

Reference 94

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 93b2558b-c135-4db9-a78a-24febc9ba7e7 · outbound

This paper cites an unresolved cited work.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Unresolved cited work

Reference 95

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07dfbbc5-abcc-4f3e-a5b8-f937e144ea5f · outbound

This paper cites Mitigating the Unprivileged User Namespaces Based Privilege Escalation Attacks with Linux Capabilities.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Mitigating the Unprivileged User Namespaces Based Privilege Escalation Attacks with Linux Capabilities

Reference 96

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ff59652-feff-499e-8baa-8fcc18bd782a · outbound

This paper cites SoK : From Systematization to Best Practices in Fuzz Driver Generation.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs SoK : From Systematization to Best Practices in Fuzz Driver Generation

Reference 97

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d6ccfc4-08a5-49c9-aeee-e7c9aac0c530 · outbound

This paper cites Facial Authentication Security Evaluation Against Deepfake Attacks in Mobile Apps.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Facial Authentication Security Evaluation Against Deepfake Attacks in Mobile Apps

Reference 98

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 568c58fa-f965-4562-ab90-fc5124be77ac · outbound

This paper cites EAPIR : Efficient and Authenticated Private Information Retrieval with Fast Server Processing.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs EAPIR : Efficient and Authenticated Private Information Retrieval with Fast Server Processing

Reference 99

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79bfe8a3-240b-4550-8831-d308f5bb1170 · outbound

This paper cites an unresolved cited work.

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs Unresolved cited work

Reference 100

Resolution: unresolved; no resolver link, observed 2026-07-12T01:34:45.323277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers