{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z27HON4U65RKRYEXKJ75UR6YAX","short_pith_number":"pith:Z27HON4U","schema_version":"1.0","canonical_sha256":"cebe773794f762a8e097527fda47d805d92bd0486af0056b0c9384cebcca730c","source":{"kind":"arxiv","id":"1712.01139","version":5},"attestation_state":"computed","paper":{"title":"Distributed Algorithms Made Secure: A Graph Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.DS","authors_text":"Eylon Yogev, Merav Parter","submitted_at":"2017-12-04T15:08:38Z","abstract_excerpt":"In the area of distributed graph algorithms a number of network's entities with local views solve some computational task by exchanging messages with their neighbors. Quite unfortunately, an inherent property of most existing distributed algorithms is that throughout the course of their execution, the nodes get to learn not only their own output but rather learn quite a lot on the inputs or outputs of many other entities. This leakage of information might be a major obstacle in settings where the output (or input) of network's individual is a private information. In this paper, we introduce a "},"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":"1712.01139","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-04T15:08:38Z","cross_cats_sorted":["cs.CR","cs.DC"],"title_canon_sha256":"f48387534fc8a141f355017cbcd7659851c90b788a6120e57b293910b711d55e","abstract_canon_sha256":"1f0a378131169314afdcb1f7af1bbca69f84e4138326e222631fc2c3b5f314cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.106114Z","signature_b64":"LeWVc37ubnaCg2T1cexmiHTrTXU2j9lepan6kGe56CuZj+04ershoUBN7Q84jJXc7CY2d4TTxZa6zEB0cD9mBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cebe773794f762a8e097527fda47d805d92bd0486af0056b0c9384cebcca730c","last_reissued_at":"2026-05-17T23:56:30.105693Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.105693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms Made Secure: A Graph Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.DS","authors_text":"Eylon Yogev, Merav Parter","submitted_at":"2017-12-04T15:08:38Z","abstract_excerpt":"In the area of distributed graph algorithms a number of network's entities with local views solve some computational task by exchanging messages with their neighbors. Quite unfortunately, an inherent property of most existing distributed algorithms is that throughout the course of their execution, the nodes get to learn not only their own output but rather learn quite a lot on the inputs or outputs of many other entities. This leakage of information might be a major obstacle in settings where the output (or input) of network's individual is a private information. In this paper, we introduce a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01139","kind":"arxiv","version":5},"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":"1712.01139","created_at":"2026-05-17T23:56:30.105757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01139v5","created_at":"2026-05-17T23:56:30.105757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01139","created_at":"2026-05-17T23:56:30.105757+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z27HON4U65RK","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z27HON4U65RKRYEX","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z27HON4U","created_at":"2026-05-18T12:31:59.375834+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/Z27HON4U65RKRYEXKJ75UR6YAX","json":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX.json","graph_json":"https://pith.science/api/pith-number/Z27HON4U65RKRYEXKJ75UR6YAX/graph.json","events_json":"https://pith.science/api/pith-number/Z27HON4U65RKRYEXKJ75UR6YAX/events.json","paper":"https://pith.science/paper/Z27HON4U"},"agent_actions":{"view_html":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX","download_json":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX.json","view_paper":"https://pith.science/paper/Z27HON4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01139&json=true","fetch_graph":"https://pith.science/api/pith-number/Z27HON4U65RKRYEXKJ75UR6YAX/graph.json","fetch_events":"https://pith.science/api/pith-number/Z27HON4U65RKRYEXKJ75UR6YAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX/action/storage_attestation","attest_author":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX/action/author_attestation","sign_citation":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX/action/citation_signature","submit_replication":"https://pith.science/pith/Z27HON4U65RKRYEXKJ75UR6YAX/action/replication_record"}},"created_at":"2026-05-17T23:56:30.105757+00:00","updated_at":"2026-05-17T23:56:30.105757+00:00"}