{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VAEBQCRR3MA64NEQFDCQTYF7TU","short_pith_number":"pith:VAEBQCRR","schema_version":"1.0","canonical_sha256":"a808180a31db01ee349028c509e0bf9d2dbef1854a4d030efec3ffc9f484ab82","source":{"kind":"arxiv","id":"2503.04498","version":3},"attestation_state":"computed","paper":{"title":"Equivalence of Families of Polycyclic Codes over Finite Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Horlemann, Hassan Ou-azzou","submitted_at":"2025-03-06T14:48:00Z","abstract_excerpt":"We study the equivalence of families of polycyclic codes associated with polynomials of the form $x^n - a_{n-1}x^{n-1} - \\ldots - a_1x - a_0$ over a finite field. We begin with the specific case of polycyclic codes associated with a trinomial $x^n - a_{\\ell} x^{\\ell} - a_0$ (for some $0< \\ell <n$), which we refer to as \\textit{$\\ell$-trinomial codes}, after which we generalize our results to general polycyclic codes. We introduce an equivalence relation called \\textit{$n$-equivalence}, which extends the known notion of $n$-equivalence for constacyclic codes \\cite{Chen2014}. We compute the numb"},"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":"2503.04498","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-03-06T14:48:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f02e61655a022625f031fd64b483e645716c9cd76b4106643c82c088f7f1e656","abstract_canon_sha256":"eb23508df0c9d61f1938d53462e700a4d29e2f9e1e844b83d4a5c5b1a312608a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:11.488129Z","signature_b64":"hT1XAXuJCA+h16K9x4AR/QNwXZ1iQEoGVlZ6NT4nQLGkn39Ask15Lz64VzwYAX6cMpGMPDL4/DQs3fIw25FiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a808180a31db01ee349028c509e0bf9d2dbef1854a4d030efec3ffc9f484ab82","last_reissued_at":"2026-05-26T01:03:11.487202Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:11.487202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence of Families of Polycyclic Codes over Finite Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Horlemann, Hassan Ou-azzou","submitted_at":"2025-03-06T14:48:00Z","abstract_excerpt":"We study the equivalence of families of polycyclic codes associated with polynomials of the form $x^n - a_{n-1}x^{n-1} - \\ldots - a_1x - a_0$ over a finite field. We begin with the specific case of polycyclic codes associated with a trinomial $x^n - a_{\\ell} x^{\\ell} - a_0$ (for some $0< \\ell <n$), which we refer to as \\textit{$\\ell$-trinomial codes}, after which we generalize our results to general polycyclic codes. We introduce an equivalence relation called \\textit{$n$-equivalence}, which extends the known notion of $n$-equivalence for constacyclic codes \\cite{Chen2014}. We compute the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.04498","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.04498/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.04498","created_at":"2026-05-26T01:03:11.487354+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.04498v3","created_at":"2026-05-26T01:03:11.487354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.04498","created_at":"2026-05-26T01:03:11.487354+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAEBQCRR3MA6","created_at":"2026-05-26T01:03:11.487354+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAEBQCRR3MA64NEQ","created_at":"2026-05-26T01:03:11.487354+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAEBQCRR","created_at":"2026-05-26T01:03:11.487354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.03164","citing_title":"Skew polycyclic over finite chain rings associated to trinomials","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU","json":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU.json","graph_json":"https://pith.science/api/pith-number/VAEBQCRR3MA64NEQFDCQTYF7TU/graph.json","events_json":"https://pith.science/api/pith-number/VAEBQCRR3MA64NEQFDCQTYF7TU/events.json","paper":"https://pith.science/paper/VAEBQCRR"},"agent_actions":{"view_html":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU","download_json":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU.json","view_paper":"https://pith.science/paper/VAEBQCRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.04498&json=true","fetch_graph":"https://pith.science/api/pith-number/VAEBQCRR3MA64NEQFDCQTYF7TU/graph.json","fetch_events":"https://pith.science/api/pith-number/VAEBQCRR3MA64NEQFDCQTYF7TU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU/action/storage_attestation","attest_author":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU/action/author_attestation","sign_citation":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU/action/citation_signature","submit_replication":"https://pith.science/pith/VAEBQCRR3MA64NEQFDCQTYF7TU/action/replication_record"}},"created_at":"2026-05-26T01:03:11.487354+00:00","updated_at":"2026-05-26T01:03:11.487354+00:00"}