{"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"}