{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WG6IVMPW6QNS437I5I35IO4HLV","short_pith_number":"pith:WG6IVMPW","canonical_record":{"source":{"id":"1210.3187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-11T11:41:34Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"91e4ec479cda76a30b8b5acf4018b1bf5c9a96dbf514fcac70e2ef3d50f9c067","abstract_canon_sha256":"d167334d46b13f884c548df24567916bb97c28ffc62db4f46d45d76f9b6048ad"},"schema_version":"1.0"},"canonical_sha256":"b1bc8ab1f6f41b2e6fe8ea37d43b875d50c9aa9bb88c5c9086a78c81bf442ea3","source":{"kind":"arxiv","id":"1210.3187","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3187","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3187v2","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3187","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"WG6IVMPW6QNS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WG6IVMPW6QNS437I","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WG6IVMPW","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WG6IVMPW6QNS437I5I35IO4HLV","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-11T11:41:34Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"91e4ec479cda76a30b8b5acf4018b1bf5c9a96dbf514fcac70e2ef3d50f9c067","abstract_canon_sha256":"d167334d46b13f884c548df24567916bb97c28ffc62db4f46d45d76f9b6048ad"},"schema_version":"1.0"},"canonical_sha256":"b1bc8ab1f6f41b2e6fe8ea37d43b875d50c9aa9bb88c5c9086a78c81bf442ea3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:13.801561Z","signature_b64":"OeyT6f1Qe+R3LGe8IKGeZb9X6EiUZwwBzaT1NgP+cEXR29NVO6ZOgYoLNZ0m0l6ggRn5JlDCokHV8+cm4ynfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1bc8ab1f6f41b2e6fe8ea37d43b875d50c9aa9bb88c5c9086a78c81bf442ea3","last_reissued_at":"2026-05-18T03:34:13.800655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:13.800655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3187","source_version":2,"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-18T03:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3AATwLfiaI+8dilFJwj0gYiNUutp9SFhyYeJIZqaKa3lCzu7dm2nz5wYCVol+BKSP4cZEnrqG4EcdoWfqPe8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:01:02.820392Z"},"content_sha256":"6f7383d8073ba0b573a690a31a5e923330e700ee7e9844e850f9c138e80a377e","schema_version":"1.0","event_id":"sha256:6f7383d8073ba0b573a690a31a5e923330e700ee7e9844e850f9c138e80a377e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WG6IVMPW6QNS437I5I35IO4HLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An asymptotically optimal push-pull method for multicasting over a random network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Pramod Viswanath, Rajesh Sundaresan, Srikrishna Bhashyam, Vasuki Narasimha Swamy","submitted_at":"2012-10-11T11:41:34Z","abstract_excerpt":"We consider allcast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected links whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant alm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3187","kind":"arxiv","version":2},"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-18T03:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPfCa7p1SPEGYiw+ENssbUX5r6szhZasP5Hw98r6qZ1VsDSCRh2y2t85FuY/Zg3OP5DCYiMKlaVB4pRVaL2BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:01:02.820754Z"},"content_sha256":"f2f84376901e33351262607889352321ed9f09d4c39c8338087b7b9731f3bf09","schema_version":"1.0","event_id":"sha256:f2f84376901e33351262607889352321ed9f09d4c39c8338087b7b9731f3bf09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WG6IVMPW6QNS437I5I35IO4HLV/bundle.json","state_url":"https://pith.science/pith/WG6IVMPW6QNS437I5I35IO4HLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WG6IVMPW6QNS437I5I35IO4HLV/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-30T07:01:02Z","links":{"resolver":"https://pith.science/pith/WG6IVMPW6QNS437I5I35IO4HLV","bundle":"https://pith.science/pith/WG6IVMPW6QNS437I5I35IO4HLV/bundle.json","state":"https://pith.science/pith/WG6IVMPW6QNS437I5I35IO4HLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WG6IVMPW6QNS437I5I35IO4HLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WG6IVMPW6QNS437I5I35IO4HLV","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":"d167334d46b13f884c548df24567916bb97c28ffc62db4f46d45d76f9b6048ad","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-11T11:41:34Z","title_canon_sha256":"91e4ec479cda76a30b8b5acf4018b1bf5c9a96dbf514fcac70e2ef3d50f9c067"},"schema_version":"1.0","source":{"id":"1210.3187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3187","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3187v2","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3187","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"WG6IVMPW6QNS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WG6IVMPW6QNS437I","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WG6IVMPW","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:f2f84376901e33351262607889352321ed9f09d4c39c8338087b7b9731f3bf09","target":"graph","created_at":"2026-05-18T03:34:13Z","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 allcast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected links whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant alm","authors_text":"Pramod Viswanath, Rajesh Sundaresan, Srikrishna Bhashyam, Vasuki Narasimha Swamy","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-11T11:41:34Z","title":"An asymptotically optimal push-pull method for multicasting over a random network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3187","kind":"arxiv","version":2},"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:6f7383d8073ba0b573a690a31a5e923330e700ee7e9844e850f9c138e80a377e","target":"record","created_at":"2026-05-18T03:34:13Z","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":"d167334d46b13f884c548df24567916bb97c28ffc62db4f46d45d76f9b6048ad","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-11T11:41:34Z","title_canon_sha256":"91e4ec479cda76a30b8b5acf4018b1bf5c9a96dbf514fcac70e2ef3d50f9c067"},"schema_version":"1.0","source":{"id":"1210.3187","kind":"arxiv","version":2}},"canonical_sha256":"b1bc8ab1f6f41b2e6fe8ea37d43b875d50c9aa9bb88c5c9086a78c81bf442ea3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1bc8ab1f6f41b2e6fe8ea37d43b875d50c9aa9bb88c5c9086a78c81bf442ea3","first_computed_at":"2026-05-18T03:34:13.800655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:13.800655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OeyT6f1Qe+R3LGe8IKGeZb9X6EiUZwwBzaT1NgP+cEXR29NVO6ZOgYoLNZ0m0l6ggRn5JlDCokHV8+cm4ynfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:13.801561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f7383d8073ba0b573a690a31a5e923330e700ee7e9844e850f9c138e80a377e","sha256:f2f84376901e33351262607889352321ed9f09d4c39c8338087b7b9731f3bf09"],"state_sha256":"7838e3943fb9cc62f9ce105c15e718a4a273bfd50de40bcf7567fd016b4896ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OalZOgD1ckWlWQ4zj4Q/+IKzqiwDxzeoBWq2KwhwGWVTMx0u+Dy6G+43vSdOEXZPcN6AZdowgWqvliLhjBBoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:01:02.822859Z","bundle_sha256":"31bfddc0742757c092ab4de1ae5773ca4a560d6bd631d46e7b52415c3f62c48e"}}