{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VHOHIMQ4MFBQ2ILPM3FDVHAAZA","short_pith_number":"pith:VHOHIMQ4","schema_version":"1.0","canonical_sha256":"a9dc74321c61430d216f66ca3a9c00c8362423c20c387aa74e626528d8cedd39","source":{"kind":"arxiv","id":"1308.6231","version":4},"attestation_state":"computed","paper":{"title":"Equidistant Codes in the Grassmannian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Netanel Raviv, Tuvi Etzion","submitted_at":"2013-08-28T17:50:16Z","abstract_excerpt":"Equidistant codes over vector spaces are considered. For $k$-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest non-sunflower codes. A novel construction, based on the Pl\\\"{u}cker embedding, for 1-intersecting codes of $k$-dimensional subspaces over $\\F_q^n$, $n \\geq \\binom{k+1}{2}$, where the code size is $\\frac{q^{k+1}-1}{q-1}$ is presented. Finally, we present a related construction which generates equidistant constant rank codes with matrices of size $n \\times \\binom{"},"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":"1308.6231","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-28T17:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"7d17972a0bec1ba41ab87e567a1816b59a3650b4373d8eef6451a7b29bbfa5eb","abstract_canon_sha256":"983c910329232af5b7d86fcfd1d061c4902f80c461d3f1d98d5940ef9283f2ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:01.551456Z","signature_b64":"4w9ydldKY51hp3GTWQxUVnjwNbji/72beVVryBTosrBrHT9rz/hC9mD/aX3CLxc44rHcemO5TiBUvYZ34c9TCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9dc74321c61430d216f66ca3a9c00c8362423c20c387aa74e626528d8cedd39","last_reissued_at":"2026-05-18T02:17:01.550756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:01.550756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equidistant Codes in the Grassmannian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Netanel Raviv, Tuvi Etzion","submitted_at":"2013-08-28T17:50:16Z","abstract_excerpt":"Equidistant codes over vector spaces are considered. For $k$-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest non-sunflower codes. A novel construction, based on the Pl\\\"{u}cker embedding, for 1-intersecting codes of $k$-dimensional subspaces over $\\F_q^n$, $n \\geq \\binom{k+1}{2}$, where the code size is $\\frac{q^{k+1}-1}{q-1}$ is presented. Finally, we present a related construction which generates equidistant constant rank codes with matrices of size $n \\times \\binom{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6231","kind":"arxiv","version":4},"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":"1308.6231","created_at":"2026-05-18T02:17:01.550863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6231v4","created_at":"2026-05-18T02:17:01.550863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6231","created_at":"2026-05-18T02:17:01.550863+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHOHIMQ4MFBQ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHOHIMQ4MFBQ2ILP","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHOHIMQ4","created_at":"2026-05-18T12:28:04.890932+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/VHOHIMQ4MFBQ2ILPM3FDVHAAZA","json":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA.json","graph_json":"https://pith.science/api/pith-number/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/graph.json","events_json":"https://pith.science/api/pith-number/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/events.json","paper":"https://pith.science/paper/VHOHIMQ4"},"agent_actions":{"view_html":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA","download_json":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA.json","view_paper":"https://pith.science/paper/VHOHIMQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6231&json=true","fetch_graph":"https://pith.science/api/pith-number/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/graph.json","fetch_events":"https://pith.science/api/pith-number/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/action/storage_attestation","attest_author":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/action/author_attestation","sign_citation":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/action/citation_signature","submit_replication":"https://pith.science/pith/VHOHIMQ4MFBQ2ILPM3FDVHAAZA/action/replication_record"}},"created_at":"2026-05-18T02:17:01.550863+00:00","updated_at":"2026-05-18T02:17:01.550863+00:00"}