{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4IIYLSBG56E2RHXF3FU6BE5POF","short_pith_number":"pith:4IIYLSBG","canonical_record":{"source":{"id":"2006.05951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-10T16:59:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a3c747de6e39b9f6ef5086b03316d65cd40af42abeb4c925ae241a9f03b6d16","abstract_canon_sha256":"7443508217133e04334acd586f3cff92320e1cfadf25693fcf28d9a0820f0b5a"},"schema_version":"1.0"},"canonical_sha256":"e21185c826ef89a89ee5d969e093af7168e2a536f04307eea121b4d9f95629af","source":{"kind":"arxiv","id":"2006.05951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.05951","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"arxiv_version","alias_value":"2006.05951v1","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05951","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"pith_short_12","alias_value":"4IIYLSBG56E2","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"pith_short_16","alias_value":"4IIYLSBG56E2RHXF","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"pith_short_8","alias_value":"4IIYLSBG","created_at":"2026-07-05T01:09:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4IIYLSBG56E2RHXF3FU6BE5POF","target":"record","payload":{"canonical_record":{"source":{"id":"2006.05951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-10T16:59:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a3c747de6e39b9f6ef5086b03316d65cd40af42abeb4c925ae241a9f03b6d16","abstract_canon_sha256":"7443508217133e04334acd586f3cff92320e1cfadf25693fcf28d9a0820f0b5a"},"schema_version":"1.0"},"canonical_sha256":"e21185c826ef89a89ee5d969e093af7168e2a536f04307eea121b4d9f95629af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:18.475752Z","signature_b64":"tk8vJJ/q2qYMeySEoG0z4Leq80gKKvvF4F6Gm9ibM0wOZ2XH0Bn2uU8iezO187x+k9pMchEZbuIjVD/HuaLUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21185c826ef89a89ee5d969e093af7168e2a536f04307eea121b4d9f95629af","last_reissued_at":"2026-07-05T01:09:18.475374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:18.475374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.05951","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-07-05T01:09:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOUsgLuirs052WUe2ZCGND6tBC9HzyDKpWzIXGyX05WMifJVEWTzJ9gnd97B10DrbqArCAHOVz2405TM2EYCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T09:40:57.542302Z"},"content_sha256":"6105ff874084e983b6bf710cca3f7eaf242ffacfc98ca07208451edb11a8bd27","schema_version":"1.0","event_id":"sha256:6105ff874084e983b6bf710cca3f7eaf242ffacfc98ca07208451edb11a8bd27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4IIYLSBG56E2RHXF3FU6BE5POF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Erasure Codes over Multi-hop Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Elad Domanovitz, John Apostolopoulos, Wai-Tian Tan, Xiaoqing Zhu","submitted_at":"2020-06-10T16:59:14Z","abstract_excerpt":"This paper studies low-latency streaming codes for the multi-hop network. The source is transmitting a sequence of messages (streaming messages) to a destination through a chain of relays where each hop is subject to packet erasures. Every source message has to be recovered perfectly at the destination within a delay constraint of $T$ time slots. In any sliding window of $T+1$ time slots, we assume no more than $N_j$ erasures introduced by the $j$'th hop channel. The capacity in case of a single relay (a three-node network) was derived by Fong [1], et al. While the converse derived for the thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05951","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/2006.05951/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"},"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-07-05T01:09:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uNrXYwsDV559PGZXr2L40qIS5QvoogrywYsbn16EWpYx8r75G8gdzmtb3RSl2KV8k0EvvnAtco+pMYLr06XAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T09:40:57.542699Z"},"content_sha256":"79e9da35b09405cdc8492dd4e89de4f3d9d1a27ab2931a8164aa337fba7b2c13","schema_version":"1.0","event_id":"sha256:79e9da35b09405cdc8492dd4e89de4f3d9d1a27ab2931a8164aa337fba7b2c13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IIYLSBG56E2RHXF3FU6BE5POF/bundle.json","state_url":"https://pith.science/pith/4IIYLSBG56E2RHXF3FU6BE5POF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IIYLSBG56E2RHXF3FU6BE5POF/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-07-13T09:40:57Z","links":{"resolver":"https://pith.science/pith/4IIYLSBG56E2RHXF3FU6BE5POF","bundle":"https://pith.science/pith/4IIYLSBG56E2RHXF3FU6BE5POF/bundle.json","state":"https://pith.science/pith/4IIYLSBG56E2RHXF3FU6BE5POF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IIYLSBG56E2RHXF3FU6BE5POF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4IIYLSBG56E2RHXF3FU6BE5POF","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":"7443508217133e04334acd586f3cff92320e1cfadf25693fcf28d9a0820f0b5a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-10T16:59:14Z","title_canon_sha256":"1a3c747de6e39b9f6ef5086b03316d65cd40af42abeb4c925ae241a9f03b6d16"},"schema_version":"1.0","source":{"id":"2006.05951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.05951","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"arxiv_version","alias_value":"2006.05951v1","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05951","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"pith_short_12","alias_value":"4IIYLSBG56E2","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"pith_short_16","alias_value":"4IIYLSBG56E2RHXF","created_at":"2026-07-05T01:09:18Z"},{"alias_kind":"pith_short_8","alias_value":"4IIYLSBG","created_at":"2026-07-05T01:09:18Z"}],"graph_snapshots":[{"event_id":"sha256:79e9da35b09405cdc8492dd4e89de4f3d9d1a27ab2931a8164aa337fba7b2c13","target":"graph","created_at":"2026-07-05T01:09:18Z","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/2006.05951/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies low-latency streaming codes for the multi-hop network. The source is transmitting a sequence of messages (streaming messages) to a destination through a chain of relays where each hop is subject to packet erasures. Every source message has to be recovered perfectly at the destination within a delay constraint of $T$ time slots. In any sliding window of $T+1$ time slots, we assume no more than $N_j$ erasures introduced by the $j$'th hop channel. The capacity in case of a single relay (a three-node network) was derived by Fong [1], et al. While the converse derived for the thr","authors_text":"Ashish Khisti, Elad Domanovitz, John Apostolopoulos, Wai-Tian Tan, Xiaoqing Zhu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-10T16:59:14Z","title":"Streaming Erasure Codes over Multi-hop Relay Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05951","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:6105ff874084e983b6bf710cca3f7eaf242ffacfc98ca07208451edb11a8bd27","target":"record","created_at":"2026-07-05T01:09:18Z","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":"7443508217133e04334acd586f3cff92320e1cfadf25693fcf28d9a0820f0b5a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-10T16:59:14Z","title_canon_sha256":"1a3c747de6e39b9f6ef5086b03316d65cd40af42abeb4c925ae241a9f03b6d16"},"schema_version":"1.0","source":{"id":"2006.05951","kind":"arxiv","version":1}},"canonical_sha256":"e21185c826ef89a89ee5d969e093af7168e2a536f04307eea121b4d9f95629af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e21185c826ef89a89ee5d969e093af7168e2a536f04307eea121b4d9f95629af","first_computed_at":"2026-07-05T01:09:18.475374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:09:18.475374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tk8vJJ/q2qYMeySEoG0z4Leq80gKKvvF4F6Gm9ibM0wOZ2XH0Bn2uU8iezO187x+k9pMchEZbuIjVD/HuaLUCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:09:18.475752Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.05951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6105ff874084e983b6bf710cca3f7eaf242ffacfc98ca07208451edb11a8bd27","sha256:79e9da35b09405cdc8492dd4e89de4f3d9d1a27ab2931a8164aa337fba7b2c13"],"state_sha256":"cb4166e75890d5673275bea93e84ce102988f1f0c42c433350cfd6dbbb91eda1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnUp8K009W45f040AgBMPLG36VlfzPBGH2m1XmCIZ9tyivDfSBkuuJ8fOU74Znypa7Dl2mxk45pUg3neQLK/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T09:40:57.544844Z","bundle_sha256":"d4cefbbddda6c7855a76545d5eefe1e9172338257dca0e3d0f748ffda9a5717a"}}