{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F6NGTZGJZBJAG4ZJAL66HS3XCQ","short_pith_number":"pith:F6NGTZGJ","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"},"canonical_sha256":"2f9a69e4c9c85203732902fde3cb77141004e1c3d038780dd7a0b8940d4a056d","source":{"kind":"arxiv","id":"1801.10500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10500","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10500v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10500","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"F6NGTZGJZBJA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F6NGTZGJZBJAG4ZJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F6NGTZGJ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F6NGTZGJZBJAG4ZJAL66HS3XCQ","target":"record","payload":{"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"},"canonical_sha256":"2f9a69e4c9c85203732902fde3cb77141004e1c3d038780dd7a0b8940d4a056d","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"},"source_kind":"arxiv","source_id":"1801.10500","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-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5BYmnUvN2yXWC7ZVS6sKHKzeKfo6p/8G/kuW33Jr21wuwsIUtDIM0ZC0Zw/Qqo3Emlx9RaxlmAc0PnptlA7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:20.316432Z"},"content_sha256":"b294a58984ebb6693a0bd940e197d09ecbfc7772537774769ad312510cc71eee","schema_version":"1.0","event_id":"sha256:b294a58984ebb6693a0bd940e197d09ecbfc7772537774769ad312510cc71eee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F6NGTZGJZBJAG4ZJAL66HS3XCQ","target":"graph","payload":{"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"},"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-18T00:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OstNn3Fq3j9qHwNjtrrgxaoNnAXCxOpltEGDY+xS1rGMYAfvgmRqRxMDUxL/lWEai+Bg0PMnrkitajZVMhtiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:20.317169Z"},"content_sha256":"df54b0a5540d596013ffae16ae3bccdc1cbe81cccf828a57a4cbf991798cc964","schema_version":"1.0","event_id":"sha256:df54b0a5540d596013ffae16ae3bccdc1cbe81cccf828a57a4cbf991798cc964"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/bundle.json","state_url":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/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-09T07:45:20Z","links":{"resolver":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ","bundle":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/bundle.json","state":"https://pith.science/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6NGTZGJZBJAG4ZJAL66HS3XCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F6NGTZGJZBJAG4ZJAL66HS3XCQ","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":"1a228ae8bd7fb4dffe865292e513c82661d6ff6d7bf7d4c32062f5adb7268176","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T15:41:07Z","title_canon_sha256":"77790d1393ebda79a97e3342683051e0ac95113d4fa5eab887546bb9a716f5be"},"schema_version":"1.0","source":{"id":"1801.10500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10500","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10500v1","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10500","created_at":"2026-05-18T00:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"F6NGTZGJZBJA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F6NGTZGJZBJAG4ZJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F6NGTZGJ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:df54b0a5540d596013ffae16ae3bccdc1cbe81cccf828a57a4cbf991798cc964","target":"graph","created_at":"2026-05-18T00:24:40Z","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 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","authors_text":"Derya Malak, Edmund M. Yeh, Muriel M\\'edard","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T15:41:07Z","title":"Analysis of Coded Selective-Repeat ARQ via Matrix Signal-Flow Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10500","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:b294a58984ebb6693a0bd940e197d09ecbfc7772537774769ad312510cc71eee","target":"record","created_at":"2026-05-18T00:24:40Z","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":"1a228ae8bd7fb4dffe865292e513c82661d6ff6d7bf7d4c32062f5adb7268176","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-31T15:41:07Z","title_canon_sha256":"77790d1393ebda79a97e3342683051e0ac95113d4fa5eab887546bb9a716f5be"},"schema_version":"1.0","source":{"id":"1801.10500","kind":"arxiv","version":1}},"canonical_sha256":"2f9a69e4c9c85203732902fde3cb77141004e1c3d038780dd7a0b8940d4a056d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f9a69e4c9c85203732902fde3cb77141004e1c3d038780dd7a0b8940d4a056d","first_computed_at":"2026-05-18T00:24:40.673063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:40.673063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6NYhEJOGk3VR+zGV4pQG+/K73I8jUyq3tBtW7zklr6JqzthcAdlz6VmZteZpIjB9DNtbHRC0uAuszPl+IbirAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:40.673729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b294a58984ebb6693a0bd940e197d09ecbfc7772537774769ad312510cc71eee","sha256:df54b0a5540d596013ffae16ae3bccdc1cbe81cccf828a57a4cbf991798cc964"],"state_sha256":"205f836424d5998a26974f5b646ff1bddcbe325a04e56250338256a09abc51a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmxISO2HNuelHAfi6ZEMMwhBEpC6eBPnMmNgaaYD3Oms7p7KjuZssA/fewqd7sAjdsw50hUyEo0gY8av6b4bCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:45:20.321214Z","bundle_sha256":"8209799dcb58097d165ab0472cb0fe4a4f673707a12dde1d84dd12aeeff97b7e"}}