{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5DJCERL4K6NU3OOSRFH4FCI72E","short_pith_number":"pith:5DJCERL4","canonical_record":{"source":{"id":"1602.01870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T22:18:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a6ee6a11952588cdc2028cbc5da551d0dcfebab2d4e17a28125466574aae093","abstract_canon_sha256":"45c0e07b01c354b82c7e40157c0bc847538aa62ac4db2d2320c96ed87675227d"},"schema_version":"1.0"},"canonical_sha256":"e8d222457c579b4db9d2894fc2891fd1015ed42b46ce1201433d4ed5a0d51f15","source":{"kind":"arxiv","id":"1602.01870","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01870","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01870v3","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01870","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"5DJCERL4K6NU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5DJCERL4K6NU3OOS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5DJCERL4","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5DJCERL4K6NU3OOSRFH4FCI72E","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T22:18:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a6ee6a11952588cdc2028cbc5da551d0dcfebab2d4e17a28125466574aae093","abstract_canon_sha256":"45c0e07b01c354b82c7e40157c0bc847538aa62ac4db2d2320c96ed87675227d"},"schema_version":"1.0"},"canonical_sha256":"e8d222457c579b4db9d2894fc2891fd1015ed42b46ce1201433d4ed5a0d51f15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:05.430086Z","signature_b64":"hmcF9hzK+cw6qcz95CYKsFuw6fRk2qk7Et1bjVA8mYKwyvPxjG4Lw3J9RHalf1Os4x4mfCv6RQZs9jQHL+5JAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8d222457c579b4db9d2894fc2891fd1015ed42b46ce1201433d4ed5a0d51f15","last_reissued_at":"2026-05-18T00:08:05.429624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:05.429624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01870","source_version":3,"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-18T00:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pca06RpbedT5azgAySrLz8rBiMP8N5LYenZdLMIv8OPOm7ZtAYzY1AolY4YSSF92R416CbSmme7+w1pSif+/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:37:09.036722Z"},"content_sha256":"f83d5ec81dd23edeb5673adf1ae50bbf3cd74fc630ec38bd083f63e5ffa1b449","schema_version":"1.0","event_id":"sha256:f83d5ec81dd23edeb5673adf1ae50bbf3cd74fc630ec38bd083f63e5ffa1b449"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5DJCERL4K6NU3OOSRFH4FCI72E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar Coding for Processes with Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eren Sasoglu, Ido Tal","submitted_at":"2016-02-04T22:18:42Z","abstract_excerpt":"We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be present in the channel, the input, or both. We show that $\\psi$-mixing processes polarize under the standard Ar\\i{}kan transform, under a mild condition. We further show that the rate of polarization of the \\emph{low-entropy} synthetic channels is roughly $O(2^{-\\sqrt{N}})$, where $N$ is the blocklength. That is, essentially the same rate as in the memoryless case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01870","kind":"arxiv","version":3},"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-18T00:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pq3qnxPOB1xGRaWwt9CJOW86MVDn44yiO/VX9ZX859uR86d0j6KlU04LFkdxS/BNEgFsPzHRTLLTcemYg76NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:37:09.037396Z"},"content_sha256":"e6b4872b12a28e1a407dcf7967c60f160fce1a8c22317303045738183a1feb4c","schema_version":"1.0","event_id":"sha256:e6b4872b12a28e1a407dcf7967c60f160fce1a8c22317303045738183a1feb4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DJCERL4K6NU3OOSRFH4FCI72E/bundle.json","state_url":"https://pith.science/pith/5DJCERL4K6NU3OOSRFH4FCI72E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DJCERL4K6NU3OOSRFH4FCI72E/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-01T02:37:09Z","links":{"resolver":"https://pith.science/pith/5DJCERL4K6NU3OOSRFH4FCI72E","bundle":"https://pith.science/pith/5DJCERL4K6NU3OOSRFH4FCI72E/bundle.json","state":"https://pith.science/pith/5DJCERL4K6NU3OOSRFH4FCI72E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DJCERL4K6NU3OOSRFH4FCI72E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5DJCERL4K6NU3OOSRFH4FCI72E","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":"45c0e07b01c354b82c7e40157c0bc847538aa62ac4db2d2320c96ed87675227d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T22:18:42Z","title_canon_sha256":"9a6ee6a11952588cdc2028cbc5da551d0dcfebab2d4e17a28125466574aae093"},"schema_version":"1.0","source":{"id":"1602.01870","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01870","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01870v3","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01870","created_at":"2026-05-18T00:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"5DJCERL4K6NU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5DJCERL4K6NU3OOS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5DJCERL4","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:e6b4872b12a28e1a407dcf7967c60f160fce1a8c22317303045738183a1feb4c","target":"graph","created_at":"2026-05-18T00:08:05Z","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":"We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be present in the channel, the input, or both. We show that $\\psi$-mixing processes polarize under the standard Ar\\i{}kan transform, under a mild condition. We further show that the rate of polarization of the \\emph{low-entropy} synthetic channels is roughly $O(2^{-\\sqrt{N}})$, where $N$ is the blocklength. That is, essentially the same rate as in the memoryless case.","authors_text":"Eren Sasoglu, Ido Tal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T22:18:42Z","title":"Polar Coding for Processes with Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01870","kind":"arxiv","version":3},"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:f83d5ec81dd23edeb5673adf1ae50bbf3cd74fc630ec38bd083f63e5ffa1b449","target":"record","created_at":"2026-05-18T00:08:05Z","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":"45c0e07b01c354b82c7e40157c0bc847538aa62ac4db2d2320c96ed87675227d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T22:18:42Z","title_canon_sha256":"9a6ee6a11952588cdc2028cbc5da551d0dcfebab2d4e17a28125466574aae093"},"schema_version":"1.0","source":{"id":"1602.01870","kind":"arxiv","version":3}},"canonical_sha256":"e8d222457c579b4db9d2894fc2891fd1015ed42b46ce1201433d4ed5a0d51f15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8d222457c579b4db9d2894fc2891fd1015ed42b46ce1201433d4ed5a0d51f15","first_computed_at":"2026-05-18T00:08:05.429624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:05.429624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hmcF9hzK+cw6qcz95CYKsFuw6fRk2qk7Et1bjVA8mYKwyvPxjG4Lw3J9RHalf1Os4x4mfCv6RQZs9jQHL+5JAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:05.430086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01870","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f83d5ec81dd23edeb5673adf1ae50bbf3cd74fc630ec38bd083f63e5ffa1b449","sha256:e6b4872b12a28e1a407dcf7967c60f160fce1a8c22317303045738183a1feb4c"],"state_sha256":"2c7159f051ee6fc17bf9a4b4147ea35cde4cb0e8084a1217ec75af6924137108"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1aabfY8stYHj1QZqfLBh+mOZf6IcuyogbFtRan1PwxQo/ABCFnlTrTpMLsMsr9Oe4KOOcbkzUBxPbokh1MbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:37:09.039840Z","bundle_sha256":"0bcc3bbc9c3f5157544bfa49e12cab12cfe70ebffee5ee733e90c943f6aa3bca"}}