{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:JHSKCNUCFUOKNSUWSTZWLF25LO","short_pith_number":"pith:JHSKCNUC","schema_version":"1.0","canonical_sha256":"49e4a136822d1ca6ca9694f365975d5b9c9061c0d4886f33e8a4d1b8c4790890","source":{"kind":"arxiv","id":"cs/0512024","version":1},"attestation_state":"computed","paper":{"title":"A bound on Grassmannian codes","license":"","headline":"","cross_cats":["math.IT","math.MG"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Dmitry Nogin","submitted_at":"2005-12-06T04:30:57Z","abstract_excerpt":"We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values."},"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":"cs/0512024","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-12-06T04:30:57Z","cross_cats_sorted":["math.IT","math.MG"],"title_canon_sha256":"bd21e3389e960203bf5183be5942cda867735a72e90dee8c42a5087cf15dc560","abstract_canon_sha256":"b671bfb6f570adfc56e97a5b850f03f36eb8492f676ae0ca767d9588f373323a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:22.328484Z","signature_b64":"KINm4J8bDMb7iCbSAWSLBaA+4H0sw7yO12bLfYqgWlRhFTZnutJepQDYK/RcKhYJvyADWcIdEGNXf0/U1nOXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49e4a136822d1ca6ca9694f365975d5b9c9061c0d4886f33e8a4d1b8c4790890","last_reissued_at":"2026-05-17T23:46:22.327813Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:22.327813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bound on Grassmannian codes","license":"","headline":"","cross_cats":["math.IT","math.MG"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Dmitry Nogin","submitted_at":"2005-12-06T04:30:57Z","abstract_excerpt":"We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512024","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":"cs/0512024","created_at":"2026-05-17T23:46:22.327910+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0512024v1","created_at":"2026-05-17T23:46:22.327910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512024","created_at":"2026-05-17T23:46:22.327910+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHSKCNUCFUOK","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHSKCNUCFUOKNSUW","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHSKCNUC","created_at":"2026-05-18T12:25:53.335082+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/JHSKCNUCFUOKNSUWSTZWLF25LO","json":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO.json","graph_json":"https://pith.science/api/pith-number/JHSKCNUCFUOKNSUWSTZWLF25LO/graph.json","events_json":"https://pith.science/api/pith-number/JHSKCNUCFUOKNSUWSTZWLF25LO/events.json","paper":"https://pith.science/paper/JHSKCNUC"},"agent_actions":{"view_html":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO","download_json":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO.json","view_paper":"https://pith.science/paper/JHSKCNUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0512024&json=true","fetch_graph":"https://pith.science/api/pith-number/JHSKCNUCFUOKNSUWSTZWLF25LO/graph.json","fetch_events":"https://pith.science/api/pith-number/JHSKCNUCFUOKNSUWSTZWLF25LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO/action/storage_attestation","attest_author":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO/action/author_attestation","sign_citation":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO/action/citation_signature","submit_replication":"https://pith.science/pith/JHSKCNUCFUOKNSUWSTZWLF25LO/action/replication_record"}},"created_at":"2026-05-17T23:46:22.327910+00:00","updated_at":"2026-05-17T23:46:22.327910+00:00"}