{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P735LDN6QOF3XKZN7SK6IWN2MF","short_pith_number":"pith:P735LDN6","schema_version":"1.0","canonical_sha256":"7ff7d58dbe838bbbab2dfc95e459ba615db5a253a14cb6b8e68a793342ba4b43","source":{"kind":"arxiv","id":"1709.00588","version":1},"attestation_state":"computed","paper":{"title":"Practical Inner Codes for Batched Sparse Codes in Wireless Multihop Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congduan Li, Shenghao Yang, Xuan Guang, Zhiheng Zhou","submitted_at":"2017-09-02T14:30:17Z","abstract_excerpt":"Batched sparse (BATS) code is a promising technology for reliable data transmission in multi-hop wireless networks. As a BATS code consists of an outer code and an inner code that typically is a random linear network code, one main research topic for BATS codes is to design an inner code with good performance in transmission efficiency and complexity. In this paper, this issue is addressed with a focus on the problem of minimizing the total number of packets transmitted by the source and intermediate nodes. Subsequently, the problem is formulated as a mixed integer nonlinear programming (MINLP"},"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":"1709.00588","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-09-02T14:30:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db97bca6f87c8ae6e5e66a245742599e0cc34352c736bff4db526d1d145d0eab","abstract_canon_sha256":"158fc360572c49e6540b03744149cba91bd99ff7f1abb808863978a0f176e47a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:07.570109Z","signature_b64":"FYAtWxVZPp56W9J3Y3EtBr4e6t9MsteUu8km9ptuBQV6O01xNKhvKo+ikI+Y9VhaZdpqppwtq4pvQ01q5CSWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ff7d58dbe838bbbab2dfc95e459ba615db5a253a14cb6b8e68a793342ba4b43","last_reissued_at":"2026-05-18T00:36:07.569499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:07.569499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Inner Codes for Batched Sparse Codes in Wireless Multihop Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congduan Li, Shenghao Yang, Xuan Guang, Zhiheng Zhou","submitted_at":"2017-09-02T14:30:17Z","abstract_excerpt":"Batched sparse (BATS) code is a promising technology for reliable data transmission in multi-hop wireless networks. As a BATS code consists of an outer code and an inner code that typically is a random linear network code, one main research topic for BATS codes is to design an inner code with good performance in transmission efficiency and complexity. In this paper, this issue is addressed with a focus on the problem of minimizing the total number of packets transmitted by the source and intermediate nodes. Subsequently, the problem is formulated as a mixed integer nonlinear programming (MINLP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00588","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":"1709.00588","created_at":"2026-05-18T00:36:07.569586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00588v1","created_at":"2026-05-18T00:36:07.569586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00588","created_at":"2026-05-18T00:36:07.569586+00:00"},{"alias_kind":"pith_short_12","alias_value":"P735LDN6QOF3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P735LDN6QOF3XKZN","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P735LDN6","created_at":"2026-05-18T12:31:37.085036+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/P735LDN6QOF3XKZN7SK6IWN2MF","json":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF.json","graph_json":"https://pith.science/api/pith-number/P735LDN6QOF3XKZN7SK6IWN2MF/graph.json","events_json":"https://pith.science/api/pith-number/P735LDN6QOF3XKZN7SK6IWN2MF/events.json","paper":"https://pith.science/paper/P735LDN6"},"agent_actions":{"view_html":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF","download_json":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF.json","view_paper":"https://pith.science/paper/P735LDN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00588&json=true","fetch_graph":"https://pith.science/api/pith-number/P735LDN6QOF3XKZN7SK6IWN2MF/graph.json","fetch_events":"https://pith.science/api/pith-number/P735LDN6QOF3XKZN7SK6IWN2MF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF/action/storage_attestation","attest_author":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF/action/author_attestation","sign_citation":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF/action/citation_signature","submit_replication":"https://pith.science/pith/P735LDN6QOF3XKZN7SK6IWN2MF/action/replication_record"}},"created_at":"2026-05-18T00:36:07.569586+00:00","updated_at":"2026-05-18T00:36:07.569586+00:00"}