{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:63NMPNABKKAKJ44HJRZ3EX3KOW","short_pith_number":"pith:63NMPNAB","canonical_record":{"source":{"id":"1109.2583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T19:53:47Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"bb510feff7a3b4778cbd7d85835ddde291b3b23f8e22f5ae1605d87882aa2c08","abstract_canon_sha256":"1577170b5b08371bd8bc0480268236337377d66b57e0f98a35ca40f75550a172"},"schema_version":"1.0"},"canonical_sha256":"f6dac7b4015280a4f3874c73b25f6a75afaa42741726a7388c739179dc1e621d","source":{"kind":"arxiv","id":"1109.2583","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2583","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2583v2","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2583","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"63NMPNABKKAK","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"63NMPNABKKAKJ44H","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"63NMPNAB","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:63NMPNABKKAKJ44HJRZ3EX3KOW","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T19:53:47Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"bb510feff7a3b4778cbd7d85835ddde291b3b23f8e22f5ae1605d87882aa2c08","abstract_canon_sha256":"1577170b5b08371bd8bc0480268236337377d66b57e0f98a35ca40f75550a172"},"schema_version":"1.0"},"canonical_sha256":"f6dac7b4015280a4f3874c73b25f6a75afaa42741726a7388c739179dc1e621d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:02.324658Z","signature_b64":"+5Wc63xWNli+WpN5U4zWFnwdUSVDmalN4Ex+HRaP0aOcnZ515c6cDoHFHyxEZrxfXXAS5QS409D0rku+dj8UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6dac7b4015280a4f3874c73b25f6a75afaa42741726a7388c739179dc1e621d","last_reissued_at":"2026-05-18T03:51:02.323994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:02.323994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2583","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:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFK5pX0aDbUe6S5Wn7g1zv+OdPyXSA4PQXzYs9eNrklAi0zHVxdnAZKKqLbRsc74sDLLDQnaYG6/cFax0ZlHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:32:53.111982Z"},"content_sha256":"1ee212cf8e41fff7f78e6a91a06f7a6fc30ef428a79d91671b9bdc5f0cc67824","schema_version":"1.0","event_id":"sha256:1ee212cf8e41fff7f78e6a91a06f7a6fc30ef428a79d91671b9bdc5f0cc67824"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:63NMPNABKKAKJ44HJRZ3EX3KOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Backpressure Scheduling in Wireless Networks using Mutual Information Accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Jing Yang, Stark C. Draper, Yanpei Liu","submitted_at":"2011-09-12T19:53:47Z","abstract_excerpt":"In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not sufficiently high that a packet can be decoded within a single slot, the system can accumulate information across multiple slots, eventually decoding the packet. The result is an expanded stability region. The accumulation process over weak links is temporally coupled and therefore does not satisfy the independent and identically distributed (i.i.d) assumpt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2583","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:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifx+viMHZ9R4gUtkROB2+BSCxuzzc13cXxBiwjs7l8IGtP+0Ust4kR6t/uliSGU7o8JQLoSxenyHZQRPfJv8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:32:53.112345Z"},"content_sha256":"fb8522c3046dff81dd19008887ecb4ab1e8f661b5e17da2b07682596243389cf","schema_version":"1.0","event_id":"sha256:fb8522c3046dff81dd19008887ecb4ab1e8f661b5e17da2b07682596243389cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63NMPNABKKAKJ44HJRZ3EX3KOW/bundle.json","state_url":"https://pith.science/pith/63NMPNABKKAKJ44HJRZ3EX3KOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63NMPNABKKAKJ44HJRZ3EX3KOW/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-04T23:32:53Z","links":{"resolver":"https://pith.science/pith/63NMPNABKKAKJ44HJRZ3EX3KOW","bundle":"https://pith.science/pith/63NMPNABKKAKJ44HJRZ3EX3KOW/bundle.json","state":"https://pith.science/pith/63NMPNABKKAKJ44HJRZ3EX3KOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63NMPNABKKAKJ44HJRZ3EX3KOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:63NMPNABKKAKJ44HJRZ3EX3KOW","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":"1577170b5b08371bd8bc0480268236337377d66b57e0f98a35ca40f75550a172","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T19:53:47Z","title_canon_sha256":"bb510feff7a3b4778cbd7d85835ddde291b3b23f8e22f5ae1605d87882aa2c08"},"schema_version":"1.0","source":{"id":"1109.2583","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2583","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2583v2","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2583","created_at":"2026-05-18T03:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"63NMPNABKKAK","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"63NMPNABKKAKJ44H","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"63NMPNAB","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:fb8522c3046dff81dd19008887ecb4ab1e8f661b5e17da2b07682596243389cf","target":"graph","created_at":"2026-05-18T03:51:02Z","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":"In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not sufficiently high that a packet can be decoded within a single slot, the system can accumulate information across multiple slots, eventually decoding the packet. The result is an expanded stability region. The accumulation process over weak links is temporally coupled and therefore does not satisfy the independent and identically distributed (i.i.d) assumpt","authors_text":"Jing Yang, Stark C. Draper, Yanpei Liu","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T19:53:47Z","title":"Optimal Backpressure Scheduling in Wireless Networks using Mutual Information Accumulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2583","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:1ee212cf8e41fff7f78e6a91a06f7a6fc30ef428a79d91671b9bdc5f0cc67824","target":"record","created_at":"2026-05-18T03:51:02Z","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":"1577170b5b08371bd8bc0480268236337377d66b57e0f98a35ca40f75550a172","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T19:53:47Z","title_canon_sha256":"bb510feff7a3b4778cbd7d85835ddde291b3b23f8e22f5ae1605d87882aa2c08"},"schema_version":"1.0","source":{"id":"1109.2583","kind":"arxiv","version":2}},"canonical_sha256":"f6dac7b4015280a4f3874c73b25f6a75afaa42741726a7388c739179dc1e621d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6dac7b4015280a4f3874c73b25f6a75afaa42741726a7388c739179dc1e621d","first_computed_at":"2026-05-18T03:51:02.323994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:02.323994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+5Wc63xWNli+WpN5U4zWFnwdUSVDmalN4Ex+HRaP0aOcnZ515c6cDoHFHyxEZrxfXXAS5QS409D0rku+dj8UAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:02.324658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2583","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ee212cf8e41fff7f78e6a91a06f7a6fc30ef428a79d91671b9bdc5f0cc67824","sha256:fb8522c3046dff81dd19008887ecb4ab1e8f661b5e17da2b07682596243389cf"],"state_sha256":"00cde87122789b07332f27f3e34aa49be05fdadc69cb42d370b3fb847b16fa73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9fN4wiDKd5VXXGB3ajqy5pGURdIEUMfd9oJzZpy9yAYn5Ht3q/BS8K/p1U8dJbgax9DEsBCYRee0IlSK4KzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:32:53.114478Z","bundle_sha256":"8e80f50bac3837c4f9ddc92c75de7c64223d81f995d6d4a84e61948d6eb25a75"}}