{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UJ325PSW5Q2SEV635LNWO4V3NO","short_pith_number":"pith:UJ325PSW","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"},"canonical_sha256":"a277aebe56ec352257dbeadb6772bb6b9e6160fbbd9fb13373fc69476f64a19d","source":{"kind":"arxiv","id":"1012.0367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0367","created_at":"2026-05-18T04:34:17Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0367v1","created_at":"2026-05-18T04:34:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0367","created_at":"2026-05-18T04:34:17Z"},{"alias_kind":"pith_short_12","alias_value":"UJ325PSW5Q2S","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UJ325PSW5Q2SEV63","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UJ325PSW","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UJ325PSW5Q2SEV635LNWO4V3NO","target":"record","payload":{"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"},"canonical_sha256":"a277aebe56ec352257dbeadb6772bb6b9e6160fbbd9fb13373fc69476f64a19d","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"},"source_kind":"arxiv","source_id":"1012.0367","source_version":1,"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-05-18T04:34:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lo/jigUk2nhMG+4OsL4nNBPkItSXKnExseEFTeTRlRDBnavzcCnVAKSiGMi1mBaBPLtMBnCOaLwScdP3OrbbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:26:45.468372Z"},"content_sha256":"e1ca8aec4eb48816678a504c16282bba10542c339265005e77ce1f04ec89d19d","schema_version":"1.0","event_id":"sha256:e1ca8aec4eb48816678a504c16282bba10542c339265005e77ce1f04ec89d19d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UJ325PSW5Q2SEV635LNWO4V3NO","target":"graph","payload":{"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"},"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-05-18T04:34:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VFS39gwDbu5xWZ3nyTUb3qdYB3tdUrpg1tf3KsmfCY5h6XVgdEOWRsxtFhb0kyZmGS3FO8IFB9Pgtqi3yY2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:26:45.468723Z"},"content_sha256":"d760b1d109d40481ccbb00b8fb9eadca1a77b9aa8ecea69155e4e824b994938e","schema_version":"1.0","event_id":"sha256:d760b1d109d40481ccbb00b8fb9eadca1a77b9aa8ecea69155e4e824b994938e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/bundle.json","state_url":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJ325PSW5Q2SEV635LNWO4V3NO/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-06-08T11:26:45Z","links":{"resolver":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO","bundle":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/bundle.json","state":"https://pith.science/pith/UJ325PSW5Q2SEV635LNWO4V3NO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJ325PSW5Q2SEV635LNWO4V3NO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UJ325PSW5Q2SEV635LNWO4V3NO","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":"43a1d3aa457b8e7a5c8fb9ee5fe82cae659752aecc5ea9ab9a15669a307e6203","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T02:10:25Z","title_canon_sha256":"03918cc03ea311d560d60df2ff4a21eafcae0fa57439e06a2834fc459a0291d2"},"schema_version":"1.0","source":{"id":"1012.0367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0367","created_at":"2026-05-18T04:34:17Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0367v1","created_at":"2026-05-18T04:34:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0367","created_at":"2026-05-18T04:34:17Z"},{"alias_kind":"pith_short_12","alias_value":"UJ325PSW5Q2S","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UJ325PSW5Q2SEV63","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UJ325PSW","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:d760b1d109d40481ccbb00b8fb9eadca1a77b9aa8ecea69155e4e824b994938e","target":"graph","created_at":"2026-05-18T04:34:17Z","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"},"paper":{"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","authors_text":"Emmanuel Abbe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T02:10:25Z","title":"Universal polar coding and sparse recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0367","kind":"arxiv","version":1},"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:e1ca8aec4eb48816678a504c16282bba10542c339265005e77ce1f04ec89d19d","target":"record","created_at":"2026-05-18T04:34:17Z","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":"43a1d3aa457b8e7a5c8fb9ee5fe82cae659752aecc5ea9ab9a15669a307e6203","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-02T02:10:25Z","title_canon_sha256":"03918cc03ea311d560d60df2ff4a21eafcae0fa57439e06a2834fc459a0291d2"},"schema_version":"1.0","source":{"id":"1012.0367","kind":"arxiv","version":1}},"canonical_sha256":"a277aebe56ec352257dbeadb6772bb6b9e6160fbbd9fb13373fc69476f64a19d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a277aebe56ec352257dbeadb6772bb6b9e6160fbbd9fb13373fc69476f64a19d","first_computed_at":"2026-05-18T04:34:17.912548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:17.912548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oLVMGzD9o5bDMDxbpp0RkofmND56GDRmgvOXnh1BxmZYv139G6mJtgq1tHzXJcIVNfJqA1hx6nv5OtDhTCL7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:17.912938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1ca8aec4eb48816678a504c16282bba10542c339265005e77ce1f04ec89d19d","sha256:d760b1d109d40481ccbb00b8fb9eadca1a77b9aa8ecea69155e4e824b994938e"],"state_sha256":"5d1a619119588ab0e2e4040992d46803fcab2bae10f516232f2621428592a279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOY6DGFijStNbn8WHccUrztdIYyFgBS6JSGffWjapljhFiHgnatO4pE6q4S9dwGJJM2mERcgYlZcKVIRbkB4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:26:45.470687Z","bundle_sha256":"5d8b5b95b2e852de7d26d462ded1af6b78e94546410d94c222232f8e8fc73d75"}}