{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:27PUVOT72C6ELCOMY2AT76Y56E","short_pith_number":"pith:27PUVOT7","schema_version":"1.0","canonical_sha256":"d7df4aba7fd0bc4589ccc6813ffb1df12fb584818ea77f81e2d1d96093d71730","source":{"kind":"arxiv","id":"1810.01969","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Polarization for Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Madhu Sudan, Preetum Nakkiran, Venkatesan Guruswami","submitted_at":"2018-10-03T20:56:03Z","abstract_excerpt":"Using a mild variant of polar codes we design linear compression schemes compressing Hidden Markov sources (where the source is a Markov chain, but whose state is not necessarily observable from its output), and to decode from Hidden Markov channels (where the channel has a state and the error introduced depends on the state). We give the first polynomial time algorithms that manage to compress and decompress (or encode and decode) at input lengths that are polynomial $\\it{both}$ in the gap to capacity and the mixing time of the Markov chain. Prior work achieved capacity only asymptotically in"},"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":"1810.01969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-03T20:56:03Z","cross_cats_sorted":["cs.CC","math.IT","math.PR"],"title_canon_sha256":"b4dd8e58dcc12644a971c7a45bd38e3d375baaa5221f44996c7b9f37494982a7","abstract_canon_sha256":"17978f3296ffb9fdc7dd0c8dcc4aba6fdc32509a29a5fe2db3c878fcf1da9a8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.732253Z","signature_b64":"po1a7gqLv8e3GcouqSBB2Nnc/q5pjt91+aMBMcY5ij8CeL/Wq7xXBU0qX0sW8yAtLdfm6GktLTsDhQZXTttLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7df4aba7fd0bc4589ccc6813ffb1df12fb584818ea77f81e2d1d96093d71730","last_reissued_at":"2026-05-18T00:04:06.731632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.731632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Polarization for Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Madhu Sudan, Preetum Nakkiran, Venkatesan Guruswami","submitted_at":"2018-10-03T20:56:03Z","abstract_excerpt":"Using a mild variant of polar codes we design linear compression schemes compressing Hidden Markov sources (where the source is a Markov chain, but whose state is not necessarily observable from its output), and to decode from Hidden Markov channels (where the channel has a state and the error introduced depends on the state). We give the first polynomial time algorithms that manage to compress and decompress (or encode and decode) at input lengths that are polynomial $\\it{both}$ in the gap to capacity and the mixing time of the Markov chain. Prior work achieved capacity only asymptotically in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01969","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":""},"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":"1810.01969","created_at":"2026-05-18T00:04:06.731716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01969v1","created_at":"2026-05-18T00:04:06.731716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01969","created_at":"2026-05-18T00:04:06.731716+00:00"},{"alias_kind":"pith_short_12","alias_value":"27PUVOT72C6E","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"27PUVOT72C6ELCOM","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"27PUVOT7","created_at":"2026-05-18T12:31:59.375834+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/27PUVOT72C6ELCOMY2AT76Y56E","json":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E.json","graph_json":"https://pith.science/api/pith-number/27PUVOT72C6ELCOMY2AT76Y56E/graph.json","events_json":"https://pith.science/api/pith-number/27PUVOT72C6ELCOMY2AT76Y56E/events.json","paper":"https://pith.science/paper/27PUVOT7"},"agent_actions":{"view_html":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E","download_json":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E.json","view_paper":"https://pith.science/paper/27PUVOT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01969&json=true","fetch_graph":"https://pith.science/api/pith-number/27PUVOT72C6ELCOMY2AT76Y56E/graph.json","fetch_events":"https://pith.science/api/pith-number/27PUVOT72C6ELCOMY2AT76Y56E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E/action/storage_attestation","attest_author":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E/action/author_attestation","sign_citation":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E/action/citation_signature","submit_replication":"https://pith.science/pith/27PUVOT72C6ELCOMY2AT76Y56E/action/replication_record"}},"created_at":"2026-05-18T00:04:06.731716+00:00","updated_at":"2026-05-18T00:04:06.731716+00:00"}