{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F6NGTZGJZBJAG4ZJAL66HS3XCQ","short_pith_number":"pith:F6NGTZGJ","schema_version":"1.0","canonical_sha256":"2f9a69e4c9c85203732902fde3cb77141004e1c3d038780dd7a0b8940d4a056d","source":{"kind":"arxiv","id":"1801.10500","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Coded Selective-Repeat ARQ via Matrix Signal-Flow Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Derya Malak, Edmund M. Yeh, Muriel M\\'edard","submitted_at":"2018-01-31T15:41:07Z","abstract_excerpt":"We propose two schemes for selective-repeat ARQ protocols over packet erasure channels with unreliable feedback: (i) a hybrid ARQ protocol with soft combining at the receiver, and (ii) a coded ARQ protocol, by building on the uncoded baseline scheme for ARQ, developed by Ausavapattanakun and Nosratinia. Our method leverages discrete-time queuing and coding theory to analyze the performance of the proposed data transmission methods. We incorporate forward error-correction to reduce in-order delivery delay, and exploit a matrix signal-flow graph approach to analyze the throughput and delay of th"},"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":"1801.10500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T15:41:07Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"77790d1393ebda79a97e3342683051e0ac95113d4fa5eab887546bb9a716f5be","abstract_canon_sha256":"1a228ae8bd7fb4dffe865292e513c82661d6ff6d7bf7d4c32062f5adb7268176"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:40.673729Z","signature_b64":"6NYhEJOGk3VR+zGV4pQG+/K73I8jUyq3tBtW7zklr6JqzthcAdlz6VmZteZpIjB9DNtbHRC0uAuszPl+IbirAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f9a69e4c9c85203732902fde3cb77141004e1c3d038780dd7a0b8940d4a056d","last_reissued_at":"2026-05-18T00:24:40.673063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:40.673063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Coded Selective-Repeat ARQ via Matrix Signal-Flow Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Derya Malak, Edmund M. Yeh, Muriel M\\'edard","submitted_at":"2018-01-31T15:41:07Z","abstract_excerpt":"We propose two schemes for selective-repeat ARQ protocols over packet erasure channels with unreliable feedback: (i) a hybrid ARQ protocol with soft combining at the receiver, and (ii) a coded ARQ protocol, by building on the uncoded baseline scheme for ARQ, developed by Ausavapattanakun and Nosratinia. Our method leverages discrete-time queuing and coding theory to analyze the performance of the proposed data transmission methods. We incorporate forward error-correction to reduce in-order delivery delay, and exploit a matrix signal-flow graph approach to analyze the throughput and delay of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10500","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":"1801.10500","created_at":"2026-05-18T00:24:40.673162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10500v1","created_at":"2026-05-18T00:24:40.673162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10500","created_at":"2026-05-18T00:24:40.673162+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6NGTZGJZBJA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6NGTZGJZBJAG4ZJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6NGTZGJ","created_at":"2026-05-18T12:32:22.470017+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/F6NGTZGJZBJAG4ZJAL66HS3XCQ","json":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ.json","graph_json":"https://pith.science/api/pith-number/F6NGTZGJZBJAG4ZJAL66HS3XCQ/graph.json","events_json":"https://pith.science/api/pith-number/F6NGTZGJZBJAG4ZJAL66HS3XCQ/events.json","paper":"https://pith.science/paper/F6NGTZGJ"},"agent_actions":{"view_html":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ","download_json":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ.json","view_paper":"https://pith.science/paper/F6NGTZGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10500&json=true","fetch_graph":"https://pith.science/api/pith-number/F6NGTZGJZBJAG4ZJAL66HS3XCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/F6NGTZGJZBJAG4ZJAL66HS3XCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/action/storage_attestation","attest_author":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/action/author_attestation","sign_citation":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/action/citation_signature","submit_replication":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/action/replication_record"}},"created_at":"2026-05-18T00:24:40.673162+00:00","updated_at":"2026-05-18T00:24:40.673162+00:00"}