{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6RPIYHTAORUWKLHOUU346VE2RS","short_pith_number":"pith:6RPIYHTA","canonical_record":{"source":{"id":"1107.5419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-27T09:09:38Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"d70a9de58579c29d4a9983b0208bcc06228bbba57a5269a855780f9a1f236774","abstract_canon_sha256":"3552afe5fbfa698b086fae76fb2a325fe83fdd3063da84aacdd102eb75a22b1e"},"schema_version":"1.0"},"canonical_sha256":"f45e8c1e607469652ceea537cf549a8cb76a78ef42e1f60e0a15fc8a1db75e36","source":{"kind":"arxiv","id":"1107.5419","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5419","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5419v3","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5419","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"6RPIYHTAORUW","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6RPIYHTAORUWKLHO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6RPIYHTA","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6RPIYHTAORUWKLHOUU346VE2RS","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-27T09:09:38Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"d70a9de58579c29d4a9983b0208bcc06228bbba57a5269a855780f9a1f236774","abstract_canon_sha256":"3552afe5fbfa698b086fae76fb2a325fe83fdd3063da84aacdd102eb75a22b1e"},"schema_version":"1.0"},"canonical_sha256":"f45e8c1e607469652ceea537cf549a8cb76a78ef42e1f60e0a15fc8a1db75e36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:52.479896Z","signature_b64":"4duI2rpLlJIWZnW2cKnZn/LuSlLjWhvmgdRDQE9M2Uae6oapXakLAPGYwF7DT8tQ+7PpyqNxpNnCdOuBX/zTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f45e8c1e607469652ceea537cf549a8cb76a78ef42e1f60e0a15fc8a1db75e36","last_reissued_at":"2026-05-18T04:07:52.479329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:52.479329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5419","source_version":3,"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-18T04:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bQxweebNTm0Cd/Y2GBHIiYBjPQUuLADEdzm5Dr2dFPjdCJdUd4UN3ERcyvCeU/SEBlfaL/4lDGCPeufLKL2pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:08.750139Z"},"content_sha256":"82fec215068946ddc2bf4dfd6500f6783e77004d9d84975d36c87b5ffae5450e","schema_version":"1.0","event_id":"sha256:82fec215068946ddc2bf4dfd6500f6783e77004d9d84975d36c87b5ffae5450e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6RPIYHTAORUWKLHOUU346VE2RS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable and Secure Aggregation in Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"cs.DC","authors_text":"Anne-Marie Kermarrec, Florian Huc, Hamza Harkous, Rachid Guerraoui, Sebastien Gambs","submitted_at":"2011-07-27T09:09:38Z","abstract_excerpt":"We consider the problem of computing an aggregation function in a \\emph{secure} and \\emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of $O(n^3)$, we present a distributed protocol that requires only a communication complexity of $O(n\\log^3 n)$, which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates $(1/2-\\epsilon)n$ malicious nodes for any constant $1/2 > \\epsilon > 0$ (not depending on $n$), and outputs the exact value of the aggregated function with high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5419","kind":"arxiv","version":3},"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-18T04:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQWIENUJ2Yq0Ih+1tBzMR9TydRgpE7M/aCjPLC+v7IekQgLH6ZW8MSawD5JSIxJDP7hoooVT36yKbwoKxhP9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:08.750859Z"},"content_sha256":"66c161fce8e172fe0f6b49725c1af3de225c2043316f2814bdbf3ec5784b2eee","schema_version":"1.0","event_id":"sha256:66c161fce8e172fe0f6b49725c1af3de225c2043316f2814bdbf3ec5784b2eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/bundle.json","state_url":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RPIYHTAORUWKLHOUU346VE2RS/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-30T09:21:08Z","links":{"resolver":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS","bundle":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/bundle.json","state":"https://pith.science/pith/6RPIYHTAORUWKLHOUU346VE2RS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RPIYHTAORUWKLHOUU346VE2RS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6RPIYHTAORUWKLHOUU346VE2RS","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":"3552afe5fbfa698b086fae76fb2a325fe83fdd3063da84aacdd102eb75a22b1e","cross_cats_sorted":["cs.CC","cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-27T09:09:38Z","title_canon_sha256":"d70a9de58579c29d4a9983b0208bcc06228bbba57a5269a855780f9a1f236774"},"schema_version":"1.0","source":{"id":"1107.5419","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5419","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5419v3","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5419","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"6RPIYHTAORUW","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6RPIYHTAORUWKLHO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6RPIYHTA","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:66c161fce8e172fe0f6b49725c1af3de225c2043316f2814bdbf3ec5784b2eee","target":"graph","created_at":"2026-05-18T04:07:52Z","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 consider the problem of computing an aggregation function in a \\emph{secure} and \\emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of $O(n^3)$, we present a distributed protocol that requires only a communication complexity of $O(n\\log^3 n)$, which we prove is near-optimal. Our protocol ensures perfect security against a computationally-bounded adversary, tolerates $(1/2-\\epsilon)n$ malicious nodes for any constant $1/2 > \\epsilon > 0$ (not depending on $n$), and outputs the exact value of the aggregated function with high","authors_text":"Anne-Marie Kermarrec, Florian Huc, Hamza Harkous, Rachid Guerraoui, Sebastien Gambs","cross_cats":["cs.CC","cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-27T09:09:38Z","title":"Scalable and Secure Aggregation in Distributed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5419","kind":"arxiv","version":3},"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:82fec215068946ddc2bf4dfd6500f6783e77004d9d84975d36c87b5ffae5450e","target":"record","created_at":"2026-05-18T04:07:52Z","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":"3552afe5fbfa698b086fae76fb2a325fe83fdd3063da84aacdd102eb75a22b1e","cross_cats_sorted":["cs.CC","cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-27T09:09:38Z","title_canon_sha256":"d70a9de58579c29d4a9983b0208bcc06228bbba57a5269a855780f9a1f236774"},"schema_version":"1.0","source":{"id":"1107.5419","kind":"arxiv","version":3}},"canonical_sha256":"f45e8c1e607469652ceea537cf549a8cb76a78ef42e1f60e0a15fc8a1db75e36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f45e8c1e607469652ceea537cf549a8cb76a78ef42e1f60e0a15fc8a1db75e36","first_computed_at":"2026-05-18T04:07:52.479329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:52.479329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4duI2rpLlJIWZnW2cKnZn/LuSlLjWhvmgdRDQE9M2Uae6oapXakLAPGYwF7DT8tQ+7PpyqNxpNnCdOuBX/zTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:52.479896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5419","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82fec215068946ddc2bf4dfd6500f6783e77004d9d84975d36c87b5ffae5450e","sha256:66c161fce8e172fe0f6b49725c1af3de225c2043316f2814bdbf3ec5784b2eee"],"state_sha256":"1c39d03283c328ad0b86db3746d914daff401873b132a8090e82c1710523913b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AF6aOYjADXM+gqFfj1UpI3oo0NR6gAp4MVdBl6Nbv/LLYNGfwuLoFiGXCL9ngWHVvLLTOz/7yvgSBtbMGi5wBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:08.754880Z","bundle_sha256":"a94963c11f0d34cad528cdd04d1e7e83a173a003ce8a9f6f9efce2fa6dd49c91"}}