{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UN7NHO3CDPMWHAZJWTLHX77CMV","short_pith_number":"pith:UN7NHO3C","canonical_record":{"source":{"id":"1004.3714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-21T14:21:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64a37605966d0d703b6bc803a81c4aed93000853d3df35ab5d3568ae9a74f811","abstract_canon_sha256":"3d528ad96b974ddd3d6c9cc8893aaa79a95930f91afcc7ac6f10228f1e574a27"},"schema_version":"1.0"},"canonical_sha256":"a37ed3bb621bd9638329b4d67bffe2657fa53437ee6a3a2cb2c825b31e0d677f","source":{"kind":"arxiv","id":"1004.3714","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3714","created_at":"2026-05-18T03:34:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3714v3","created_at":"2026-05-18T03:34:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3714","created_at":"2026-05-18T03:34:16Z"},{"alias_kind":"pith_short_12","alias_value":"UN7NHO3CDPMW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UN7NHO3CDPMWHAZJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UN7NHO3C","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UN7NHO3CDPMWHAZJWTLHX77CMV","target":"record","payload":{"canonical_record":{"source":{"id":"1004.3714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-21T14:21:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64a37605966d0d703b6bc803a81c4aed93000853d3df35ab5d3568ae9a74f811","abstract_canon_sha256":"3d528ad96b974ddd3d6c9cc8893aaa79a95930f91afcc7ac6f10228f1e574a27"},"schema_version":"1.0"},"canonical_sha256":"a37ed3bb621bd9638329b4d67bffe2657fa53437ee6a3a2cb2c825b31e0d677f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:16.546716Z","signature_b64":"JbUkBrECWjp6EK572Alc44aTArtY9T08xj+TYV/TqDj7iGSRy7mxJJ165che4crcImz/PJiUgVMSwRLQ625WAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a37ed3bb621bd9638329b4d67bffe2657fa53437ee6a3a2cb2c825b31e0d677f","last_reissued_at":"2026-05-18T03:34:16.545922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:16.545922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.3714","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-18T03:34:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDQN8a+14KoKWS5lF+DPMVeSxN0LohigLVi7WXm5+J+hhAxFIMPIMTNj3bIZBn9O5/RtE3Rj2Lh1TQl2Vt7JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:54:10.071209Z"},"content_sha256":"4d424ab6b55c977abe2e935ddcdb50feabe6d49cc2d765eecf0ef3c9e367bad8","schema_version":"1.0","event_id":"sha256:4d424ab6b55c977abe2e935ddcdb50feabe6d49cc2d765eecf0ef3c9e367bad8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UN7NHO3CDPMWHAZJWTLHX77CMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jeffrey G. Andrews, Yuxin Chen","submitted_at":"2010-04-21T14:21:59Z","abstract_excerpt":"This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower bound on the outage probability is derived in terms of the expected number of potential paths. This is in turn used to provide an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3714","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-18T03:34:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4CU1yYbqpulAVhsITRL6jnZmdHacmVEIZwGk7hDazB3Ml/xu2elMoZUJOtTsdPjKpgaWgGm9ohH+jKPGgXeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:54:10.071860Z"},"content_sha256":"9ec16d301ab8da186fcfaf33ee3dd81745d9cf520a22a41e14ce0c7b33376c8a","schema_version":"1.0","event_id":"sha256:9ec16d301ab8da186fcfaf33ee3dd81745d9cf520a22a41e14ce0c7b33376c8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UN7NHO3CDPMWHAZJWTLHX77CMV/bundle.json","state_url":"https://pith.science/pith/UN7NHO3CDPMWHAZJWTLHX77CMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UN7NHO3CDPMWHAZJWTLHX77CMV/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-12T05:54:10Z","links":{"resolver":"https://pith.science/pith/UN7NHO3CDPMWHAZJWTLHX77CMV","bundle":"https://pith.science/pith/UN7NHO3CDPMWHAZJWTLHX77CMV/bundle.json","state":"https://pith.science/pith/UN7NHO3CDPMWHAZJWTLHX77CMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UN7NHO3CDPMWHAZJWTLHX77CMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UN7NHO3CDPMWHAZJWTLHX77CMV","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":"3d528ad96b974ddd3d6c9cc8893aaa79a95930f91afcc7ac6f10228f1e574a27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-21T14:21:59Z","title_canon_sha256":"64a37605966d0d703b6bc803a81c4aed93000853d3df35ab5d3568ae9a74f811"},"schema_version":"1.0","source":{"id":"1004.3714","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3714","created_at":"2026-05-18T03:34:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3714v3","created_at":"2026-05-18T03:34:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3714","created_at":"2026-05-18T03:34:16Z"},{"alias_kind":"pith_short_12","alias_value":"UN7NHO3CDPMW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UN7NHO3CDPMWHAZJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UN7NHO3C","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:9ec16d301ab8da186fcfaf33ee3dd81745d9cf520a22a41e14ce0c7b33376c8a","target":"graph","created_at":"2026-05-18T03:34:16Z","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 develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower bound on the outage probability is derived in terms of the expected number of potential paths. This is in turn used to provide an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the ma","authors_text":"Jeffrey G. Andrews, Yuxin Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-21T14:21:59Z","title":"An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3714","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:4d424ab6b55c977abe2e935ddcdb50feabe6d49cc2d765eecf0ef3c9e367bad8","target":"record","created_at":"2026-05-18T03:34:16Z","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":"3d528ad96b974ddd3d6c9cc8893aaa79a95930f91afcc7ac6f10228f1e574a27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-21T14:21:59Z","title_canon_sha256":"64a37605966d0d703b6bc803a81c4aed93000853d3df35ab5d3568ae9a74f811"},"schema_version":"1.0","source":{"id":"1004.3714","kind":"arxiv","version":3}},"canonical_sha256":"a37ed3bb621bd9638329b4d67bffe2657fa53437ee6a3a2cb2c825b31e0d677f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a37ed3bb621bd9638329b4d67bffe2657fa53437ee6a3a2cb2c825b31e0d677f","first_computed_at":"2026-05-18T03:34:16.545922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:16.545922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JbUkBrECWjp6EK572Alc44aTArtY9T08xj+TYV/TqDj7iGSRy7mxJJ165che4crcImz/PJiUgVMSwRLQ625WAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:16.546716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.3714","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d424ab6b55c977abe2e935ddcdb50feabe6d49cc2d765eecf0ef3c9e367bad8","sha256:9ec16d301ab8da186fcfaf33ee3dd81745d9cf520a22a41e14ce0c7b33376c8a"],"state_sha256":"6255f4af7736bd5b691b67f88ede8cd51a1489829c954771f0a4ea4b957b102b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YiTShou4GRZqfjS3OpLuZhESVsJ8OIO45MLlGpvW9DvbEQWwWsLDa9CqcE382pGhK6FQgTGEaWN71vD4sb/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:54:10.075130Z","bundle_sha256":"a6ef903973e547a7830f3b9abea5f8de40a0fa8affff9bf791d14a0d2a028d38"}}