{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:T63E5QIM55FESCM5BSRXDEKU4E","short_pith_number":"pith:T63E5QIM","canonical_record":{"source":{"id":"1305.5762","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T14:58:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"edd2070f73b7519a17c58ca83ce6ea6f3474f6c1f208a3076a3db9d14d978447","abstract_canon_sha256":"a4730e7202036ac51b679a1ef116a930ae2257238506822d95f871f65aad1315"},"schema_version":"1.0"},"canonical_sha256":"9fb64ec10cef4a49099d0ca3719154e13490a45c059aefc3b7fef93eb9f097d9","source":{"kind":"arxiv","id":"1305.5762","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5762","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5762v5","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5762","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"T63E5QIM55FE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T63E5QIM55FESCM5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T63E5QIM","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:T63E5QIM55FESCM5BSRXDEKU4E","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5762","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T14:58:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"edd2070f73b7519a17c58ca83ce6ea6f3474f6c1f208a3076a3db9d14d978447","abstract_canon_sha256":"a4730e7202036ac51b679a1ef116a930ae2257238506822d95f871f65aad1315"},"schema_version":"1.0"},"canonical_sha256":"9fb64ec10cef4a49099d0ca3719154e13490a45c059aefc3b7fef93eb9f097d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.153644Z","signature_b64":"1F5tCa809gik2VUH1HUSer1ueU5xAtmGurMf+stRlnymJ3IUe3Gz5m/T0HPyR39U98qg6WfAjzrinZ1rF+LkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb64ec10cef4a49099d0ca3719154e13490a45c059aefc3b7fef93eb9f097d9","last_reissued_at":"2026-05-18T00:58:17.152897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.152897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5762","source_version":5,"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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eR/7myl9M1QfdokQVpLQWfQ9ylrmktM73GcWb422E+fUN+uHREMzrrH7Al0KDIdlqEAoW5zu+cPtpu3jkuJcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:14:45.107862Z"},"content_sha256":"d00bb9e344d26d96ab7d5ca246775047e760b59e85307a10e92c05fe7ee6e6d1","schema_version":"1.0","event_id":"sha256:d00bb9e344d26d96ab7d5ca246775047e760b59e85307a10e92c05fe7ee6e6d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:T63E5QIM55FESCM5BSRXDEKU4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding by Sampling - Part II: Derandomization and Soft-output Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Shuiyin Liu, Zheng Wang","submitted_at":"2013-05-24T14:58:10Z","abstract_excerpt":"In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic, which brings considerable performance improvement and complexity reduction over to the randomized sampling. Moreover, the upper bound on the sample size K, which corresponds to near-maximum likelihood (ML) performance, is derived. We also find that the proposed algorithm can be used as an efficient tool to implement soft-output decoding in multiple-input mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5762","kind":"arxiv","version":5},"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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+bmrf8YIYuqrHqp7PQkCFMrp4Wk4EBrJujKq5mSwBtWEEB3qzRPJ1lRHHxYvlb4jIXO+LBrsg2AcW7Xc0HuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:14:45.108211Z"},"content_sha256":"2975b3014b76200b5d61d37ee5bf1099f38211ed328b66cc2202179ecd0266ce","schema_version":"1.0","event_id":"sha256:2975b3014b76200b5d61d37ee5bf1099f38211ed328b66cc2202179ecd0266ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T63E5QIM55FESCM5BSRXDEKU4E/bundle.json","state_url":"https://pith.science/pith/T63E5QIM55FESCM5BSRXDEKU4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T63E5QIM55FESCM5BSRXDEKU4E/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-01T04:14:45Z","links":{"resolver":"https://pith.science/pith/T63E5QIM55FESCM5BSRXDEKU4E","bundle":"https://pith.science/pith/T63E5QIM55FESCM5BSRXDEKU4E/bundle.json","state":"https://pith.science/pith/T63E5QIM55FESCM5BSRXDEKU4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T63E5QIM55FESCM5BSRXDEKU4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:T63E5QIM55FESCM5BSRXDEKU4E","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":"a4730e7202036ac51b679a1ef116a930ae2257238506822d95f871f65aad1315","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T14:58:10Z","title_canon_sha256":"edd2070f73b7519a17c58ca83ce6ea6f3474f6c1f208a3076a3db9d14d978447"},"schema_version":"1.0","source":{"id":"1305.5762","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5762","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5762v5","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5762","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"T63E5QIM55FE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T63E5QIM55FESCM5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T63E5QIM","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:2975b3014b76200b5d61d37ee5bf1099f38211ed328b66cc2202179ecd0266ce","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic, which brings considerable performance improvement and complexity reduction over to the randomized sampling. Moreover, the upper bound on the sample size K, which corresponds to near-maximum likelihood (ML) performance, is derived. We also find that the proposed algorithm can be used as an efficient tool to implement soft-output decoding in multiple-input mul","authors_text":"Cong Ling, Shuiyin Liu, Zheng Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T14:58:10Z","title":"Decoding by Sampling - Part II: Derandomization and Soft-output Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5762","kind":"arxiv","version":5},"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:d00bb9e344d26d96ab7d5ca246775047e760b59e85307a10e92c05fe7ee6e6d1","target":"record","created_at":"2026-05-18T00:58:17Z","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":"a4730e7202036ac51b679a1ef116a930ae2257238506822d95f871f65aad1315","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T14:58:10Z","title_canon_sha256":"edd2070f73b7519a17c58ca83ce6ea6f3474f6c1f208a3076a3db9d14d978447"},"schema_version":"1.0","source":{"id":"1305.5762","kind":"arxiv","version":5}},"canonical_sha256":"9fb64ec10cef4a49099d0ca3719154e13490a45c059aefc3b7fef93eb9f097d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fb64ec10cef4a49099d0ca3719154e13490a45c059aefc3b7fef93eb9f097d9","first_computed_at":"2026-05-18T00:58:17.152897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.152897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1F5tCa809gik2VUH1HUSer1ueU5xAtmGurMf+stRlnymJ3IUe3Gz5m/T0HPyR39U98qg6WfAjzrinZ1rF+LkCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.153644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5762","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d00bb9e344d26d96ab7d5ca246775047e760b59e85307a10e92c05fe7ee6e6d1","sha256:2975b3014b76200b5d61d37ee5bf1099f38211ed328b66cc2202179ecd0266ce"],"state_sha256":"bbe04b6ca5e480b6adf45c319097df45ca99110c5e760b6cf38ab3cc572da4b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gS/FDVneCt63eqQ80MLPRkKrh/3BmOS1dnIH4MwxZ4cmsubP5w7w5q6dJmZPAErrlmY8WbnbcEg77IomSvsMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:14:45.110313Z","bundle_sha256":"af324e34196e0aa7c633661cefdf5841d7ce1de590dfe56b5138a3ae8224b767"}}