{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OVHCEWNVY5OZTWJ62XIXJCQUVA","short_pith_number":"pith:OVHCEWNV","canonical_record":{"source":{"id":"2506.04163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-04T17:02:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b23ee4d95e61dd15eedf31ddaac8b56679d2e513ae7fec344a73d5176d60a0ee","abstract_canon_sha256":"41903f7e061860b99d5f8159b9598afbc601f71e84fd79049c3015ea87af50dc"},"schema_version":"1.0"},"canonical_sha256":"754e2259b5c75d99d93ed5d1748a14a82da7fc1491b3a8dffe0a29f2599d5deb","source":{"kind":"arxiv","id":"2506.04163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04163","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04163v1","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04163","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"OVHCEWNVY5OZ","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"pith_short_16","alias_value":"OVHCEWNVY5OZTWJ6","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"pith_short_8","alias_value":"OVHCEWNV","created_at":"2026-07-05T11:15:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OVHCEWNVY5OZTWJ62XIXJCQUVA","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-04T17:02:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b23ee4d95e61dd15eedf31ddaac8b56679d2e513ae7fec344a73d5176d60a0ee","abstract_canon_sha256":"41903f7e061860b99d5f8159b9598afbc601f71e84fd79049c3015ea87af50dc"},"schema_version":"1.0"},"canonical_sha256":"754e2259b5c75d99d93ed5d1748a14a82da7fc1491b3a8dffe0a29f2599d5deb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:58.222887Z","signature_b64":"l0lNOzN4w+EUyuVD539V1NRsRkhA6qTvJw1uHIs3s6oCvDBEfcG4kFeHW8lF1cSyLIhRJNRNaV2nRwYaINVTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"754e2259b5c75d99d93ed5d1748a14a82da7fc1491b3a8dffe0a29f2599d5deb","last_reissued_at":"2026-07-05T11:15:58.222389Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:58.222389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04163","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-07-05T11:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOoWsgToy0brOwDbmjd0750bX/eKnPY3CsT20qnN7Z3vr6EA9SIXad7QjTK6qtostMBA7mN/mUYFBrvUuWy7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:55:51.707036Z"},"content_sha256":"531332a8d61139fef308095d54ec148b4e5a74114bfeec421576856fac2d7450","schema_version":"1.0","event_id":"sha256:531332a8d61139fef308095d54ec148b4e5a74114bfeec421576856fac2d7450"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OVHCEWNVY5OZTWJ62XIXJCQUVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ming Xu, Xiaoyan Cheng, Yadong Jiao, Yuansheng Tang","submitted_at":"2025-06-04T17:02:04Z","abstract_excerpt":"Polar codes introduced by Arikan in 2009 are the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding and decoding. Identifying unreliable synthetic channels in polar code construction is crucial. Currently, because of the large size of the output alphabets of synthetic channels, there is no effective approach to evaluate their reliability, except in the case that the underlying channels are binary erasure channels. This paper defines equivalence and symmetry based on the likelihood ratio profile of BIDMCs and characterizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04163","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.04163/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"},"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-07-05T11:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8i6q/pBIfgOoZdigBj5pLaYXfuhbKcXDSharKx5yFlnXeWMRrn26hYNc700DMeyCfmCg6rM7wsRKgqSQ9x3NBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:55:51.707563Z"},"content_sha256":"24c0bfa2e20f72cab696145a89251d116fb7f13643127fbf5319f2303dde6117","schema_version":"1.0","event_id":"sha256:24c0bfa2e20f72cab696145a89251d116fb7f13643127fbf5319f2303dde6117"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVHCEWNVY5OZTWJ62XIXJCQUVA/bundle.json","state_url":"https://pith.science/pith/OVHCEWNVY5OZTWJ62XIXJCQUVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVHCEWNVY5OZTWJ62XIXJCQUVA/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-08-08T20:55:51Z","links":{"resolver":"https://pith.science/pith/OVHCEWNVY5OZTWJ62XIXJCQUVA","bundle":"https://pith.science/pith/OVHCEWNVY5OZTWJ62XIXJCQUVA/bundle.json","state":"https://pith.science/pith/OVHCEWNVY5OZTWJ62XIXJCQUVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVHCEWNVY5OZTWJ62XIXJCQUVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OVHCEWNVY5OZTWJ62XIXJCQUVA","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":"41903f7e061860b99d5f8159b9598afbc601f71e84fd79049c3015ea87af50dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-04T17:02:04Z","title_canon_sha256":"b23ee4d95e61dd15eedf31ddaac8b56679d2e513ae7fec344a73d5176d60a0ee"},"schema_version":"1.0","source":{"id":"2506.04163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04163","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04163v1","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04163","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"OVHCEWNVY5OZ","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"pith_short_16","alias_value":"OVHCEWNVY5OZTWJ6","created_at":"2026-07-05T11:15:58Z"},{"alias_kind":"pith_short_8","alias_value":"OVHCEWNV","created_at":"2026-07-05T11:15:58Z"}],"graph_snapshots":[{"event_id":"sha256:24c0bfa2e20f72cab696145a89251d116fb7f13643127fbf5319f2303dde6117","target":"graph","created_at":"2026-07-05T11:15:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.04163/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Polar codes introduced by Arikan in 2009 are the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding and decoding. Identifying unreliable synthetic channels in polar code construction is crucial. Currently, because of the large size of the output alphabets of synthetic channels, there is no effective approach to evaluate their reliability, except in the case that the underlying channels are binary erasure channels. This paper defines equivalence and symmetry based on the likelihood ratio profile of BIDMCs and characterizes","authors_text":"Ming Xu, Xiaoyan Cheng, Yadong Jiao, Yuansheng Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-04T17:02:04Z","title":"On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04163","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:531332a8d61139fef308095d54ec148b4e5a74114bfeec421576856fac2d7450","target":"record","created_at":"2026-07-05T11:15:58Z","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":"41903f7e061860b99d5f8159b9598afbc601f71e84fd79049c3015ea87af50dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-04T17:02:04Z","title_canon_sha256":"b23ee4d95e61dd15eedf31ddaac8b56679d2e513ae7fec344a73d5176d60a0ee"},"schema_version":"1.0","source":{"id":"2506.04163","kind":"arxiv","version":1}},"canonical_sha256":"754e2259b5c75d99d93ed5d1748a14a82da7fc1491b3a8dffe0a29f2599d5deb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"754e2259b5c75d99d93ed5d1748a14a82da7fc1491b3a8dffe0a29f2599d5deb","first_computed_at":"2026-07-05T11:15:58.222389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:58.222389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l0lNOzN4w+EUyuVD539V1NRsRkhA6qTvJw1uHIs3s6oCvDBEfcG4kFeHW8lF1cSyLIhRJNRNaV2nRwYaINVTBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:58.222887Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:531332a8d61139fef308095d54ec148b4e5a74114bfeec421576856fac2d7450","sha256:24c0bfa2e20f72cab696145a89251d116fb7f13643127fbf5319f2303dde6117"],"state_sha256":"d0cb7de33afc7f32af6fb1ade40ea677d6f091befdb35db64ab8130197c58dab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkFmU99N5tvg/Y8xBtXfFUyJ1ikDK9n5OPY1YL+5q4C4eoHQGvXoKgu/ziZV0AdB1dQ4NX9O/BfzY6lA9i4ZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:55:51.711367Z","bundle_sha256":"93ed3e10440935402996cc6d494bf73975197e7ec32711b28e20a187952b59c2"}}