{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:M5FA6CKK6KDSGEFVWD45NVLFYT","short_pith_number":"pith:M5FA6CKK","canonical_record":{"source":{"id":"2011.06937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-13T14:30:40Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"c45f74b8efc6b9108d24294dd6a5ccc8001c6f8dd51597ea4b103e5453ba031a","abstract_canon_sha256":"a9c4062ae41d60578fcd86f6384949a16a0e399fdb381ad1c7669f107f85dfe1"},"schema_version":"1.0"},"canonical_sha256":"674a0f094af2872310b5b0f9d6d565c4c205cd72e20ca4d6fe2fe07ccfab6382","source":{"kind":"arxiv","id":"2011.06937","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.06937","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"2011.06937v1","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06937","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"M5FA6CKK6KDS","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_16","alias_value":"M5FA6CKK6KDSGEFV","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_8","alias_value":"M5FA6CKK","created_at":"2026-07-05T01:51:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:M5FA6CKK6KDSGEFVWD45NVLFYT","target":"record","payload":{"canonical_record":{"source":{"id":"2011.06937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-13T14:30:40Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"c45f74b8efc6b9108d24294dd6a5ccc8001c6f8dd51597ea4b103e5453ba031a","abstract_canon_sha256":"a9c4062ae41d60578fcd86f6384949a16a0e399fdb381ad1c7669f107f85dfe1"},"schema_version":"1.0"},"canonical_sha256":"674a0f094af2872310b5b0f9d6d565c4c205cd72e20ca4d6fe2fe07ccfab6382","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:26.256851Z","signature_b64":"aHW1tP5KlH16mJQnktr9+AfSdEgJRtSwY8skhiFWDxPQt/VWN2eQFo+ditr5k4hOah6fIpnW2YgliuEeaDH9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"674a0f094af2872310b5b0f9d6d565c4c205cd72e20ca4d6fe2fe07ccfab6382","last_reissued_at":"2026-07-05T01:51:26.256506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:26.256506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.06937","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-07-05T01:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Isl8C0o0PheTCXyvL+ECVN4NW5HO9GMqa3uBF0tJpTI6adrlgQ95+o7x6gI6yqq5ao/YXrCWJSo55KzZxDTkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:14:12.015753Z"},"content_sha256":"7565e8490a7f54fa184432273ddb9bb9658f3530b7db2973adfba9c8f5a92695","schema_version":"1.0","event_id":"sha256:7565e8490a7f54fa184432273ddb9bb9658f3530b7db2973adfba9c8f5a92695"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:M5FA6CKK6KDSGEFVWD45NVLFYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for the multilevel construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Sascha Kurz, Shuangqing Liu, Tao Feng","submitted_at":"2020-11-13T14:30:40Z","abstract_excerpt":"One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\\mathcal{P}_q(n)$ for a given minimum distance. The determination of the exact maximum cardinality is a very tough discrete optimization problem involving a huge number of symmetries. Besides some explicit constructions for \\textit{good} subspace codes several of the most success full constructions involve the solution of discrete optimization subproblems itself, which mostly have not been not been solved systematical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06937","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.06937/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-05T01:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/IJ12F8qDLeZOU67UbO2V1Wmzk9GF/sflxdwk4Ko5DccZxqzB/x2cN4VIxtk10/gle+psjnspx5KOYZzIhKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:14:12.016392Z"},"content_sha256":"c0a71af911a43f839b475bfd365881d74c62ae2fa8b2a4b04c26817ecb26fd22","schema_version":"1.0","event_id":"sha256:c0a71af911a43f839b475bfd365881d74c62ae2fa8b2a4b04c26817ecb26fd22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5FA6CKK6KDSGEFVWD45NVLFYT/bundle.json","state_url":"https://pith.science/pith/M5FA6CKK6KDSGEFVWD45NVLFYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5FA6CKK6KDSGEFVWD45NVLFYT/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-14T07:14:12Z","links":{"resolver":"https://pith.science/pith/M5FA6CKK6KDSGEFVWD45NVLFYT","bundle":"https://pith.science/pith/M5FA6CKK6KDSGEFVWD45NVLFYT/bundle.json","state":"https://pith.science/pith/M5FA6CKK6KDSGEFVWD45NVLFYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5FA6CKK6KDSGEFVWD45NVLFYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:M5FA6CKK6KDSGEFVWD45NVLFYT","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":"a9c4062ae41d60578fcd86f6384949a16a0e399fdb381ad1c7669f107f85dfe1","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-13T14:30:40Z","title_canon_sha256":"c45f74b8efc6b9108d24294dd6a5ccc8001c6f8dd51597ea4b103e5453ba031a"},"schema_version":"1.0","source":{"id":"2011.06937","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.06937","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"2011.06937v1","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06937","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"M5FA6CKK6KDS","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_16","alias_value":"M5FA6CKK6KDSGEFV","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_8","alias_value":"M5FA6CKK","created_at":"2026-07-05T01:51:26Z"}],"graph_snapshots":[{"event_id":"sha256:c0a71af911a43f839b475bfd365881d74c62ae2fa8b2a4b04c26817ecb26fd22","target":"graph","created_at":"2026-07-05T01:51:26Z","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/2011.06937/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\\mathcal{P}_q(n)$ for a given minimum distance. The determination of the exact maximum cardinality is a very tough discrete optimization problem involving a huge number of symmetries. Besides some explicit constructions for \\textit{good} subspace codes several of the most success full constructions involve the solution of discrete optimization subproblems itself, which mostly have not been not been solved systematical","authors_text":"Sascha Kurz, Shuangqing Liu, Tao Feng","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-13T14:30:40Z","title":"Bounds for the multilevel construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06937","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:7565e8490a7f54fa184432273ddb9bb9658f3530b7db2973adfba9c8f5a92695","target":"record","created_at":"2026-07-05T01:51:26Z","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":"a9c4062ae41d60578fcd86f6384949a16a0e399fdb381ad1c7669f107f85dfe1","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-13T14:30:40Z","title_canon_sha256":"c45f74b8efc6b9108d24294dd6a5ccc8001c6f8dd51597ea4b103e5453ba031a"},"schema_version":"1.0","source":{"id":"2011.06937","kind":"arxiv","version":1}},"canonical_sha256":"674a0f094af2872310b5b0f9d6d565c4c205cd72e20ca4d6fe2fe07ccfab6382","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"674a0f094af2872310b5b0f9d6d565c4c205cd72e20ca4d6fe2fe07ccfab6382","first_computed_at":"2026-07-05T01:51:26.256506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:26.256506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHW1tP5KlH16mJQnktr9+AfSdEgJRtSwY8skhiFWDxPQt/VWN2eQFo+ditr5k4hOah6fIpnW2YgliuEeaDH9DA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:26.256851Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.06937","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7565e8490a7f54fa184432273ddb9bb9658f3530b7db2973adfba9c8f5a92695","sha256:c0a71af911a43f839b475bfd365881d74c62ae2fa8b2a4b04c26817ecb26fd22"],"state_sha256":"2c7d7bf45fe520d3f02047e499bbe21b258c712788ce3cd1839036942f3b74a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A89cm+/iwJjYELHiz3R7gxafz39laE5y4xUUyZ7d93v1SwomQXUZ8+GI1I+akmExWHkl6i8xJJIeP3j9avVVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:14:12.022246Z","bundle_sha256":"6a568e207ace1d5fc35862cf3ad4af44f9366e4b3deb7f4381e123001e9e1a48"}}