{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GEWKXL6ZSCK6SONK4OMRDWMEYM","short_pith_number":"pith:GEWKXL6Z","canonical_record":{"source":{"id":"1204.3114","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-13T21:48:24Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"726af4ff6c206b9e7fb3958e0fb8666fb39a6ca9292a44c825bed1a023d176fa","abstract_canon_sha256":"20d6b6902225130f26d5e96b159cd7cf3ed80853c18dcaa49ecaf978026377c6"},"schema_version":"1.0"},"canonical_sha256":"312cabafd99095e939aae39911d984c31f08f8e55fc00ef71c38623771c61858","source":{"kind":"arxiv","id":"1204.3114","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3114","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3114v4","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3114","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"GEWKXL6ZSCK6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GEWKXL6ZSCK6SONK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GEWKXL6Z","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GEWKXL6ZSCK6SONK4OMRDWMEYM","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3114","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-13T21:48:24Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"726af4ff6c206b9e7fb3958e0fb8666fb39a6ca9292a44c825bed1a023d176fa","abstract_canon_sha256":"20d6b6902225130f26d5e96b159cd7cf3ed80853c18dcaa49ecaf978026377c6"},"schema_version":"1.0"},"canonical_sha256":"312cabafd99095e939aae39911d984c31f08f8e55fc00ef71c38623771c61858","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.846453Z","signature_b64":"wg6rB6BSORrNK4rGdP/HFKuiNLLq6ILogobWQ5/V+GGd1mG+AN0IsQVe/RFVTxWdqFT0LUcVjpTLg4AAvDnjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312cabafd99095e939aae39911d984c31f08f8e55fc00ef71c38623771c61858","last_reissued_at":"2026-05-18T02:30:08.845915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.845915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3114","source_version":4,"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CViIjrohRR5UVUJOGOH4Ci6oIiHtC9CmChcL/yuLV3QB5zL1GOFY1OgY2l+qoHVl11ryVFyR6BQj2NmJ/nZnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:19:40.641124Z"},"content_sha256":"be8cf5d5c2fa2bc6d2125ff6b4db2ec2fb7087dc458f7d2ba14cdc52ec433a43","schema_version":"1.0","event_id":"sha256:be8cf5d5c2fa2bc6d2125ff6b4db2ec2fb7087dc458f7d2ba14cdc52ec433a43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GEWKXL6ZSCK6SONK4OMRDWMEYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Role of Mobility for Multi-message Gossip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.SI","authors_text":"Jeffrey G. Andrews, Sanjay Shakkottai, Yuxin Chen","submitted_at":"2012-04-13T21:48:24Z","abstract_excerpt":"We consider information dissemination in a large $n$-user wireless network in which $k$ users wish to share a unique message with all other users. Each of the $n$ users only has knowledge of its own contents and state information; this corresponds to a one-sided push-only scenario. The goal is to disseminate all messages efficiently, hopefully achieving an order-optimal spreading rate over unicast wireless random networks. First, we show that a random-push strategy -- where a user sends its own or a received packet at random -- is order-wise suboptimal in a random geometric graph: specifically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3114","kind":"arxiv","version":4},"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPmQkyyIJEZo8Y+Ng6Cf7X57KlJu/IeuKKN+UkdjdzriieESlPu7uzoljWxpHBGvNqhnfNMKA9wIalAP2F3tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:19:40.641501Z"},"content_sha256":"ab1619bafc06b2e6c63359a7c29a0b97937e3d8b992a857d4e0fe69bb5082313","schema_version":"1.0","event_id":"sha256:ab1619bafc06b2e6c63359a7c29a0b97937e3d8b992a857d4e0fe69bb5082313"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEWKXL6ZSCK6SONK4OMRDWMEYM/bundle.json","state_url":"https://pith.science/pith/GEWKXL6ZSCK6SONK4OMRDWMEYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEWKXL6ZSCK6SONK4OMRDWMEYM/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-10T19:19:40Z","links":{"resolver":"https://pith.science/pith/GEWKXL6ZSCK6SONK4OMRDWMEYM","bundle":"https://pith.science/pith/GEWKXL6ZSCK6SONK4OMRDWMEYM/bundle.json","state":"https://pith.science/pith/GEWKXL6ZSCK6SONK4OMRDWMEYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEWKXL6ZSCK6SONK4OMRDWMEYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GEWKXL6ZSCK6SONK4OMRDWMEYM","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":"20d6b6902225130f26d5e96b159cd7cf3ed80853c18dcaa49ecaf978026377c6","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-13T21:48:24Z","title_canon_sha256":"726af4ff6c206b9e7fb3958e0fb8666fb39a6ca9292a44c825bed1a023d176fa"},"schema_version":"1.0","source":{"id":"1204.3114","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3114","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3114v4","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3114","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"GEWKXL6ZSCK6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GEWKXL6ZSCK6SONK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GEWKXL6Z","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:ab1619bafc06b2e6c63359a7c29a0b97937e3d8b992a857d4e0fe69bb5082313","target":"graph","created_at":"2026-05-18T02:30:08Z","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 information dissemination in a large $n$-user wireless network in which $k$ users wish to share a unique message with all other users. Each of the $n$ users only has knowledge of its own contents and state information; this corresponds to a one-sided push-only scenario. The goal is to disseminate all messages efficiently, hopefully achieving an order-optimal spreading rate over unicast wireless random networks. First, we show that a random-push strategy -- where a user sends its own or a received packet at random -- is order-wise suboptimal in a random geometric graph: specifically","authors_text":"Jeffrey G. Andrews, Sanjay Shakkottai, Yuxin Chen","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-13T21:48:24Z","title":"On the Role of Mobility for Multi-message Gossip"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3114","kind":"arxiv","version":4},"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:be8cf5d5c2fa2bc6d2125ff6b4db2ec2fb7087dc458f7d2ba14cdc52ec433a43","target":"record","created_at":"2026-05-18T02:30:08Z","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":"20d6b6902225130f26d5e96b159cd7cf3ed80853c18dcaa49ecaf978026377c6","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-13T21:48:24Z","title_canon_sha256":"726af4ff6c206b9e7fb3958e0fb8666fb39a6ca9292a44c825bed1a023d176fa"},"schema_version":"1.0","source":{"id":"1204.3114","kind":"arxiv","version":4}},"canonical_sha256":"312cabafd99095e939aae39911d984c31f08f8e55fc00ef71c38623771c61858","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"312cabafd99095e939aae39911d984c31f08f8e55fc00ef71c38623771c61858","first_computed_at":"2026-05-18T02:30:08.845915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:08.845915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wg6rB6BSORrNK4rGdP/HFKuiNLLq6ILogobWQ5/V+GGd1mG+AN0IsQVe/RFVTxWdqFT0LUcVjpTLg4AAvDnjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:08.846453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3114","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be8cf5d5c2fa2bc6d2125ff6b4db2ec2fb7087dc458f7d2ba14cdc52ec433a43","sha256:ab1619bafc06b2e6c63359a7c29a0b97937e3d8b992a857d4e0fe69bb5082313"],"state_sha256":"30ae0fc3ed1aa97882d608dc1e51dcf84b6e694703e4dd07bf9bbbdb70089770"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWXoQspwkp9sEnun+bcpJAPvHAGRtPSdwBVNFBORQanMmvxOhMoesrIAyCoCyNN+khKlG4BhHEArwK4Gbsl5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:19:40.643464Z","bundle_sha256":"c82904278a24b9f70e40f8324cec76627f9ad9222be790a4e2c16d01b1195eb6"}}