{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:XJALKIA77MHDMDV4MW6YWA7GZO","short_pith_number":"pith:XJALKIA7","canonical_record":{"source":{"id":"2201.06609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T19:46:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"433b92fea57e993fe5e1c1dfcf95515792e95a7df776b4beb747053b439d416a","abstract_canon_sha256":"4d9ccfc2d091d9b9390f0b541f93c67410275ee5662ae4d7fa65b31a636c8efb"},"schema_version":"1.0"},"canonical_sha256":"ba40b5201ffb0e360ebc65bd8b03e6cbb8a9432c5eb1ebcbd12ec28f28261c46","source":{"kind":"arxiv","id":"2201.06609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06609","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06609v1","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06609","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"XJALKIA77MHD","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"pith_short_16","alias_value":"XJALKIA77MHDMDV4","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"pith_short_8","alias_value":"XJALKIA7","created_at":"2026-07-05T03:48:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:XJALKIA77MHDMDV4MW6YWA7GZO","target":"record","payload":{"canonical_record":{"source":{"id":"2201.06609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T19:46:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"433b92fea57e993fe5e1c1dfcf95515792e95a7df776b4beb747053b439d416a","abstract_canon_sha256":"4d9ccfc2d091d9b9390f0b541f93c67410275ee5662ae4d7fa65b31a636c8efb"},"schema_version":"1.0"},"canonical_sha256":"ba40b5201ffb0e360ebc65bd8b03e6cbb8a9432c5eb1ebcbd12ec28f28261c46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:59.881143Z","signature_b64":"v2HBZBmXmw1KkAlYnWaChpdtFKZRBmAk3M3TNDH/BNcZt4FkFfaXcZ0IXj+/2tAEjSA6mYvipK0eTHll7q26AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba40b5201ffb0e360ebc65bd8b03e6cbb8a9432c5eb1ebcbd12ec28f28261c46","last_reissued_at":"2026-07-05T03:48:59.880808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:59.880808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.06609","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-05T03:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDlnnEWoe8WPBeI1TxBkX8yidIPy/ESOMTpE9hS1dStZ0egZD21WH6dC4zhCXqPWwcHIgHt/hJbhv0Zk+/uYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:36:19.968702Z"},"content_sha256":"08a79402267d577f93c522d3ee225aba679461b25640543878a4bc16137d18c6","schema_version":"1.0","event_id":"sha256:08a79402267d577f93c522d3ee225aba679461b25640543878a4bc16137d18c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:XJALKIA77MHDMDV4MW6YWA7GZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error-correcting codes for low latency streaming over multiple link relay 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":"2022-01-17T19:46:06Z","abstract_excerpt":"This paper investigates the performance of streaming codes in low-latency applications over a multi-link three-node relayed network. The source wishes to transmit a sequence of messages to the destination through a relay. Each message must be reconstructed after a fixed decoding delay. The special case with one link connecting each node has been studied by Fong et. al [1], and a multi-hop multi-link setting has been studied by Domanovitz et. al [2]. The topology with three nodes and multiple links is studied in this paper. Each link is subject to a different number of erasures due to different"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06609","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/2201.06609/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-05T03:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxKJWPKCmlJvYXzFzxsqWIV0AnTiy6W9rQfG62Cw3Sa7ERn+sGQEBU4OVRuiJrHyRPyWxkv7lmWwUigl/ZLnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:36:19.969636Z"},"content_sha256":"c125a2f9a903c29dce713566239a5fbd2e9071bfc3d897d7d20f9858d49e5397","schema_version":"1.0","event_id":"sha256:c125a2f9a903c29dce713566239a5fbd2e9071bfc3d897d7d20f9858d49e5397"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJALKIA77MHDMDV4MW6YWA7GZO/bundle.json","state_url":"https://pith.science/pith/XJALKIA77MHDMDV4MW6YWA7GZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJALKIA77MHDMDV4MW6YWA7GZO/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-08-03T16:36:19Z","links":{"resolver":"https://pith.science/pith/XJALKIA77MHDMDV4MW6YWA7GZO","bundle":"https://pith.science/pith/XJALKIA77MHDMDV4MW6YWA7GZO/bundle.json","state":"https://pith.science/pith/XJALKIA77MHDMDV4MW6YWA7GZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJALKIA77MHDMDV4MW6YWA7GZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XJALKIA77MHDMDV4MW6YWA7GZO","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":"4d9ccfc2d091d9b9390f0b541f93c67410275ee5662ae4d7fa65b31a636c8efb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T19:46:06Z","title_canon_sha256":"433b92fea57e993fe5e1c1dfcf95515792e95a7df776b4beb747053b439d416a"},"schema_version":"1.0","source":{"id":"2201.06609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06609","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06609v1","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06609","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"XJALKIA77MHD","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"pith_short_16","alias_value":"XJALKIA77MHDMDV4","created_at":"2026-07-05T03:48:59Z"},{"alias_kind":"pith_short_8","alias_value":"XJALKIA7","created_at":"2026-07-05T03:48:59Z"}],"graph_snapshots":[{"event_id":"sha256:c125a2f9a903c29dce713566239a5fbd2e9071bfc3d897d7d20f9858d49e5397","target":"graph","created_at":"2026-07-05T03:48:59Z","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/2201.06609/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates the performance of streaming codes in low-latency applications over a multi-link three-node relayed network. The source wishes to transmit a sequence of messages to the destination through a relay. Each message must be reconstructed after a fixed decoding delay. The special case with one link connecting each node has been studied by Fong et. al [1], and a multi-hop multi-link setting has been studied by Domanovitz et. al [2]. The topology with three nodes and multiple links is studied in this paper. Each link is subject to a different number of erasures due to different","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":"2022-01-17T19:46:06Z","title":"Error-correcting codes for low latency streaming over multiple link relay networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06609","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:08a79402267d577f93c522d3ee225aba679461b25640543878a4bc16137d18c6","target":"record","created_at":"2026-07-05T03:48:59Z","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":"4d9ccfc2d091d9b9390f0b541f93c67410275ee5662ae4d7fa65b31a636c8efb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-17T19:46:06Z","title_canon_sha256":"433b92fea57e993fe5e1c1dfcf95515792e95a7df776b4beb747053b439d416a"},"schema_version":"1.0","source":{"id":"2201.06609","kind":"arxiv","version":1}},"canonical_sha256":"ba40b5201ffb0e360ebc65bd8b03e6cbb8a9432c5eb1ebcbd12ec28f28261c46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba40b5201ffb0e360ebc65bd8b03e6cbb8a9432c5eb1ebcbd12ec28f28261c46","first_computed_at":"2026-07-05T03:48:59.880808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:59.880808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v2HBZBmXmw1KkAlYnWaChpdtFKZRBmAk3M3TNDH/BNcZt4FkFfaXcZ0IXj+/2tAEjSA6mYvipK0eTHll7q26AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:59.881143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.06609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08a79402267d577f93c522d3ee225aba679461b25640543878a4bc16137d18c6","sha256:c125a2f9a903c29dce713566239a5fbd2e9071bfc3d897d7d20f9858d49e5397"],"state_sha256":"ff04e41761c8e1fc19cb309efa016e05145f39da4b62f95d6a197e6b03fa5d6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfHTNT//IQvpUmIQEaV5gVF3kxF3oE373ZH0yYOfJYfmmXoCChVFmveiitqNrkHlTPQHfnMJ2cYYPqzhaEoBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:36:19.976887Z","bundle_sha256":"aa814a5f60d02dab672750708e808d5326486aa47f9ec066b7fa2bb78d05d687"}}