{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VBCIKRIP2RQACWM4HW6QG3YFFJ","short_pith_number":"pith:VBCIKRIP","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"},"canonical_sha256":"a84485450fd46001599c3dbd036f052a6973ea17ade45d8e9c55aca35e930076","source":{"kind":"arxiv","id":"1208.4909","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4909","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4909v1","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4909","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"VBCIKRIP2RQA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VBCIKRIP2RQACWM4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VBCIKRIP","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VBCIKRIP2RQACWM4HW6QG3YFFJ","target":"record","payload":{"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"},"canonical_sha256":"a84485450fd46001599c3dbd036f052a6973ea17ade45d8e9c55aca35e930076","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"},"source_kind":"arxiv","source_id":"1208.4909","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-18T02:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0u+FqDjkPcjUMB9MyIRIzMrBEjsCOulKwF3y0aORYnnCKfSv9JNrxrBgDA0r4Pa8gBpQUCt+JRJBjrQ9bhAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:04:02.547051Z"},"content_sha256":"6805196bcb82618bf53889e4110fc4b0297c4991e60320f846445372726b44f5","schema_version":"1.0","event_id":"sha256:6805196bcb82618bf53889e4110fc4b0297c4991e60320f846445372726b44f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VBCIKRIP2RQACWM4HW6QG3YFFJ","target":"graph","payload":{"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"},"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-18T02:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5y7A4FS5kVOgNSLoxTxsHwORdbDDz7caCtaGGVP8oUsIGxYkCx/ZfftCJ/X3lsqvl7oOQUW6dAsmeT12s4eaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:04:02.547427Z"},"content_sha256":"8b197ff68e37f7973dc7cbc100dc8b6d1ef6e7e5f8e88179f2c45cc6d6cc7df9","schema_version":"1.0","event_id":"sha256:8b197ff68e37f7973dc7cbc100dc8b6d1ef6e7e5f8e88179f2c45cc6d6cc7df9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/bundle.json","state_url":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/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-29T15:04:02Z","links":{"resolver":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ","bundle":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/bundle.json","state":"https://pith.science/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBCIKRIP2RQACWM4HW6QG3YFFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VBCIKRIP2RQACWM4HW6QG3YFFJ","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":"0fc57baf71a80b08fb3270429f38783497e22ffe8382e38ccfd15ad00fdd482f","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-24T06:38:35Z","title_canon_sha256":"f4cc4381cd354ae018cb3803b87cd3047a68989d66383dbf277765b856500bfe"},"schema_version":"1.0","source":{"id":"1208.4909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4909","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4909v1","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4909","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"VBCIKRIP2RQA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VBCIKRIP2RQACWM4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VBCIKRIP","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:8b197ff68e37f7973dc7cbc100dc8b6d1ef6e7e5f8e88179f2c45cc6d6cc7df9","target":"graph","created_at":"2026-05-18T02:21:00Z","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":"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","authors_text":"Juan Garay, Niv Gilboa, Shlomi Dolev, Vladimir Kolesnikov, Yelena Yuditsky","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-24T06:38:35Z","title":"Efficient Private Distributed Computation on Unbounded Input Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4909","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:6805196bcb82618bf53889e4110fc4b0297c4991e60320f846445372726b44f5","target":"record","created_at":"2026-05-18T02:21:00Z","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":"0fc57baf71a80b08fb3270429f38783497e22ffe8382e38ccfd15ad00fdd482f","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-24T06:38:35Z","title_canon_sha256":"f4cc4381cd354ae018cb3803b87cd3047a68989d66383dbf277765b856500bfe"},"schema_version":"1.0","source":{"id":"1208.4909","kind":"arxiv","version":1}},"canonical_sha256":"a84485450fd46001599c3dbd036f052a6973ea17ade45d8e9c55aca35e930076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a84485450fd46001599c3dbd036f052a6973ea17ade45d8e9c55aca35e930076","first_computed_at":"2026-05-18T02:21:00.420203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:00.420203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QZ9mZhA6PLlHUn7kDCF6IVaAlmyE/elXUQiczVO+sWwFFBR3Ve238LzivepY6TVR+0ojmUDbJBJxDugJ+L0mDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:00.420741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.4909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6805196bcb82618bf53889e4110fc4b0297c4991e60320f846445372726b44f5","sha256:8b197ff68e37f7973dc7cbc100dc8b6d1ef6e7e5f8e88179f2c45cc6d6cc7df9"],"state_sha256":"529289fe79b83a479f7e9d1ef549f139fa46577d8a89174113ca15ffe3276db5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ui/DOqBSQLYFtnr0mBuPlyLgUKEC0kmpMUsyTUsdc2IYLWCTqIag5XmtjMPXwz4uWWo9tg8A7SWZVzGnhWlqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:04:02.549663Z","bundle_sha256":"167baf2b684b50686bfd66260e66f119977cfe6355d9456d35930ddc5155b8d5"}}