{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WSVGQNS77YBIPYWTUCVYY2GCVF","short_pith_number":"pith:WSVGQNS7","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"},"canonical_sha256":"b4aa68365ffe0287e2d3a0ab8c68c2a97e3b2a7d8b2d40ebf5441d2e2ac45fd1","source":{"kind":"arxiv","id":"1704.02110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02110","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02110v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02110","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"WSVGQNS77YBI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSVGQNS77YBIPYWT","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSVGQNS7","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WSVGQNS77YBIPYWTUCVYY2GCVF","target":"record","payload":{"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"},"canonical_sha256":"b4aa68365ffe0287e2d3a0ab8c68c2a97e3b2a7d8b2d40ebf5441d2e2ac45fd1","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"},"source_kind":"arxiv","source_id":"1704.02110","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOd89nKg1NwTt1xmiagGvwDRfDZ3kiiWHbWMe80ZdmsH2aTI2oj76haYHasxiU2BAJ2IM0INesgJt80ouUr3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:06:55.588996Z"},"content_sha256":"26c7ce4a01ad034a46d226df33beb44439e26f0f5193c99382fe0e6e63c6895c","schema_version":"1.0","event_id":"sha256:26c7ce4a01ad034a46d226df33beb44439e26f0f5193c99382fe0e6e63c6895c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WSVGQNS77YBIPYWTUCVYY2GCVF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHH3gO4kzukmbHMjACvKnWxcO4iyDRikI5Ot5GFGQOZcPjehCJY11yWC4+fSg0UA8XWVx7yS+B28bdXOmmlYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:06:55.589362Z"},"content_sha256":"5dd22c243264ca07edaf23ba32f525c2e33cc3120e0babc3cead1422f1ce5696","schema_version":"1.0","event_id":"sha256:5dd22c243264ca07edaf23ba32f525c2e33cc3120e0babc3cead1422f1ce5696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/bundle.json","state_url":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T09:06:55Z","links":{"resolver":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF","bundle":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/bundle.json","state":"https://pith.science/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSVGQNS77YBIPYWTUCVYY2GCVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WSVGQNS77YBIPYWTUCVYY2GCVF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a029a7f09a3f264e29a388fb1f8ed3f2d1c75fa428e4c7a21e4119abffeb125","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-07T07:03:58Z","title_canon_sha256":"2cccbe571465e2284d163c19c7237779cf8393e36335773b349a2e4c82151a20"},"schema_version":"1.0","source":{"id":"1704.02110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02110","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02110v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02110","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"WSVGQNS77YBI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSVGQNS77YBIPYWT","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSVGQNS7","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:5dd22c243264ca07edaf23ba32f525c2e33cc3120e0babc3cead1422f1ce5696","target":"graph","created_at":"2026-05-18T00:46:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alessandro Siciliano, Nicola Durante","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-07T07:03:58Z","title":"Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02110","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:26c7ce4a01ad034a46d226df33beb44439e26f0f5193c99382fe0e6e63c6895c","target":"record","created_at":"2026-05-18T00:46:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6a029a7f09a3f264e29a388fb1f8ed3f2d1c75fa428e4c7a21e4119abffeb125","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-07T07:03:58Z","title_canon_sha256":"2cccbe571465e2284d163c19c7237779cf8393e36335773b349a2e4c82151a20"},"schema_version":"1.0","source":{"id":"1704.02110","kind":"arxiv","version":1}},"canonical_sha256":"b4aa68365ffe0287e2d3a0ab8c68c2a97e3b2a7d8b2d40ebf5441d2e2ac45fd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4aa68365ffe0287e2d3a0ab8c68c2a97e3b2a7d8b2d40ebf5441d2e2ac45fd1","first_computed_at":"2026-05-18T00:46:50.736029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:50.736029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"so17vJna7LmX8ZCQB6/4FdhyGjcbC+rtWESA0v52yeJZK2VbAaPQ19uYuAxwB94/Ugtk279NkWVQony58DDyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:50.736735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26c7ce4a01ad034a46d226df33beb44439e26f0f5193c99382fe0e6e63c6895c","sha256:5dd22c243264ca07edaf23ba32f525c2e33cc3120e0babc3cead1422f1ce5696"],"state_sha256":"b38ea27bf761b9fd0af567c5fa9ea7132e17627332a52e43939a741dd646c74d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDitGQyVFkdqa2vjWpX6YfICoDagdZRqVWMq3+79gUUoQjswZIHGDcF2h2Ae+SWnRsjTlczB/XEwSbisZ9SyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T09:06:55.591146Z","bundle_sha256":"49570e905dcb4b8860d982ab58887bb6eac41da2279ce9175a76d848101897f2"}}