{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:MTSFRADO53KHV3TGQF4Y7SF6OZ","short_pith_number":"pith:MTSFRADO","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"},"canonical_sha256":"64e458806eeed47aee6681798fc8be7665d0c42d2c06ec6af9d90ac1dd944cdf","source":{"kind":"arxiv","id":"cs/0602079","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602079","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602079v3","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602079","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"MTSFRADO53KH","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"MTSFRADO53KHV3TG","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"MTSFRADO","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:MTSFRADO53KHV3TGQF4Y7SF6OZ","target":"record","payload":{"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"},"canonical_sha256":"64e458806eeed47aee6681798fc8be7665d0c42d2c06ec6af9d90ac1dd944cdf","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"},"source_kind":"arxiv","source_id":"cs/0602079","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-05-18T03:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kiJwL/SWy7vOjq6W0uv1Yit7jN4W3vxdjYudoHVqI/EcMZQj52DSLMuQsj5zAfyEObvLkUDqcnBT4C+3TWEcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:59:39.067584Z"},"content_sha256":"87dc4887167011e0e2c01fb68c9d1ec736b48598e042bd15df1c2b5c0f060fce","schema_version":"1.0","event_id":"sha256:87dc4887167011e0e2c01fb68c9d1ec736b48598e042bd15df1c2b5c0f060fce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:MTSFRADO53KHV3TGQF4Y7SF6OZ","target":"graph","payload":{"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"},"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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2xGZjyILUcmMMOYnpWdx3g5nZX1+8nTc+wy9o1j2ql2+W8v0IhuCT5SXqeXB49213qxihUcX7ygXnqbYFtXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:59:39.067943Z"},"content_sha256":"096eba81a2a41ed0b9b96f564f64645d5021184726f5d17049d009a65e2bcfda","schema_version":"1.0","event_id":"sha256:096eba81a2a41ed0b9b96f564f64645d5021184726f5d17049d009a65e2bcfda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/bundle.json","state_url":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/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-04T16:59:39Z","links":{"resolver":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ","bundle":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/bundle.json","state":"https://pith.science/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTSFRADO53KHV3TGQF4Y7SF6OZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:MTSFRADO53KHV3TGQF4Y7SF6OZ","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":"f8d783d9f9fb98c2dd919cb4dd66b0721f5a8c171e605cafd1a61c8680d9f8a8","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-02-22T03:28:46Z","title_canon_sha256":"90a34ca7650b7ddce67618459a3c7aeb3e14fcf24925f0ccb53f72afb8133f15"},"schema_version":"1.0","source":{"id":"cs/0602079","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602079","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602079v3","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602079","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"MTSFRADO53KH","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"MTSFRADO53KHV3TG","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"MTSFRADO","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:096eba81a2a41ed0b9b96f564f64645d5021184726f5d17049d009a65e2bcfda","target":"graph","created_at":"2026-05-18T03:54:48Z","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":"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 ","authors_text":"Dumitru Mihai Ionescu, Haidong Zhu","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-02-22T03:28:46Z","title":"SISO APP Searches in Lattices with Tanner Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602079","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:87dc4887167011e0e2c01fb68c9d1ec736b48598e042bd15df1c2b5c0f060fce","target":"record","created_at":"2026-05-18T03:54:48Z","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":"f8d783d9f9fb98c2dd919cb4dd66b0721f5a8c171e605cafd1a61c8680d9f8a8","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-02-22T03:28:46Z","title_canon_sha256":"90a34ca7650b7ddce67618459a3c7aeb3e14fcf24925f0ccb53f72afb8133f15"},"schema_version":"1.0","source":{"id":"cs/0602079","kind":"arxiv","version":3}},"canonical_sha256":"64e458806eeed47aee6681798fc8be7665d0c42d2c06ec6af9d90ac1dd944cdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64e458806eeed47aee6681798fc8be7665d0c42d2c06ec6af9d90ac1dd944cdf","first_computed_at":"2026-05-18T03:54:48.148971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:48.148971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F3h+96pL0oa/WB1THY7hDlkV5e+ZDrQGIoitET0lFR8jQi5g5+liCa9cwVYlWlgO42CEx9Xg0tUOwjw9tSA6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:48.149551Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0602079","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87dc4887167011e0e2c01fb68c9d1ec736b48598e042bd15df1c2b5c0f060fce","sha256:096eba81a2a41ed0b9b96f564f64645d5021184726f5d17049d009a65e2bcfda"],"state_sha256":"432f25f9dde3c8f2aeb45e3209d8e1910cbc18be28fac30a6904e16db2d280aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3/kszjzAv7OtyG0vrgGy6MgJvRH5GiNGt4J2Ju8xRMpYE+0/rY1/ORTvAgRi5xN69oB2AHeTaGDaUWq9PX5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:59:39.070200Z","bundle_sha256":"9eef2ff8f96667e9cf72fa58e2220c57c0e3bb4d8ab452043af6354e8f4e273b"}}