{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LRJSTWAI6HJRACRHP2VSTLTBHL","short_pith_number":"pith:LRJSTWAI","canonical_record":{"source":{"id":"1601.01502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T12:01:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"990936febd40ed2e264312f2b834e988dc340c9d37ee59352210b221e8d6f813","abstract_canon_sha256":"401431a686c5b2d9de38295bdd2c11ed3b6ab1eb044dffce67f72b795f7a9788"},"schema_version":"1.0"},"canonical_sha256":"5c5329d808f1d3100a277eab29ae613ae61faaa1041900122818f26a70f1e7c8","source":{"kind":"arxiv","id":"1601.01502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01502","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01502v2","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01502","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"pith_short_12","alias_value":"LRJSTWAI6HJR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LRJSTWAI6HJRACRH","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LRJSTWAI","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LRJSTWAI6HJRACRHP2VSTLTBHL","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T12:01:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"990936febd40ed2e264312f2b834e988dc340c9d37ee59352210b221e8d6f813","abstract_canon_sha256":"401431a686c5b2d9de38295bdd2c11ed3b6ab1eb044dffce67f72b795f7a9788"},"schema_version":"1.0"},"canonical_sha256":"5c5329d808f1d3100a277eab29ae613ae61faaa1041900122818f26a70f1e7c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:46.043254Z","signature_b64":"le69TAKit+TKfPHraqMjhsd+brrkE8QqB6+B9KL0vQbJTCKj+Mmy03IhR9avgxiGowd4YOn4e8L5RlqOWQlxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c5329d808f1d3100a277eab29ae613ae61faaa1041900122818f26a70f1e7c8","last_reissued_at":"2026-05-18T01:22:46.042697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:46.042697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01502","source_version":2,"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-18T01:22:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxhX9UdyF/UoLP7I6rrQKI8WgVdvBCrI0hn0aY+MypDP1Nq226gk08o6rZwsViJt4qM+lNkjdH5MVt4MQpDdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:45:40.052228Z"},"content_sha256":"dbfb724a6ea78b2f27bf74276b99619da615e2ae6f15a642d7b451d882043cd7","schema_version":"1.0","event_id":"sha256:dbfb724a6ea78b2f27bf74276b99619da615e2ae6f15a642d7b451d882043cd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LRJSTWAI6HJRACRHP2VSTLTBHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Expurgation-Augmentation Method for Constructing Good Plane Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Haiteng Liu, Jingmei Ai, Thomas Honold","submitted_at":"2016-01-07T12:01:18Z","abstract_excerpt":"As shown in [28], one of the five isomorphism types of optimal binary subspace codes of size 77 for packet length v=6, constant dimension k=3 and minimum subspace distance d=4 can be constructed by first expurgating and then augmenting the corresponding lifted Gabidulin code in a fairly simple way. The method was refined in [32,26] to yield an essentially computer-free construction of a currently best-known plane subspace code of size 329 for (v,k,d)=(7,3,4). In this paper we generalize the expurgation-augmentation approach to arbitrary packet length v, providing both a detailed theoretical an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01502","kind":"arxiv","version":2},"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-18T01:22:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZNR4djgN45YPMRG96sHM5B9M/iB/tc4RsCWoebkm/0a/i06MZPfzPHPcrvvNGDFDRKz5Nv1IQ0BJoldFL8nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:45:40.052594Z"},"content_sha256":"80a0906dc94acf32ba37362a1f7ae6b7923786e71d45479fe9189677aad05b4e","schema_version":"1.0","event_id":"sha256:80a0906dc94acf32ba37362a1f7ae6b7923786e71d45479fe9189677aad05b4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRJSTWAI6HJRACRHP2VSTLTBHL/bundle.json","state_url":"https://pith.science/pith/LRJSTWAI6HJRACRHP2VSTLTBHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRJSTWAI6HJRACRHP2VSTLTBHL/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-29T22:45:40Z","links":{"resolver":"https://pith.science/pith/LRJSTWAI6HJRACRHP2VSTLTBHL","bundle":"https://pith.science/pith/LRJSTWAI6HJRACRHP2VSTLTBHL/bundle.json","state":"https://pith.science/pith/LRJSTWAI6HJRACRHP2VSTLTBHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRJSTWAI6HJRACRHP2VSTLTBHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LRJSTWAI6HJRACRHP2VSTLTBHL","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":"401431a686c5b2d9de38295bdd2c11ed3b6ab1eb044dffce67f72b795f7a9788","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T12:01:18Z","title_canon_sha256":"990936febd40ed2e264312f2b834e988dc340c9d37ee59352210b221e8d6f813"},"schema_version":"1.0","source":{"id":"1601.01502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01502","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01502v2","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01502","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"pith_short_12","alias_value":"LRJSTWAI6HJR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LRJSTWAI6HJRACRH","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LRJSTWAI","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:80a0906dc94acf32ba37362a1f7ae6b7923786e71d45479fe9189677aad05b4e","target":"graph","created_at":"2026-05-18T01:22:46Z","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":"As shown in [28], one of the five isomorphism types of optimal binary subspace codes of size 77 for packet length v=6, constant dimension k=3 and minimum subspace distance d=4 can be constructed by first expurgating and then augmenting the corresponding lifted Gabidulin code in a fairly simple way. The method was refined in [32,26] to yield an essentially computer-free construction of a currently best-known plane subspace code of size 329 for (v,k,d)=(7,3,4). In this paper we generalize the expurgation-augmentation approach to arbitrary packet length v, providing both a detailed theoretical an","authors_text":"Haiteng Liu, Jingmei Ai, Thomas Honold","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T12:01:18Z","title":"The Expurgation-Augmentation Method for Constructing Good Plane Subspace Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01502","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:dbfb724a6ea78b2f27bf74276b99619da615e2ae6f15a642d7b451d882043cd7","target":"record","created_at":"2026-05-18T01:22:46Z","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":"401431a686c5b2d9de38295bdd2c11ed3b6ab1eb044dffce67f72b795f7a9788","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T12:01:18Z","title_canon_sha256":"990936febd40ed2e264312f2b834e988dc340c9d37ee59352210b221e8d6f813"},"schema_version":"1.0","source":{"id":"1601.01502","kind":"arxiv","version":2}},"canonical_sha256":"5c5329d808f1d3100a277eab29ae613ae61faaa1041900122818f26a70f1e7c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c5329d808f1d3100a277eab29ae613ae61faaa1041900122818f26a70f1e7c8","first_computed_at":"2026-05-18T01:22:46.042697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:46.042697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"le69TAKit+TKfPHraqMjhsd+brrkE8QqB6+B9KL0vQbJTCKj+Mmy03IhR9avgxiGowd4YOn4e8L5RlqOWQlxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:46.043254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbfb724a6ea78b2f27bf74276b99619da615e2ae6f15a642d7b451d882043cd7","sha256:80a0906dc94acf32ba37362a1f7ae6b7923786e71d45479fe9189677aad05b4e"],"state_sha256":"8cf7be6b2475cb1ac104183df85d0debd204dd7298b8818561c3a035df96660e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUBKzYz4M5vE2BsZ+ehbsDmhWB3uw1rNlkjJZ9IB8nW7u1f1mcfkcGxuz0vHUxJ/X/jEmkoWop91Rt6WOVg9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:45:40.054808Z","bundle_sha256":"87e53da95690b13ec9cc145879c336004947b4edc39bf261c15f3d483c581ef0"}}