{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DN7UZJGS5XNY3HOJOOYD2IUTSQ","short_pith_number":"pith:DN7UZJGS","canonical_record":{"source":{"id":"1601.02864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"87a593d9617ac02cc0ebbe9d86342d61d5b96703dc55c9144984feb02ec4c3c5","abstract_canon_sha256":"6557c75512fac2a605473d840935ac763a402f159a4690c2ccad18b110a5c974"},"schema_version":"1.0"},"canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","source":{"kind":"arxiv","id":"1601.02864","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02864","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02864v3","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02864","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"DN7UZJGS5XNY","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DN7UZJGS5XNY3HOJ","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DN7UZJGS","created_at":"2026-07-05T00:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DN7UZJGS5XNY3HOJOOYD2IUTSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"87a593d9617ac02cc0ebbe9d86342d61d5b96703dc55c9144984feb02ec4c3c5","abstract_canon_sha256":"6557c75512fac2a605473d840935ac763a402f159a4690c2ccad18b110a5c974"},"schema_version":"1.0"},"canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:40.875832Z","signature_b64":"zuw68K7fN+QXHqwqG3fMUitYArfgKB/rw5zyPNZrJkc61hiLFYOX6l06N0JY9HbhWItGowEzhqsCGUtdzQyWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","last_reissued_at":"2026-07-05T00:27:40.875447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:40.875447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02864","source_version":3,"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-07-05T00:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyV8Pu/5inaCdZT/dlMI80XU9FxlvCobDuE7SkxKuFFLlYwV0qy+St2FpXjbHqj94OGG5OyInZF/FSuAxhiHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:13:14.957622Z"},"content_sha256":"117b33eca9727adc935605a1d68dc41102dec28efdf9a568b232a4b91685e076","schema_version":"1.0","event_id":"sha256:117b33eca9727adc935605a1d68dc41102dec28efdf9a568b232a4b91685e076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DN7UZJGS5XNY3HOJOOYD2IUTSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tables of subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz","submitted_at":"2016-01-12T13:59:06Z","abstract_excerpt":"One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained in $K\\subseteq\\{0,1,\\dots,n\\}$. In the special case of $K=\\{k\\}$ one speaks of constant dimension codes. Since this (still) emerging field is very prosperous on the one hand side and there are a lot of connections to classical objects from Galois geometry it is a bit difficult to keep or to obtain an overview about the current state of knowledge. To this en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02864","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1601.02864/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wa8/9lhnGvOauDy1C5xiGRIuyVug59fM/ymctoczMUbMLIgeoGNqA30IJ1LYfOYPy4nx5Rg6A6zC0zCV9kA+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:13:14.958329Z"},"content_sha256":"7c574cee9d7650cca259bf3859032bb67d9724510c09fbde843461ccdf55f5e6","schema_version":"1.0","event_id":"sha256:7c574cee9d7650cca259bf3859032bb67d9724510c09fbde843461ccdf55f5e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/bundle.json","state_url":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/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-08-11T09:13:14Z","links":{"resolver":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ","bundle":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/bundle.json","state":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DN7UZJGS5XNY3HOJOOYD2IUTSQ","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":"6557c75512fac2a605473d840935ac763a402f159a4690c2ccad18b110a5c974","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","title_canon_sha256":"87a593d9617ac02cc0ebbe9d86342d61d5b96703dc55c9144984feb02ec4c3c5"},"schema_version":"1.0","source":{"id":"1601.02864","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02864","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02864v3","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02864","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"DN7UZJGS5XNY","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DN7UZJGS5XNY3HOJ","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DN7UZJGS","created_at":"2026-07-05T00:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:7c574cee9d7650cca259bf3859032bb67d9724510c09fbde843461ccdf55f5e6","target":"graph","created_at":"2026-07-05T00:27:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1601.02864/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained in $K\\subseteq\\{0,1,\\dots,n\\}$. In the special case of $K=\\{k\\}$ one speaks of constant dimension codes. Since this (still) emerging field is very prosperous on the one hand side and there are a lot of connections to classical objects from Galois geometry it is a bit difficult to keep or to obtain an overview about the current state of knowledge. To this en","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","title":"Tables of subspace codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02864","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:117b33eca9727adc935605a1d68dc41102dec28efdf9a568b232a4b91685e076","target":"record","created_at":"2026-07-05T00:27:40Z","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":"6557c75512fac2a605473d840935ac763a402f159a4690c2ccad18b110a5c974","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","title_canon_sha256":"87a593d9617ac02cc0ebbe9d86342d61d5b96703dc55c9144984feb02ec4c3c5"},"schema_version":"1.0","source":{"id":"1601.02864","kind":"arxiv","version":3}},"canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","first_computed_at":"2026-07-05T00:27:40.875447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:27:40.875447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zuw68K7fN+QXHqwqG3fMUitYArfgKB/rw5zyPNZrJkc61hiLFYOX6l06N0JY9HbhWItGowEzhqsCGUtdzQyWAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:27:40.875832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02864","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117b33eca9727adc935605a1d68dc41102dec28efdf9a568b232a4b91685e076","sha256:7c574cee9d7650cca259bf3859032bb67d9724510c09fbde843461ccdf55f5e6"],"state_sha256":"15cd3482e95ee45c3b4b7f297acd9d64f2de8a0a93299760ac1bc513cbd9aeed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJo1moNLOPRPLBxj+4n3f7QIooxvKNgEys9XoP3rFIkGxnTyn7jPOROj70I5zwHlWUvzCifW+gy1lbvhR1YGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:13:14.964470Z","bundle_sha256":"f3db6df8b7b85a2a047225761640dbe8a032de992867e4cdc03b389362690bef"}}