{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CDFHD7AKIUVQRM4JJIETGFOO36","short_pith_number":"pith:CDFHD7AK","schema_version":"1.0","canonical_sha256":"10ca71fc0a452b08b3894a093315cedfbc2d881f512a162c0ea710bf1940f142","source":{"kind":"arxiv","id":"1210.8267","version":1},"attestation_state":"computed","paper":{"title":"Detecting Linear Block Codes in Noise using the GLRT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arti D. Yardi, Saravanan Vijayakumaran","submitted_at":"2012-10-31T08:44:24Z","abstract_excerpt":"In this paper, we consider the problem of distinguishing the noisy codewords of a known binary linear block code from a random bit sequence. We propose to use the generalized likelihood ratio test (GLRT) to solve this problem. We also give a formula to find approximate number of codewords required and compare our results with an existing method."},"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":"1210.8267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-31T08:44:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6ef410c7d334d6ce3da6af1d5d6ac6400d0cd52e1e4893f4ae9b0664a6b63987","abstract_canon_sha256":"baa67d79bfebace75fefc09d871b07cf514fb11e31e3183d0dee747553cb6e3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:55.505343Z","signature_b64":"fVX4zzbfIAy0XT+bBuvk5h/u+Bj3SQz9MMWrBrLQJWqGsSU5LCtF0ZlbHPrvOV6MVCm8WBfNfaiM3fBEl8eUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10ca71fc0a452b08b3894a093315cedfbc2d881f512a162c0ea710bf1940f142","last_reissued_at":"2026-05-18T03:41:55.504616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:55.504616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting Linear Block Codes in Noise using the GLRT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arti D. Yardi, Saravanan Vijayakumaran","submitted_at":"2012-10-31T08:44:24Z","abstract_excerpt":"In this paper, we consider the problem of distinguishing the noisy codewords of a known binary linear block code from a random bit sequence. We propose to use the generalized likelihood ratio test (GLRT) to solve this problem. We also give a formula to find approximate number of codewords required and compare our results with an existing method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8267","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":"1210.8267","created_at":"2026-05-18T03:41:55.504736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8267v1","created_at":"2026-05-18T03:41:55.504736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8267","created_at":"2026-05-18T03:41:55.504736+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDFHD7AKIUVQ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDFHD7AKIUVQRM4J","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDFHD7AK","created_at":"2026-05-18T12:27:01.376967+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/CDFHD7AKIUVQRM4JJIETGFOO36","json":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36.json","graph_json":"https://pith.science/api/pith-number/CDFHD7AKIUVQRM4JJIETGFOO36/graph.json","events_json":"https://pith.science/api/pith-number/CDFHD7AKIUVQRM4JJIETGFOO36/events.json","paper":"https://pith.science/paper/CDFHD7AK"},"agent_actions":{"view_html":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36","download_json":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36.json","view_paper":"https://pith.science/paper/CDFHD7AK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8267&json=true","fetch_graph":"https://pith.science/api/pith-number/CDFHD7AKIUVQRM4JJIETGFOO36/graph.json","fetch_events":"https://pith.science/api/pith-number/CDFHD7AKIUVQRM4JJIETGFOO36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36/action/storage_attestation","attest_author":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36/action/author_attestation","sign_citation":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36/action/citation_signature","submit_replication":"https://pith.science/pith/CDFHD7AKIUVQRM4JJIETGFOO36/action/replication_record"}},"created_at":"2026-05-18T03:41:55.504736+00:00","updated_at":"2026-05-18T03:41:55.504736+00:00"}