{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AAZL2AFX5EAALE7HHJMEHTOHLP","short_pith_number":"pith:AAZL2AFX","canonical_record":{"source":{"id":"1908.01298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T09:07:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9551bc753ad990d4b947685c67d7feb356dd6c1f3c71295fc22162bff131c661","abstract_canon_sha256":"12a8e0a3e5655416181d2b41bd02fd465de47b9ef8b620876c0999b919888acd"},"schema_version":"1.0"},"canonical_sha256":"0032bd00b7e9000593e73a5843cdc75be3cec0efcd20d075a641a3dba5cb2c82","source":{"kind":"arxiv","id":"1908.01298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01298","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01298v2","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01298","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"pith_short_12","alias_value":"AAZL2AFX5EAA","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"pith_short_16","alias_value":"AAZL2AFX5EAALE7H","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"pith_short_8","alias_value":"AAZL2AFX","created_at":"2026-07-05T00:30:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AAZL2AFX5EAALE7HHJMEHTOHLP","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T09:07:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9551bc753ad990d4b947685c67d7feb356dd6c1f3c71295fc22162bff131c661","abstract_canon_sha256":"12a8e0a3e5655416181d2b41bd02fd465de47b9ef8b620876c0999b919888acd"},"schema_version":"1.0"},"canonical_sha256":"0032bd00b7e9000593e73a5843cdc75be3cec0efcd20d075a641a3dba5cb2c82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:30:20.171228Z","signature_b64":"xEV5Rcp3XkB1is+P2kNoKbVvFfsTvLUKL/g7bJ36SidDjx5f+4I7Ij8k1x4D3iyLGIbAusG2oVHrlr3vK9/YCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0032bd00b7e9000593e73a5843cdc75be3cec0efcd20d075a641a3dba5cb2c82","last_reissued_at":"2026-07-05T00:30:20.170686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:30:20.170686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01298","source_version":2,"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-05T00:30:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2gNxLRrFj1VKDij/3kLwzl2vFANcya4e9hCDuSvRmpeevNuqEpWl+mOB/EQRdjLsEH3GYM3ld6hVQHqLelSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:49:07.565044Z"},"content_sha256":"153e29b07dabba1149a6715549f3d2b0273eb4c233ef55740ef07a8d3bb73a55","schema_version":"1.0","event_id":"sha256:153e29b07dabba1149a6715549f3d2b0273eb4c233ef55740ef07a8d3bb73a55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AAZL2AFX5EAALE7HHJMEHTOHLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum-Latency FEC Design with Delayed Feedback: Mathematical Modeling and Efficient Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Xiaoli Xu, Yonghui Li, Yong Zeng","submitted_at":"2019-08-04T09:07:19Z","abstract_excerpt":"In this paper, we consider the packet-level forward error correction (FEC) code design, without feedback or with delayed feedback, for achieving the minimum end-to-end latency, i.e., the latency between the time when packet is generated at the source and its \\emph{in-order delivery} to the application layer of the destination. We first show that the minimum-latency FEC design problem can be modeled as a partially observable Markov decision process (POMDP), and hence the optimal code construction can be obtained by solving the corresponding POMDP. However, solving the POMDP optimally is in gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01298","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/1908.01298/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-05T00:30:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJ3HfpJYvkYgbiW7zkAzgPwQ1SKEBSs81hlq6+wO+A9r3VBHPpNrAptmPAXNmRnPcyg/V+N0YVM7aNws4v/MCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:49:07.565890Z"},"content_sha256":"3355b99d1b30e6ca94a276aba2ed0c66b774e8bd8dfdaac04f3d8c7bc7ae721b","schema_version":"1.0","event_id":"sha256:3355b99d1b30e6ca94a276aba2ed0c66b774e8bd8dfdaac04f3d8c7bc7ae721b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAZL2AFX5EAALE7HHJMEHTOHLP/bundle.json","state_url":"https://pith.science/pith/AAZL2AFX5EAALE7HHJMEHTOHLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAZL2AFX5EAALE7HHJMEHTOHLP/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-12T20:49:07Z","links":{"resolver":"https://pith.science/pith/AAZL2AFX5EAALE7HHJMEHTOHLP","bundle":"https://pith.science/pith/AAZL2AFX5EAALE7HHJMEHTOHLP/bundle.json","state":"https://pith.science/pith/AAZL2AFX5EAALE7HHJMEHTOHLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAZL2AFX5EAALE7HHJMEHTOHLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AAZL2AFX5EAALE7HHJMEHTOHLP","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":"12a8e0a3e5655416181d2b41bd02fd465de47b9ef8b620876c0999b919888acd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T09:07:19Z","title_canon_sha256":"9551bc753ad990d4b947685c67d7feb356dd6c1f3c71295fc22162bff131c661"},"schema_version":"1.0","source":{"id":"1908.01298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01298","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01298v2","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01298","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"pith_short_12","alias_value":"AAZL2AFX5EAA","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"pith_short_16","alias_value":"AAZL2AFX5EAALE7H","created_at":"2026-07-05T00:30:20Z"},{"alias_kind":"pith_short_8","alias_value":"AAZL2AFX","created_at":"2026-07-05T00:30:20Z"}],"graph_snapshots":[{"event_id":"sha256:3355b99d1b30e6ca94a276aba2ed0c66b774e8bd8dfdaac04f3d8c7bc7ae721b","target":"graph","created_at":"2026-07-05T00:30:20Z","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/1908.01298/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider the packet-level forward error correction (FEC) code design, without feedback or with delayed feedback, for achieving the minimum end-to-end latency, i.e., the latency between the time when packet is generated at the source and its \\emph{in-order delivery} to the application layer of the destination. We first show that the minimum-latency FEC design problem can be modeled as a partially observable Markov decision process (POMDP), and hence the optimal code construction can be obtained by solving the corresponding POMDP. However, solving the POMDP optimally is in gene","authors_text":"Branka Vucetic, Xiaoli Xu, Yonghui Li, Yong Zeng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T09:07:19Z","title":"Minimum-Latency FEC Design with Delayed Feedback: Mathematical Modeling and Efficient Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01298","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:153e29b07dabba1149a6715549f3d2b0273eb4c233ef55740ef07a8d3bb73a55","target":"record","created_at":"2026-07-05T00:30:20Z","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":"12a8e0a3e5655416181d2b41bd02fd465de47b9ef8b620876c0999b919888acd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T09:07:19Z","title_canon_sha256":"9551bc753ad990d4b947685c67d7feb356dd6c1f3c71295fc22162bff131c661"},"schema_version":"1.0","source":{"id":"1908.01298","kind":"arxiv","version":2}},"canonical_sha256":"0032bd00b7e9000593e73a5843cdc75be3cec0efcd20d075a641a3dba5cb2c82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0032bd00b7e9000593e73a5843cdc75be3cec0efcd20d075a641a3dba5cb2c82","first_computed_at":"2026-07-05T00:30:20.170686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:30:20.170686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xEV5Rcp3XkB1is+P2kNoKbVvFfsTvLUKL/g7bJ36SidDjx5f+4I7Ij8k1x4D3iyLGIbAusG2oVHrlr3vK9/YCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:30:20.171228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:153e29b07dabba1149a6715549f3d2b0273eb4c233ef55740ef07a8d3bb73a55","sha256:3355b99d1b30e6ca94a276aba2ed0c66b774e8bd8dfdaac04f3d8c7bc7ae721b"],"state_sha256":"6bf552383f385a30ecbcaffc564fb4caf1bc4ba49fb23ebb499f575d9b73f559"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4M+3PBPboqniDYotLhrdpKnvMJ0KxQt7BFYpSBsag6AjRJyJoV+paWhVS9/X0rInmpAzQtWffYZem/le38doAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:49:07.572358Z","bundle_sha256":"6680cec5ebd80c218c961a5da391ba9c06b2cbb59899f47e5fabf8eb540de77f"}}