{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SH7V6SYJXUYFD44WE2M2HYGZNL","short_pith_number":"pith:SH7V6SYJ","schema_version":"1.0","canonical_sha256":"91ff5f4b09bd3051f3962699a3e0d96ae34eafb666d50e27ce687fa56eb25c93","source":{"kind":"arxiv","id":"1105.4143","version":2},"attestation_state":"computed","paper":{"title":"Opportunities for Network Coding: To Wait or Not to Wait","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Alex Sprintson, Natarajan Gautam, Navid Abedini, Srinivas Shakkottai, Yu-Pin Hsu","submitted_at":"2011-05-20T18:04:53Z","abstract_excerpt":"It has been well established that wireless network coding can significantly improve the efficiency of multi-hop wireless networks. However, in a stochastic environment some of the packets might not have coding pairs, which limits the number of available coding opportunities. In this context, an important decision is whether to delay packet transmission in hope that a coding pair will be available in the future or transmit a packet without coding. The paper addresses this problem by formulating a stochastic dynamic program whose objective is to minimize the long-run average cost per unit time i"},"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":"1105.4143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-20T18:04:53Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"94731e4207bb51501aa7a5b6155219ba350ab6d4acdb85fe82f695d97758a880","abstract_canon_sha256":"06ef1421a17fd110a5af0a870fb43ce7005d9f865b16d33a93f45620b397a848"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:52.142360Z","signature_b64":"L1IFLCI1fWStgVastAEp/WuqHwIl/62jcWOi3ShcBu2o+jQVe02D/9OLb432vcTvq+NOC+IkO/LpiJ2Zj/XYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91ff5f4b09bd3051f3962699a3e0d96ae34eafb666d50e27ce687fa56eb25c93","last_reissued_at":"2026-05-18T02:21:52.141641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:52.141641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opportunities for Network Coding: To Wait or Not to Wait","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Alex Sprintson, Natarajan Gautam, Navid Abedini, Srinivas Shakkottai, Yu-Pin Hsu","submitted_at":"2011-05-20T18:04:53Z","abstract_excerpt":"It has been well established that wireless network coding can significantly improve the efficiency of multi-hop wireless networks. However, in a stochastic environment some of the packets might not have coding pairs, which limits the number of available coding opportunities. In this context, an important decision is whether to delay packet transmission in hope that a coding pair will be available in the future or transmit a packet without coding. The paper addresses this problem by formulating a stochastic dynamic program whose objective is to minimize the long-run average cost per unit time i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4143","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.4143","created_at":"2026-05-18T02:21:52.141765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4143v2","created_at":"2026-05-18T02:21:52.141765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4143","created_at":"2026-05-18T02:21:52.141765+00:00"},{"alias_kind":"pith_short_12","alias_value":"SH7V6SYJXUYF","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SH7V6SYJXUYFD44W","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SH7V6SYJ","created_at":"2026-05-18T12:26:41.206345+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/SH7V6SYJXUYFD44WE2M2HYGZNL","json":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL.json","graph_json":"https://pith.science/api/pith-number/SH7V6SYJXUYFD44WE2M2HYGZNL/graph.json","events_json":"https://pith.science/api/pith-number/SH7V6SYJXUYFD44WE2M2HYGZNL/events.json","paper":"https://pith.science/paper/SH7V6SYJ"},"agent_actions":{"view_html":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL","download_json":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL.json","view_paper":"https://pith.science/paper/SH7V6SYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4143&json=true","fetch_graph":"https://pith.science/api/pith-number/SH7V6SYJXUYFD44WE2M2HYGZNL/graph.json","fetch_events":"https://pith.science/api/pith-number/SH7V6SYJXUYFD44WE2M2HYGZNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL/action/storage_attestation","attest_author":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL/action/author_attestation","sign_citation":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL/action/citation_signature","submit_replication":"https://pith.science/pith/SH7V6SYJXUYFD44WE2M2HYGZNL/action/replication_record"}},"created_at":"2026-05-18T02:21:52.141765+00:00","updated_at":"2026-05-18T02:21:52.141765+00:00"}