{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VBCIKRIP2RQACWM4HW6QG3YFFJ","short_pith_number":"pith:VBCIKRIP","schema_version":"1.0","canonical_sha256":"a84485450fd46001599c3dbd036f052a6973ea17ade45d8e9c55aca35e930076","source":{"kind":"arxiv","id":"1208.4909","version":1},"attestation_state":"computed","paper":{"title":"Efficient Private Distributed Computation on Unbounded Input Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Juan Garay, Niv Gilboa, Shlomi Dolev, Vladimir Kolesnikov, Yelena Yuditsky","submitted_at":"2012-08-24T06:38:35Z","abstract_excerpt":"In the problem of swarm computing, $n$ agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, Gilboa and Kolesnikov [ICS 2011] considered this problem in the setting of information-theoretic security, showing how to perform such computations on input streams of unbounded length. The cost of their solution, however, is exponential in the size of the Finite State Automaton (FSA) computing the function"},"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":"1208.4909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-24T06:38:35Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f4cc4381cd354ae018cb3803b87cd3047a68989d66383dbf277765b856500bfe","abstract_canon_sha256":"0fc57baf71a80b08fb3270429f38783497e22ffe8382e38ccfd15ad00fdd482f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.420741Z","signature_b64":"QZ9mZhA6PLlHUn7kDCF6IVaAlmyE/elXUQiczVO+sWwFFBR3Ve238LzivepY6TVR+0ojmUDbJBJxDugJ+L0mDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a84485450fd46001599c3dbd036f052a6973ea17ade45d8e9c55aca35e930076","last_reissued_at":"2026-05-18T02:21:00.420203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.420203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Private Distributed Computation on Unbounded Input Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Juan Garay, Niv Gilboa, Shlomi Dolev, Vladimir Kolesnikov, Yelena Yuditsky","submitted_at":"2012-08-24T06:38:35Z","abstract_excerpt":"In the problem of swarm computing, $n$ agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, Gilboa and Kolesnikov [ICS 2011] considered this problem in the setting of information-theoretic security, showing how to perform such computations on input streams of unbounded length. The cost of their solution, however, is exponential in the size of the Finite State Automaton (FSA) computing the function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4909","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":"1208.4909","created_at":"2026-05-18T02:21:00.420268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4909v1","created_at":"2026-05-18T02:21:00.420268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4909","created_at":"2026-05-18T02:21:00.420268+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBCIKRIP2RQA","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBCIKRIP2RQACWM4","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBCIKRIP","created_at":"2026-05-18T12:27:25.539911+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/VBCIKRIP2RQACWM4HW6QG3YFFJ","json":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ.json","graph_json":"https://pith.science/api/pith-number/VBCIKRIP2RQACWM4HW6QG3YFFJ/graph.json","events_json":"https://pith.science/api/pith-number/VBCIKRIP2RQACWM4HW6QG3YFFJ/events.json","paper":"https://pith.science/paper/VBCIKRIP"},"agent_actions":{"view_html":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ","download_json":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ.json","view_paper":"https://pith.science/paper/VBCIKRIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4909&json=true","fetch_graph":"https://pith.science/api/pith-number/VBCIKRIP2RQACWM4HW6QG3YFFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VBCIKRIP2RQACWM4HW6QG3YFFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/action/storage_attestation","attest_author":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/action/author_attestation","sign_citation":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/action/citation_signature","submit_replication":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/action/replication_record"}},"created_at":"2026-05-18T02:21:00.420268+00:00","updated_at":"2026-05-18T02:21:00.420268+00:00"}