{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7AMNMMRTTQ7WIZDQVYLSEXK4ME","short_pith_number":"pith:7AMNMMRT","schema_version":"1.0","canonical_sha256":"f818d632339c3f646470ae17225d5c611a1ce0061be348a4a02ce78315001fe5","source":{"kind":"arxiv","id":"1711.10478","version":1},"attestation_state":"computed","paper":{"title":"Linear codes from Denniston maximal arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Maria Montanucci, Massimo Giulietti","submitted_at":"2017-11-28T09:29:42Z","abstract_excerpt":"In this paper we construct functional codes from Denniston maximal arcs. For $q=2^{4n+2}$ we obtain linear codes with parameters $[(\\sqrt{q}-1)(q+1),5,d]_q$ where $\\lim_{q \\to +\\infty} d=(\\sqrt{q}-1)q-3\\sqrt{q}$. We also find for $q=16,32$ a number of linear codes which appear to have larger minimum distance with respect to the known codes with same length and dimension."},"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":"1711.10478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-28T09:29:42Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"a79d8bd13e11cbd71e7f5080fd0d7cca8a6cf64ed6c927734e2dcc832cab3928","abstract_canon_sha256":"eb75adec3df62dd43b29ff6f278b649746521722ffe38ec678a24e131df2f0f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:21.740474Z","signature_b64":"ydlEe6hplKoOJnoUAQb9ATlDRBxw252wboQCfWbO3pibu8kLjsqkOZxU3g9LKsq9SOw4KuXRie55ShBkuY1KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f818d632339c3f646470ae17225d5c611a1ce0061be348a4a02ce78315001fe5","last_reissued_at":"2026-05-18T00:29:21.739960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:21.739960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear codes from Denniston maximal arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Maria Montanucci, Massimo Giulietti","submitted_at":"2017-11-28T09:29:42Z","abstract_excerpt":"In this paper we construct functional codes from Denniston maximal arcs. For $q=2^{4n+2}$ we obtain linear codes with parameters $[(\\sqrt{q}-1)(q+1),5,d]_q$ where $\\lim_{q \\to +\\infty} d=(\\sqrt{q}-1)q-3\\sqrt{q}$. We also find for $q=16,32$ a number of linear codes which appear to have larger minimum distance with respect to the known codes with same length and dimension."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10478","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":"1711.10478","created_at":"2026-05-18T00:29:21.740033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10478v1","created_at":"2026-05-18T00:29:21.740033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10478","created_at":"2026-05-18T00:29:21.740033+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AMNMMRTTQ7W","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AMNMMRTTQ7WIZDQ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AMNMMRT","created_at":"2026-05-18T12:31:03.183658+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/7AMNMMRTTQ7WIZDQVYLSEXK4ME","json":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME.json","graph_json":"https://pith.science/api/pith-number/7AMNMMRTTQ7WIZDQVYLSEXK4ME/graph.json","events_json":"https://pith.science/api/pith-number/7AMNMMRTTQ7WIZDQVYLSEXK4ME/events.json","paper":"https://pith.science/paper/7AMNMMRT"},"agent_actions":{"view_html":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME","download_json":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME.json","view_paper":"https://pith.science/paper/7AMNMMRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10478&json=true","fetch_graph":"https://pith.science/api/pith-number/7AMNMMRTTQ7WIZDQVYLSEXK4ME/graph.json","fetch_events":"https://pith.science/api/pith-number/7AMNMMRTTQ7WIZDQVYLSEXK4ME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME/action/storage_attestation","attest_author":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME/action/author_attestation","sign_citation":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME/action/citation_signature","submit_replication":"https://pith.science/pith/7AMNMMRTTQ7WIZDQVYLSEXK4ME/action/replication_record"}},"created_at":"2026-05-18T00:29:21.740033+00:00","updated_at":"2026-05-18T00:29:21.740033+00:00"}