{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QY7NWYVPNTKQE7ECSNOKKRU5UQ","short_pith_number":"pith:QY7NWYVP","canonical_record":{"source":{"id":"1403.7851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-31T02:29:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c8b678b371662f618a428719c5b9fe9e4da0b259b753e7e96913252e9895a20","abstract_canon_sha256":"477ab65932367b2af95f884e7d18585590d3b05beb690a3afbf40dc1ca309f66"},"schema_version":"1.0"},"canonical_sha256":"863edb62af6cd5027c82935ca5469da422f8f2b84359e7e0343fa0bd8c9de0c6","source":{"kind":"arxiv","id":"1403.7851","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7851","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7851v2","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7851","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"QY7NWYVPNTKQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QY7NWYVPNTKQE7EC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QY7NWYVP","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QY7NWYVPNTKQE7ECSNOKKRU5UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1403.7851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-31T02:29:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c8b678b371662f618a428719c5b9fe9e4da0b259b753e7e96913252e9895a20","abstract_canon_sha256":"477ab65932367b2af95f884e7d18585590d3b05beb690a3afbf40dc1ca309f66"},"schema_version":"1.0"},"canonical_sha256":"863edb62af6cd5027c82935ca5469da422f8f2b84359e7e0343fa0bd8c9de0c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:57.609144Z","signature_b64":"1bG2nZTlGbwTg8elzlMB9isKIyezu9nEL1JfidTZLGhq5icgONELVao7IOOhZRwtJpC5RPVAo033uPCmdjDqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863edb62af6cd5027c82935ca5469da422f8f2b84359e7e0343fa0bd8c9de0c6","last_reissued_at":"2026-05-18T02:52:57.608479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:57.608479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.7851","source_version":2,"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-18T02:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1WCWbXvhgNci0mEDxa6cOMh1yM41LwZvI1fW+H3FmCdmVXc0yrsMJk84UOqGRouZUdr1IqVnaDJwQy59peBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:36:34.152108Z"},"content_sha256":"1cfaefc91f81d50ba4682c97307cc10d95ac20f2b141652b6d5940214a867b60","schema_version":"1.0","event_id":"sha256:1cfaefc91f81d50ba4682c97307cc10d95ac20f2b141652b6d5940214a867b60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QY7NWYVPNTKQE7ECSNOKKRU5UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Linear Programming Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Paul H. Siegel, Veeresh Taranalli","submitted_at":"2014-03-31T02:29:19Z","abstract_excerpt":"Polar codes are high density parity check codes and hence the sparse factor graph, instead of the parity check matrix, has been used to practically represent an LP polytope for LP decoding. Although LP decoding on this polytope has the ML-certificate property, it performs poorly over a BAWGN channel. In this paper, we propose modifications to adaptive cut generation based LP decoding techniques and apply the modified-adaptive LP decoder to short blocklength polar codes over a BAWGN channel. The proposed decoder provides significant FER performance gain compared to the previously proposed LP de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7851","kind":"arxiv","version":2},"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-18T02:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0uG2s8GEVierxoT6FOjeiEcLP22boQowTBEndGU7YTJSt8n6ut45RYasKh//TDjGcau/VlvOs7C1yESJR5yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:36:34.152481Z"},"content_sha256":"e17c169e092c8b407c89b08e47ad23f82851db7053bd5365cde51c119288a13c","schema_version":"1.0","event_id":"sha256:e17c169e092c8b407c89b08e47ad23f82851db7053bd5365cde51c119288a13c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY7NWYVPNTKQE7ECSNOKKRU5UQ/bundle.json","state_url":"https://pith.science/pith/QY7NWYVPNTKQE7ECSNOKKRU5UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY7NWYVPNTKQE7ECSNOKKRU5UQ/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-02T08:36:34Z","links":{"resolver":"https://pith.science/pith/QY7NWYVPNTKQE7ECSNOKKRU5UQ","bundle":"https://pith.science/pith/QY7NWYVPNTKQE7ECSNOKKRU5UQ/bundle.json","state":"https://pith.science/pith/QY7NWYVPNTKQE7ECSNOKKRU5UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY7NWYVPNTKQE7ECSNOKKRU5UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QY7NWYVPNTKQE7ECSNOKKRU5UQ","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":"477ab65932367b2af95f884e7d18585590d3b05beb690a3afbf40dc1ca309f66","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-31T02:29:19Z","title_canon_sha256":"4c8b678b371662f618a428719c5b9fe9e4da0b259b753e7e96913252e9895a20"},"schema_version":"1.0","source":{"id":"1403.7851","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7851","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7851v2","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7851","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"QY7NWYVPNTKQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QY7NWYVPNTKQE7EC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QY7NWYVP","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:e17c169e092c8b407c89b08e47ad23f82851db7053bd5365cde51c119288a13c","target":"graph","created_at":"2026-05-18T02:52:57Z","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":"Polar codes are high density parity check codes and hence the sparse factor graph, instead of the parity check matrix, has been used to practically represent an LP polytope for LP decoding. Although LP decoding on this polytope has the ML-certificate property, it performs poorly over a BAWGN channel. In this paper, we propose modifications to adaptive cut generation based LP decoding techniques and apply the modified-adaptive LP decoder to short blocklength polar codes over a BAWGN channel. The proposed decoder provides significant FER performance gain compared to the previously proposed LP de","authors_text":"Paul H. Siegel, Veeresh Taranalli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-31T02:29:19Z","title":"Adaptive Linear Programming Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7851","kind":"arxiv","version":2},"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:1cfaefc91f81d50ba4682c97307cc10d95ac20f2b141652b6d5940214a867b60","target":"record","created_at":"2026-05-18T02:52:57Z","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":"477ab65932367b2af95f884e7d18585590d3b05beb690a3afbf40dc1ca309f66","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-31T02:29:19Z","title_canon_sha256":"4c8b678b371662f618a428719c5b9fe9e4da0b259b753e7e96913252e9895a20"},"schema_version":"1.0","source":{"id":"1403.7851","kind":"arxiv","version":2}},"canonical_sha256":"863edb62af6cd5027c82935ca5469da422f8f2b84359e7e0343fa0bd8c9de0c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863edb62af6cd5027c82935ca5469da422f8f2b84359e7e0343fa0bd8c9de0c6","first_computed_at":"2026-05-18T02:52:57.608479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:57.608479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1bG2nZTlGbwTg8elzlMB9isKIyezu9nEL1JfidTZLGhq5icgONELVao7IOOhZRwtJpC5RPVAo033uPCmdjDqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:57.609144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7851","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cfaefc91f81d50ba4682c97307cc10d95ac20f2b141652b6d5940214a867b60","sha256:e17c169e092c8b407c89b08e47ad23f82851db7053bd5365cde51c119288a13c"],"state_sha256":"b7fe5f5d48146318cc9b9dddac57032636bae930222b3a5dc36af18088a4e7eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWnLRVZgtx38FpNwD0qMMXvAOydPjuwViTzMKBGMC2mRaWblvMf2xxYaLvLck6vPP8mkIBC7595eII60lsQNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:36:34.154437Z","bundle_sha256":"960234093d24272eba9436da5b09f79c7db36bb6de5a0035f2ec15ab854bbd6d"}}