{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XKDQCKNOX7T5TIDXOAN7DIRGXU","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":"2a8aabd2378c7f310e98ad9d8f64b841a14fa607b9d757393089c49172c92a8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T13:23:25Z","title_canon_sha256":"d8dbddd4c1a02b4bb088a182e52e682611e8308081ddb2c2bd423ccbdd6b06c2"},"schema_version":"1.0","source":{"id":"1311.0464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0464","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0464v2","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0464","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"XKDQCKNOX7T5","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XKDQCKNOX7T5TIDX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XKDQCKNO","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:a923a00c7bd7daeb82df2680de897e2ab351baf08845b74a29fa2737b1e30aaa","target":"graph","created_at":"2026-05-18T01:30:08Z","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":"It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\\operatorname{PG}(5,2)$ mutually intersecting in at most a point is $77$. Optimal binary $(v,M,d;k)=(6,77,4;3)$ subspace codes are classified into $5$ isomorphism types, and a computer-free construction of one isomorphism type is provided. The construction uses both geometry and finite fields theory and generalizes to any $q$, yielding a new family of $q$-ary $(6,q^6+2q^2+2q+1,4;3)","authors_text":"Michael Kiermaier, Sascha Kurz, Thomas Honold","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T13:23:25Z","title":"Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0464","kind":"arxiv","version":2},"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:6e64af3ad7b30733378ce513a5cb8c1ac3daa7ae20b303611786426934dd50eb","target":"record","created_at":"2026-05-18T01:30:08Z","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":"2a8aabd2378c7f310e98ad9d8f64b841a14fa607b9d757393089c49172c92a8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-03T13:23:25Z","title_canon_sha256":"d8dbddd4c1a02b4bb088a182e52e682611e8308081ddb2c2bd423ccbdd6b06c2"},"schema_version":"1.0","source":{"id":"1311.0464","kind":"arxiv","version":2}},"canonical_sha256":"ba870129aebfe7d9a077701bf1a226bd26e39e88aa37c30b56999187f76dc32d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba870129aebfe7d9a077701bf1a226bd26e39e88aa37c30b56999187f76dc32d","first_computed_at":"2026-05-18T01:30:08.542426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:08.542426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"67I3iX4geHcAkrwGcHXJA3ID1BqaoXiJcVwXzwKzpTdI8dIVKCppZ5Rwksl3l4hz6h9o7FjEEgtwtwq+N2k+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:08.542966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e64af3ad7b30733378ce513a5cb8c1ac3daa7ae20b303611786426934dd50eb","sha256:a923a00c7bd7daeb82df2680de897e2ab351baf08845b74a29fa2737b1e30aaa"],"state_sha256":"ef8f20576c7bf47e429103116df88647f50a354e704d44fb9ef7dcc892900086"}