{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BB5IGIIONLBOE72SVH4DSJDHYJ","short_pith_number":"pith:BB5IGIIO","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"},"canonical_sha256":"087a83210e6ac2e27f52a9f8392467c2656efabe1291214301fbc6aa70b7eea8","source":{"kind":"arxiv","id":"1701.06831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06831","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06831v1","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06831","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"BB5IGIIONLBO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BB5IGIIONLBOE72S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BB5IGIIO","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BB5IGIIONLBOE72SVH4DSJDHYJ","target":"record","payload":{"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"},"canonical_sha256":"087a83210e6ac2e27f52a9f8392467c2656efabe1291214301fbc6aa70b7eea8","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"},"source_kind":"arxiv","source_id":"1701.06831","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:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Q5AoKJuG3HaKXQfBjfgjwl+fqSEdcCsw5XiIvIK689PG0nL0Nd3vnBgwLgqQmWjOMedn67dUYzVlNoKv0fPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:39:41.673223Z"},"content_sha256":"8cd167030c7bb8174e024905a538e00b26d2ab82bcaef32d6ba345da485b61bf","schema_version":"1.0","event_id":"sha256:8cd167030c7bb8174e024905a538e00b26d2ab82bcaef32d6ba345da485b61bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BB5IGIIONLBOE72SVH4DSJDHYJ","target":"graph","payload":{"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"},"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:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFjXYgFdf4fqyfDWeIPPTGuebSopuMtxVo5HiHgrwzziqhjCjh8+2DVvnaeeAnvMPwKEqSfGG9UtSggUw5O8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:39:41.673961Z"},"content_sha256":"ed2166e07de56f2259a21868a6038faea5e4ae60aa57001cdf92a9911014e1ce","schema_version":"1.0","event_id":"sha256:ed2166e07de56f2259a21868a6038faea5e4ae60aa57001cdf92a9911014e1ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/bundle.json","state_url":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/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-07T01:39:41Z","links":{"resolver":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ","bundle":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/bundle.json","state":"https://pith.science/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BB5IGIIONLBOE72SVH4DSJDHYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BB5IGIIONLBOE72SVH4DSJDHYJ","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":"21f5f67f83a4c9ee7d97876cbaaf873b8a0c08e0652d57586376a59befd6ecc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-24T12:13:16Z","title_canon_sha256":"7ffc87e845f3ef944274c188c139f6794e4819b36ef999377c60510d44c63e4f"},"schema_version":"1.0","source":{"id":"1701.06831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06831","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06831v1","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06831","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"BB5IGIIONLBO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BB5IGIIONLBOE72S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BB5IGIIO","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:ed2166e07de56f2259a21868a6038faea5e4ae60aa57001cdf92a9911014e1ce","target":"graph","created_at":"2026-05-18T00:52:12Z","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":"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","authors_text":"Bence Csajb\\'ok, Ferdinando Zullo, Giuseppe Marino, Olga Polverino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-24T12:13:16Z","title":"Maximum scattered linear sets and MRD-codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06831","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:8cd167030c7bb8174e024905a538e00b26d2ab82bcaef32d6ba345da485b61bf","target":"record","created_at":"2026-05-18T00:52:12Z","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":"21f5f67f83a4c9ee7d97876cbaaf873b8a0c08e0652d57586376a59befd6ecc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-24T12:13:16Z","title_canon_sha256":"7ffc87e845f3ef944274c188c139f6794e4819b36ef999377c60510d44c63e4f"},"schema_version":"1.0","source":{"id":"1701.06831","kind":"arxiv","version":1}},"canonical_sha256":"087a83210e6ac2e27f52a9f8392467c2656efabe1291214301fbc6aa70b7eea8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"087a83210e6ac2e27f52a9f8392467c2656efabe1291214301fbc6aa70b7eea8","first_computed_at":"2026-05-18T00:52:12.089417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:12.089417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B5SB6I9gVtwa3R8nkQHVagREIHinPNvTW53YGHybIE4Y/ByxW00lKzECULVIhHXlYBoa1U2wi7id4F06SLaFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:12.089851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cd167030c7bb8174e024905a538e00b26d2ab82bcaef32d6ba345da485b61bf","sha256:ed2166e07de56f2259a21868a6038faea5e4ae60aa57001cdf92a9911014e1ce"],"state_sha256":"29b13cec4390014253cbe3afafc55f0adb0f0224d7b285d71e1ba0f21da68bf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+9ACLlpIDM8Wy6X46wbeE6wTZ8LJH6VUKkBomf6q1tNjsln5CK9C8VwiGCvEcCa9ivK9Ta3PGtu6MqPqv1vCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:39:41.678958Z","bundle_sha256":"ea64cf971699161a7dda6f29b0756b0e8409582bb6b32cce16c55bc944a7fccf"}}