{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GI55CBFLCY7H7MGH62267XTVLC","short_pith_number":"pith:GI55CBFL","schema_version":"1.0","canonical_sha256":"323bd104ab163e7fb0c7f6b5efde75588aa855c024fdc29402f9458d83ebc309","source":{"kind":"arxiv","id":"1908.02169","version":1},"attestation_state":"computed","paper":{"title":"Automorphism groups and new constructions of maximum additive rank metric codes with restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G. Longobardi, G. Lunardon, R. Trombetti, Y. Zhou","submitted_at":"2019-08-06T14:05:24Z","abstract_excerpt":"Let $d, n \\in \\mathbb{Z}^+$ such that $1\\leq d \\leq n$. A $d$-code $\\mathcal{C} \\subset \\mathbb{F}_q^{n \\times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\\mathcal{C}$, the rank of their difference is greater than or equal to $d$. A $d$-code with as many as possible elements is called a maximum $d$-code. The integer $d$ is also called the minimum distance of the code. When $d<n$, a classical example of such an object is the so-called generalized Gabidulin code. There exist several classes of maximum $d$-codes made up respectively o"},"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":"1908.02169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T14:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"a5ed230401fdae606c25a10f8feaf9efc4d6eb0834085a66a275bb125df7a928","abstract_canon_sha256":"4312fd6199be5dad350523f6b5076534e811c3626d4f9547ee741d6570798bf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:03.437358Z","signature_b64":"IRh8e9KfgjAN2hM6jiFk/VXXsDeclLSuHSF5O8SMhU0fylZGbxt8QvHZ7E1qP9467+uczYlTqPD5fzOfdg1UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323bd104ab163e7fb0c7f6b5efde75588aa855c024fdc29402f9458d83ebc309","last_reissued_at":"2026-07-05T01:02:03.436912Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:03.436912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automorphism groups and new constructions of maximum additive rank metric codes with restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G. Longobardi, G. Lunardon, R. Trombetti, Y. Zhou","submitted_at":"2019-08-06T14:05:24Z","abstract_excerpt":"Let $d, n \\in \\mathbb{Z}^+$ such that $1\\leq d \\leq n$. A $d$-code $\\mathcal{C} \\subset \\mathbb{F}_q^{n \\times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\\mathcal{C}$, the rank of their difference is greater than or equal to $d$. A $d$-code with as many as possible elements is called a maximum $d$-code. The integer $d$ is also called the minimum distance of the code. When $d<n$, a classical example of such an object is the so-called generalized Gabidulin code. There exist several classes of maximum $d$-codes made up respectively o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02169","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02169/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":"1908.02169","created_at":"2026-07-05T01:02:03.436965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02169v1","created_at":"2026-07-05T01:02:03.436965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02169","created_at":"2026-07-05T01:02:03.436965+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI55CBFLCY7H","created_at":"2026-07-05T01:02:03.436965+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI55CBFLCY7H7MGH","created_at":"2026-07-05T01:02:03.436965+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI55CBFL","created_at":"2026-07-05T01:02:03.436965+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/GI55CBFLCY7H7MGH62267XTVLC","json":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC.json","graph_json":"https://pith.science/api/pith-number/GI55CBFLCY7H7MGH62267XTVLC/graph.json","events_json":"https://pith.science/api/pith-number/GI55CBFLCY7H7MGH62267XTVLC/events.json","paper":"https://pith.science/paper/GI55CBFL"},"agent_actions":{"view_html":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC","download_json":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC.json","view_paper":"https://pith.science/paper/GI55CBFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02169&json=true","fetch_graph":"https://pith.science/api/pith-number/GI55CBFLCY7H7MGH62267XTVLC/graph.json","fetch_events":"https://pith.science/api/pith-number/GI55CBFLCY7H7MGH62267XTVLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/action/storage_attestation","attest_author":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/action/author_attestation","sign_citation":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/action/citation_signature","submit_replication":"https://pith.science/pith/GI55CBFLCY7H7MGH62267XTVLC/action/replication_record"}},"created_at":"2026-07-05T01:02:03.436965+00:00","updated_at":"2026-07-05T01:02:03.436965+00:00"}