{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NWFWTSAQU5DV35TMVM3HUM7KTV","short_pith_number":"pith:NWFWTSAQ","canonical_record":{"source":{"id":"1305.5588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-24T00:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"f2464d5d5c08e92038640759c5395d6f0b7c128fc121ab63bc50474ef85f8b49","abstract_canon_sha256":"70a1fce802ce3d797e7627395795ad0936498ac106417efa414be24efd6cd664"},"schema_version":"1.0"},"canonical_sha256":"6d8b69c810a7475df66cab367a33ea9d5dcd29447ca3e18f00cb53cb139a1e50","source":{"kind":"arxiv","id":"1305.5588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5588","created_at":"2026-05-18T00:36:19Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5588v1","created_at":"2026-05-18T00:36:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5588","created_at":"2026-05-18T00:36:19Z"},{"alias_kind":"pith_short_12","alias_value":"NWFWTSAQU5DV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NWFWTSAQU5DV35TM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NWFWTSAQ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NWFWTSAQU5DV35TMVM3HUM7KTV","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-24T00:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"f2464d5d5c08e92038640759c5395d6f0b7c128fc121ab63bc50474ef85f8b49","abstract_canon_sha256":"70a1fce802ce3d797e7627395795ad0936498ac106417efa414be24efd6cd664"},"schema_version":"1.0"},"canonical_sha256":"6d8b69c810a7475df66cab367a33ea9d5dcd29447ca3e18f00cb53cb139a1e50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:19.953168Z","signature_b64":"4I/XdZQMXWkNE5IabhZxH3A1qQfvJ0g1vfDnB9AjTLnfqMJc0AyCqU+PN3GD4nVqfBlvry+YI3udkRTbljp/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d8b69c810a7475df66cab367a33ea9d5dcd29447ca3e18f00cb53cb139a1e50","last_reissued_at":"2026-05-18T00:36:19.952634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:19.952634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5588","source_version":1,"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:36:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOSAXOR86QdnmaNjhOSHaSw7iFynfE8zJG9LlhkmQhgQWdUc8wLluatGGCS7IVfEzSmDzPeD8Ak4ZrOxdn+mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:44:04.430785Z"},"content_sha256":"41f84dd6aab652a1346102c782a74404bd880dcf00a2aaa5d17f6b6ef88e95e8","schema_version":"1.0","event_id":"sha256:41f84dd6aab652a1346102c782a74404bd880dcf00a2aaa5d17f6b6ef88e95e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NWFWTSAQU5DV35TMVM3HUM7KTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diversity Backpressure Scheduling and Routing with Mutual Information Accumulation in Wireless Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andreas F. Molisch, Hao Feng","submitted_at":"2013-05-24T00:40:36Z","abstract_excerpt":"We suggest and analyze algorithms for routing in multi-hop wireless ad-hoc networks that exploit mutual information accumulation as the physical layer transmission scheme, and are capable of routing multiple packet streams (commodities) when only the average channel state information is present and that only locally. The proposed algorithms are modifications of the Diversity Backpressure (DIVBAR) algorithm, under which the packet whose commodity has the largest \"backpressure metric\" is chosen to be transmitted and is forwarded through the link with the largest differential backlog (queue lengt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5588","kind":"arxiv","version":1},"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:36:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gLSQC7TT4QrkuvNul/TpWngqyaHoLV+uqdU1wUC83Mx33y5N0Cm8gb20qF2onWpHfGyRvO+p5hOAWjxAi8TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:44:04.431502Z"},"content_sha256":"cc7c92a8353c1d4375c63977cb3ce6b85468cd21806d3721bf8eaa6c610654c1","schema_version":"1.0","event_id":"sha256:cc7c92a8353c1d4375c63977cb3ce6b85468cd21806d3721bf8eaa6c610654c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWFWTSAQU5DV35TMVM3HUM7KTV/bundle.json","state_url":"https://pith.science/pith/NWFWTSAQU5DV35TMVM3HUM7KTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWFWTSAQU5DV35TMVM3HUM7KTV/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-06T06:44:04Z","links":{"resolver":"https://pith.science/pith/NWFWTSAQU5DV35TMVM3HUM7KTV","bundle":"https://pith.science/pith/NWFWTSAQU5DV35TMVM3HUM7KTV/bundle.json","state":"https://pith.science/pith/NWFWTSAQU5DV35TMVM3HUM7KTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWFWTSAQU5DV35TMVM3HUM7KTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NWFWTSAQU5DV35TMVM3HUM7KTV","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":"70a1fce802ce3d797e7627395795ad0936498ac106417efa414be24efd6cd664","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-24T00:40:36Z","title_canon_sha256":"f2464d5d5c08e92038640759c5395d6f0b7c128fc121ab63bc50474ef85f8b49"},"schema_version":"1.0","source":{"id":"1305.5588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5588","created_at":"2026-05-18T00:36:19Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5588v1","created_at":"2026-05-18T00:36:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5588","created_at":"2026-05-18T00:36:19Z"},{"alias_kind":"pith_short_12","alias_value":"NWFWTSAQU5DV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NWFWTSAQU5DV35TM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NWFWTSAQ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:cc7c92a8353c1d4375c63977cb3ce6b85468cd21806d3721bf8eaa6c610654c1","target":"graph","created_at":"2026-05-18T00:36:19Z","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 suggest and analyze algorithms for routing in multi-hop wireless ad-hoc networks that exploit mutual information accumulation as the physical layer transmission scheme, and are capable of routing multiple packet streams (commodities) when only the average channel state information is present and that only locally. The proposed algorithms are modifications of the Diversity Backpressure (DIVBAR) algorithm, under which the packet whose commodity has the largest \"backpressure metric\" is chosen to be transmitted and is forwarded through the link with the largest differential backlog (queue lengt","authors_text":"Andreas F. Molisch, Hao Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-24T00:40:36Z","title":"Diversity Backpressure Scheduling and Routing with Mutual Information Accumulation in Wireless Ad-hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5588","kind":"arxiv","version":1},"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:41f84dd6aab652a1346102c782a74404bd880dcf00a2aaa5d17f6b6ef88e95e8","target":"record","created_at":"2026-05-18T00:36:19Z","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":"70a1fce802ce3d797e7627395795ad0936498ac106417efa414be24efd6cd664","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-24T00:40:36Z","title_canon_sha256":"f2464d5d5c08e92038640759c5395d6f0b7c128fc121ab63bc50474ef85f8b49"},"schema_version":"1.0","source":{"id":"1305.5588","kind":"arxiv","version":1}},"canonical_sha256":"6d8b69c810a7475df66cab367a33ea9d5dcd29447ca3e18f00cb53cb139a1e50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d8b69c810a7475df66cab367a33ea9d5dcd29447ca3e18f00cb53cb139a1e50","first_computed_at":"2026-05-18T00:36:19.952634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:19.952634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4I/XdZQMXWkNE5IabhZxH3A1qQfvJ0g1vfDnB9AjTLnfqMJc0AyCqU+PN3GD4nVqfBlvry+YI3udkRTbljp/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:19.953168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41f84dd6aab652a1346102c782a74404bd880dcf00a2aaa5d17f6b6ef88e95e8","sha256:cc7c92a8353c1d4375c63977cb3ce6b85468cd21806d3721bf8eaa6c610654c1"],"state_sha256":"c576f4702179b9739c47c11c9a0441e22fab9593f89016d337afb3aff267637c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OLwKHTaWGuuahvu6zvJDTdkiOsziSDmBr76cUdX/+PClKJ9Rr2VpIhrwt0zkDSRqoouDcC/KlmnaxTklDSeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:44:04.435217Z","bundle_sha256":"dd42f4bf23a33de89d370efe677f8808f124dfbfe50bd70b24942590e858a2f4"}}