{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T2G3OL7TYZ62R7WEN7UF27UDVX","short_pith_number":"pith:T2G3OL7T","canonical_record":{"source":{"id":"1602.04419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-14T05:35:30Z","cross_cats_sorted":[],"title_canon_sha256":"8176523d7b649319f5ceecda52a4547492bcef3648520c88e4dfde36113b5e35","abstract_canon_sha256":"932d14a3783d741219518f9005fa298bfb2ebd331b3103ae14a7df5d1437f3db"},"schema_version":"1.0"},"canonical_sha256":"9e8db72ff3c67da8fec46fe85d7e83adf24c4b5ecf22725c4122253e86495a73","source":{"kind":"arxiv","id":"1602.04419","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04419","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04419v3","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04419","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"T2G3OL7TYZ62","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T2G3OL7TYZ62R7WE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T2G3OL7T","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T2G3OL7TYZ62R7WEN7UF27UDVX","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-14T05:35:30Z","cross_cats_sorted":[],"title_canon_sha256":"8176523d7b649319f5ceecda52a4547492bcef3648520c88e4dfde36113b5e35","abstract_canon_sha256":"932d14a3783d741219518f9005fa298bfb2ebd331b3103ae14a7df5d1437f3db"},"schema_version":"1.0"},"canonical_sha256":"9e8db72ff3c67da8fec46fe85d7e83adf24c4b5ecf22725c4122253e86495a73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:12.535618Z","signature_b64":"9Axj8s0Ve03WBGDdGbYRSwtO5CTmsHJtDYMSLhQdhIxZVRAdu/tTQcyq8LsiED35hiK9+rPnaeIdVpt4eBjVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e8db72ff3c67da8fec46fe85d7e83adf24c4b5ecf22725c4122253e86495a73","last_reissued_at":"2026-05-18T01:00:12.534919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:12.534919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04419","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-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"En2WQ98I+qDOsXri2tsKL3vDgHuuqsNC+coktfPr5qO2Gc+V2xuapi5A9TGkfDCom4WfuMs1rHbrBEQrnoADAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:51:32.548394Z"},"content_sha256":"dec41c264735e4ea0cfb3c3fadd4634e80cde5cba8d791c3d180fc2557e13b5f","schema_version":"1.0","event_id":"sha256:dec41c264735e4ea0cfb3c3fadd4634e80cde5cba8d791c3d180fc2557e13b5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T2G3OL7TYZ62R7WEN7UF27UDVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman, Emanuele Natale, Lucas Boczkowski","submitted_at":"2016-02-14T05:35:30Z","abstract_excerpt":"This paper considers the basic $\\mathcal{PULL}$ model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each interaction (message size) that nevertheless allows for efficient and robust computations of fundamental information dissemination tasks. We focus on the Majority Bit Dissemination problem that considers a population of $n$ agents, with a designated subset of source agents. Each source agent holds an input bit and each agent holds an output bit. The goal is to let "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04419","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-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vl51qhvk7K9NY8Ij5kENcjk0s6lAomfDqHLxPw4qvp6fDYMkO4C2xlXbGQY4DDQa2k6M7dVpLh3YZJDIZAD7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:51:32.548744Z"},"content_sha256":"354fb836e4d8d018b844a0da6adca62beed6830c1dae0aa6e0714c22d373340f","schema_version":"1.0","event_id":"sha256:354fb836e4d8d018b844a0da6adca62beed6830c1dae0aa6e0714c22d373340f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2G3OL7TYZ62R7WEN7UF27UDVX/bundle.json","state_url":"https://pith.science/pith/T2G3OL7TYZ62R7WEN7UF27UDVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2G3OL7TYZ62R7WEN7UF27UDVX/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-06-20T21:51:32Z","links":{"resolver":"https://pith.science/pith/T2G3OL7TYZ62R7WEN7UF27UDVX","bundle":"https://pith.science/pith/T2G3OL7TYZ62R7WEN7UF27UDVX/bundle.json","state":"https://pith.science/pith/T2G3OL7TYZ62R7WEN7UF27UDVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2G3OL7TYZ62R7WEN7UF27UDVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T2G3OL7TYZ62R7WEN7UF27UDVX","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":"932d14a3783d741219518f9005fa298bfb2ebd331b3103ae14a7df5d1437f3db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-14T05:35:30Z","title_canon_sha256":"8176523d7b649319f5ceecda52a4547492bcef3648520c88e4dfde36113b5e35"},"schema_version":"1.0","source":{"id":"1602.04419","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04419","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04419v3","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04419","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"T2G3OL7TYZ62","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T2G3OL7TYZ62R7WE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T2G3OL7T","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:354fb836e4d8d018b844a0da6adca62beed6830c1dae0aa6e0714c22d373340f","target":"graph","created_at":"2026-05-18T01:00:12Z","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":"This paper considers the basic $\\mathcal{PULL}$ model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each interaction (message size) that nevertheless allows for efficient and robust computations of fundamental information dissemination tasks. We focus on the Majority Bit Dissemination problem that considers a population of $n$ agents, with a designated subset of source agents. Each source agent holds an input bit and each agent holds an output bit. The goal is to let ","authors_text":"Amos Korman, Emanuele Natale, Lucas Boczkowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-14T05:35:30Z","title":"Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04419","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:dec41c264735e4ea0cfb3c3fadd4634e80cde5cba8d791c3d180fc2557e13b5f","target":"record","created_at":"2026-05-18T01:00:12Z","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":"932d14a3783d741219518f9005fa298bfb2ebd331b3103ae14a7df5d1437f3db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-14T05:35:30Z","title_canon_sha256":"8176523d7b649319f5ceecda52a4547492bcef3648520c88e4dfde36113b5e35"},"schema_version":"1.0","source":{"id":"1602.04419","kind":"arxiv","version":3}},"canonical_sha256":"9e8db72ff3c67da8fec46fe85d7e83adf24c4b5ecf22725c4122253e86495a73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e8db72ff3c67da8fec46fe85d7e83adf24c4b5ecf22725c4122253e86495a73","first_computed_at":"2026-05-18T01:00:12.534919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:12.534919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Axj8s0Ve03WBGDdGbYRSwtO5CTmsHJtDYMSLhQdhIxZVRAdu/tTQcyq8LsiED35hiK9+rPnaeIdVpt4eBjVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:12.535618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04419","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dec41c264735e4ea0cfb3c3fadd4634e80cde5cba8d791c3d180fc2557e13b5f","sha256:354fb836e4d8d018b844a0da6adca62beed6830c1dae0aa6e0714c22d373340f"],"state_sha256":"0613f7d45fafcee22914208dd59b33d50c82f805dfcdb12bcc4bce0223e49a48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kr3LY/j0ODWJti0ZBtqAkbHCaS/AmMi4ntGEoWyOL59BOD68H5WupcN7bvVmu+eafMQEdUIqgyc/fIyPwFoIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:51:32.550682Z","bundle_sha256":"a10737bff97ca220ac5a5ea70e843ac2adeb01d197d94e05697f02004720f398"}}