{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XZ7HYNTTM5K4QRG73RBC4UPO2Q","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":"47edf1e942d9b6788fe8d36c2618ab51ad79400a80d2073ef7fed0221a411368","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-26T22:26:54Z","title_canon_sha256":"0ba8c78f563ed620998f1dddbe20b78299c12181b366b90dc402223f6296652a"},"schema_version":"1.0","source":{"id":"2101.11117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.11117","created_at":"2026-07-05T03:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"2101.11117v2","created_at":"2026-07-05T03:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11117","created_at":"2026-07-05T03:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"XZ7HYNTTM5K4","created_at":"2026-07-05T03:21:42Z"},{"alias_kind":"pith_short_16","alias_value":"XZ7HYNTTM5K4QRG7","created_at":"2026-07-05T03:21:42Z"},{"alias_kind":"pith_short_8","alias_value":"XZ7HYNTT","created_at":"2026-07-05T03:21:42Z"}],"graph_snapshots":[{"event_id":"sha256:5c1446a31e77a9745f705c365f057b831775fa8db98199edd701220ae3f0bca8","target":"graph","created_at":"2026-07-05T03:21:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.11117/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ashish Khisti, Elad Domanovitz, Gustavo Kasper Facenda, John Apostolopoulos, Wai-Tian Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-26T22:26:54Z","title":"Streaming Erasure Codes over Multi-Access Relayed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11117","kind":"arxiv","version":2},"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:b7153c105d85ff127dbd75f68e33267c9be652f2ee80a7ed9f7a7303fa09d731","target":"record","created_at":"2026-07-05T03:21:42Z","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":"47edf1e942d9b6788fe8d36c2618ab51ad79400a80d2073ef7fed0221a411368","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-26T22:26:54Z","title_canon_sha256":"0ba8c78f563ed620998f1dddbe20b78299c12181b366b90dc402223f6296652a"},"schema_version":"1.0","source":{"id":"2101.11117","kind":"arxiv","version":2}},"canonical_sha256":"be7e7c36736755c844dfdc422e51eed42321e6433631f3d4236ed9fe8145a846","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be7e7c36736755c844dfdc422e51eed42321e6433631f3d4236ed9fe8145a846","first_computed_at":"2026-07-05T03:21:42.902109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:21:42.902109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/KORsmUGHHEHui2HUgiVPUxqkTvnDaEE0IpzaxZ6AETBdJe89ITGvGix7OcCmRhJiZUGb6avaXqplaffQnkHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:21:42.902502Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.11117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7153c105d85ff127dbd75f68e33267c9be652f2ee80a7ed9f7a7303fa09d731","sha256:5c1446a31e77a9745f705c365f057b831775fa8db98199edd701220ae3f0bca8"],"state_sha256":"9be608ce905da1d21fff512d90b75066d59bfd401ce17ae7cb30692bc2f18b9c"}