{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LMABOS5KP653BRF3WH2PIQZRIY","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":"fe91cc6c0decd17dcd8033306306d7aa688ab06ae86103647b60dad6fa1bc54e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-10T01:21:27Z","title_canon_sha256":"1cd8e2966289ed6e4b11c173c00201bcab3a4e377ab9ff74b67a01e92a2b6dd9"},"schema_version":"1.0","source":{"id":"2203.05102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05102","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05102v1","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05102","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"LMABOS5KP653","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"LMABOS5KP653BRF3","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"LMABOS5K","created_at":"2026-07-05T04:03:29Z"}],"graph_snapshots":[{"event_id":"sha256:0f722dadd71c5172e664acbc05a3463e831ce9872fdfe7207965e646097c1452","target":"graph","created_at":"2026-07-05T04:03:29Z","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/2203.05102/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source node transmits a sequence of message packets to a destination through a relay. The source-to-relay and relay-to-destination links are unreliable and introduce at most $N_1$ and $N_2$ packet erasures, respectively. The destination node must recover each message packet within a strict delay constraint $T$. The paper presents achievable streaming codes for all feasible parameters $\\{N_1, N_2, T\\}$ that exploit the fact that the relay naturally observes the erasure pattern occurring in the","authors_text":"Ashish Khisti, Elad Domanovitz, Gustavo Kasper Facenda, John Apostolopoulos, M. Nikhil Krishnan, Silas L. Fong, Wai-Tian Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-10T01:21:27Z","title":"Adaptive relaying for streaming erasure codes in a three node relay network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05102","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:92af6515f6d782cb2f81c834bf7d2856a0d5f60a28406a0185b5dfae75985a0f","target":"record","created_at":"2026-07-05T04:03:29Z","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":"fe91cc6c0decd17dcd8033306306d7aa688ab06ae86103647b60dad6fa1bc54e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-03-10T01:21:27Z","title_canon_sha256":"1cd8e2966289ed6e4b11c173c00201bcab3a4e377ab9ff74b67a01e92a2b6dd9"},"schema_version":"1.0","source":{"id":"2203.05102","kind":"arxiv","version":1}},"canonical_sha256":"5b00174baa7fbbb0c4bbb1f4f44331461d397355be1ce88233410b73a991ea53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b00174baa7fbbb0c4bbb1f4f44331461d397355be1ce88233410b73a991ea53","first_computed_at":"2026-07-05T04:03:29.882838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:29.882838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0szoelHjLrueDieSMK9/5exq7dpEyv/6uZ2SI9zaysX1zHO7GOA7pP27kvoNPDDNXgh/pJRstlVno4GTLVn4DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:29.883219Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.05102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92af6515f6d782cb2f81c834bf7d2856a0d5f60a28406a0185b5dfae75985a0f","sha256:0f722dadd71c5172e664acbc05a3463e831ce9872fdfe7207965e646097c1452"],"state_sha256":"e45da39e9783494e256201d661f91949e7c3a3ecd56c8ca7ff774f383fd2e8e9"}