{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:526A7V5YVXE4IFLPBQKPVOA2AO","short_pith_number":"pith:526A7V5Y","schema_version":"1.0","canonical_sha256":"eebc0fd7b8adc9c4156f0c14fab81a03a5d8e42ad44714a05d1f4b8a0386a0dd","source":{"kind":"arxiv","id":"2311.12609","version":4},"attestation_state":"computed","paper":{"title":"Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Liam Cregg, Serdar Yuksel, Tamas Linder","submitted_at":"2023-11-21T13:52:20Z","abstract_excerpt":"In the classical lossy source coding problem, one encodes long blocks of source symbols that enables the distortion to approach the ultimate Shannon limit. Such a block-coding approach introduces large delays, which is undesirable in many delay-sensitive applications. We consider the zero-delay case, where the goal is to encode and decode a finite-alphabet Markov source without any delay. It has been shown that this problem lends itself to stochastic control techniques, which lead to existence, structural, and general structural approximation results. However, these techniques so far have resu"},"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":"2311.12609","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2023-11-21T13:52:20Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"330fac33db18994cb3b4e8f016dfba6cf0f7379943338fc72aafd220d5878147","abstract_canon_sha256":"16db6ea526c6b469d673635a7950804568715c6df21e81e237318fdb31964bc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:33.204872Z","signature_b64":"da99QnucEtlRIJOJgrwlJ38vJcTXrbrX6+zXKhr3IDO6UlfcPjXU+mw2/t8ABk8kfN8+pB/DouL1rxTKyX7ADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eebc0fd7b8adc9c4156f0c14fab81a03a5d8e42ad44714a05d1f4b8a0386a0dd","last_reissued_at":"2026-07-05T08:32:33.204387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:33.204387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Liam Cregg, Serdar Yuksel, Tamas Linder","submitted_at":"2023-11-21T13:52:20Z","abstract_excerpt":"In the classical lossy source coding problem, one encodes long blocks of source symbols that enables the distortion to approach the ultimate Shannon limit. Such a block-coding approach introduces large delays, which is undesirable in many delay-sensitive applications. We consider the zero-delay case, where the goal is to encode and decode a finite-alphabet Markov source without any delay. It has been shown that this problem lends itself to stochastic control techniques, which lead to existence, structural, and general structural approximation results. However, these techniques so far have resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12609","kind":"arxiv","version":4},"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/2311.12609/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":"2311.12609","created_at":"2026-07-05T08:32:33.204445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.12609v4","created_at":"2026-07-05T08:32:33.204445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12609","created_at":"2026-07-05T08:32:33.204445+00:00"},{"alias_kind":"pith_short_12","alias_value":"526A7V5YVXE4","created_at":"2026-07-05T08:32:33.204445+00:00"},{"alias_kind":"pith_short_16","alias_value":"526A7V5YVXE4IFLP","created_at":"2026-07-05T08:32:33.204445+00:00"},{"alias_kind":"pith_short_8","alias_value":"526A7V5Y","created_at":"2026-07-05T08:32:33.204445+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00160","citing_title":"Approximations and Learning for Decentralized Stochastic Control and Near Optimal Finite Window Policies","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO","json":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO.json","graph_json":"https://pith.science/api/pith-number/526A7V5YVXE4IFLPBQKPVOA2AO/graph.json","events_json":"https://pith.science/api/pith-number/526A7V5YVXE4IFLPBQKPVOA2AO/events.json","paper":"https://pith.science/paper/526A7V5Y"},"agent_actions":{"view_html":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO","download_json":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO.json","view_paper":"https://pith.science/paper/526A7V5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.12609&json=true","fetch_graph":"https://pith.science/api/pith-number/526A7V5YVXE4IFLPBQKPVOA2AO/graph.json","fetch_events":"https://pith.science/api/pith-number/526A7V5YVXE4IFLPBQKPVOA2AO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO/action/storage_attestation","attest_author":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO/action/author_attestation","sign_citation":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO/action/citation_signature","submit_replication":"https://pith.science/pith/526A7V5YVXE4IFLPBQKPVOA2AO/action/replication_record"}},"created_at":"2026-07-05T08:32:33.204445+00:00","updated_at":"2026-07-05T08:32:33.204445+00:00"}