{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ONIRXJSEWGAT3LGLWTLJEDMG7C","short_pith_number":"pith:ONIRXJSE","canonical_record":{"source":{"id":"2408.03840","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-07T15:25:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b14d1997b6e6d09b798ddddb01e49da2cac6201b0c1d4864be573f75911748bd","abstract_canon_sha256":"e1521109e2606532f183787f73ff1bf8cfa9e71f351f263335b288255f67ded5"},"schema_version":"1.0"},"canonical_sha256":"73511ba644b1813daccbb4d6920d86f88b7fab0a13e656bf3b006c70ddc724d3","source":{"kind":"arxiv","id":"2408.03840","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03840","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03840v3","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03840","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"ONIRXJSEWGAT","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"ONIRXJSEWGAT3LGL","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"ONIRXJSE","created_at":"2026-07-05T12:05:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ONIRXJSEWGAT3LGLWTLJEDMG7C","target":"record","payload":{"canonical_record":{"source":{"id":"2408.03840","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-07T15:25:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b14d1997b6e6d09b798ddddb01e49da2cac6201b0c1d4864be573f75911748bd","abstract_canon_sha256":"e1521109e2606532f183787f73ff1bf8cfa9e71f351f263335b288255f67ded5"},"schema_version":"1.0"},"canonical_sha256":"73511ba644b1813daccbb4d6920d86f88b7fab0a13e656bf3b006c70ddc724d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:09.579554Z","signature_b64":"XQdowXI/uaQ8ZTnMimOkPxk6u3ar5xjFasgn5cvu+g85luwed400kLqUsJmvzPwpWoCr73r5VPq5yO/Fa5jfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73511ba644b1813daccbb4d6920d86f88b7fab0a13e656bf3b006c70ddc724d3","last_reissued_at":"2026-07-05T12:05:09.578939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:09.578939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.03840","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-07-05T12:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g61so8v435vu2Y4eWMdbNsd8EVvPYy83UHX8v7iXGXL5csD1JKt+PpQ0Cv42pfTvkUjincoNahQ1BEIf/oCHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:57:42.399268Z"},"content_sha256":"7fc854e856f4bfadcaef70330666fecd54520f4ebae8826efbe11ae893276005","schema_version":"1.0","event_id":"sha256:7fc854e856f4bfadcaef70330666fecd54520f4ebae8826efbe11ae893276005"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ONIRXJSEWGAT3LGLWTLJEDMG7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Metric Function for SC-based Polar Decoders: Polarization, Pruning, and Fast Decoders","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mohsen Moradi","submitted_at":"2024-08-07T15:25:50Z","abstract_excerpt":"In this paper, we propose a method to obtain the optimal metric function at each depth of the polarization tree through a process we call polarization of the metric function. This polarization process generates an optimal metric at intermediate levels of the polarization tree, which can be applied in fast successive-cancellation-based (FSC) and SC list-based (FSCL) decoders -- decoders that partially explore the binary tree representation. We prove that at each step of the polarization tree, the expected value of the metric function random variable is the mutual information of the correspondin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03840","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.03840/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-05T12:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFILKG1Sw5in9Iw3gyPNyGOMxWtSSqv4lGbQJz76TI8aP2Wt+r0jw+i7pU+lY4NRHHRA9MVrkkxL1tjsoQXhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:57:42.399681Z"},"content_sha256":"b552482a5efe2b171393b17bfce8c11ea0c496019bc5be53604e6fe09b5598da","schema_version":"1.0","event_id":"sha256:b552482a5efe2b171393b17bfce8c11ea0c496019bc5be53604e6fe09b5598da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONIRXJSEWGAT3LGLWTLJEDMG7C/bundle.json","state_url":"https://pith.science/pith/ONIRXJSEWGAT3LGLWTLJEDMG7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONIRXJSEWGAT3LGLWTLJEDMG7C/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-19T18:57:42Z","links":{"resolver":"https://pith.science/pith/ONIRXJSEWGAT3LGLWTLJEDMG7C","bundle":"https://pith.science/pith/ONIRXJSEWGAT3LGLWTLJEDMG7C/bundle.json","state":"https://pith.science/pith/ONIRXJSEWGAT3LGLWTLJEDMG7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONIRXJSEWGAT3LGLWTLJEDMG7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ONIRXJSEWGAT3LGLWTLJEDMG7C","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":"e1521109e2606532f183787f73ff1bf8cfa9e71f351f263335b288255f67ded5","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-07T15:25:50Z","title_canon_sha256":"b14d1997b6e6d09b798ddddb01e49da2cac6201b0c1d4864be573f75911748bd"},"schema_version":"1.0","source":{"id":"2408.03840","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03840","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03840v3","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03840","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"ONIRXJSEWGAT","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"ONIRXJSEWGAT3LGL","created_at":"2026-07-05T12:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"ONIRXJSE","created_at":"2026-07-05T12:05:09Z"}],"graph_snapshots":[{"event_id":"sha256:b552482a5efe2b171393b17bfce8c11ea0c496019bc5be53604e6fe09b5598da","target":"graph","created_at":"2026-07-05T12:05:09Z","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/2408.03840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a method to obtain the optimal metric function at each depth of the polarization tree through a process we call polarization of the metric function. This polarization process generates an optimal metric at intermediate levels of the polarization tree, which can be applied in fast successive-cancellation-based (FSC) and SC list-based (FSCL) decoders -- decoders that partially explore the binary tree representation. We prove that at each step of the polarization tree, the expected value of the metric function random variable is the mutual information of the correspondin","authors_text":"Hessam Mahdavifar, Mohsen Moradi","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-07T15:25:50Z","title":"A New Metric Function for SC-based Polar Decoders: Polarization, Pruning, and Fast Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03840","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:7fc854e856f4bfadcaef70330666fecd54520f4ebae8826efbe11ae893276005","target":"record","created_at":"2026-07-05T12:05:09Z","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":"e1521109e2606532f183787f73ff1bf8cfa9e71f351f263335b288255f67ded5","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-07T15:25:50Z","title_canon_sha256":"b14d1997b6e6d09b798ddddb01e49da2cac6201b0c1d4864be573f75911748bd"},"schema_version":"1.0","source":{"id":"2408.03840","kind":"arxiv","version":3}},"canonical_sha256":"73511ba644b1813daccbb4d6920d86f88b7fab0a13e656bf3b006c70ddc724d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73511ba644b1813daccbb4d6920d86f88b7fab0a13e656bf3b006c70ddc724d3","first_computed_at":"2026-07-05T12:05:09.578939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:05:09.578939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQdowXI/uaQ8ZTnMimOkPxk6u3ar5xjFasgn5cvu+g85luwed400kLqUsJmvzPwpWoCr73r5VPq5yO/Fa5jfAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:05:09.579554Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.03840","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fc854e856f4bfadcaef70330666fecd54520f4ebae8826efbe11ae893276005","sha256:b552482a5efe2b171393b17bfce8c11ea0c496019bc5be53604e6fe09b5598da"],"state_sha256":"bdaa8178f1780863fd907f830ecff1a4231617e9d5cd672c7837bcb7d54720ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HU3zNt1aUtaCpKfKSrxF8Z9q4YJ+aPFS2DZAneMIXjP4sZuQv1/pyIHL+bSVcCGdwPQ4P0UvcGifICpljDzSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T18:57:42.403389Z","bundle_sha256":"b2590fec2c7a9133d726618dac1d3d8254f7da4716892a3ccf9f299e958b6419"}}