{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UEP667CYNUQ6T4GXZJVQNMSSE4","short_pith_number":"pith:UEP667CY","schema_version":"1.0","canonical_sha256":"a11fef7c586d21e9f0d7ca6b06b252271837724aeefd3fb487e1a2d21fa4d7c0","source":{"kind":"arxiv","id":"1711.09373","version":1},"attestation_state":"computed","paper":{"title":"Circulant Hadamard matrices as HFP-codes of type $C_{4n}\\times C_2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josep Rif\\`a","submitted_at":"2017-11-26T12:12:37Z","abstract_excerpt":"We prove that a circulant Hadamard code of length $4n$ can always be seen as an HFP-code (Hadamard full propelinear code) of type $C_{4n}\\times C_2$, where $C_2=\\langle u\\rangle$ or the same, as a cocyclic Hadamard code. We compute the rank and dimension of the kernel of these kind of codes."},"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":"1711.09373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-26T12:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"cc14aa2e34aba05920105f997d72b16c63ac3eb0ab2e2a57544c975ed83aa311","abstract_canon_sha256":"b1abaed2f7860e267584d3afbff2894abdaee90e25160a1510e72ee9a9f5153c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:35.823728Z","signature_b64":"j/dCd/n5TCmSw5+jQWlIbNdRAeTFexJQW0RHPhwBtSEFnPUM475/8ynbnandTiSUcCcQF6fEwaox6OzPgelUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a11fef7c586d21e9f0d7ca6b06b252271837724aeefd3fb487e1a2d21fa4d7c0","last_reissued_at":"2026-05-18T00:29:35.822866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:35.822866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circulant Hadamard matrices as HFP-codes of type $C_{4n}\\times C_2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josep Rif\\`a","submitted_at":"2017-11-26T12:12:37Z","abstract_excerpt":"We prove that a circulant Hadamard code of length $4n$ can always be seen as an HFP-code (Hadamard full propelinear code) of type $C_{4n}\\times C_2$, where $C_2=\\langle u\\rangle$ or the same, as a cocyclic Hadamard code. We compute the rank and dimension of the kernel of these kind of codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09373","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":"1711.09373","created_at":"2026-05-18T00:29:35.822970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09373v1","created_at":"2026-05-18T00:29:35.822970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09373","created_at":"2026-05-18T00:29:35.822970+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEP667CYNUQ6","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEP667CYNUQ6T4GX","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEP667CY","created_at":"2026-05-18T12:31:46.661854+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/UEP667CYNUQ6T4GXZJVQNMSSE4","json":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4.json","graph_json":"https://pith.science/api/pith-number/UEP667CYNUQ6T4GXZJVQNMSSE4/graph.json","events_json":"https://pith.science/api/pith-number/UEP667CYNUQ6T4GXZJVQNMSSE4/events.json","paper":"https://pith.science/paper/UEP667CY"},"agent_actions":{"view_html":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4","download_json":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4.json","view_paper":"https://pith.science/paper/UEP667CY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09373&json=true","fetch_graph":"https://pith.science/api/pith-number/UEP667CYNUQ6T4GXZJVQNMSSE4/graph.json","fetch_events":"https://pith.science/api/pith-number/UEP667CYNUQ6T4GXZJVQNMSSE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4/action/storage_attestation","attest_author":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4/action/author_attestation","sign_citation":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4/action/citation_signature","submit_replication":"https://pith.science/pith/UEP667CYNUQ6T4GXZJVQNMSSE4/action/replication_record"}},"created_at":"2026-05-18T00:29:35.822970+00:00","updated_at":"2026-05-18T00:29:35.822970+00:00"}