{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QSC2G2YRTRLOLKC42E6U2HLTKM","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":"38b36cdbb4a7bdc8118eafe76220af3513f15db6fdb38b10e40d204bc69a483e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-10T15:09:51Z","title_canon_sha256":"77ffbfb618c4d94116e16d4e29d560eadf5b18a0708461fd7976e949678eaf55"},"schema_version":"1.0","source":{"id":"1808.03580","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03580","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03580v3","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03580","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"QSC2G2YRTRLO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSC2G2YRTRLOLKC4","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSC2G2YR","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:9739737ce7d559404d0355d9dd7093bf40aa8eac3461d797b68485642e637605","target":"graph","created_at":"2026-05-17T23:56:14Z","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":"Subspace codes, i.e., sets of subspaces of $\\mathbb{F}_q^v$, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.","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":"2018-08-10T15:09:51Z","title":"Johnson type bounds for mixed dimension subspace codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03580","kind":"arxiv","version":3},"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:eea2c2b5e0c39af24ae8e086c5fac656afcff00b7fca1a3589179f954cbc2198","target":"record","created_at":"2026-05-17T23:56:14Z","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":"38b36cdbb4a7bdc8118eafe76220af3513f15db6fdb38b10e40d204bc69a483e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-10T15:09:51Z","title_canon_sha256":"77ffbfb618c4d94116e16d4e29d560eadf5b18a0708461fd7976e949678eaf55"},"schema_version":"1.0","source":{"id":"1808.03580","kind":"arxiv","version":3}},"canonical_sha256":"8485a36b119c56e5a85cd13d4d1d7353295bb1e9bcc421198b11c324d3b52cd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8485a36b119c56e5a85cd13d4d1d7353295bb1e9bcc421198b11c324d3b52cd0","first_computed_at":"2026-05-17T23:56:14.811032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:14.811032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXT7iJ2t5d4+L6NXYKFXnD7j9oYPLTeKWOL43zXaUaheyjYeU/1ulGLYR6PjaBUqA2WyX2CV9nLheSSJSVtlCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:14.811671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03580","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eea2c2b5e0c39af24ae8e086c5fac656afcff00b7fca1a3589179f954cbc2198","sha256:9739737ce7d559404d0355d9dd7093bf40aa8eac3461d797b68485642e637605"],"state_sha256":"32e5d695264534257e826fa78794c81444acdd55805036cf0366accdf05c460b"}