{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BB5IGIIONLBOE72SVH4DSJDHYJ","short_pith_number":"pith:BB5IGIIO","schema_version":"1.0","canonical_sha256":"087a83210e6ac2e27f52a9f8392467c2656efabe1291214301fbc6aa70b7eea8","source":{"kind":"arxiv","id":"1701.06831","version":1},"attestation_state":"computed","paper":{"title":"Maximum scattered linear sets and MRD-codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bence Csajb\\'ok, Ferdinando Zullo, Giuseppe Marino, Olga Polverino","submitted_at":"2017-01-24T12:13:16Z","abstract_excerpt":"The rank of a scattered $\\mathbb{F}_q$-linear set of $\\mathrm{PG}(r-1,q^n)$, $rn$ even, is at most $rn/2$ as it was proved by Blokhuis and Lavrauw. Existence results and explicit constructions were given for infinitely many values of $r$, $n$, $q$ ($rn$ even) for scattered $\\mathbb{F}_q$-linear sets of rank $rn/2$. In this paper we prove that the bound $rn/2$ is sharp also in the remaining open cases.\n  Recently Sheekey proved that scattered $\\mathbb{F}_q$-linear sets of $\\mathrm{PG}(1,q^n)$ of maximum rank $n$ yield $\\mathbb{F}_q$-linear MRD-codes with dimension $2n$ and minimum distance $n-1"},"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":"1701.06831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-24T12:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"7ffc87e845f3ef944274c188c139f6794e4819b36ef999377c60510d44c63e4f","abstract_canon_sha256":"21f5f67f83a4c9ee7d97876cbaaf873b8a0c08e0652d57586376a59befd6ecc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:12.089851Z","signature_b64":"B5SB6I9gVtwa3R8nkQHVagREIHinPNvTW53YGHybIE4Y/ByxW00lKzECULVIhHXlYBoa1U2wi7id4F06SLaFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"087a83210e6ac2e27f52a9f8392467c2656efabe1291214301fbc6aa70b7eea8","last_reissued_at":"2026-05-18T00:52:12.089417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:12.089417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum scattered linear sets and MRD-codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bence Csajb\\'ok, Ferdinando Zullo, Giuseppe Marino, Olga Polverino","submitted_at":"2017-01-24T12:13:16Z","abstract_excerpt":"The rank of a scattered $\\mathbb{F}_q$-linear set of $\\mathrm{PG}(r-1,q^n)$, $rn$ even, is at most $rn/2$ as it was proved by Blokhuis and Lavrauw. Existence results and explicit constructions were given for infinitely many values of $r$, $n$, $q$ ($rn$ even) for scattered $\\mathbb{F}_q$-linear sets of rank $rn/2$. In this paper we prove that the bound $rn/2$ is sharp also in the remaining open cases.\n  Recently Sheekey proved that scattered $\\mathbb{F}_q$-linear sets of $\\mathrm{PG}(1,q^n)$ of maximum rank $n$ yield $\\mathbb{F}_q$-linear MRD-codes with dimension $2n$ and minimum distance $n-1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06831","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":"1701.06831","created_at":"2026-05-18T00:52:12.089483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06831v1","created_at":"2026-05-18T00:52:12.089483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06831","created_at":"2026-05-18T00:52:12.089483+00:00"},{"alias_kind":"pith_short_12","alias_value":"BB5IGIIONLBO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BB5IGIIONLBOE72S","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BB5IGIIO","created_at":"2026-05-18T12:31:08.081275+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/BB5IGIIONLBOE72SVH4DSJDHYJ","json":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ.json","graph_json":"https://pith.science/api/pith-number/BB5IGIIONLBOE72SVH4DSJDHYJ/graph.json","events_json":"https://pith.science/api/pith-number/BB5IGIIONLBOE72SVH4DSJDHYJ/events.json","paper":"https://pith.science/paper/BB5IGIIO"},"agent_actions":{"view_html":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ","download_json":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ.json","view_paper":"https://pith.science/paper/BB5IGIIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06831&json=true","fetch_graph":"https://pith.science/api/pith-number/BB5IGIIONLBOE72SVH4DSJDHYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/BB5IGIIONLBOE72SVH4DSJDHYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/action/storage_attestation","attest_author":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/action/author_attestation","sign_citation":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/action/citation_signature","submit_replication":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/action/replication_record"}},"created_at":"2026-05-18T00:52:12.089483+00:00","updated_at":"2026-05-18T00:52:12.089483+00:00"}