{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OHGVKN36P74M765SSB6E3OHUHS","short_pith_number":"pith:OHGVKN36","schema_version":"1.0","canonical_sha256":"71cd55377e7ff8cffbb2907c4db8f43cb6d6a1931ea48628819a3a55cf174a77","source":{"kind":"arxiv","id":"1610.09656","version":1},"attestation_state":"computed","paper":{"title":"Tables, bounds and graphics of the smallest known sizes of complete caps in the spaces $\\mathrm{PG}(3,q)$ and $\\mathrm{PG}(4,q)$","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, Stefano Marcugini","submitted_at":"2016-10-30T14:48:37Z","abstract_excerpt":"In this paper we present and analyze computational results concerning small complete caps in the projective spaces $\\mathrm{PG}(N,q)$ of dimension $N=3$ and $N=4$ over the finite field of order $q$. The results have been obtained using randomized greedy algorithms and the algorithm with fixed order of points (FOP). The computations have been done in relatively wide regions of $q$ values; such wide regions are not considered in literature for $N=3,4$. The new complete caps are the smallest known. Basing on them, we obtained new upper bounds on $t_2(N,q)$, the minimum size of a complete cap in $"},"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":"1610.09656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-30T14:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"dd10b30bc9a7751cefb5f92afe0bae43451e48a78b17a15dc8d842c108fe8abb","abstract_canon_sha256":"5ac9444831d891ffa5fa655125649d9072ad381fa344f36271210f365f61c352"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:51.364253Z","signature_b64":"W8GqiUnH+uYCImvvCIXQUVnS5fuuhmqlWrFrEGz530yUlZ1ZSFELnw0YAvINBm4zwvooveSP0gSxYKvwmBuTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71cd55377e7ff8cffbb2907c4db8f43cb6d6a1931ea48628819a3a55cf174a77","last_reissued_at":"2026-05-18T01:00:51.363617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:51.363617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tables, bounds and graphics of the smallest known sizes of complete caps in the spaces $\\mathrm{PG}(3,q)$ and $\\mathrm{PG}(4,q)$","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, Stefano Marcugini","submitted_at":"2016-10-30T14:48:37Z","abstract_excerpt":"In this paper we present and analyze computational results concerning small complete caps in the projective spaces $\\mathrm{PG}(N,q)$ of dimension $N=3$ and $N=4$ over the finite field of order $q$. The results have been obtained using randomized greedy algorithms and the algorithm with fixed order of points (FOP). The computations have been done in relatively wide regions of $q$ values; such wide regions are not considered in literature for $N=3,4$. The new complete caps are the smallest known. Basing on them, we obtained new upper bounds on $t_2(N,q)$, the minimum size of a complete cap in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09656","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":"1610.09656","created_at":"2026-05-18T01:00:51.363712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09656v1","created_at":"2026-05-18T01:00:51.363712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09656","created_at":"2026-05-18T01:00:51.363712+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHGVKN36P74M","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHGVKN36P74M765S","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHGVKN36","created_at":"2026-05-18T12:30:36.002864+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/OHGVKN36P74M765SSB6E3OHUHS","json":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS.json","graph_json":"https://pith.science/api/pith-number/OHGVKN36P74M765SSB6E3OHUHS/graph.json","events_json":"https://pith.science/api/pith-number/OHGVKN36P74M765SSB6E3OHUHS/events.json","paper":"https://pith.science/paper/OHGVKN36"},"agent_actions":{"view_html":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS","download_json":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS.json","view_paper":"https://pith.science/paper/OHGVKN36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09656&json=true","fetch_graph":"https://pith.science/api/pith-number/OHGVKN36P74M765SSB6E3OHUHS/graph.json","fetch_events":"https://pith.science/api/pith-number/OHGVKN36P74M765SSB6E3OHUHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS/action/storage_attestation","attest_author":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS/action/author_attestation","sign_citation":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS/action/citation_signature","submit_replication":"https://pith.science/pith/OHGVKN36P74M765SSB6E3OHUHS/action/replication_record"}},"created_at":"2026-05-18T01:00:51.363712+00:00","updated_at":"2026-05-18T01:00:51.363712+00:00"}