{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EPQAUKHLOQCQURCQTCASMS2RJJ","short_pith_number":"pith:EPQAUKHL","schema_version":"1.0","canonical_sha256":"23e00a28eb74050a44509881264b514a5de6ba240c43089b3ab9e7d30f42b671","source":{"kind":"arxiv","id":"1703.08712","version":1},"attestation_state":"computed","paper":{"title":"A new upper bound for subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Heinlein, Sascha Kurz","submitted_at":"2017-03-25T16:50:49Z","abstract_excerpt":"It is shown that the maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=4$, and constant dimension $k=4$ is at most $272$. In Finite Geometry terms, the maximum number of solids in $\\operatorname{PG}(7,2)$, mutually intersecting in at most a point, is at most $272$. Previously, the best known upper bound $A_2(8,6;4)\\le 289$ was implied by the Johnson bound and the maximum size $A_2(7,6;3)=17$ of partial plane spreads in $\\operatorname{PG}(6,2)$. The result was obtained by combining the classification of subspace codes with parameters $(7,17"},"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":"1703.08712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T16:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"16abfb8b52e0a90e0bb319b2e8f52b706eba7e15fd5810af881d6ddb72ec6c12","abstract_canon_sha256":"75450cc23955532a741382df47c4b598c26b217ec27fd6800d8926b361c9f17e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.792707Z","signature_b64":"eI7wM/myNSLQUfzzn1MaWf9Y0G+7xiqmOOkoreR5yPqLBFoWVbHY9zURSirbnEZ+V8XZVeB7KXtMykXH6SD0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23e00a28eb74050a44509881264b514a5de6ba240c43089b3ab9e7d30f42b671","last_reissued_at":"2026-05-18T00:47:55.792165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.792165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new upper bound for subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Heinlein, Sascha Kurz","submitted_at":"2017-03-25T16:50:49Z","abstract_excerpt":"It is shown that the maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=4$, and constant dimension $k=4$ is at most $272$. In Finite Geometry terms, the maximum number of solids in $\\operatorname{PG}(7,2)$, mutually intersecting in at most a point, is at most $272$. Previously, the best known upper bound $A_2(8,6;4)\\le 289$ was implied by the Johnson bound and the maximum size $A_2(7,6;3)=17$ of partial plane spreads in $\\operatorname{PG}(6,2)$. The result was obtained by combining the classification of subspace codes with parameters $(7,17"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08712","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":"1703.08712","created_at":"2026-05-18T00:47:55.792231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08712v1","created_at":"2026-05-18T00:47:55.792231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08712","created_at":"2026-05-18T00:47:55.792231+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPQAUKHLOQCQ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPQAUKHLOQCQURCQ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPQAUKHL","created_at":"2026-05-18T12:31:12.930513+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/EPQAUKHLOQCQURCQTCASMS2RJJ","json":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ.json","graph_json":"https://pith.science/api/pith-number/EPQAUKHLOQCQURCQTCASMS2RJJ/graph.json","events_json":"https://pith.science/api/pith-number/EPQAUKHLOQCQURCQTCASMS2RJJ/events.json","paper":"https://pith.science/paper/EPQAUKHL"},"agent_actions":{"view_html":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ","download_json":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ.json","view_paper":"https://pith.science/paper/EPQAUKHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08712&json=true","fetch_graph":"https://pith.science/api/pith-number/EPQAUKHLOQCQURCQTCASMS2RJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EPQAUKHLOQCQURCQTCASMS2RJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/action/storage_attestation","attest_author":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/action/author_attestation","sign_citation":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/action/citation_signature","submit_replication":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/action/replication_record"}},"created_at":"2026-05-18T00:47:55.792231+00:00","updated_at":"2026-05-18T00:47:55.792231+00:00"}