{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XZ7HYNTTM5K4QRG73RBC4UPO2Q","short_pith_number":"pith:XZ7HYNTT","schema_version":"1.0","canonical_sha256":"be7e7c36736755c844dfdc422e51eed42321e6433631f3d4236ed9fe8145a846","source":{"kind":"arxiv","id":"2101.11117","version":2},"attestation_state":"computed","paper":{"title":"Streaming Erasure Codes over Multi-Access Relayed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Elad Domanovitz, Gustavo Kasper Facenda, John Apostolopoulos, Wai-Tian Tan","submitted_at":"2021-01-26T22:26:54Z","abstract_excerpt":"Many emerging multimedia streaming applications involve multiple users communicating under strict latency constraints. In this paper we study streaming codes for a network involving two source nodes, one relay node and a destination node. In our setting, each source node transmits a stream of messages, through the relay, to a destination, who is required to decode the messages under a strict delay constraint. For the case of a single source node, a class of streaming codes has been proposed by Fong et al. [2], using the concept of {\\em delay-spectrum}. In the present work we present an in-dept"},"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":"2101.11117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-26T22:26:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ba8c78f563ed620998f1dddbe20b78299c12181b366b90dc402223f6296652a","abstract_canon_sha256":"47edf1e942d9b6788fe8d36c2618ab51ad79400a80d2073ef7fed0221a411368"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:42.902502Z","signature_b64":"/KORsmUGHHEHui2HUgiVPUxqkTvnDaEE0IpzaxZ6AETBdJe89ITGvGix7OcCmRhJiZUGb6avaXqplaffQnkHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be7e7c36736755c844dfdc422e51eed42321e6433631f3d4236ed9fe8145a846","last_reissued_at":"2026-07-05T03:21:42.902109Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:42.902109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Erasure Codes over Multi-Access Relayed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Elad Domanovitz, Gustavo Kasper Facenda, John Apostolopoulos, Wai-Tian Tan","submitted_at":"2021-01-26T22:26:54Z","abstract_excerpt":"Many emerging multimedia streaming applications involve multiple users communicating under strict latency constraints. In this paper we study streaming codes for a network involving two source nodes, one relay node and a destination node. In our setting, each source node transmits a stream of messages, through the relay, to a destination, who is required to decode the messages under a strict delay constraint. For the case of a single source node, a class of streaming codes has been proposed by Fong et al. [2], using the concept of {\\em delay-spectrum}. In the present work we present an in-dept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11117","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.11117/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":"2101.11117","created_at":"2026-07-05T03:21:42.902166+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.11117v2","created_at":"2026-07-05T03:21:42.902166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11117","created_at":"2026-07-05T03:21:42.902166+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZ7HYNTTM5K4","created_at":"2026-07-05T03:21:42.902166+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZ7HYNTTM5K4QRG7","created_at":"2026-07-05T03:21:42.902166+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZ7HYNTT","created_at":"2026-07-05T03:21:42.902166+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/XZ7HYNTTM5K4QRG73RBC4UPO2Q","json":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q.json","graph_json":"https://pith.science/api/pith-number/XZ7HYNTTM5K4QRG73RBC4UPO2Q/graph.json","events_json":"https://pith.science/api/pith-number/XZ7HYNTTM5K4QRG73RBC4UPO2Q/events.json","paper":"https://pith.science/paper/XZ7HYNTT"},"agent_actions":{"view_html":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q","download_json":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q.json","view_paper":"https://pith.science/paper/XZ7HYNTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.11117&json=true","fetch_graph":"https://pith.science/api/pith-number/XZ7HYNTTM5K4QRG73RBC4UPO2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/XZ7HYNTTM5K4QRG73RBC4UPO2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q/action/storage_attestation","attest_author":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q/action/author_attestation","sign_citation":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q/action/citation_signature","submit_replication":"https://pith.science/pith/XZ7HYNTTM5K4QRG73RBC4UPO2Q/action/replication_record"}},"created_at":"2026-07-05T03:21:42.902166+00:00","updated_at":"2026-07-05T03:21:42.902166+00:00"}