{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XQSB3AIDJ6U5GKZIW6CTVJW3JR","short_pith_number":"pith:XQSB3AID","schema_version":"1.0","canonical_sha256":"bc241d81034fa9d32b28b7853aa6db4c7b7273bf6015c81206f8331fd6ad02ab","source":{"kind":"arxiv","id":"1812.10917","version":1},"attestation_state":"computed","paper":{"title":"The Power of Distributed Verifiers in Interactive Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eylon Yogev, Merav Parter, Moni Naor","submitted_at":"2018-12-28T07:52:24Z","abstract_excerpt":"We explore the power of interactive proofs with a distributed verifier. In this setting, the verifier consists of $n$ nodes and a graph $G$ that defines their communication pattern. The prover is a single entity that communicates with all nodes by short messages. The goal is to verify that the graph $G$ belongs to some language in a small number of rounds, and with small communication bound, i.e., the proof size.\n  This interactive model was introduced by Kol, Oshman and Saxena (PODC 2018) as a generalization of non-interactive distributed proofs. They demonstrated the power of interaction in "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1812.10917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-28T07:52:24Z","cross_cats_sorted":[],"title_canon_sha256":"139eec75c1f86cbfcd9d492f33e589dc9523fa5b2bdd87aaf5e39677fefa41b9","abstract_canon_sha256":"b0ff59e1fd8c76cc70550f819266d298a04c73239d9cca290c07460e5e109dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.767071Z","signature_b64":"7wezEQ/ILvFgcrgCQnl0sGU/+RTxGAAq3RQ4jS9XPKXOnDOcZhMAwWDc1VsGXGWJuo5VIVEK9plxCTCODLkGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc241d81034fa9d32b28b7853aa6db4c7b7273bf6015c81206f8331fd6ad02ab","last_reissued_at":"2026-05-17T23:57:16.766691Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.766691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Distributed Verifiers in Interactive Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eylon Yogev, Merav Parter, Moni Naor","submitted_at":"2018-12-28T07:52:24Z","abstract_excerpt":"We explore the power of interactive proofs with a distributed verifier. In this setting, the verifier consists of $n$ nodes and a graph $G$ that defines their communication pattern. The prover is a single entity that communicates with all nodes by short messages. The goal is to verify that the graph $G$ belongs to some language in a small number of rounds, and with small communication bound, i.e., the proof size.\n  This interactive model was introduced by Kol, Oshman and Saxena (PODC 2018) as a generalization of non-interactive distributed proofs. They demonstrated the power of interaction in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10917","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.10917","created_at":"2026-05-17T23:57:16.766750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10917v1","created_at":"2026-05-17T23:57:16.766750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10917","created_at":"2026-05-17T23:57:16.766750+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQSB3AIDJ6U5","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQSB3AIDJ6U5GKZI","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQSB3AID","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR","json":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR.json","graph_json":"https://pith.science/api/pith-number/XQSB3AIDJ6U5GKZIW6CTVJW3JR/graph.json","events_json":"https://pith.science/api/pith-number/XQSB3AIDJ6U5GKZIW6CTVJW3JR/events.json","paper":"https://pith.science/paper/XQSB3AID"},"agent_actions":{"view_html":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR","download_json":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR.json","view_paper":"https://pith.science/paper/XQSB3AID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10917&json=true","fetch_graph":"https://pith.science/api/pith-number/XQSB3AIDJ6U5GKZIW6CTVJW3JR/graph.json","fetch_events":"https://pith.science/api/pith-number/XQSB3AIDJ6U5GKZIW6CTVJW3JR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/action/storage_attestation","attest_author":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/action/author_attestation","sign_citation":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/action/citation_signature","submit_replication":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/action/replication_record"}},"created_at":"2026-05-17T23:57:16.766750+00:00","updated_at":"2026-05-17T23:57:16.766750+00:00"}