{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z3JS3O3P4KN2QHARTC6ZXPOOXC","short_pith_number":"pith:Z3JS3O3P","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"},"canonical_sha256":"ced32dbb6fe29ba81c1198bd9bbdceb8bd9893c5e78beed06ca2fbf73f774aab","source":{"kind":"arxiv","id":"1711.06624","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06624","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06624v4","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06624","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"Z3JS3O3P4KN2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3JS3O3P4KN2QHAR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3JS3O3P","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z3JS3O3P4KN2QHARTC6ZXPOOXC","target":"record","payload":{"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"},"canonical_sha256":"ced32dbb6fe29ba81c1198bd9bbdceb8bd9893c5e78beed06ca2fbf73f774aab","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"},"source_kind":"arxiv","source_id":"1711.06624","source_version":4,"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHSlr190eORI5+SnE2Sx6JmCwIRVL+822fOZ5Y7Tmfs+BnFwlq0YfQ6+tG7qpKTsZM+KwLowGfRM2fIaFS0CBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:29:45.901785Z"},"content_sha256":"f4acd113c4911691baab68ca0d6bba3ecfb2f579f9f888cd0419886d199bde81","schema_version":"1.0","event_id":"sha256:f4acd113c4911691baab68ca0d6bba3ecfb2f579f9f888cd0419886d199bde81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z3JS3O3P4KN2QHARTC6ZXPOOXC","target":"graph","payload":{"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"},"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nv5juee7B/afqFMlaGicZ+Q9KnWOCZJtqjXi6jokQLA7A6HtHxe5M8xs9ogzWJzaH9bvCyT3I/9HJUbeE+9dDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:29:45.902516Z"},"content_sha256":"087e29bf8bf2f6e474654b0b54abc7201c584509c839e84d670b186c227d0306","schema_version":"1.0","event_id":"sha256:087e29bf8bf2f6e474654b0b54abc7201c584509c839e84d670b186c227d0306"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/bundle.json","state_url":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/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-05-25T08:29:45Z","links":{"resolver":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC","bundle":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/bundle.json","state":"https://pith.science/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3JS3O3P4KN2QHARTC6ZXPOOXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z3JS3O3P4KN2QHARTC6ZXPOOXC","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":"a9a43ad61f8e583fd163bf80480ce4e6dfa49bc15c1ca6e1c1618b573a0ec7c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-17T16:56:28Z","title_canon_sha256":"2fb47d5f7865ea443d0a72b9748bc066614d06f6aec2eeb2ab6b5cd5ac2cc084"},"schema_version":"1.0","source":{"id":"1711.06624","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06624","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06624v4","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06624","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"Z3JS3O3P4KN2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3JS3O3P4KN2QHAR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3JS3O3P","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:087e29bf8bf2f6e474654b0b54abc7201c584509c839e84d670b186c227d0306","target":"graph","created_at":"2026-05-18T00:02:45Z","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 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","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Thomas Honold","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-17T16:56:28Z","title":"Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06624","kind":"arxiv","version":4},"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:f4acd113c4911691baab68ca0d6bba3ecfb2f579f9f888cd0419886d199bde81","target":"record","created_at":"2026-05-18T00:02:45Z","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":"a9a43ad61f8e583fd163bf80480ce4e6dfa49bc15c1ca6e1c1618b573a0ec7c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-17T16:56:28Z","title_canon_sha256":"2fb47d5f7865ea443d0a72b9748bc066614d06f6aec2eeb2ab6b5cd5ac2cc084"},"schema_version":"1.0","source":{"id":"1711.06624","kind":"arxiv","version":4}},"canonical_sha256":"ced32dbb6fe29ba81c1198bd9bbdceb8bd9893c5e78beed06ca2fbf73f774aab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ced32dbb6fe29ba81c1198bd9bbdceb8bd9893c5e78beed06ca2fbf73f774aab","first_computed_at":"2026-05-18T00:02:45.446485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.446485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oiTa8X0ie5rA+rqrLqqMDrQb+AWmrHGfrn9VwCSXdJkzpVTd+6O/61fg/yYc1STgt7J8+ztJR4W19Orj1nddAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.446872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06624","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4acd113c4911691baab68ca0d6bba3ecfb2f579f9f888cd0419886d199bde81","sha256:087e29bf8bf2f6e474654b0b54abc7201c584509c839e84d670b186c227d0306"],"state_sha256":"725d5d5415c48a9f44d51e7a16aa2f58d368813386c6d15a4bce90195d39511f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLkhFlvb75y5ywWRVFqoDe9xHgM8QnTNOQSLyAUHJu1wudXDxYi97SSnro4q7pi3qMeAuSQQ1aC2WVOrzITjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:29:45.905757Z","bundle_sha256":"02645f541d29153beb1777e7cc23651178137c3f75063c6b58d0afc86ea22b7a"}}