{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J23UD3S2LLZRZWD4RCRI27ZI3R","short_pith_number":"pith:J23UD3S2","canonical_record":{"source":{"id":"1108.3097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T21:00:24Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"378d974bc6a09803e176b1dfe06566ceb4d5d41245103097c3f305e2092eeabd","abstract_canon_sha256":"87f941a971bc4c9d9783b10fb108bff19d23b832961b10fd594e72ae36e4e111"},"schema_version":"1.0"},"canonical_sha256":"4eb741ee5a5af31cd87c88a28d7f28dc45aa2dd0a9a3fdbbd5f6d6963f1d0381","source":{"kind":"arxiv","id":"1108.3097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3097","created_at":"2026-05-18T04:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3097v1","created_at":"2026-05-18T04:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3097","created_at":"2026-05-18T04:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"J23UD3S2LLZR","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J23UD3S2LLZRZWD4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J23UD3S2","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J23UD3S2LLZRZWD4RCRI27ZI3R","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T21:00:24Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"378d974bc6a09803e176b1dfe06566ceb4d5d41245103097c3f305e2092eeabd","abstract_canon_sha256":"87f941a971bc4c9d9783b10fb108bff19d23b832961b10fd594e72ae36e4e111"},"schema_version":"1.0"},"canonical_sha256":"4eb741ee5a5af31cd87c88a28d7f28dc45aa2dd0a9a3fdbbd5f6d6963f1d0381","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:27.956012Z","signature_b64":"4TviqDSiMQKJix8cYZrXhR4cWa+fib72QGQlVDmHVDE57FX/YvUNlA98P+WXftZANqIfgEFp0Ei9t1D//LdbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eb741ee5a5af31cd87c88a28d7f28dc45aa2dd0a9a3fdbbd5f6d6963f1d0381","last_reissued_at":"2026-05-18T04:15:27.955633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:27.955633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3097","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-18T04:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzuJ7NHL93W23HaXuySXPUN6QxiLRyfo6wnRTp7i/+aoOg6PhyWZrJfoWldU/qU7+llPEraMOszzlMp/amhUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:13.938169Z"},"content_sha256":"72466d8e9ae7d720ea28239a8f788cd9add0554ed7f4e943d5fcb30a0d964220","schema_version":"1.0","event_id":"sha256:72466d8e9ae7d720ea28239a8f788cd9add0554ed7f4e943d5fcb30a0d964220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J23UD3S2LLZRZWD4RCRI27ZI3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Packet Routing 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-08-15T21:00:24Z","abstract_excerpt":"We consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We consider a unicast setting and arbitrary arrival processes at the source node. Source arrivals can be broken down into numerous packets to better exploit the spatial and temporal diversity of the routes available in the network. We devise a linear-program-based algorithm which allocates network resource to meet a certain transmission objective. Given a network, a source with multiple arriving packets and a destination, our algorithm generates a policy that regu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3097","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-18T04:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2sXTDhyGAMsfebTWytuJ2B8ZjpibwRbNxeT9mkpIbhfuQD7w6upVp3I6uvtGX32RNCMZNA/wiXJ8niG7gP4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:13.938533Z"},"content_sha256":"d9102f1f7552ec98e2abc35d159330d5c36746d4355f94355f960ce8c5f1e0c5","schema_version":"1.0","event_id":"sha256:d9102f1f7552ec98e2abc35d159330d5c36746d4355f94355f960ce8c5f1e0c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/bundle.json","state_url":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/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-04T02:44:13Z","links":{"resolver":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R","bundle":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/bundle.json","state":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J23UD3S2LLZRZWD4RCRI27ZI3R","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":"87f941a971bc4c9d9783b10fb108bff19d23b832961b10fd594e72ae36e4e111","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T21:00:24Z","title_canon_sha256":"378d974bc6a09803e176b1dfe06566ceb4d5d41245103097c3f305e2092eeabd"},"schema_version":"1.0","source":{"id":"1108.3097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3097","created_at":"2026-05-18T04:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3097v1","created_at":"2026-05-18T04:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3097","created_at":"2026-05-18T04:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"J23UD3S2LLZR","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J23UD3S2LLZRZWD4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J23UD3S2","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:d9102f1f7552ec98e2abc35d159330d5c36746d4355f94355f960ce8c5f1e0c5","target":"graph","created_at":"2026-05-18T04:15:27Z","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 consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We consider a unicast setting and arbitrary arrival processes at the source node. Source arrivals can be broken down into numerous packets to better exploit the spatial and temporal diversity of the routes available in the network. We devise a linear-program-based algorithm which allocates network resource to meet a certain transmission objective. Given a network, a source with multiple arriving packets and a destination, our algorithm generates a policy that regu","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-08-15T21:00:24Z","title":"Cooperative Packet Routing using Mutual Information Accumulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3097","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:72466d8e9ae7d720ea28239a8f788cd9add0554ed7f4e943d5fcb30a0d964220","target":"record","created_at":"2026-05-18T04:15:27Z","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":"87f941a971bc4c9d9783b10fb108bff19d23b832961b10fd594e72ae36e4e111","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-15T21:00:24Z","title_canon_sha256":"378d974bc6a09803e176b1dfe06566ceb4d5d41245103097c3f305e2092eeabd"},"schema_version":"1.0","source":{"id":"1108.3097","kind":"arxiv","version":1}},"canonical_sha256":"4eb741ee5a5af31cd87c88a28d7f28dc45aa2dd0a9a3fdbbd5f6d6963f1d0381","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eb741ee5a5af31cd87c88a28d7f28dc45aa2dd0a9a3fdbbd5f6d6963f1d0381","first_computed_at":"2026-05-18T04:15:27.955633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:27.955633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4TviqDSiMQKJix8cYZrXhR4cWa+fib72QGQlVDmHVDE57FX/YvUNlA98P+WXftZANqIfgEFp0Ei9t1D//LdbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:27.956012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72466d8e9ae7d720ea28239a8f788cd9add0554ed7f4e943d5fcb30a0d964220","sha256:d9102f1f7552ec98e2abc35d159330d5c36746d4355f94355f960ce8c5f1e0c5"],"state_sha256":"4b66fefac68fe055d5ab75f7c1cf4b828a77c68ae815c1f291ab28b12ac85a5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jH/sC2sO04OAwy9c0y/LEc9jOofyUohSkkC4vg2EaEWNu+KDyRrpH0mmHRgldnAjqRh6QaL1XnVh0oit6BHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:44:13.940545Z","bundle_sha256":"ce93ec10e0647c21001f04cc7852f49e5c47eb4e7ada7e06dec26dceb99b4c07"}}