{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UJ325PSW5Q2SEV635LNWO4V3NO","short_pith_number":"pith:UJ325PSW","schema_version":"1.0","canonical_sha256":"a277aebe56ec352257dbeadb6772bb6b9e6160fbbd9fb13373fc69476f64a19d","source":{"kind":"arxiv","id":"1012.0367","version":1},"attestation_state":"computed","paper":{"title":"Universal polar coding and sparse recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe","submitted_at":"2010-12-02T02:10:25Z","abstract_excerpt":"This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compression (or communication) scheme designed for one distribution can also succeed for another one. The original polar decoding algorithm is also generalized to an algorithm allowing to learn information about the source distribution using the idea of checkers. These tools are used to construct a universal compression algorithm for binary sources, operating at the lowest achievable rate (entropy), wit"},"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":"1012.0367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T02:10:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03918cc03ea311d560d60df2ff4a21eafcae0fa57439e06a2834fc459a0291d2","abstract_canon_sha256":"43a1d3aa457b8e7a5c8fb9ee5fe82cae659752aecc5ea9ab9a15669a307e6203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:17.912938Z","signature_b64":"oLVMGzD9o5bDMDxbpp0RkofmND56GDRmgvOXnh1BxmZYv139G6mJtgq1tHzXJcIVNfJqA1hx6nv5OtDhTCL7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a277aebe56ec352257dbeadb6772bb6b9e6160fbbd9fb13373fc69476f64a19d","last_reissued_at":"2026-05-18T04:34:17.912548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:17.912548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal polar coding and sparse recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe","submitted_at":"2010-12-02T02:10:25Z","abstract_excerpt":"This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compression (or communication) scheme designed for one distribution can also succeed for another one. The original polar decoding algorithm is also generalized to an algorithm allowing to learn information about the source distribution using the idea of checkers. These tools are used to construct a universal compression algorithm for binary sources, operating at the lowest achievable rate (entropy), wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0367","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":"1012.0367","created_at":"2026-05-18T04:34:17.912604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0367v1","created_at":"2026-05-18T04:34:17.912604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0367","created_at":"2026-05-18T04:34:17.912604+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJ325PSW5Q2S","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJ325PSW5Q2SEV63","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJ325PSW","created_at":"2026-05-18T12:26:15.391820+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/UJ325PSW5Q2SEV635LNWO4V3NO","json":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO.json","graph_json":"https://pith.science/api/pith-number/UJ325PSW5Q2SEV635LNWO4V3NO/graph.json","events_json":"https://pith.science/api/pith-number/UJ325PSW5Q2SEV635LNWO4V3NO/events.json","paper":"https://pith.science/paper/UJ325PSW"},"agent_actions":{"view_html":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO","download_json":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO.json","view_paper":"https://pith.science/paper/UJ325PSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0367&json=true","fetch_graph":"https://pith.science/api/pith-number/UJ325PSW5Q2SEV635LNWO4V3NO/graph.json","fetch_events":"https://pith.science/api/pith-number/UJ325PSW5Q2SEV635LNWO4V3NO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/action/storage_attestation","attest_author":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/action/author_attestation","sign_citation":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/action/citation_signature","submit_replication":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/action/replication_record"}},"created_at":"2026-05-18T04:34:17.912604+00:00","updated_at":"2026-05-18T04:34:17.912604+00:00"}