{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XQSB3AIDJ6U5GKZIW6CTVJW3JR","short_pith_number":"pith:XQSB3AID","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"},"canonical_sha256":"bc241d81034fa9d32b28b7853aa6db4c7b7273bf6015c81206f8331fd6ad02ab","source":{"kind":"arxiv","id":"1812.10917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10917","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10917v1","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10917","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"XQSB3AIDJ6U5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XQSB3AIDJ6U5GKZI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XQSB3AID","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XQSB3AIDJ6U5GKZIW6CTVJW3JR","target":"record","payload":{"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"},"canonical_sha256":"bc241d81034fa9d32b28b7853aa6db4c7b7273bf6015c81206f8331fd6ad02ab","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"},"source_kind":"arxiv","source_id":"1812.10917","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pp8Bhfy96fuCBnCCcC1kQR2yWuojYiQ/rSHClnMeOxeOI91BWQW3KN6JSCFnUebKisiThoZ+HU1jUJ9kSfeTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:46:37.957271Z"},"content_sha256":"65ded2db19a24e28b20a0557ef87f9c243f7e9b7b9324a70715c60b390b49300","schema_version":"1.0","event_id":"sha256:65ded2db19a24e28b20a0557ef87f9c243f7e9b7b9324a70715c60b390b49300"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XQSB3AIDJ6U5GKZIW6CTVJW3JR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyL8azP3RYk7HiYYNxgFFdLc5ZXbSXp7WZ5z8D71FTWk4Z4MUtJmKMa6t5gwNrleOsGEqMy4g7fLp/KfNnc7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:46:37.957959Z"},"content_sha256":"bb808d0df6df4b7f15c69670f4c185c88009ce8381e10ef1f20b9e2f7863a6bd","schema_version":"1.0","event_id":"sha256:bb808d0df6df4b7f15c69670f4c185c88009ce8381e10ef1f20b9e2f7863a6bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/bundle.json","state_url":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T14:46:37Z","links":{"resolver":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR","bundle":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/bundle.json","state":"https://pith.science/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQSB3AIDJ6U5GKZIW6CTVJW3JR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XQSB3AIDJ6U5GKZIW6CTVJW3JR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b0ff59e1fd8c76cc70550f819266d298a04c73239d9cca290c07460e5e109dfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-28T07:52:24Z","title_canon_sha256":"139eec75c1f86cbfcd9d492f33e589dc9523fa5b2bdd87aaf5e39677fefa41b9"},"schema_version":"1.0","source":{"id":"1812.10917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10917","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10917v1","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10917","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"XQSB3AIDJ6U5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XQSB3AIDJ6U5GKZI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XQSB3AID","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:bb808d0df6df4b7f15c69670f4c185c88009ce8381e10ef1f20b9e2f7863a6bd","target":"graph","created_at":"2026-05-17T23:57:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Eylon Yogev, Merav Parter, Moni Naor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-28T07:52:24Z","title":"The Power of Distributed Verifiers in Interactive Proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10917","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:65ded2db19a24e28b20a0557ef87f9c243f7e9b7b9324a70715c60b390b49300","target":"record","created_at":"2026-05-17T23:57:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b0ff59e1fd8c76cc70550f819266d298a04c73239d9cca290c07460e5e109dfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-28T07:52:24Z","title_canon_sha256":"139eec75c1f86cbfcd9d492f33e589dc9523fa5b2bdd87aaf5e39677fefa41b9"},"schema_version":"1.0","source":{"id":"1812.10917","kind":"arxiv","version":1}},"canonical_sha256":"bc241d81034fa9d32b28b7853aa6db4c7b7273bf6015c81206f8331fd6ad02ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc241d81034fa9d32b28b7853aa6db4c7b7273bf6015c81206f8331fd6ad02ab","first_computed_at":"2026-05-17T23:57:16.766691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:16.766691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7wezEQ/ILvFgcrgCQnl0sGU/+RTxGAAq3RQ4jS9XPKXOnDOcZhMAwWDc1VsGXGWJuo5VIVEK9plxCTCODLkGBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:16.767071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65ded2db19a24e28b20a0557ef87f9c243f7e9b7b9324a70715c60b390b49300","sha256:bb808d0df6df4b7f15c69670f4c185c88009ce8381e10ef1f20b9e2f7863a6bd"],"state_sha256":"caa06fbf5dfe364c78bdbf5cced9fec3b343503f862eeb3d513812106b3aa5bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIuRxeuyRWnTXSgAUVg8tIlLkgEx/VZAq3EDMdnaJbV6hc1Oc+X2pdePnEBfpMsOTTh3CTEV09dCshGg9nigBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:46:37.961986Z","bundle_sha256":"7fe337efc50ec43cd4abc0baba3950676fa8fc100000880612bd8a0b4998f2c1"}}