{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:66FFU5BSCFACO4QIOOEV6DLVT4","short_pith_number":"pith:66FFU5BS","schema_version":"1.0","canonical_sha256":"f78a5a7432114027720873895f0d759f39b8fe71a20a1e0d6bb284c6c88ea605","source":{"kind":"arxiv","id":"1404.0469","version":3},"attestation_state":"computed","paper":{"title":"Tables, bounds and graphics of sizes of complete arcs in the plane $\\mathrm{PG}(2,q)$ for all $q\\le321007$ and sporadic $q$ in $[323761\\ldots430007]$ obtained by an algorithm with fixed order of points (FOP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander A. Davydov, Alexey A. Kreshchuk, Daniele Bartoli, Fernanda Pambianco, Giorgio Faina, Stefano Marcugini","submitted_at":"2014-04-02T06:26:19Z","abstract_excerpt":"In the previous works of the authors, a step-by-step algorithm FOP which uses any fixed order of points in the projective plane $\\mathrm{PG}(2,q)$ is proposed to construct small complete arcs. In each step, the algorithm adds to a current arc the first point in the fixed order not lying on the bisecants of the arc. The algorithm is based on the intuitive postulate that $\\mathrm{PG}(2,q)$ contains a sufficient number of relatively small complete arcs. Also, in the previous papers, it is shown that the type of order on the points of $\\mathrm{PG}(2,q)$ is not relevant. A complete lexiarc in $\\mat"},"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":"1404.0469","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-02T06:26:19Z","cross_cats_sorted":[],"title_canon_sha256":"8c8fdf104092c17a1f3c7ce38517d982e5d573fcc15fea2c21646e64267cb60c","abstract_canon_sha256":"cb89dd31304d765621fc5f28e1ce09333f61f87104e611e6dfa17644f498bc9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.769438Z","signature_b64":"FnPIxYNW+h3MQDHp1x0ChcjZxfTbnDWWicuUxTa0t8pOd6WDF/80b4Fl+UhqNOLNZvdiZKG3mIgiktFvUCrrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78a5a7432114027720873895f0d759f39b8fe71a20a1e0d6bb284c6c88ea605","last_reissued_at":"2026-05-18T00:26:47.768746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.768746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tables, bounds and graphics of sizes of complete arcs in the plane $\\mathrm{PG}(2,q)$ for all $q\\le321007$ and sporadic $q$ in $[323761\\ldots430007]$ obtained by an algorithm with fixed order of points (FOP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander A. Davydov, Alexey A. Kreshchuk, Daniele Bartoli, Fernanda Pambianco, Giorgio Faina, Stefano Marcugini","submitted_at":"2014-04-02T06:26:19Z","abstract_excerpt":"In the previous works of the authors, a step-by-step algorithm FOP which uses any fixed order of points in the projective plane $\\mathrm{PG}(2,q)$ is proposed to construct small complete arcs. In each step, the algorithm adds to a current arc the first point in the fixed order not lying on the bisecants of the arc. The algorithm is based on the intuitive postulate that $\\mathrm{PG}(2,q)$ contains a sufficient number of relatively small complete arcs. Also, in the previous papers, it is shown that the type of order on the points of $\\mathrm{PG}(2,q)$ is not relevant. A complete lexiarc in $\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0469","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":"1404.0469","created_at":"2026-05-18T00:26:47.768868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0469v3","created_at":"2026-05-18T00:26:47.768868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0469","created_at":"2026-05-18T00:26:47.768868+00:00"},{"alias_kind":"pith_short_12","alias_value":"66FFU5BSCFAC","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"66FFU5BSCFACO4QI","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"66FFU5BS","created_at":"2026-05-18T12:28:16.859392+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/66FFU5BSCFACO4QIOOEV6DLVT4","json":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4.json","graph_json":"https://pith.science/api/pith-number/66FFU5BSCFACO4QIOOEV6DLVT4/graph.json","events_json":"https://pith.science/api/pith-number/66FFU5BSCFACO4QIOOEV6DLVT4/events.json","paper":"https://pith.science/paper/66FFU5BS"},"agent_actions":{"view_html":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4","download_json":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4.json","view_paper":"https://pith.science/paper/66FFU5BS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0469&json=true","fetch_graph":"https://pith.science/api/pith-number/66FFU5BSCFACO4QIOOEV6DLVT4/graph.json","fetch_events":"https://pith.science/api/pith-number/66FFU5BSCFACO4QIOOEV6DLVT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4/action/storage_attestation","attest_author":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4/action/author_attestation","sign_citation":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4/action/citation_signature","submit_replication":"https://pith.science/pith/66FFU5BSCFACO4QIOOEV6DLVT4/action/replication_record"}},"created_at":"2026-05-18T00:26:47.768868+00:00","updated_at":"2026-05-18T00:26:47.768868+00:00"}