{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KJDVAPWTJQWN3PEVYEEHQOWG4B","short_pith_number":"pith:KJDVAPWT","schema_version":"1.0","canonical_sha256":"5247503ed34c2cddbc95c108783ac6e07764db1ec5b8c0e681fbb30e36236ea6","source":{"kind":"arxiv","id":"1601.00443","version":1},"attestation_state":"computed","paper":{"title":"On the dual code of points and generators on the Hermitian variety $\\mathcal{H}(2n+1,q^2)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maarten De Boeck, Peter Vandendriessche","submitted_at":"2016-01-04T10:36:24Z","abstract_excerpt":"We study the dual linear code of points and generators on a non-singular Hermitian variety $\\mathcal{H}(2n+1,q^2)$. We improve the earlier results for $n=2$, we solve the minimum distance problem for general $n$, we classify the $n$ smallest types of code words and we characterize the small weight code words as being a linear combination of these $n$ types."},"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":"1601.00443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-04T10:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"1b64357f66d468705b06816c2a3b5337289a26636daae636701c818cf78018d6","abstract_canon_sha256":"24b5f7ee8b71dd3c22f2b30567242c6fd59f12117e6fa616d493da888d2db87d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:27.429352Z","signature_b64":"UUHRjOOowOCXs2ohGHL30SrrUonSpbSM2FRaNGkZoZ8eD0QrvUuc/uLpAKSR7yoYqFfpkmOp/F048MsvN7AWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5247503ed34c2cddbc95c108783ac6e07764db1ec5b8c0e681fbb30e36236ea6","last_reissued_at":"2026-05-18T01:23:27.428694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:27.428694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the dual code of points and generators on the Hermitian variety $\\mathcal{H}(2n+1,q^2)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maarten De Boeck, Peter Vandendriessche","submitted_at":"2016-01-04T10:36:24Z","abstract_excerpt":"We study the dual linear code of points and generators on a non-singular Hermitian variety $\\mathcal{H}(2n+1,q^2)$. We improve the earlier results for $n=2$, we solve the minimum distance problem for general $n$, we classify the $n$ smallest types of code words and we characterize the small weight code words as being a linear combination of these $n$ types."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00443","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":"1601.00443","created_at":"2026-05-18T01:23:27.428838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00443v1","created_at":"2026-05-18T01:23:27.428838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00443","created_at":"2026-05-18T01:23:27.428838+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJDVAPWTJQWN","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJDVAPWTJQWN3PEV","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJDVAPWT","created_at":"2026-05-18T12:30:25.849896+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/KJDVAPWTJQWN3PEVYEEHQOWG4B","json":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B.json","graph_json":"https://pith.science/api/pith-number/KJDVAPWTJQWN3PEVYEEHQOWG4B/graph.json","events_json":"https://pith.science/api/pith-number/KJDVAPWTJQWN3PEVYEEHQOWG4B/events.json","paper":"https://pith.science/paper/KJDVAPWT"},"agent_actions":{"view_html":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B","download_json":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B.json","view_paper":"https://pith.science/paper/KJDVAPWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00443&json=true","fetch_graph":"https://pith.science/api/pith-number/KJDVAPWTJQWN3PEVYEEHQOWG4B/graph.json","fetch_events":"https://pith.science/api/pith-number/KJDVAPWTJQWN3PEVYEEHQOWG4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B/action/storage_attestation","attest_author":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B/action/author_attestation","sign_citation":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B/action/citation_signature","submit_replication":"https://pith.science/pith/KJDVAPWTJQWN3PEVYEEHQOWG4B/action/replication_record"}},"created_at":"2026-05-18T01:23:27.428838+00:00","updated_at":"2026-05-18T01:23:27.428838+00:00"}