{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IHVEOTXSZHNVXTTNQCTOVGW5VX","short_pith_number":"pith:IHVEOTXS","canonical_record":{"source":{"id":"1308.2894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-13T15:19:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0a862e636ae1aeb0bcd938a326d6a487c2d9c5120872c5a9a12781bd6c4445ee","abstract_canon_sha256":"da21f53f8ece9194e16fabf42e4d28fa8e596b5241ef0a9507f8eea5792a75b2"},"schema_version":"1.0"},"canonical_sha256":"41ea474ef2c9db5bce6d80a6ea9addadf65e48136c1c528b40a1135693525350","source":{"kind":"arxiv","id":"1308.2894","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2894","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2894v1","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2894","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"IHVEOTXSZHNV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IHVEOTXSZHNVXTTN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IHVEOTXS","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IHVEOTXSZHNVXTTNQCTOVGW5VX","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-13T15:19:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0a862e636ae1aeb0bcd938a326d6a487c2d9c5120872c5a9a12781bd6c4445ee","abstract_canon_sha256":"da21f53f8ece9194e16fabf42e4d28fa8e596b5241ef0a9507f8eea5792a75b2"},"schema_version":"1.0"},"canonical_sha256":"41ea474ef2c9db5bce6d80a6ea9addadf65e48136c1c528b40a1135693525350","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:58.253353Z","signature_b64":"mmmXbg8l2Dff0a+KQIJpglzOfX+bVEGbpDmUtx3hM9tY1r6FR6L3MS+c9ew5465P+QSeo+dSFNFjR5N3GN7MCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41ea474ef2c9db5bce6d80a6ea9addadf65e48136c1c528b40a1135693525350","last_reissued_at":"2026-05-18T03:15:58.252752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:58.252752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2894","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-18T03: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":"iNUeaqPtCNwd0ViPTzpX0pW4hKobep3ISOk7MqlHb9IWk4F5s3xWgNHh1Wsy+lfvtStDVdhW9Egel9WWVvsyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:49:49.119444Z"},"content_sha256":"cc9be19eb23442c8bfbaa8f58ea7c6779afe6a860986dfa303d516f0deb18502","schema_version":"1.0","event_id":"sha256:cc9be19eb23442c8bfbaa8f58ea7c6779afe6a860986dfa303d516f0deb18502"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IHVEOTXSZHNVXTTNQCTOVGW5VX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Sphere Decoding of Polar Codes based on Optimum Path Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiaru Lin, Kai Chen, Kai Niu","submitted_at":"2013-08-13T15:19:05Z","abstract_excerpt":"Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere are enumerated and the radius is decreased gradually until no available candidate is in the sphere. In order to reduce the complexity of SD, a stack SD (SSD) algorithm with an efficient enumeration is proposed in this paper. Based on a novel path metric, SSD can effectively narrow the search range when enumerating the candidates within a sphere. The proposed m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2894","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-18T03: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":"9BNUg3LQKQORFJdYm3JTOm1OHbjoJMR+wfi3EesfAy4RQscRsZuKUihVpLgnFRadmrBgt7D+42bQneesEyyPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:49:49.119792Z"},"content_sha256":"77dbd2069923b2d224950330e8e686d405d53095b3ced25c4347fa4dac56ee94","schema_version":"1.0","event_id":"sha256:77dbd2069923b2d224950330e8e686d405d53095b3ced25c4347fa4dac56ee94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHVEOTXSZHNVXTTNQCTOVGW5VX/bundle.json","state_url":"https://pith.science/pith/IHVEOTXSZHNVXTTNQCTOVGW5VX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHVEOTXSZHNVXTTNQCTOVGW5VX/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-26T08:49:49Z","links":{"resolver":"https://pith.science/pith/IHVEOTXSZHNVXTTNQCTOVGW5VX","bundle":"https://pith.science/pith/IHVEOTXSZHNVXTTNQCTOVGW5VX/bundle.json","state":"https://pith.science/pith/IHVEOTXSZHNVXTTNQCTOVGW5VX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHVEOTXSZHNVXTTNQCTOVGW5VX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IHVEOTXSZHNVXTTNQCTOVGW5VX","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":"da21f53f8ece9194e16fabf42e4d28fa8e596b5241ef0a9507f8eea5792a75b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-13T15:19:05Z","title_canon_sha256":"0a862e636ae1aeb0bcd938a326d6a487c2d9c5120872c5a9a12781bd6c4445ee"},"schema_version":"1.0","source":{"id":"1308.2894","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2894","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2894v1","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2894","created_at":"2026-05-18T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"IHVEOTXSZHNV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IHVEOTXSZHNVXTTN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IHVEOTXS","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:77dbd2069923b2d224950330e8e686d405d53095b3ced25c4347fa4dac56ee94","target":"graph","created_at":"2026-05-18T03: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"},"paper":{"abstract_excerpt":"Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere are enumerated and the radius is decreased gradually until no available candidate is in the sphere. In order to reduce the complexity of SD, a stack SD (SSD) algorithm with an efficient enumeration is proposed in this paper. Based on a novel path metric, SSD can effectively narrow the search range when enumerating the candidates within a sphere. The proposed m","authors_text":"Jiaru Lin, Kai Chen, Kai Niu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-13T15:19:05Z","title":"Low-Complexity Sphere Decoding of Polar Codes based on Optimum Path Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2894","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:cc9be19eb23442c8bfbaa8f58ea7c6779afe6a860986dfa303d516f0deb18502","target":"record","created_at":"2026-05-18T03: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":"da21f53f8ece9194e16fabf42e4d28fa8e596b5241ef0a9507f8eea5792a75b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-13T15:19:05Z","title_canon_sha256":"0a862e636ae1aeb0bcd938a326d6a487c2d9c5120872c5a9a12781bd6c4445ee"},"schema_version":"1.0","source":{"id":"1308.2894","kind":"arxiv","version":1}},"canonical_sha256":"41ea474ef2c9db5bce6d80a6ea9addadf65e48136c1c528b40a1135693525350","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41ea474ef2c9db5bce6d80a6ea9addadf65e48136c1c528b40a1135693525350","first_computed_at":"2026-05-18T03:15:58.252752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:58.252752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmmXbg8l2Dff0a+KQIJpglzOfX+bVEGbpDmUtx3hM9tY1r6FR6L3MS+c9ew5465P+QSeo+dSFNFjR5N3GN7MCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:58.253353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2894","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc9be19eb23442c8bfbaa8f58ea7c6779afe6a860986dfa303d516f0deb18502","sha256:77dbd2069923b2d224950330e8e686d405d53095b3ced25c4347fa4dac56ee94"],"state_sha256":"f254c207033614dff9ce9482dc20eccb7fa9077610948cb4deb6b05dfec0c016"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9siFPnRcs6dzGZHTlHQ+KBnsKzpJ8ZcQJhQXQ8GYfHTvKS0E0uRzrsoPP7vhfPvP6fA3ZtE3LyEusNORLTzdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T08:49:49.121747Z","bundle_sha256":"928e759c7f452b0a0ee94ca29e70ed429a11fe12b33a351d3967573a661b7f94"}}