{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C3SQTIDNXKYYYPXL7TFBHPGAG4","short_pith_number":"pith:C3SQTIDN","schema_version":"1.0","canonical_sha256":"16e509a06dbab18c3eebfcca13bcc03729df0bc48752dc817992db0fe82682bc","source":{"kind":"arxiv","id":"1503.05456","version":3},"attestation_state":"computed","paper":{"title":"Minimum distance of Symplectic Grassmann codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Ilaria Cardinali, Luca Giuzzi","submitted_at":"2015-03-17T10:01:08Z","abstract_excerpt":"We introduce the Symplectic Grassmann codes as projective codes defined by symplectic Grassmannians, in analogy with the orthogonal Grassmann codes introduced in [4]. Note that the Lagrangian-Grassmannian codes are a special class of Symplectic Grassmann codes. We describe the weight enumerator of the Lagrangian--Grassmannian codes of rank $2$ and $3$ and we determine the minimum distance of the line Symplectic Grassmann 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":"1503.05456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-17T10:01:08Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"42025b7a7e18cf489c6886b2ccbe4f02ce4b3025c683518d3965d2fb00547cea","abstract_canon_sha256":"c3f4b1bcd069ff7c6537d3a3bfaaba5b1de1671cda05db24e81db0d994826379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:18.799857Z","signature_b64":"Z7AD2JQVwqmekeiblZECEN9ldl7Jpz4X0q3Fq/MZ0cI5oc7maZrXvHz6iL/aNnijiJA1sYxXn+xhTlyj6zwyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16e509a06dbab18c3eebfcca13bcc03729df0bc48752dc817992db0fe82682bc","last_reissued_at":"2026-05-18T01:31:18.799156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:18.799156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum distance of Symplectic Grassmann codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Ilaria Cardinali, Luca Giuzzi","submitted_at":"2015-03-17T10:01:08Z","abstract_excerpt":"We introduce the Symplectic Grassmann codes as projective codes defined by symplectic Grassmannians, in analogy with the orthogonal Grassmann codes introduced in [4]. Note that the Lagrangian-Grassmannian codes are a special class of Symplectic Grassmann codes. We describe the weight enumerator of the Lagrangian--Grassmannian codes of rank $2$ and $3$ and we determine the minimum distance of the line Symplectic Grassmann codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05456","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":""},"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":"1503.05456","created_at":"2026-05-18T01:31:18.799259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05456v3","created_at":"2026-05-18T01:31:18.799259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05456","created_at":"2026-05-18T01:31:18.799259+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3SQTIDNXKYY","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3SQTIDNXKYYYPXL","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3SQTIDN","created_at":"2026-05-18T12:29:14.074870+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/C3SQTIDNXKYYYPXL7TFBHPGAG4","json":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4.json","graph_json":"https://pith.science/api/pith-number/C3SQTIDNXKYYYPXL7TFBHPGAG4/graph.json","events_json":"https://pith.science/api/pith-number/C3SQTIDNXKYYYPXL7TFBHPGAG4/events.json","paper":"https://pith.science/paper/C3SQTIDN"},"agent_actions":{"view_html":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4","download_json":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4.json","view_paper":"https://pith.science/paper/C3SQTIDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05456&json=true","fetch_graph":"https://pith.science/api/pith-number/C3SQTIDNXKYYYPXL7TFBHPGAG4/graph.json","fetch_events":"https://pith.science/api/pith-number/C3SQTIDNXKYYYPXL7TFBHPGAG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4/action/storage_attestation","attest_author":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4/action/author_attestation","sign_citation":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4/action/citation_signature","submit_replication":"https://pith.science/pith/C3SQTIDNXKYYYPXL7TFBHPGAG4/action/replication_record"}},"created_at":"2026-05-18T01:31:18.799259+00:00","updated_at":"2026-05-18T01:31:18.799259+00:00"}