{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WR6ARRCCQNB2UCUTBOXMV3QWF7","short_pith_number":"pith:WR6ARRCC","schema_version":"1.0","canonical_sha256":"b47c08c4428343aa0a930baecaee162fe205343ae91268a2221ebfbe59c270e0","source":{"kind":"arxiv","id":"1102.2350","version":1},"attestation_state":"computed","paper":{"title":"The best possible upper bound on the probability of undetected error for linear codes of full support","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinquan Luo, Torleiv Kl{\\o}ve","submitted_at":"2011-02-11T14:06:19Z","abstract_excerpt":"There is a known best possible upper bound on the probability of undetected error for linear codes. The $[n,k;q]$ codes with probability of undetected error meeting the bound have support of size $k$ only. In this note, linear codes of full support ($=n$) are studied. A best possible upper bound on the probability of undetected error for such codes is given, and the codes with probability of undetected error meeting this bound are characterized."},"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":"1102.2350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-11T14:06:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"146fef94303e80047a922d93956df7c98eb3af48acd462a49b4de93dc536ab82","abstract_canon_sha256":"e7c6f3f24d8075459bbbbc3b6b967845b7ae1ebfb90cbe64904e58f7eecacd3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:56.165849Z","signature_b64":"/e41bc0cswJzZfqCaF4cp9jVdk37PJvcviQ/VK09fbxJM0CpJlzdDdZTO2XTqI1u89b3Re8qhBA+oFk+/DXmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b47c08c4428343aa0a930baecaee162fe205343ae91268a2221ebfbe59c270e0","last_reissued_at":"2026-05-18T04:28:56.165161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:56.165161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The best possible upper bound on the probability of undetected error for linear codes of full support","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinquan Luo, Torleiv Kl{\\o}ve","submitted_at":"2011-02-11T14:06:19Z","abstract_excerpt":"There is a known best possible upper bound on the probability of undetected error for linear codes. The $[n,k;q]$ codes with probability of undetected error meeting the bound have support of size $k$ only. In this note, linear codes of full support ($=n$) are studied. A best possible upper bound on the probability of undetected error for such codes is given, and the codes with probability of undetected error meeting this bound are characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2350","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.2350","created_at":"2026-05-18T04:28:56.165268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2350v1","created_at":"2026-05-18T04:28:56.165268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2350","created_at":"2026-05-18T04:28:56.165268+00:00"},{"alias_kind":"pith_short_12","alias_value":"WR6ARRCCQNB2","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WR6ARRCCQNB2UCUT","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WR6ARRCC","created_at":"2026-05-18T12:26:44.992195+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/WR6ARRCCQNB2UCUTBOXMV3QWF7","json":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7.json","graph_json":"https://pith.science/api/pith-number/WR6ARRCCQNB2UCUTBOXMV3QWF7/graph.json","events_json":"https://pith.science/api/pith-number/WR6ARRCCQNB2UCUTBOXMV3QWF7/events.json","paper":"https://pith.science/paper/WR6ARRCC"},"agent_actions":{"view_html":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7","download_json":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7.json","view_paper":"https://pith.science/paper/WR6ARRCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2350&json=true","fetch_graph":"https://pith.science/api/pith-number/WR6ARRCCQNB2UCUTBOXMV3QWF7/graph.json","fetch_events":"https://pith.science/api/pith-number/WR6ARRCCQNB2UCUTBOXMV3QWF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7/action/storage_attestation","attest_author":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7/action/author_attestation","sign_citation":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7/action/citation_signature","submit_replication":"https://pith.science/pith/WR6ARRCCQNB2UCUTBOXMV3QWF7/action/replication_record"}},"created_at":"2026-05-18T04:28:56.165268+00:00","updated_at":"2026-05-18T04:28:56.165268+00:00"}