{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6JOVSQCNA3QYZ3QNPNGWZU4BHY","short_pith_number":"pith:6JOVSQCN","canonical_record":{"source":{"id":"1502.00076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-31T06:36:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b2f8e6d91ce6f4f0de5401afb3926b39e7b1b1645aafb112f32f435e3eeaeb3","abstract_canon_sha256":"61ff4bdaae0fc2e9d0b0f8d34bc4ce3ab445b34a9a290a4993ccde41bf45e955"},"schema_version":"1.0"},"canonical_sha256":"f25d59404d06e18cee0d7b4d6cd3813e3ba4d3f1ec961d1bdda7952ecc2c1bc1","source":{"kind":"arxiv","id":"1502.00076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00076","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00076v1","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00076","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"6JOVSQCNA3QY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6JOVSQCNA3QYZ3QN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6JOVSQCN","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6JOVSQCNA3QYZ3QNPNGWZU4BHY","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-31T06:36:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b2f8e6d91ce6f4f0de5401afb3926b39e7b1b1645aafb112f32f435e3eeaeb3","abstract_canon_sha256":"61ff4bdaae0fc2e9d0b0f8d34bc4ce3ab445b34a9a290a4993ccde41bf45e955"},"schema_version":"1.0"},"canonical_sha256":"f25d59404d06e18cee0d7b4d6cd3813e3ba4d3f1ec961d1bdda7952ecc2c1bc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:12.872155Z","signature_b64":"Zyig4QPWO2yLnV5pJq5oKIPFd+/y17ubBtRP75/ntgKG659aJMYUX5LNNXzB2yVEmVR4OYJVvt16/rR4E0lBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f25d59404d06e18cee0d7b4d6cd3813e3ba4d3f1ec961d1bdda7952ecc2c1bc1","last_reissued_at":"2026-05-18T02:28:12.871698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:12.871698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00076","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-18T02:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iM7IqudRyACKlkcIH3JEsiykg7CK6iExU4QKZtJwTjfG1FLYvRpdahFSi4uXpducr6aIFry2XDDtkKX0iXO2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:44:19.256651Z"},"content_sha256":"91375e5af1489b0ae831bbac0026827b0aa1772ad8a4c0a7a716d04e18a3f602","schema_version":"1.0","event_id":"sha256:91375e5af1489b0ae831bbac0026827b0aa1772ad8a4c0a7a716d04e18a3f602"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6JOVSQCNA3QYZ3QNPNGWZU4BHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of a Unified Transport Triggered Processor for LDPC/Turbo Decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amanullah Ghazi, Janne Janhunen, Markku Juntti, Muhammet Fatih Bayramoglu, Olli Silven, Shahriar Shahabuddin","submitted_at":"2015-01-31T06:36:34Z","abstract_excerpt":"This paper summarizes the design of a programmable processor with transport triggered architecture (TTA) for decoding LDPC and turbo codes. The processor architecture is designed in such a manner that it can be programmed for LDPC or turbo decoding for the purpose of internetworking and roaming between different networks. The standard trellis based maximum a posteriori (MAP) algorithm is used for turbo decoding. Unlike most other implementations, a supercode based sum-product algorithm is used for the check node message computation for LDPC decoding. This approach ensures the highest hardware "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00076","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-18T02:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+HxEqiEUXyyNGs1CLuSAYnBVefHX8zxQnURdom/DAiMxNBzDp3TOfmAN7dNM2byM4BZJYm+70ojko/PAeQ6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:44:19.257343Z"},"content_sha256":"1994b663535a04829895ae9940b29a1dc28bde54a60b24248c260e201c67b424","schema_version":"1.0","event_id":"sha256:1994b663535a04829895ae9940b29a1dc28bde54a60b24248c260e201c67b424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JOVSQCNA3QYZ3QNPNGWZU4BHY/bundle.json","state_url":"https://pith.science/pith/6JOVSQCNA3QYZ3QNPNGWZU4BHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JOVSQCNA3QYZ3QNPNGWZU4BHY/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-07T13:44:19Z","links":{"resolver":"https://pith.science/pith/6JOVSQCNA3QYZ3QNPNGWZU4BHY","bundle":"https://pith.science/pith/6JOVSQCNA3QYZ3QNPNGWZU4BHY/bundle.json","state":"https://pith.science/pith/6JOVSQCNA3QYZ3QNPNGWZU4BHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JOVSQCNA3QYZ3QNPNGWZU4BHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6JOVSQCNA3QYZ3QNPNGWZU4BHY","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":"61ff4bdaae0fc2e9d0b0f8d34bc4ce3ab445b34a9a290a4993ccde41bf45e955","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-31T06:36:34Z","title_canon_sha256":"5b2f8e6d91ce6f4f0de5401afb3926b39e7b1b1645aafb112f32f435e3eeaeb3"},"schema_version":"1.0","source":{"id":"1502.00076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00076","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00076v1","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00076","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"6JOVSQCNA3QY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6JOVSQCNA3QYZ3QN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6JOVSQCN","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:1994b663535a04829895ae9940b29a1dc28bde54a60b24248c260e201c67b424","target":"graph","created_at":"2026-05-18T02:28:12Z","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":"This paper summarizes the design of a programmable processor with transport triggered architecture (TTA) for decoding LDPC and turbo codes. The processor architecture is designed in such a manner that it can be programmed for LDPC or turbo decoding for the purpose of internetworking and roaming between different networks. The standard trellis based maximum a posteriori (MAP) algorithm is used for turbo decoding. Unlike most other implementations, a supercode based sum-product algorithm is used for the check node message computation for LDPC decoding. This approach ensures the highest hardware ","authors_text":"Amanullah Ghazi, Janne Janhunen, Markku Juntti, Muhammet Fatih Bayramoglu, Olli Silven, Shahriar Shahabuddin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-31T06:36:34Z","title":"Design of a Unified Transport Triggered Processor for LDPC/Turbo Decoder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00076","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:91375e5af1489b0ae831bbac0026827b0aa1772ad8a4c0a7a716d04e18a3f602","target":"record","created_at":"2026-05-18T02:28:12Z","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":"61ff4bdaae0fc2e9d0b0f8d34bc4ce3ab445b34a9a290a4993ccde41bf45e955","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-31T06:36:34Z","title_canon_sha256":"5b2f8e6d91ce6f4f0de5401afb3926b39e7b1b1645aafb112f32f435e3eeaeb3"},"schema_version":"1.0","source":{"id":"1502.00076","kind":"arxiv","version":1}},"canonical_sha256":"f25d59404d06e18cee0d7b4d6cd3813e3ba4d3f1ec961d1bdda7952ecc2c1bc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f25d59404d06e18cee0d7b4d6cd3813e3ba4d3f1ec961d1bdda7952ecc2c1bc1","first_computed_at":"2026-05-18T02:28:12.871698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:12.871698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zyig4QPWO2yLnV5pJq5oKIPFd+/y17ubBtRP75/ntgKG659aJMYUX5LNNXzB2yVEmVR4OYJVvt16/rR4E0lBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:12.872155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91375e5af1489b0ae831bbac0026827b0aa1772ad8a4c0a7a716d04e18a3f602","sha256:1994b663535a04829895ae9940b29a1dc28bde54a60b24248c260e201c67b424"],"state_sha256":"e9dfea046f3adbfc5c447b059e982508e3d5d0668102fa47b68258109bd1097a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bv8Ql4TP9mS4LJ4IudBBygkPkHIYsC0azbBWfXVePFGdXjJ0D7MZPgGmMtemx7JDu1K1RvOq7MAFTvw44SzZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:44:19.261470Z","bundle_sha256":"3766750719a87fc92e09b2eaae201f8bd14e96c62883751abf722363dd5a056f"}}