{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TFUPGK62NUKAC5OSZYZIVPDLAO","short_pith_number":"pith:TFUPGK62","canonical_record":{"source":{"id":"1408.5674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T07:56:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de66547474bb13db17bab9ec48254b71dc711304cfeedc005b9983d65fb782e9","abstract_canon_sha256":"d86e36a5940bafd8f3ef5a0d7670a9b63c88c4dc6e48217668e52d2af1aaad77"},"schema_version":"1.0"},"canonical_sha256":"9968f32bda6d140175d2ce328abc6b03a72949f9580108413fc051ee60f6d8b9","source":{"kind":"arxiv","id":"1408.5674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5674","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5674v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5674","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"TFUPGK62NUKA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TFUPGK62NUKAC5OS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TFUPGK62","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TFUPGK62NUKAC5OSZYZIVPDLAO","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T07:56:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de66547474bb13db17bab9ec48254b71dc711304cfeedc005b9983d65fb782e9","abstract_canon_sha256":"d86e36a5940bafd8f3ef5a0d7670a9b63c88c4dc6e48217668e52d2af1aaad77"},"schema_version":"1.0"},"canonical_sha256":"9968f32bda6d140175d2ce328abc6b03a72949f9580108413fc051ee60f6d8b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:24.569767Z","signature_b64":"hdvJHn+l9aMsam0kzYGeE0rLNg66/IWA5EkHCaJpreUE9GdFZmcuGvWF1s8aRSv13lznaZj6Ss39rGePAsu8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9968f32bda6d140175d2ce328abc6b03a72949f9580108413fc051ee60f6d8b9","last_reissued_at":"2026-05-18T02:44:24.569377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:24.569377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5674","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:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6LmtdkE4QPdIZWn3sU8MPQ30pmeOifS5uIngWktd0Ds97TiWQZuPeaI9+5FXznXgEftA4+5QQEbaYycmy5mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:49:00.582329Z"},"content_sha256":"c208a53a05c778e61f5274522e0b9bc5eb7d17dc2110aae793057096d0f7e60f","schema_version":"1.0","event_id":"sha256:c208a53a05c778e61f5274522e0b9bc5eb7d17dc2110aae793057096d0f7e60f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TFUPGK62NUKAC5OSZYZIVPDLAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance and analysis of Quadratic Residue Codes of lengths less than 100","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongqing Liu, Qianbin Chen, Trieu-Kien Truong, Yong Li","submitted_at":"2014-08-25T07:56:13Z","abstract_excerpt":"In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a simulation-based algorithm is proposed to obtain the maximum likelihood decoding performance of QR codes of lengths within 100. Moreover, four important theorems are proposed to predict the performance of the hard decoding and the maximum-likelihood decoding in which they can explor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5674","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:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2CDFs2KyN9OVAH6lHcaHB5teSUMBnJ+/4Po1UcX45uYaKiTCFeRny+JLV/fgmNcSlHrpa13IED7G0CjBeC5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:49:00.583020Z"},"content_sha256":"987b40b3951621b1c3262b645c11d7b1afa873d425b0a43610d76bb7da3530a3","schema_version":"1.0","event_id":"sha256:987b40b3951621b1c3262b645c11d7b1afa873d425b0a43610d76bb7da3530a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFUPGK62NUKAC5OSZYZIVPDLAO/bundle.json","state_url":"https://pith.science/pith/TFUPGK62NUKAC5OSZYZIVPDLAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFUPGK62NUKAC5OSZYZIVPDLAO/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-05-29T14:49:00Z","links":{"resolver":"https://pith.science/pith/TFUPGK62NUKAC5OSZYZIVPDLAO","bundle":"https://pith.science/pith/TFUPGK62NUKAC5OSZYZIVPDLAO/bundle.json","state":"https://pith.science/pith/TFUPGK62NUKAC5OSZYZIVPDLAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFUPGK62NUKAC5OSZYZIVPDLAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TFUPGK62NUKAC5OSZYZIVPDLAO","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":"d86e36a5940bafd8f3ef5a0d7670a9b63c88c4dc6e48217668e52d2af1aaad77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T07:56:13Z","title_canon_sha256":"de66547474bb13db17bab9ec48254b71dc711304cfeedc005b9983d65fb782e9"},"schema_version":"1.0","source":{"id":"1408.5674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5674","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5674v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5674","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"TFUPGK62NUKA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TFUPGK62NUKAC5OS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TFUPGK62","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:987b40b3951621b1c3262b645c11d7b1afa873d425b0a43610d76bb7da3530a3","target":"graph","created_at":"2026-05-18T02:44:24Z","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, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a simulation-based algorithm is proposed to obtain the maximum likelihood decoding performance of QR codes of lengths within 100. Moreover, four important theorems are proposed to predict the performance of the hard decoding and the maximum-likelihood decoding in which they can explor","authors_text":"Hongqing Liu, Qianbin Chen, Trieu-Kien Truong, Yong Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T07:56:13Z","title":"Performance and analysis of Quadratic Residue Codes of lengths less than 100"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5674","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:c208a53a05c778e61f5274522e0b9bc5eb7d17dc2110aae793057096d0f7e60f","target":"record","created_at":"2026-05-18T02:44:24Z","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":"d86e36a5940bafd8f3ef5a0d7670a9b63c88c4dc6e48217668e52d2af1aaad77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T07:56:13Z","title_canon_sha256":"de66547474bb13db17bab9ec48254b71dc711304cfeedc005b9983d65fb782e9"},"schema_version":"1.0","source":{"id":"1408.5674","kind":"arxiv","version":1}},"canonical_sha256":"9968f32bda6d140175d2ce328abc6b03a72949f9580108413fc051ee60f6d8b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9968f32bda6d140175d2ce328abc6b03a72949f9580108413fc051ee60f6d8b9","first_computed_at":"2026-05-18T02:44:24.569377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:24.569377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hdvJHn+l9aMsam0kzYGeE0rLNg66/IWA5EkHCaJpreUE9GdFZmcuGvWF1s8aRSv13lznaZj6Ss39rGePAsu8Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:24.569767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c208a53a05c778e61f5274522e0b9bc5eb7d17dc2110aae793057096d0f7e60f","sha256:987b40b3951621b1c3262b645c11d7b1afa873d425b0a43610d76bb7da3530a3"],"state_sha256":"dda39079a45cb9d616cd8380f7650bd8ae2f2e8e7ae7c33c89d548bae5dcbbc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dtsfbVH5Vl4kQiIvb8g87UgU/3uB60larC+MigcHHcmXmbqFq7kHqmkQsQB1Bbms+dK2onBOjKWfUvgJnNmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:49:00.586703Z","bundle_sha256":"d19a5a9d5fecd19f837064ecbee724812d4a7af20fc47c97ea06f45e28f7bc8c"}}