{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OYZUUMQB6SSMWMHJ4XNRES62DV","short_pith_number":"pith:OYZUUMQB","schema_version":"1.0","canonical_sha256":"76334a3201f4a4cb30e9e5db124bda1d5a6b9d77a58b41829bbd168db2e191dd","source":{"kind":"arxiv","id":"1810.03878","version":1},"attestation_state":"computed","paper":{"title":"Linear Codes Associated to Skew-symmetric Determinantal Varieties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Beelen, Prasant Singh","submitted_at":"2018-10-09T09:33:42Z","abstract_excerpt":"In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given."},"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":"1810.03878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-09T09:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"98b946710ae56f1b968a55fff9ab1c90f8feed5e593b02d786981bb92b41b3e8","abstract_canon_sha256":"68964f004f9421939219ff582621404c2e9d68388449d66f0100d81059e7efdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.342341Z","signature_b64":"/a8kwxtfAqq1MsS3IZU+WJy4kdYHSODI93c2W0q73lKz3tT4r5Nc92GZiG2wNQVAFmWf5ppQLKaYMuQ1CXK5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76334a3201f4a4cb30e9e5db124bda1d5a6b9d77a58b41829bbd168db2e191dd","last_reissued_at":"2026-05-18T00:03:44.341893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.341893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Codes Associated to Skew-symmetric Determinantal Varieties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Beelen, Prasant Singh","submitted_at":"2018-10-09T09:33:42Z","abstract_excerpt":"In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03878","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":"1810.03878","created_at":"2026-05-18T00:03:44.341962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03878v1","created_at":"2026-05-18T00:03:44.341962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03878","created_at":"2026-05-18T00:03:44.341962+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYZUUMQB6SSM","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYZUUMQB6SSMWMHJ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYZUUMQB","created_at":"2026-05-18T12:32:43.782077+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/OYZUUMQB6SSMWMHJ4XNRES62DV","json":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV.json","graph_json":"https://pith.science/api/pith-number/OYZUUMQB6SSMWMHJ4XNRES62DV/graph.json","events_json":"https://pith.science/api/pith-number/OYZUUMQB6SSMWMHJ4XNRES62DV/events.json","paper":"https://pith.science/paper/OYZUUMQB"},"agent_actions":{"view_html":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV","download_json":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV.json","view_paper":"https://pith.science/paper/OYZUUMQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03878&json=true","fetch_graph":"https://pith.science/api/pith-number/OYZUUMQB6SSMWMHJ4XNRES62DV/graph.json","fetch_events":"https://pith.science/api/pith-number/OYZUUMQB6SSMWMHJ4XNRES62DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV/action/storage_attestation","attest_author":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV/action/author_attestation","sign_citation":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV/action/citation_signature","submit_replication":"https://pith.science/pith/OYZUUMQB6SSMWMHJ4XNRES62DV/action/replication_record"}},"created_at":"2026-05-18T00:03:44.341962+00:00","updated_at":"2026-05-18T00:03:44.341962+00:00"}