{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R","short_pith_number":"pith:GMBBPKQ3","canonical_record":{"source":{"id":"0802.2013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-14T14:09:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"833b1a98bd8093a387f08d5414358515b37bb498e581ae2266b2359b8f976aae","abstract_canon_sha256":"8d795878ffca3c3d19afadb621faec0d47569d10045da5cb78ee862e148bf920"},"schema_version":"1.0"},"canonical_sha256":"330217aa1bcbb2c3c3e9f22bccf085d469adb5c06b1271d0e7dd856747ccf985","source":{"kind":"arxiv","id":"0802.2013","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.2013","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0802.2013v2","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2013","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"GMBBPKQ3ZOZM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GMBBPKQ3ZOZMHQ7J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GMBBPKQ3","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R","target":"record","payload":{"canonical_record":{"source":{"id":"0802.2013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-14T14:09:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"833b1a98bd8093a387f08d5414358515b37bb498e581ae2266b2359b8f976aae","abstract_canon_sha256":"8d795878ffca3c3d19afadb621faec0d47569d10045da5cb78ee862e148bf920"},"schema_version":"1.0"},"canonical_sha256":"330217aa1bcbb2c3c3e9f22bccf085d469adb5c06b1271d0e7dd856747ccf985","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.751328Z","signature_b64":"yEhJnQQ1N6jns0uFUkiIjzoerWii6WDLpEgSbpv1qmNg74Sg2S0rQFUtU0ujrZFp84No0tz7OfXDnJ27gSaLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330217aa1bcbb2c3c3e9f22bccf085d469adb5c06b1271d0e7dd856747ccf985","last_reissued_at":"2026-05-18T00:58:25.750777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.750777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.2013","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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BhXmAijzFzh9L7Ff8uoXbIqP0K6rofnRdLqPeofHJK1/gW05rFtSFO5gErixjgis+NiMPc7DNGvVa9BKfu+yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:34:59.801562Z"},"content_sha256":"28c96c6416ec2e2f651602bbe52b7032b856dceac1cd9cf49826c7f99013d7f8","schema_version":"1.0","event_id":"sha256:28c96c6416ec2e2f651602bbe52b7032b856dceac1cd9cf49826c7f99013d7f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ayfer Ozgur, Olivier Leveque","submitted_at":"2008-02-14T14:09:59Z","abstract_excerpt":"Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be significantly larger than those of multihop schemes. A modification of the scheme is proposed here that achieves a throughput-delay trade-off $D(n)=(\\log n)^2 T(n)$ for T(n) between $\\Theta(\\sqrt{n}/\\log n)$ and $\\Theta(n/\\log n)$, where D(n) and T(n) are respectively the average delay per bit and the aggregate throughput in a network of n nod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2013","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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0BA8d9dZMVSfWSfFKcfm9Bwax/+OO+8YbiWFLGgE7UqPqsq/nMDI9B+KCUxxKeQ9JqgarJJ1kbtRV6U9Cs9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:34:59.802389Z"},"content_sha256":"0ebde8b8665c853967f4d3c0fa533d9a3e7c93d3b5a86275765191cbd70c3ba5","schema_version":"1.0","event_id":"sha256:0ebde8b8665c853967f4d3c0fa533d9a3e7c93d3b5a86275765191cbd70c3ba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R/bundle.json","state_url":"https://pith.science/pith/GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R/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-28T22:34:59Z","links":{"resolver":"https://pith.science/pith/GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R","bundle":"https://pith.science/pith/GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R/bundle.json","state":"https://pith.science/pith/GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:GMBBPKQ3ZOZMHQ7J6IV4Z4EF2R","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":"8d795878ffca3c3d19afadb621faec0d47569d10045da5cb78ee862e148bf920","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-14T14:09:59Z","title_canon_sha256":"833b1a98bd8093a387f08d5414358515b37bb498e581ae2266b2359b8f976aae"},"schema_version":"1.0","source":{"id":"0802.2013","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.2013","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0802.2013v2","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2013","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"GMBBPKQ3ZOZM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GMBBPKQ3ZOZMHQ7J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GMBBPKQ3","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:0ebde8b8665c853967f4d3c0fa533d9a3e7c93d3b5a86275765191cbd70c3ba5","target":"graph","created_at":"2026-05-18T00:58:25Z","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":"Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be significantly larger than those of multihop schemes. A modification of the scheme is proposed here that achieves a throughput-delay trade-off $D(n)=(\\log n)^2 T(n)$ for T(n) between $\\Theta(\\sqrt{n}/\\log n)$ and $\\Theta(n/\\log n)$, where D(n) and T(n) are respectively the average delay per bit and the aggregate throughput in a network of n nod","authors_text":"Ayfer Ozgur, Olivier Leveque","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-14T14:09:59Z","title":"Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2013","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:28c96c6416ec2e2f651602bbe52b7032b856dceac1cd9cf49826c7f99013d7f8","target":"record","created_at":"2026-05-18T00:58:25Z","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":"8d795878ffca3c3d19afadb621faec0d47569d10045da5cb78ee862e148bf920","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-14T14:09:59Z","title_canon_sha256":"833b1a98bd8093a387f08d5414358515b37bb498e581ae2266b2359b8f976aae"},"schema_version":"1.0","source":{"id":"0802.2013","kind":"arxiv","version":2}},"canonical_sha256":"330217aa1bcbb2c3c3e9f22bccf085d469adb5c06b1271d0e7dd856747ccf985","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330217aa1bcbb2c3c3e9f22bccf085d469adb5c06b1271d0e7dd856747ccf985","first_computed_at":"2026-05-18T00:58:25.750777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.750777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yEhJnQQ1N6jns0uFUkiIjzoerWii6WDLpEgSbpv1qmNg74Sg2S0rQFUtU0ujrZFp84No0tz7OfXDnJ27gSaLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.751328Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.2013","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28c96c6416ec2e2f651602bbe52b7032b856dceac1cd9cf49826c7f99013d7f8","sha256:0ebde8b8665c853967f4d3c0fa533d9a3e7c93d3b5a86275765191cbd70c3ba5"],"state_sha256":"8dcf55a31728c790ebc5ad0b2581a15a6c053ebbdc47ce8a95a8be1b775780b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30oAkMN4ow+9CrNAatPY61IN810c8rn7QDSbdAbDOUefNEet//QqhqcW4mFTE2cXzP7sHS0D88OU06QTU53TBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:34:59.805524Z","bundle_sha256":"b1d54a3f2e2045003945da6baaa0b9fab9cb8e67f6168eab5c17f97722badec2"}}