{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J5KWV3H4UODVNGOQS4QMB4GCSK","short_pith_number":"pith:J5KWV3H4","schema_version":"1.0","canonical_sha256":"4f556aecfca3875699d09720c0f0c292a2eb0d2349b524e1af5f046cc185b1d5","source":{"kind":"arxiv","id":"1901.03769","version":2},"attestation_state":"computed","paper":{"title":"Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Baochun Li, John Apostolopoulos, Silas L. Fong, Wai-Tian Tan, Xiaoqing Zhu","submitted_at":"2019-01-11T23:16:22Z","abstract_excerpt":"This paper considers multiplexing two sequences of messages with two different decoding delays over a packet erasure channel. In each time slot, the source constructs a packet based on the current and previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. The destination must perfectly recover every source message in the first sequence subject to a decoding delay $T_\\mathrm{v}$ and every source message in the second sequence subject to a shorter decoding delay $T_\\mathrm{u}\\le T_\\mathrm{v}$. We assume that the channel loss mo"},"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":"1901.03769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-11T23:16:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04074877d1aea1729dd68903b7da5928688b91f0a10f00d3f62c6295dfe84f97","abstract_canon_sha256":"7a3bcc72cee5464ce2fff6369a28c3dbec56259c4f188834bd101691e993cc26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:06.046122Z","signature_b64":"8rsGRlBkTARJg0TZjKMokEYnxBGaf21aBkNrmzm0k/FvX8U+Ho8R54IW7u/uwbgR6qLxnLNZDls7g0X+dfgRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f556aecfca3875699d09720c0f0c292a2eb0d2349b524e1af5f046cc185b1d5","last_reissued_at":"2026-07-05T00:18:06.045720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:06.045720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Baochun Li, John Apostolopoulos, Silas L. Fong, Wai-Tian Tan, Xiaoqing Zhu","submitted_at":"2019-01-11T23:16:22Z","abstract_excerpt":"This paper considers multiplexing two sequences of messages with two different decoding delays over a packet erasure channel. In each time slot, the source constructs a packet based on the current and previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. The destination must perfectly recover every source message in the first sequence subject to a decoding delay $T_\\mathrm{v}$ and every source message in the second sequence subject to a shorter decoding delay $T_\\mathrm{u}\\le T_\\mathrm{v}$. We assume that the channel loss mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03769","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/1901.03769/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":"1901.03769","created_at":"2026-07-05T00:18:06.045780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03769v2","created_at":"2026-07-05T00:18:06.045780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03769","created_at":"2026-07-05T00:18:06.045780+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5KWV3H4UODV","created_at":"2026-07-05T00:18:06.045780+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5KWV3H4UODVNGOQ","created_at":"2026-07-05T00:18:06.045780+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5KWV3H4","created_at":"2026-07-05T00:18:06.045780+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/J5KWV3H4UODVNGOQS4QMB4GCSK","json":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK.json","graph_json":"https://pith.science/api/pith-number/J5KWV3H4UODVNGOQS4QMB4GCSK/graph.json","events_json":"https://pith.science/api/pith-number/J5KWV3H4UODVNGOQS4QMB4GCSK/events.json","paper":"https://pith.science/paper/J5KWV3H4"},"agent_actions":{"view_html":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK","download_json":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK.json","view_paper":"https://pith.science/paper/J5KWV3H4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03769&json=true","fetch_graph":"https://pith.science/api/pith-number/J5KWV3H4UODVNGOQS4QMB4GCSK/graph.json","fetch_events":"https://pith.science/api/pith-number/J5KWV3H4UODVNGOQS4QMB4GCSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK/action/storage_attestation","attest_author":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK/action/author_attestation","sign_citation":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK/action/citation_signature","submit_replication":"https://pith.science/pith/J5KWV3H4UODVNGOQS4QMB4GCSK/action/replication_record"}},"created_at":"2026-07-05T00:18:06.045780+00:00","updated_at":"2026-07-05T00:18:06.045780+00:00"}