{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4Y53EJIFBFTH7JS2UIPAHVYGCT","short_pith_number":"pith:4Y53EJIF","canonical_record":{"source":{"id":"1508.03660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T21:00:11Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"164dd956a60f710f086ae3710655e2195459e13276276606b80f7fd16e5f0182","abstract_canon_sha256":"c4c0f1460ee0a1d24ca909791915854f2043b08193c176921ffc7d252e55e1b8"},"schema_version":"1.0"},"canonical_sha256":"e63bb2250509667fa65aa21e03d70614f96162b2789ead99c7e281a4fa28d2d7","source":{"kind":"arxiv","id":"1508.03660","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03660","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03660v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03660","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"4Y53EJIFBFTH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4Y53EJIFBFTH7JS2","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4Y53EJIF","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4Y53EJIFBFTH7JS2UIPAHVYGCT","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T21:00:11Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"164dd956a60f710f086ae3710655e2195459e13276276606b80f7fd16e5f0182","abstract_canon_sha256":"c4c0f1460ee0a1d24ca909791915854f2043b08193c176921ffc7d252e55e1b8"},"schema_version":"1.0"},"canonical_sha256":"e63bb2250509667fa65aa21e03d70614f96162b2789ead99c7e281a4fa28d2d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.492101Z","signature_b64":"jhaJZN3MZtzQIu4sqZK1nMdO9pj53f3+lSxIvCuzpFqTj42ZUVm3ByZSLq1Zi3EJTqE9TK2Xt1WyHZI0KbWUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e63bb2250509667fa65aa21e03d70614f96162b2789ead99c7e281a4fa28d2d7","last_reissued_at":"2026-05-18T01:35:15.491530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.491530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03660","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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M86W2lqQ1V7zOl7YqLSIC5ZOR3qEQoyaCDs0I6in9cWOGBuUWatTLbE5iIzHelDvlOkFdCv9eLYARl28DzkDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:04.136534Z"},"content_sha256":"0e1120d866a3b6257c8c6a32f43900d3c2a3f2056bbd227e1a4c37df705ecaa2","schema_version":"1.0","event_id":"sha256:0e1120d866a3b6257c8c6a32f43900d3c2a3f2056bbd227e1a4c37df705ecaa2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4Y53EJIFBFTH7JS2UIPAHVYGCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing in Additive Networks with Bounded-Information Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Erez Kantor, Keren Censor-Hillel, Merav Parter, Nancy Lynch","submitted_at":"2015-08-14T21:00:11Z","abstract_excerpt":"This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is not high contention, as assumed previously, but rather guaranteeing a bounded amount of \\emph{information} in each neighborhood per round, a property that we show is achievable using a new random coding technique.\n  Technically, we provide efficient algorithms for fundamental distributed tasks in additive networks, such as solving various symmetry breaking "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03660","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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHnkoLtkQ2qhqbKL1ldOP0CVAiP85/XbYgeq6c1ZGqjpwa8xERlo4Qld6ULu+8vQYHJCEckPGFAayC/abItVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:04.137167Z"},"content_sha256":"5a238b54510b059772aa4028259dd058d76e60fb5d383edcb4143ba0ca66c5c7","schema_version":"1.0","event_id":"sha256:5a238b54510b059772aa4028259dd058d76e60fb5d383edcb4143ba0ca66c5c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4Y53EJIFBFTH7JS2UIPAHVYGCT/bundle.json","state_url":"https://pith.science/pith/4Y53EJIFBFTH7JS2UIPAHVYGCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4Y53EJIFBFTH7JS2UIPAHVYGCT/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-27T15:47:04Z","links":{"resolver":"https://pith.science/pith/4Y53EJIFBFTH7JS2UIPAHVYGCT","bundle":"https://pith.science/pith/4Y53EJIFBFTH7JS2UIPAHVYGCT/bundle.json","state":"https://pith.science/pith/4Y53EJIFBFTH7JS2UIPAHVYGCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4Y53EJIFBFTH7JS2UIPAHVYGCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4Y53EJIFBFTH7JS2UIPAHVYGCT","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":"c4c0f1460ee0a1d24ca909791915854f2043b08193c176921ffc7d252e55e1b8","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T21:00:11Z","title_canon_sha256":"164dd956a60f710f086ae3710655e2195459e13276276606b80f7fd16e5f0182"},"schema_version":"1.0","source":{"id":"1508.03660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03660","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03660v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03660","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"4Y53EJIFBFTH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4Y53EJIFBFTH7JS2","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4Y53EJIF","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:5a238b54510b059772aa4028259dd058d76e60fb5d383edcb4143ba0ca66c5c7","target":"graph","created_at":"2026-05-18T01:35:15Z","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 studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is not high contention, as assumed previously, but rather guaranteeing a bounded amount of \\emph{information} in each neighborhood per round, a property that we show is achievable using a new random coding technique.\n  Technically, we provide efficient algorithms for fundamental distributed tasks in additive networks, such as solving various symmetry breaking ","authors_text":"Erez Kantor, Keren Censor-Hillel, Merav Parter, Nancy Lynch","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T21:00:11Z","title":"Computing in Additive Networks with Bounded-Information Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03660","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:0e1120d866a3b6257c8c6a32f43900d3c2a3f2056bbd227e1a4c37df705ecaa2","target":"record","created_at":"2026-05-18T01:35:15Z","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":"c4c0f1460ee0a1d24ca909791915854f2043b08193c176921ffc7d252e55e1b8","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T21:00:11Z","title_canon_sha256":"164dd956a60f710f086ae3710655e2195459e13276276606b80f7fd16e5f0182"},"schema_version":"1.0","source":{"id":"1508.03660","kind":"arxiv","version":1}},"canonical_sha256":"e63bb2250509667fa65aa21e03d70614f96162b2789ead99c7e281a4fa28d2d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e63bb2250509667fa65aa21e03d70614f96162b2789ead99c7e281a4fa28d2d7","first_computed_at":"2026-05-18T01:35:15.491530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:15.491530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jhaJZN3MZtzQIu4sqZK1nMdO9pj53f3+lSxIvCuzpFqTj42ZUVm3ByZSLq1Zi3EJTqE9TK2Xt1WyHZI0KbWUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:15.492101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e1120d866a3b6257c8c6a32f43900d3c2a3f2056bbd227e1a4c37df705ecaa2","sha256:5a238b54510b059772aa4028259dd058d76e60fb5d383edcb4143ba0ca66c5c7"],"state_sha256":"8184349f14e078ae2a46aed459a1d4465a28bf1f919cf3a8d80118290541726b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAgt4ecKzPMUOvUajCCCX/gbqyL+h4p9ul8v2b/NoO+SRKXj8d4XU2OvGyJV9fKl6hF76H5cCS4hLOCHrE63DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:47:04.140182Z","bundle_sha256":"e70c9a00e9db48b2581feb95a1a11af1e942e396f080002bd34e53537c1db40c"}}