{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DLW45U5CX67YIXOQASW54JLXWH","short_pith_number":"pith:DLW45U5C","schema_version":"1.0","canonical_sha256":"1aedced3a2bfbf845dd004adde2577b1f0d15d8deb45087420cbe0e545304a89","source":{"kind":"arxiv","id":"1801.04803","version":1},"attestation_state":"computed","paper":{"title":"New LMRD bounds for constant dimension codes and improved constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Daniel Heinlein","submitted_at":"2018-01-15T13:55:19Z","abstract_excerpt":"We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.04803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-15T13:55:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5ca3cf565f3837b9202b1428f47dd7461cc3f3d05708375568cfc5165d150545","abstract_canon_sha256":"6132015bbe1b65348db9d6b63ca9d2dc35af161424bb635f559b2337cab8e878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.196055Z","signature_b64":"3BQONOmw6QIWFFPbeiUi5Hawx3leaiWIagxcOHiZ0WrBW/fAKrFQYnHD0Ye6SJqNmQfyXrSm0P1CoToHRsiKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aedced3a2bfbf845dd004adde2577b1f0d15d8deb45087420cbe0e545304a89","last_reissued_at":"2026-05-18T00:26:03.195374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.195374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New LMRD bounds for constant dimension codes and improved constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Daniel Heinlein","submitted_at":"2018-01-15T13:55:19Z","abstract_excerpt":"We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04803","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.04803","created_at":"2026-05-18T00:26:03.195496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04803v1","created_at":"2026-05-18T00:26:03.195496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04803","created_at":"2026-05-18T00:26:03.195496+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLW45U5CX67Y","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLW45U5CX67YIXOQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLW45U5C","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH","json":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH.json","graph_json":"https://pith.science/api/pith-number/DLW45U5CX67YIXOQASW54JLXWH/graph.json","events_json":"https://pith.science/api/pith-number/DLW45U5CX67YIXOQASW54JLXWH/events.json","paper":"https://pith.science/paper/DLW45U5C"},"agent_actions":{"view_html":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH","download_json":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH.json","view_paper":"https://pith.science/paper/DLW45U5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04803&json=true","fetch_graph":"https://pith.science/api/pith-number/DLW45U5CX67YIXOQASW54JLXWH/graph.json","fetch_events":"https://pith.science/api/pith-number/DLW45U5CX67YIXOQASW54JLXWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH/action/storage_attestation","attest_author":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH/action/author_attestation","sign_citation":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH/action/citation_signature","submit_replication":"https://pith.science/pith/DLW45U5CX67YIXOQASW54JLXWH/action/replication_record"}},"created_at":"2026-05-18T00:26:03.195496+00:00","updated_at":"2026-05-18T00:26:03.195496+00:00"}