{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J23UD3S2LLZRZWD4RCRI27ZI3R","short_pith_number":"pith:J23UD3S2","schema_version":"1.0","canonical_sha256":"4eb741ee5a5af31cd87c88a28d7f28dc45aa2dd0a9a3fdbbd5f6d6963f1d0381","source":{"kind":"arxiv","id":"1108.3097","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.3097","created_at":"2026-05-18T04:15:27.955687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3097v1","created_at":"2026-05-18T04:15:27.955687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3097","created_at":"2026-05-18T04:15:27.955687+00:00"},{"alias_kind":"pith_short_12","alias_value":"J23UD3S2LLZR","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J23UD3S2LLZRZWD4","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J23UD3S2","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R","json":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R.json","graph_json":"https://pith.science/api/pith-number/J23UD3S2LLZRZWD4RCRI27ZI3R/graph.json","events_json":"https://pith.science/api/pith-number/J23UD3S2LLZRZWD4RCRI27ZI3R/events.json","paper":"https://pith.science/paper/J23UD3S2"},"agent_actions":{"view_html":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R","download_json":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R.json","view_paper":"https://pith.science/paper/J23UD3S2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3097&json=true","fetch_graph":"https://pith.science/api/pith-number/J23UD3S2LLZRZWD4RCRI27ZI3R/graph.json","fetch_events":"https://pith.science/api/pith-number/J23UD3S2LLZRZWD4RCRI27ZI3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/action/storage_attestation","attest_author":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/action/author_attestation","sign_citation":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/action/citation_signature","submit_replication":"https://pith.science/pith/J23UD3S2LLZRZWD4RCRI27ZI3R/action/replication_record"}},"created_at":"2026-05-18T04:15:27.955687+00:00","updated_at":"2026-05-18T04:15:27.955687+00:00"}