{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZEZ6H7KJJ3H6FXBRLM5MCML563","short_pith_number":"pith:ZEZ6H7KJ","schema_version":"1.0","canonical_sha256":"c933e3fd494ecfe2dc315b3ac1317df6dce36fe47a2c679b515344d76de58a2f","source":{"kind":"arxiv","id":"1512.04297","version":2},"attestation_state":"computed","paper":{"title":"Improved upper bounds for partial spreads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sascha Kurz","submitted_at":"2015-12-14T13:11:38Z","abstract_excerpt":"A partial $(k-1)$-spread in $\\operatorname{PG}(n-1,q)$ is a collection of $(k-1)$-dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far the maximum size of a partial $(k-1)$-spread in $\\operatorname{PG}(n-1,q)$ was known for the cases $n\\equiv 0\\pmod k$, $n\\equiv 1\\pmod k$ and $n\\equiv 2\\pmod k$ with the additional requirements $q=2$ and $k=3$. We completely resolve the case $n\\equiv 2\\pmod k$ for the binary case $q=2$."},"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":"1512.04297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-14T13:11:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f3261543ff910f33138732882485404d79f19a96d0cf98a6644e531f9418dd54","abstract_canon_sha256":"7069352a77e5bab39775f8fda30e122677e07b604a5cfbcb2424a3c51f401c60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:40.037578Z","signature_b64":"xKV+y/NL6crowFtSadTSkd3a3fK9kdCXvOKWFAcdP6HeQPJ1I5BlE1e17JBlxqd8HsYDOMOoUEbh6ciEHfLGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c933e3fd494ecfe2dc315b3ac1317df6dce36fe47a2c679b515344d76de58a2f","last_reissued_at":"2026-05-18T01:00:40.036885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:40.036885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved upper bounds for partial spreads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sascha Kurz","submitted_at":"2015-12-14T13:11:38Z","abstract_excerpt":"A partial $(k-1)$-spread in $\\operatorname{PG}(n-1,q)$ is a collection of $(k-1)$-dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far the maximum size of a partial $(k-1)$-spread in $\\operatorname{PG}(n-1,q)$ was known for the cases $n\\equiv 0\\pmod k$, $n\\equiv 1\\pmod k$ and $n\\equiv 2\\pmod k$ with the additional requirements $q=2$ and $k=3$. We completely resolve the case $n\\equiv 2\\pmod k$ for the binary case $q=2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04297","kind":"arxiv","version":2},"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":"1512.04297","created_at":"2026-05-18T01:00:40.036988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04297v2","created_at":"2026-05-18T01:00:40.036988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04297","created_at":"2026-05-18T01:00:40.036988+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEZ6H7KJJ3H6","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEZ6H7KJJ3H6FXBR","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEZ6H7KJ","created_at":"2026-05-18T12:29:52.810259+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/ZEZ6H7KJJ3H6FXBRLM5MCML563","json":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563.json","graph_json":"https://pith.science/api/pith-number/ZEZ6H7KJJ3H6FXBRLM5MCML563/graph.json","events_json":"https://pith.science/api/pith-number/ZEZ6H7KJJ3H6FXBRLM5MCML563/events.json","paper":"https://pith.science/paper/ZEZ6H7KJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563","download_json":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563.json","view_paper":"https://pith.science/paper/ZEZ6H7KJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04297&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEZ6H7KJJ3H6FXBRLM5MCML563/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEZ6H7KJJ3H6FXBRLM5MCML563/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563/action/storage_attestation","attest_author":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563/action/author_attestation","sign_citation":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563/action/citation_signature","submit_replication":"https://pith.science/pith/ZEZ6H7KJJ3H6FXBRLM5MCML563/action/replication_record"}},"created_at":"2026-05-18T01:00:40.036988+00:00","updated_at":"2026-05-18T01:00:40.036988+00:00"}