{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YJY6QEVMEOL6SXHA4CCYIMAYDM","short_pith_number":"pith:YJY6QEVM","schema_version":"1.0","canonical_sha256":"c271e812ac2397e95ce0e0858430181b20eb6c87de734127029b44f779d57fda","source":{"kind":"arxiv","id":"1705.06049","version":1},"attestation_state":"computed","paper":{"title":"A Note on The Enumeration of Euclidean Self-Dual Skew-Cyclic Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Muchlis, Aleams Barra, Djoko Suprijanto, Intan Muchtadi-Alamsyah, Irwansyah","submitted_at":"2017-05-17T08:50:45Z","abstract_excerpt":"In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\\theta|)=1$ and for some cases when $(n,|\\theta|)>1,$ where $n$ is the length of the code and $|\\theta|$ is the order of automorphism $\\theta.$"},"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":"1705.06049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-17T08:50:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4c6ba3b54cb5d18f126614fd5198185d6df6af55092b044c8d7611feb8c309e","abstract_canon_sha256":"a031c65f0bad021b523cdb8198af180b2b2c66d192f51e1669af9ef63b8798bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.129295Z","signature_b64":"PGwqTw2cFpKp+k9LtSFYeZ5Q7kv4/4XOa6N8029vmOVFjGSb75JmVsfu9it98CtUeid3Lh1dp8jynWRxe2O0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c271e812ac2397e95ce0e0858430181b20eb6c87de734127029b44f779d57fda","last_reissued_at":"2026-05-18T00:44:19.128938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.128938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on The Enumeration of Euclidean Self-Dual Skew-Cyclic Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Muchlis, Aleams Barra, Djoko Suprijanto, Intan Muchtadi-Alamsyah, Irwansyah","submitted_at":"2017-05-17T08:50:45Z","abstract_excerpt":"In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\\theta|)=1$ and for some cases when $(n,|\\theta|)>1,$ where $n$ is the length of the code and $|\\theta|$ is the order of automorphism $\\theta.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06049","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":"1705.06049","created_at":"2026-05-18T00:44:19.128995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06049v1","created_at":"2026-05-18T00:44:19.128995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06049","created_at":"2026-05-18T00:44:19.128995+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJY6QEVMEOL6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJY6QEVMEOL6SXHA","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJY6QEVM","created_at":"2026-05-18T12:31:56.362134+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/YJY6QEVMEOL6SXHA4CCYIMAYDM","json":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM.json","graph_json":"https://pith.science/api/pith-number/YJY6QEVMEOL6SXHA4CCYIMAYDM/graph.json","events_json":"https://pith.science/api/pith-number/YJY6QEVMEOL6SXHA4CCYIMAYDM/events.json","paper":"https://pith.science/paper/YJY6QEVM"},"agent_actions":{"view_html":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM","download_json":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM.json","view_paper":"https://pith.science/paper/YJY6QEVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06049&json=true","fetch_graph":"https://pith.science/api/pith-number/YJY6QEVMEOL6SXHA4CCYIMAYDM/graph.json","fetch_events":"https://pith.science/api/pith-number/YJY6QEVMEOL6SXHA4CCYIMAYDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM/action/storage_attestation","attest_author":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM/action/author_attestation","sign_citation":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM/action/citation_signature","submit_replication":"https://pith.science/pith/YJY6QEVMEOL6SXHA4CCYIMAYDM/action/replication_record"}},"created_at":"2026-05-18T00:44:19.128995+00:00","updated_at":"2026-05-18T00:44:19.128995+00:00"}