{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QPKSVUI2M3Q7ANUUR5EGDWFHBY","short_pith_number":"pith:QPKSVUI2","canonical_record":{"source":{"id":"2505.09978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-15T05:32:03Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"1043ad9de006041922386c88b78908c9f1c6b4a576ddbe26f9767d0d47e77654","abstract_canon_sha256":"19ddad7dedd914b8433bb8fbe97d057b84d533b68169e6252ca00e8e7b015a4c"},"schema_version":"1.0"},"canonical_sha256":"83d52ad11a66e1f036948f4861d8a70e39d26ed5057892637857c11318fae0cb","source":{"kind":"arxiv","id":"2505.09978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09978","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09978v1","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09978","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"QPKSVUI2M3Q7","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"pith_short_16","alias_value":"QPKSVUI2M3Q7ANUU","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"pith_short_8","alias_value":"QPKSVUI2","created_at":"2026-07-05T11:03:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QPKSVUI2M3Q7ANUUR5EGDWFHBY","target":"record","payload":{"canonical_record":{"source":{"id":"2505.09978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-15T05:32:03Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"1043ad9de006041922386c88b78908c9f1c6b4a576ddbe26f9767d0d47e77654","abstract_canon_sha256":"19ddad7dedd914b8433bb8fbe97d057b84d533b68169e6252ca00e8e7b015a4c"},"schema_version":"1.0"},"canonical_sha256":"83d52ad11a66e1f036948f4861d8a70e39d26ed5057892637857c11318fae0cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:31.352402Z","signature_b64":"REuLnAnaSv/qmVJNjvSwJ1opjjBVZMpcO42VRwlzV97E86LwQUYTCsq3/92RCt+yL1qEDUizpcVLawiH74jgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d52ad11a66e1f036948f4861d8a70e39d26ed5057892637857c11318fae0cb","last_reissued_at":"2026-07-05T11:03:31.351964Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:31.351964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.09978","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-07-05T11:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNumgxABODDW+fdMIWIFogbpffbY/rLfQVubsGoXNJolv3+gbEjmqeQ5LmhD2OJdH1umOT1xdKruqzqjt0HrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:57:24.843278Z"},"content_sha256":"53cb9a0a0251f1ae49d95c7a46d6bf1863f76ef95b66708cdda6a67cc1090750","schema_version":"1.0","event_id":"sha256:53cb9a0a0251f1ae49d95c7a46d6bf1863f76ef95b66708cdda6a67cc1090750"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QPKSVUI2M3Q7ANUUR5EGDWFHBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Chia-Chun Chen, Ching-Chang Lin, Huang-Chang Lee, Mao-Chao Lin, Pin Lin, Shih-Kai Lee, Teng-Yuan Syu","submitted_at":"2025-05-15T05:32:03Z","abstract_excerpt":"To decode a short linear block code, ordered statics decoding (OSD) and/or the $A^*$ decoding are usually considered. Either OSD or the $A^*$ decoding utilizes the magnitudes of the received symbols to establish the most reliable and independent positions (MRIP) frame. A restricted searched space can be employed to achieve near-optimum decoding with reduced decoding complexity. For a low-rate code with large minimum distance, the restricted search space is still very huge.\n  We propose to use concatenated coding to further restrict the search space by proposing an improved MRIP frame. The impr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09978","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.09978/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uojDX24Wtw2dDNHTY4jHG98gu234J75zmyPMlZ5/iCgZ0180oFF6ksXJuNZ3gZEC/Be42kQH/X/+0AvJB1MfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:57:24.843789Z"},"content_sha256":"76d621e6937833475636a093e4e90700e5a0dfbd10451f0c5cc1a60015649212","schema_version":"1.0","event_id":"sha256:76d621e6937833475636a093e4e90700e5a0dfbd10451f0c5cc1a60015649212"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPKSVUI2M3Q7ANUUR5EGDWFHBY/bundle.json","state_url":"https://pith.science/pith/QPKSVUI2M3Q7ANUUR5EGDWFHBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPKSVUI2M3Q7ANUUR5EGDWFHBY/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-08-19T07:57:24Z","links":{"resolver":"https://pith.science/pith/QPKSVUI2M3Q7ANUUR5EGDWFHBY","bundle":"https://pith.science/pith/QPKSVUI2M3Q7ANUUR5EGDWFHBY/bundle.json","state":"https://pith.science/pith/QPKSVUI2M3Q7ANUUR5EGDWFHBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPKSVUI2M3Q7ANUUR5EGDWFHBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QPKSVUI2M3Q7ANUUR5EGDWFHBY","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":"19ddad7dedd914b8433bb8fbe97d057b84d533b68169e6252ca00e8e7b015a4c","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-15T05:32:03Z","title_canon_sha256":"1043ad9de006041922386c88b78908c9f1c6b4a576ddbe26f9767d0d47e77654"},"schema_version":"1.0","source":{"id":"2505.09978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09978","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09978v1","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09978","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"QPKSVUI2M3Q7","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"pith_short_16","alias_value":"QPKSVUI2M3Q7ANUU","created_at":"2026-07-05T11:03:31Z"},{"alias_kind":"pith_short_8","alias_value":"QPKSVUI2","created_at":"2026-07-05T11:03:31Z"}],"graph_snapshots":[{"event_id":"sha256:76d621e6937833475636a093e4e90700e5a0dfbd10451f0c5cc1a60015649212","target":"graph","created_at":"2026-07-05T11:03:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.09978/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To decode a short linear block code, ordered statics decoding (OSD) and/or the $A^*$ decoding are usually considered. Either OSD or the $A^*$ decoding utilizes the magnitudes of the received symbols to establish the most reliable and independent positions (MRIP) frame. A restricted searched space can be employed to achieve near-optimum decoding with reduced decoding complexity. For a low-rate code with large minimum distance, the restricted search space is still very huge.\n  We propose to use concatenated coding to further restrict the search space by proposing an improved MRIP frame. The impr","authors_text":"Chia-Chun Chen, Ching-Chang Lin, Huang-Chang Lee, Mao-Chao Lin, Pin Lin, Shih-Kai Lee, Teng-Yuan Syu","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09978","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:53cb9a0a0251f1ae49d95c7a46d6bf1863f76ef95b66708cdda6a67cc1090750","target":"record","created_at":"2026-07-05T11:03:31Z","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":"19ddad7dedd914b8433bb8fbe97d057b84d533b68169e6252ca00e8e7b015a4c","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-15T05:32:03Z","title_canon_sha256":"1043ad9de006041922386c88b78908c9f1c6b4a576ddbe26f9767d0d47e77654"},"schema_version":"1.0","source":{"id":"2505.09978","kind":"arxiv","version":1}},"canonical_sha256":"83d52ad11a66e1f036948f4861d8a70e39d26ed5057892637857c11318fae0cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83d52ad11a66e1f036948f4861d8a70e39d26ed5057892637857c11318fae0cb","first_computed_at":"2026-07-05T11:03:31.351964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:03:31.351964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"REuLnAnaSv/qmVJNjvSwJ1opjjBVZMpcO42VRwlzV97E86LwQUYTCsq3/92RCt+yL1qEDUizpcVLawiH74jgAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:03:31.352402Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.09978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53cb9a0a0251f1ae49d95c7a46d6bf1863f76ef95b66708cdda6a67cc1090750","sha256:76d621e6937833475636a093e4e90700e5a0dfbd10451f0c5cc1a60015649212"],"state_sha256":"d9f98e6a32785edcc599eb355afb5ece371fbea0e25294b9a797f72eb8d4b245"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uuufzsFaSB8j1XO8UGddapwgN+QsdRDbr11zi3zvsEFSS76C97Uy0Uruqavt7zMU7QwpQ51YkiIZoMQDyQQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T07:57:24.847467Z","bundle_sha256":"dbd85d84c2cd4f3f470ef1da8d18729df021bd58c00dc8f9347e4bd854c1bdc5"}}