{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HSQDATGJIAC4N3REXALCP34J2Q","short_pith_number":"pith:HSQDATGJ","schema_version":"1.0","canonical_sha256":"3ca0304cc94005c6ee24b81627ef89d43d22fa4f441500a82e7b1425c52cca6a","source":{"kind":"arxiv","id":"1303.1870","version":2},"attestation_state":"computed","paper":{"title":"On Isodual Cyclic Codes over Finite Fields and Finite Chain Rings: Monomial Equivalence","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aicha Batoul, Kenza Guenda, Nuh Aydin, T. Aaron Gulliver","submitted_at":"2013-03-08T01:45:25Z","abstract_excerpt":"This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given."},"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":"1303.1870","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T01:45:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eb09412ce8f15d47dee56c487b12787c13f4d25fc5262ce4a8caf344a93f807f","abstract_canon_sha256":"7f7874d9bc23f1a688cc3df887b6461055614219b5ab7a414e77d5daa27a1675"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:07.352398Z","signature_b64":"2QLRntiAsrdqB5kM3J+aG5KK/y5wGbn/zs/6XR260Cvhh2RtuAyCcPYwyONwMSQ2mZzxCoRduMfStrg18NJmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ca0304cc94005c6ee24b81627ef89d43d22fa4f441500a82e7b1425c52cca6a","last_reissued_at":"2026-05-18T01:09:07.351650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:07.351650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Isodual Cyclic Codes over Finite Fields and Finite Chain Rings: Monomial Equivalence","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aicha Batoul, Kenza Guenda, Nuh Aydin, T. Aaron Gulliver","submitted_at":"2013-03-08T01:45:25Z","abstract_excerpt":"This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1870","kind":"arxiv","version":2},"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":"1303.1870","created_at":"2026-05-18T01:09:07.351776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1870v2","created_at":"2026-05-18T01:09:07.351776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1870","created_at":"2026-05-18T01:09:07.351776+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSQDATGJIAC4","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSQDATGJIAC4N3RE","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSQDATGJ","created_at":"2026-05-18T12:27:46.883200+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/HSQDATGJIAC4N3REXALCP34J2Q","json":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q.json","graph_json":"https://pith.science/api/pith-number/HSQDATGJIAC4N3REXALCP34J2Q/graph.json","events_json":"https://pith.science/api/pith-number/HSQDATGJIAC4N3REXALCP34J2Q/events.json","paper":"https://pith.science/paper/HSQDATGJ"},"agent_actions":{"view_html":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q","download_json":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q.json","view_paper":"https://pith.science/paper/HSQDATGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1870&json=true","fetch_graph":"https://pith.science/api/pith-number/HSQDATGJIAC4N3REXALCP34J2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/HSQDATGJIAC4N3REXALCP34J2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q/action/storage_attestation","attest_author":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q/action/author_attestation","sign_citation":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q/action/citation_signature","submit_replication":"https://pith.science/pith/HSQDATGJIAC4N3REXALCP34J2Q/action/replication_record"}},"created_at":"2026-05-18T01:09:07.351776+00:00","updated_at":"2026-05-18T01:09:07.351776+00:00"}