{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:THQPUHUXNLMWFQYYHTBTNPMT45","short_pith_number":"pith:THQPUHUX","canonical_record":{"source":{"id":"1008.4896","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-29T01:44:02Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"2d8257c3a81e47a4130a755f7523495953b55a1556b1ee6b2eecf6caf6b9dce5","abstract_canon_sha256":"94569dad9e169389b9f6a1bf85848bda05c2bb28e51bc77b905bcfdf1fdf1a51"},"schema_version":"1.0"},"canonical_sha256":"99e0fa1e976ad962c3183cc336bd93e74f3d0bc9e4244ccb617242c2896bc8ec","source":{"kind":"arxiv","id":"1008.4896","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4896","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4896v4","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4896","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"THQPUHUXNLMW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"THQPUHUXNLMWFQYY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"THQPUHUX","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:THQPUHUXNLMWFQYYHTBTNPMT45","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4896","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-29T01:44:02Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"2d8257c3a81e47a4130a755f7523495953b55a1556b1ee6b2eecf6caf6b9dce5","abstract_canon_sha256":"94569dad9e169389b9f6a1bf85848bda05c2bb28e51bc77b905bcfdf1fdf1a51"},"schema_version":"1.0"},"canonical_sha256":"99e0fa1e976ad962c3183cc336bd93e74f3d0bc9e4244ccb617242c2896bc8ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:57.106050Z","signature_b64":"jR4TpqUGaaRirWfkpTPJgB9zgtfjkIwiYalA7vC0tvo4ueVBAoK0mgMQsV7s8yW+3lbyqqVXDLcrgNslSqr2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e0fa1e976ad962c3183cc336bd93e74f3d0bc9e4244ccb617242c2896bc8ec","last_reissued_at":"2026-05-18T04:10:57.105611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:57.105611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4896","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-18T04:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnYnyMReBqr4F2X3IdfRsVLLP7K8+KXHspFctV4TpSSC+583rdPiUdLkceX5BHACyqXpUQBB3gLSYN7tEGQrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:11:28.547491Z"},"content_sha256":"241bc8b5a2b6fbaa735070ee3d109e01ef495cd6e2a3cddaf47f6e468035a26d","schema_version":"1.0","event_id":"sha256:241bc8b5a2b6fbaa735070ee3d109e01ef495cd6e2a3cddaf47f6e468035a26d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:THQPUHUXNLMWFQYYHTBTNPMT45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Routing with Mutual Information Accumulation in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Michael J. Neely, Rahul Urgaonkar","submitted_at":"2010-08-29T01:44:02Z","abstract_excerpt":"We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual information from every packet transmission. This enables a significant performance gain over conventional shortest path routing. Further, it outperforms cooperative communication techniques that are based on energy accumulation. However, it requires complex and combinatorial networking decisions concerning which nodes participate in transmission, and which decode ordering to use. We formulate three problems of interest "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4896","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-18T04:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbI6Iwxc2WSl7aXT9BhpN381gsqHjZeMpkMUb4Bbf6wiaA7qFvGy1P8m7dhYReEX9+EoAA1LMMpVUltasn5lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:11:28.548141Z"},"content_sha256":"18db95f1fe45d85d333834a135ce32c3094eb600f5c3a3d00e4ce2542562d5fa","schema_version":"1.0","event_id":"sha256:18db95f1fe45d85d333834a135ce32c3094eb600f5c3a3d00e4ce2542562d5fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THQPUHUXNLMWFQYYHTBTNPMT45/bundle.json","state_url":"https://pith.science/pith/THQPUHUXNLMWFQYYHTBTNPMT45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THQPUHUXNLMWFQYYHTBTNPMT45/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-30T13:11:28Z","links":{"resolver":"https://pith.science/pith/THQPUHUXNLMWFQYYHTBTNPMT45","bundle":"https://pith.science/pith/THQPUHUXNLMWFQYYHTBTNPMT45/bundle.json","state":"https://pith.science/pith/THQPUHUXNLMWFQYYHTBTNPMT45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THQPUHUXNLMWFQYYHTBTNPMT45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:THQPUHUXNLMWFQYYHTBTNPMT45","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":"94569dad9e169389b9f6a1bf85848bda05c2bb28e51bc77b905bcfdf1fdf1a51","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-29T01:44:02Z","title_canon_sha256":"2d8257c3a81e47a4130a755f7523495953b55a1556b1ee6b2eecf6caf6b9dce5"},"schema_version":"1.0","source":{"id":"1008.4896","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4896","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4896v4","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4896","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"THQPUHUXNLMW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"THQPUHUXNLMWFQYY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"THQPUHUX","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:18db95f1fe45d85d333834a135ce32c3094eb600f5c3a3d00e4ce2542562d5fa","target":"graph","created_at":"2026-05-18T04:10:57Z","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 investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual information from every packet transmission. This enables a significant performance gain over conventional shortest path routing. Further, it outperforms cooperative communication techniques that are based on energy accumulation. However, it requires complex and combinatorial networking decisions concerning which nodes participate in transmission, and which decode ordering to use. We formulate three problems of interest ","authors_text":"Michael J. Neely, Rahul Urgaonkar","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-29T01:44:02Z","title":"Optimal Routing with Mutual Information Accumulation in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4896","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:241bc8b5a2b6fbaa735070ee3d109e01ef495cd6e2a3cddaf47f6e468035a26d","target":"record","created_at":"2026-05-18T04:10:57Z","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":"94569dad9e169389b9f6a1bf85848bda05c2bb28e51bc77b905bcfdf1fdf1a51","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-29T01:44:02Z","title_canon_sha256":"2d8257c3a81e47a4130a755f7523495953b55a1556b1ee6b2eecf6caf6b9dce5"},"schema_version":"1.0","source":{"id":"1008.4896","kind":"arxiv","version":4}},"canonical_sha256":"99e0fa1e976ad962c3183cc336bd93e74f3d0bc9e4244ccb617242c2896bc8ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e0fa1e976ad962c3183cc336bd93e74f3d0bc9e4244ccb617242c2896bc8ec","first_computed_at":"2026-05-18T04:10:57.105611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:57.105611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jR4TpqUGaaRirWfkpTPJgB9zgtfjkIwiYalA7vC0tvo4ueVBAoK0mgMQsV7s8yW+3lbyqqVXDLcrgNslSqr2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:57.106050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4896","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:241bc8b5a2b6fbaa735070ee3d109e01ef495cd6e2a3cddaf47f6e468035a26d","sha256:18db95f1fe45d85d333834a135ce32c3094eb600f5c3a3d00e4ce2542562d5fa"],"state_sha256":"e4cd1ae3a89258ebdd283d3c3b24cbbeaf4ba9a5e12080044f38fffeb5038118"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQkQDTTwc7Ade3wGI/FXougoBN5iEezX90lgJUsxxmzqVw9rdmHUSE54sNN0P5kNAnbUckFU1qJuqvr8krAyAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:11:28.551311Z","bundle_sha256":"86f663b8fb33c43a905c59be2c328e668377ca156b0fb90bb894c3e3f3507474"}}