{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:MTSFRADO53KHV3TGQF4Y7SF6OZ","short_pith_number":"pith:MTSFRADO","schema_version":"1.0","canonical_sha256":"64e458806eeed47aee6681798fc8be7665d0c42d2c06ec6af9d90ac1dd944cdf","source":{"kind":"arxiv","id":"cs/0602079","version":3},"attestation_state":"computed","paper":{"title":"SISO APP Searches in Lattices with Tanner Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Dumitru Mihai Ionescu, Haidong Zhu","submitted_at":"2006-02-22T03:28:46Z","abstract_excerpt":"An efficient, low-complexity, soft-output detector for general lattices is presented, based on their Tanner graph (TG) representations. Closest-point searches in lattices can be performed as non-binary belief propagation on associated TGs; soft-information output is naturally generated in the process; the algorithm requires no backtrack (cf. classic sphere decoding), and extracts extrinsic information. A lattice's coding gain enables equivalence relations between lattice points, which can be thereby partitioned in cosets. Total and extrinsic a posteriori probabilities at the detector's output "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"cs/0602079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-02-22T03:28:46Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"90a34ca7650b7ddce67618459a3c7aeb3e14fcf24925f0ccb53f72afb8133f15","abstract_canon_sha256":"f8d783d9f9fb98c2dd919cb4dd66b0721f5a8c171e605cafd1a61c8680d9f8a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:48.149551Z","signature_b64":"F3h+96pL0oa/WB1THY7hDlkV5e+ZDrQGIoitET0lFR8jQi5g5+liCa9cwVYlWlgO42CEx9Xg0tUOwjw9tSA6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e458806eeed47aee6681798fc8be7665d0c42d2c06ec6af9d90ac1dd944cdf","last_reissued_at":"2026-05-18T03:54:48.148971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:48.148971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SISO APP Searches in Lattices with Tanner Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Dumitru Mihai Ionescu, Haidong Zhu","submitted_at":"2006-02-22T03:28:46Z","abstract_excerpt":"An efficient, low-complexity, soft-output detector for general lattices is presented, based on their Tanner graph (TG) representations. Closest-point searches in lattices can be performed as non-binary belief propagation on associated TGs; soft-information output is naturally generated in the process; the algorithm requires no backtrack (cf. classic sphere decoding), and extracts extrinsic information. A lattice's coding gain enables equivalence relations between lattice points, which can be thereby partitioned in cosets. Total and extrinsic a posteriori probabilities at the detector's output "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602079","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602079","created_at":"2026-05-18T03:54:48.149064+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0602079v3","created_at":"2026-05-18T03:54:48.149064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602079","created_at":"2026-05-18T03:54:48.149064+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTSFRADO53KH","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTSFRADO53KHV3TG","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTSFRADO","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ","json":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ.json","graph_json":"https://pith.science/api/pith-number/MTSFRADO53KHV3TGQF4Y7SF6OZ/graph.json","events_json":"https://pith.science/api/pith-number/MTSFRADO53KHV3TGQF4Y7SF6OZ/events.json","paper":"https://pith.science/paper/MTSFRADO"},"agent_actions":{"view_html":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ","download_json":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ.json","view_paper":"https://pith.science/paper/MTSFRADO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0602079&json=true","fetch_graph":"https://pith.science/api/pith-number/MTSFRADO53KHV3TGQF4Y7SF6OZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MTSFRADO53KHV3TGQF4Y7SF6OZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/action/storage_attestation","attest_author":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/action/author_attestation","sign_citation":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/action/citation_signature","submit_replication":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/action/replication_record"}},"created_at":"2026-05-18T03:54:48.149064+00:00","updated_at":"2026-05-18T03:54:48.149064+00:00"}