{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EPQAUKHLOQCQURCQTCASMS2RJJ","short_pith_number":"pith:EPQAUKHL","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"},"canonical_sha256":"23e00a28eb74050a44509881264b514a5de6ba240c43089b3ab9e7d30f42b671","source":{"kind":"arxiv","id":"1703.08712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08712","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08712v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08712","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"EPQAUKHLOQCQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EPQAUKHLOQCQURCQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EPQAUKHL","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EPQAUKHLOQCQURCQTCASMS2RJJ","target":"record","payload":{"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"},"canonical_sha256":"23e00a28eb74050a44509881264b514a5de6ba240c43089b3ab9e7d30f42b671","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"},"source_kind":"arxiv","source_id":"1703.08712","source_version":1,"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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzYR230RMF2fFF08P2Mah/e5kiahp4n9X+g7JTHmxmqpnCbIjSKVElUvYY6t1KOixPZVcLb5l1Cmpl7/Ad7PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:25.392710Z"},"content_sha256":"6cd536a0e790eeffdf61288fc37a6f902fdf8cc9caf1e213c5d678ba3d414881","schema_version":"1.0","event_id":"sha256:6cd536a0e790eeffdf61288fc37a6f902fdf8cc9caf1e213c5d678ba3d414881"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EPQAUKHLOQCQURCQTCASMS2RJJ","target":"graph","payload":{"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"},"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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4KqGKmew1dv3vsvk5nGTHScVxRdXMTzjpLYS1CuxFmfMVnJ5lraA/LEyVSN7dAB+4u97OSw6HgQR4kUQPmmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:25.393401Z"},"content_sha256":"ded23fa02235615c8e08ef936bdc11fedf6a87603ed2e0601d04e043e89e3ef4","schema_version":"1.0","event_id":"sha256:ded23fa02235615c8e08ef936bdc11fedf6a87603ed2e0601d04e043e89e3ef4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/bundle.json","state_url":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/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-25T18:01:25Z","links":{"resolver":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ","bundle":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/bundle.json","state":"https://pith.science/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPQAUKHLOQCQURCQTCASMS2RJJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EPQAUKHLOQCQURCQTCASMS2RJJ","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":"75450cc23955532a741382df47c4b598c26b217ec27fd6800d8926b361c9f17e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T16:50:49Z","title_canon_sha256":"16abfb8b52e0a90e0bb319b2e8f52b706eba7e15fd5810af881d6ddb72ec6c12"},"schema_version":"1.0","source":{"id":"1703.08712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08712","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08712v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08712","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"EPQAUKHLOQCQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EPQAUKHLOQCQURCQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EPQAUKHL","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ded23fa02235615c8e08ef936bdc11fedf6a87603ed2e0601d04e043e89e3ef4","target":"graph","created_at":"2026-05-18T00:47:55Z","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 $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","authors_text":"Daniel Heinlein, Sascha Kurz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T16:50:49Z","title":"A new upper bound for subspace codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08712","kind":"arxiv","version":1},"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:6cd536a0e790eeffdf61288fc37a6f902fdf8cc9caf1e213c5d678ba3d414881","target":"record","created_at":"2026-05-18T00:47:55Z","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":"75450cc23955532a741382df47c4b598c26b217ec27fd6800d8926b361c9f17e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-25T16:50:49Z","title_canon_sha256":"16abfb8b52e0a90e0bb319b2e8f52b706eba7e15fd5810af881d6ddb72ec6c12"},"schema_version":"1.0","source":{"id":"1703.08712","kind":"arxiv","version":1}},"canonical_sha256":"23e00a28eb74050a44509881264b514a5de6ba240c43089b3ab9e7d30f42b671","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23e00a28eb74050a44509881264b514a5de6ba240c43089b3ab9e7d30f42b671","first_computed_at":"2026-05-18T00:47:55.792165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:55.792165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eI7wM/myNSLQUfzzn1MaWf9Y0G+7xiqmOOkoreR5yPqLBFoWVbHY9zURSirbnEZ+V8XZVeB7KXtMykXH6SD0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:55.792707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cd536a0e790eeffdf61288fc37a6f902fdf8cc9caf1e213c5d678ba3d414881","sha256:ded23fa02235615c8e08ef936bdc11fedf6a87603ed2e0601d04e043e89e3ef4"],"state_sha256":"1c79ea014e6831afd8be288adb7e39de86c6e9524487dd16c9f38650ce2e64fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqgcfh0Vi1K+RpLHyonvvgkUaCEc/7yGfVTRrwljpRX4u0ahne2rwZKhVCanaUptalNHXoBurRe1k5K119qEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:01:25.396873Z","bundle_sha256":"b188647ca3994ac28db0aeb233d6546685ac086807c6d2de9a4725e1e893a280"}}