{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4QGJJAYWILENE3MVYRGP6ZUCSX","short_pith_number":"pith:4QGJJAYW","schema_version":"1.0","canonical_sha256":"e40c94831642c8d26d95c44cff668295f6413c293ca99fce6988910afa57ea31","source":{"kind":"arxiv","id":"1802.03359","version":1},"attestation_state":"computed","paper":{"title":"Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchm\\'aros curve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Matteo Bonini","submitted_at":"2018-02-09T17:22:08Z","abstract_excerpt":"In this paper we investigate the number of minimum weight codewords of some dual Algebraic-Geometric codes associated with the Giulietti-Korchm\\'aros maximal curve, by computing the maximal number of intersections between the Giulietti-Korchm\\'aros curve and lines, plane conics and plane cubics."},"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":"1802.03359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-09T17:22:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b9a89b9f479400359787c114c096e86fc67a53abd6dfd0ab21b9ca506edda2c6","abstract_canon_sha256":"6d1a02139deb6e63314864e171a29f827c68c9037b710204d89402a36613c83a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:57.829111Z","signature_b64":"vuYA+i2ImMVWduL/n4Y2X0Frxzh3yb34HXitt1umiZSdB56YE+86E/D8RHNZuxVq3O9WYK0RB/CHGD6032efCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e40c94831642c8d26d95c44cff668295f6413c293ca99fce6988910afa57ea31","last_reissued_at":"2026-05-18T00:23:57.828430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:57.828430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchm\\'aros curve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Matteo Bonini","submitted_at":"2018-02-09T17:22:08Z","abstract_excerpt":"In this paper we investigate the number of minimum weight codewords of some dual Algebraic-Geometric codes associated with the Giulietti-Korchm\\'aros maximal curve, by computing the maximal number of intersections between the Giulietti-Korchm\\'aros curve and lines, plane conics and plane cubics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03359","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":"1802.03359","created_at":"2026-05-18T00:23:57.828539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03359v1","created_at":"2026-05-18T00:23:57.828539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03359","created_at":"2026-05-18T00:23:57.828539+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QGJJAYWILEN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QGJJAYWILENE3MV","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QGJJAYW","created_at":"2026-05-18T12:32:05.422762+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/4QGJJAYWILENE3MVYRGP6ZUCSX","json":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX.json","graph_json":"https://pith.science/api/pith-number/4QGJJAYWILENE3MVYRGP6ZUCSX/graph.json","events_json":"https://pith.science/api/pith-number/4QGJJAYWILENE3MVYRGP6ZUCSX/events.json","paper":"https://pith.science/paper/4QGJJAYW"},"agent_actions":{"view_html":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX","download_json":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX.json","view_paper":"https://pith.science/paper/4QGJJAYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03359&json=true","fetch_graph":"https://pith.science/api/pith-number/4QGJJAYWILENE3MVYRGP6ZUCSX/graph.json","fetch_events":"https://pith.science/api/pith-number/4QGJJAYWILENE3MVYRGP6ZUCSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX/action/storage_attestation","attest_author":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX/action/author_attestation","sign_citation":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX/action/citation_signature","submit_replication":"https://pith.science/pith/4QGJJAYWILENE3MVYRGP6ZUCSX/action/replication_record"}},"created_at":"2026-05-18T00:23:57.828539+00:00","updated_at":"2026-05-18T00:23:57.828539+00:00"}