{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z3JS3O3P4KN2QHARTC6ZXPOOXC","short_pith_number":"pith:Z3JS3O3P","schema_version":"1.0","canonical_sha256":"ced32dbb6fe29ba81c1198bd9bbdceb8bd9893c5e78beed06ca2fbf73f774aab","source":{"kind":"arxiv","id":"1711.06624","version":4},"attestation_state":"computed","paper":{"title":"Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Thomas Honold","submitted_at":"2017-11-17T16:56:28Z","abstract_excerpt":"The maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=6$, and constant dimension $k=4$ is $257$, where the $2$ isomorphism types are extended lifted maximum rank distance codes. In finite geometry terms the maximum number of solids in $\\operatorname{PG}(7,2)$, mutually intersecting in at most a point, is $257$. The result was obtained by combining the classification of substructures with integer linear programming techniques. This implies that the maximum size $A_2(8,6)$ of a binary mixed-dimension code of packet length $8$ and minimum sub"},"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":"1711.06624","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-17T16:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"2fb47d5f7865ea443d0a72b9748bc066614d06f6aec2eeb2ab6b5cd5ac2cc084","abstract_canon_sha256":"a9a43ad61f8e583fd163bf80480ce4e6dfa49bc15c1ca6e1c1618b573a0ec7c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.446872Z","signature_b64":"oiTa8X0ie5rA+rqrLqqMDrQb+AWmrHGfrn9VwCSXdJkzpVTd+6O/61fg/yYc1STgt7J8+ztJR4W19Orj1nddAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced32dbb6fe29ba81c1198bd9bbdceb8bd9893c5e78beed06ca2fbf73f774aab","last_reissued_at":"2026-05-18T00:02:45.446485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.446485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Thomas Honold","submitted_at":"2017-11-17T16:56:28Z","abstract_excerpt":"The maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=6$, and constant dimension $k=4$ is $257$, where the $2$ isomorphism types are extended lifted maximum rank distance codes. In finite geometry terms the maximum number of solids in $\\operatorname{PG}(7,2)$, mutually intersecting in at most a point, is $257$. The result was obtained by combining the classification of substructures with integer linear programming techniques. This implies that the maximum size $A_2(8,6)$ of a binary mixed-dimension code of packet length $8$ and minimum sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06624","kind":"arxiv","version":4},"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":"1711.06624","created_at":"2026-05-18T00:02:45.446537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06624v4","created_at":"2026-05-18T00:02:45.446537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06624","created_at":"2026-05-18T00:02:45.446537+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3JS3O3P4KN2","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3JS3O3P4KN2QHAR","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3JS3O3P","created_at":"2026-05-18T12:31:59.375834+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/Z3JS3O3P4KN2QHARTC6ZXPOOXC","json":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC.json","graph_json":"https://pith.science/api/pith-number/Z3JS3O3P4KN2QHARTC6ZXPOOXC/graph.json","events_json":"https://pith.science/api/pith-number/Z3JS3O3P4KN2QHARTC6ZXPOOXC/events.json","paper":"https://pith.science/paper/Z3JS3O3P"},"agent_actions":{"view_html":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC","download_json":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC.json","view_paper":"https://pith.science/paper/Z3JS3O3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06624&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3JS3O3P4KN2QHARTC6ZXPOOXC/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3JS3O3P4KN2QHARTC6ZXPOOXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/action/storage_attestation","attest_author":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/action/author_attestation","sign_citation":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/action/citation_signature","submit_replication":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/action/replication_record"}},"created_at":"2026-05-18T00:02:45.446537+00:00","updated_at":"2026-05-18T00:02:45.446537+00:00"}