{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:I5T43QDA5K3CPGLBITPKG5LLFR","short_pith_number":"pith:I5T43QDA","schema_version":"1.0","canonical_sha256":"4767cdc060eab627996144dea3756b2c63f7d79588211ba2862235690eb2a14e","source":{"kind":"arxiv","id":"1012.5498","version":1},"attestation_state":"computed","paper":{"title":"Checkable Codes from Group Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Hongwei Liu, San Ling, Somphong Jitman, Xiaoli Xie","submitted_at":"2010-12-26T08:34:06Z","abstract_excerpt":"We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in the case where the group is a finite abelian group and the ring is a finite field. This characterization leads to many good examples, among which two checkable codes and two shortened codes have minimum distance better than the lower bound given in Grassl's online table. Furthermore, when a group ring is code-checkable, it is shown that every code in such a gr"},"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":"1012.5498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-26T08:34:06Z","cross_cats_sorted":["math.AC","math.IT"],"title_canon_sha256":"df9b1653d4d94212cb0189ec95da1c79fa678a656d3bffee14c69cc3ddca2fea","abstract_canon_sha256":"7b557765590619e6cdf85fde728bfb9522c82bbf625f3e4563cafae2891d0bce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:23.251257Z","signature_b64":"Xe5I/60RVbWCo8tpw3XTgCBhH95dt/C7KkB63QG6DCS9qdhjzUURISk5vsGwP5+KEkflRdF9Bt9XsdRaqLqcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4767cdc060eab627996144dea3756b2c63f7d79588211ba2862235690eb2a14e","last_reissued_at":"2026-05-18T04:32:23.250573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:23.250573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checkable Codes from Group Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Hongwei Liu, San Ling, Somphong Jitman, Xiaoli Xie","submitted_at":"2010-12-26T08:34:06Z","abstract_excerpt":"We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in the case where the group is a finite abelian group and the ring is a finite field. This characterization leads to many good examples, among which two checkable codes and two shortened codes have minimum distance better than the lower bound given in Grassl's online table. Furthermore, when a group ring is code-checkable, it is shown that every code in such a gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5498","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":"1012.5498","created_at":"2026-05-18T04:32:23.250679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5498v1","created_at":"2026-05-18T04:32:23.250679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5498","created_at":"2026-05-18T04:32:23.250679+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5T43QDA5K3C","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5T43QDA5K3CPGLB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5T43QDA","created_at":"2026-05-18T12:26:07.630475+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/I5T43QDA5K3CPGLBITPKG5LLFR","json":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR.json","graph_json":"https://pith.science/api/pith-number/I5T43QDA5K3CPGLBITPKG5LLFR/graph.json","events_json":"https://pith.science/api/pith-number/I5T43QDA5K3CPGLBITPKG5LLFR/events.json","paper":"https://pith.science/paper/I5T43QDA"},"agent_actions":{"view_html":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR","download_json":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR.json","view_paper":"https://pith.science/paper/I5T43QDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5498&json=true","fetch_graph":"https://pith.science/api/pith-number/I5T43QDA5K3CPGLBITPKG5LLFR/graph.json","fetch_events":"https://pith.science/api/pith-number/I5T43QDA5K3CPGLBITPKG5LLFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR/action/storage_attestation","attest_author":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR/action/author_attestation","sign_citation":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR/action/citation_signature","submit_replication":"https://pith.science/pith/I5T43QDA5K3CPGLBITPKG5LLFR/action/replication_record"}},"created_at":"2026-05-18T04:32:23.250679+00:00","updated_at":"2026-05-18T04:32:23.250679+00:00"}