{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WSVGQNS77YBIPYWTUCVYY2GCVF","short_pith_number":"pith:WSVGQNS7","schema_version":"1.0","canonical_sha256":"b4aa68365ffe0287e2d3a0ab8c68c2a97e3b2a7d8b2d40ebf5441d2e2ac45fd1","source":{"kind":"arxiv","id":"1704.02110","version":1},"attestation_state":"computed","paper":{"title":"Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alessandro Siciliano, Nicola Durante","submitted_at":"2017-04-07T07:03:58Z","abstract_excerpt":"In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese."},"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":"1704.02110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-07T07:03:58Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"2cccbe571465e2284d163c19c7237779cf8393e36335773b349a2e4c82151a20","abstract_canon_sha256":"6a029a7f09a3f264e29a388fb1f8ed3f2d1c75fa428e4c7a21e4119abffeb125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.736735Z","signature_b64":"so17vJna7LmX8ZCQB6/4FdhyGjcbC+rtWESA0v52yeJZK2VbAaPQ19uYuAxwB94/Ugtk279NkWVQony58DDyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4aa68365ffe0287e2d3a0ab8c68c2a97e3b2a7d8b2d40ebf5441d2e2ac45fd1","last_reissued_at":"2026-05-18T00:46:50.736029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.736029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alessandro Siciliano, Nicola Durante","submitted_at":"2017-04-07T07:03:58Z","abstract_excerpt":"In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02110","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":"1704.02110","created_at":"2026-05-18T00:46:50.736132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02110v1","created_at":"2026-05-18T00:46:50.736132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02110","created_at":"2026-05-18T00:46:50.736132+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSVGQNS77YBI","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSVGQNS77YBIPYWT","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSVGQNS7","created_at":"2026-05-18T12:31:53.515858+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/WSVGQNS77YBIPYWTUCVYY2GCVF","json":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF.json","graph_json":"https://pith.science/api/pith-number/WSVGQNS77YBIPYWTUCVYY2GCVF/graph.json","events_json":"https://pith.science/api/pith-number/WSVGQNS77YBIPYWTUCVYY2GCVF/events.json","paper":"https://pith.science/paper/WSVGQNS7"},"agent_actions":{"view_html":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF","download_json":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF.json","view_paper":"https://pith.science/paper/WSVGQNS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02110&json=true","fetch_graph":"https://pith.science/api/pith-number/WSVGQNS77YBIPYWTUCVYY2GCVF/graph.json","fetch_events":"https://pith.science/api/pith-number/WSVGQNS77YBIPYWTUCVYY2GCVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/action/storage_attestation","attest_author":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/action/author_attestation","sign_citation":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/action/citation_signature","submit_replication":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/action/replication_record"}},"created_at":"2026-05-18T00:46:50.736132+00:00","updated_at":"2026-05-18T00:46:50.736132+00:00"}