{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JUKDAVJONO34TLQ4Q4E3OOIKWT","short_pith_number":"pith:JUKDAVJO","schema_version":"1.0","canonical_sha256":"4d1430552e6bb7c9ae1c8709b7390ab4d343d74388dc9d632f3341972718257a","source":{"kind":"arxiv","id":"2401.15056","version":1},"attestation_state":"computed","paper":{"title":"Subset Adaptive Relaying for Streaming Erasure Codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Gustavo Kasper Facenda, Muhammad Ahmad Kaleem","submitted_at":"2024-01-26T18:36:45Z","abstract_excerpt":"This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source transmits a sequence of message packets through a relay under a delay constraint of $T$ time slots per packet. The source-to-relay and relay-to-destination links are unreliable and introduce a maximum of $N_1$ and $N_2$ packet erasures respectively. Recent work has proposed adaptive (time variant) and nonadaptive (time invariant) code constructions for this setting and has shown that adaptive codes can achieve higher rates. However, the adaptive construction deals with many possibiliti"},"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":"2401.15056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-26T18:36:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f521be08607e493a90a2261be200e4bc02a1433fbf77f5365e273bb110a0826","abstract_canon_sha256":"51ea98342a056b4dbc39baba6b1e15dc3edb092d6b426f06ca665878a89f869b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:06.008255Z","signature_b64":"cc3jeE3wkWLkfYa7ztIK/cQl3quXdjdF/8xJB8RO4iuwZDalpmZ/gKMOuJqTAnPUjUWx78vxUvPZh9I1jpQjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d1430552e6bb7c9ae1c8709b7390ab4d343d74388dc9d632f3341972718257a","last_reissued_at":"2026-07-05T07:38:06.007783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:06.007783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subset Adaptive Relaying for Streaming Erasure Codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Gustavo Kasper Facenda, Muhammad Ahmad Kaleem","submitted_at":"2024-01-26T18:36:45Z","abstract_excerpt":"This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source transmits a sequence of message packets through a relay under a delay constraint of $T$ time slots per packet. The source-to-relay and relay-to-destination links are unreliable and introduce a maximum of $N_1$ and $N_2$ packet erasures respectively. Recent work has proposed adaptive (time variant) and nonadaptive (time invariant) code constructions for this setting and has shown that adaptive codes can achieve higher rates. However, the adaptive construction deals with many possibiliti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15056","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.15056/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.15056","created_at":"2026-07-05T07:38:06.007856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.15056v1","created_at":"2026-07-05T07:38:06.007856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15056","created_at":"2026-07-05T07:38:06.007856+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUKDAVJONO34","created_at":"2026-07-05T07:38:06.007856+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUKDAVJONO34TLQ4","created_at":"2026-07-05T07:38:06.007856+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUKDAVJO","created_at":"2026-07-05T07:38:06.007856+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/JUKDAVJONO34TLQ4Q4E3OOIKWT","json":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT.json","graph_json":"https://pith.science/api/pith-number/JUKDAVJONO34TLQ4Q4E3OOIKWT/graph.json","events_json":"https://pith.science/api/pith-number/JUKDAVJONO34TLQ4Q4E3OOIKWT/events.json","paper":"https://pith.science/paper/JUKDAVJO"},"agent_actions":{"view_html":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT","download_json":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT.json","view_paper":"https://pith.science/paper/JUKDAVJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.15056&json=true","fetch_graph":"https://pith.science/api/pith-number/JUKDAVJONO34TLQ4Q4E3OOIKWT/graph.json","fetch_events":"https://pith.science/api/pith-number/JUKDAVJONO34TLQ4Q4E3OOIKWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT/action/storage_attestation","attest_author":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT/action/author_attestation","sign_citation":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT/action/citation_signature","submit_replication":"https://pith.science/pith/JUKDAVJONO34TLQ4Q4E3OOIKWT/action/replication_record"}},"created_at":"2026-07-05T07:38:06.007856+00:00","updated_at":"2026-07-05T07:38:06.007856+00:00"}