{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GVOBEEXV57ZXZXUQI7D2UWFAS5","short_pith_number":"pith:GVOBEEXV","schema_version":"1.0","canonical_sha256":"355c1212f5eff37cde9047c7aa58a0976e98f425194ee879e28edf68eab86beb","source":{"kind":"arxiv","id":"1406.5060","version":1},"attestation_state":"computed","paper":{"title":"A probabilistic construction of small complete caps in projective spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Fernanda Pambianco, Stefano Marcugini","submitted_at":"2014-06-03T09:52:37Z","abstract_excerpt":"In this work complete caps in $PG(N,q)$ of size $O(q^{\\frac{N-1}{2}}\\log^{300} q)$ are obtained by probabilistic methods. This gives an upper bound asymptotically very close to the trivial lower bound $\\sqrt{2}q^{\\frac{N-1}{2}}$ and it improves the best known bound in the literature for small complete caps in projective spaces of any dimension. The result obtained in the paper also gives a new upper bound for $l(m,2,q)_4$, that is the minimal length $n$ for which there exists an $[n,n-m, 4]_q2$ covering code with given $m$ and $q$."},"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":"1406.5060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-03T09:52:37Z","cross_cats_sorted":[],"title_canon_sha256":"2c927a377edf187f742c3058554c92c292aaf85cbef6322ceb1b4148fac181ee","abstract_canon_sha256":"90d0690eb10d153c1bbd597a807e0de3356809d4dd08dba8babc239bf357bd33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:21.043935Z","signature_b64":"u9Zwq1IbLtEdnUkdsiEC3TzESTNdYpY5VI8FVLSgK6yuvHStSa61LMYvrhGR5zYfuB4rmCRdtq6jkPW1CKzTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"355c1212f5eff37cde9047c7aa58a0976e98f425194ee879e28edf68eab86beb","last_reissued_at":"2026-05-18T02:49:21.043254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:21.043254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A probabilistic construction of small complete caps in projective spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Fernanda Pambianco, Stefano Marcugini","submitted_at":"2014-06-03T09:52:37Z","abstract_excerpt":"In this work complete caps in $PG(N,q)$ of size $O(q^{\\frac{N-1}{2}}\\log^{300} q)$ are obtained by probabilistic methods. This gives an upper bound asymptotically very close to the trivial lower bound $\\sqrt{2}q^{\\frac{N-1}{2}}$ and it improves the best known bound in the literature for small complete caps in projective spaces of any dimension. The result obtained in the paper also gives a new upper bound for $l(m,2,q)_4$, that is the minimal length $n$ for which there exists an $[n,n-m, 4]_q2$ covering code with given $m$ and $q$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5060","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":"1406.5060","created_at":"2026-05-18T02:49:21.043379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5060v1","created_at":"2026-05-18T02:49:21.043379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5060","created_at":"2026-05-18T02:49:21.043379+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVOBEEXV57ZX","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVOBEEXV57ZXZXUQ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVOBEEXV","created_at":"2026-05-18T12:28:30.664211+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/GVOBEEXV57ZXZXUQI7D2UWFAS5","json":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5.json","graph_json":"https://pith.science/api/pith-number/GVOBEEXV57ZXZXUQI7D2UWFAS5/graph.json","events_json":"https://pith.science/api/pith-number/GVOBEEXV57ZXZXUQI7D2UWFAS5/events.json","paper":"https://pith.science/paper/GVOBEEXV"},"agent_actions":{"view_html":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5","download_json":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5.json","view_paper":"https://pith.science/paper/GVOBEEXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5060&json=true","fetch_graph":"https://pith.science/api/pith-number/GVOBEEXV57ZXZXUQI7D2UWFAS5/graph.json","fetch_events":"https://pith.science/api/pith-number/GVOBEEXV57ZXZXUQI7D2UWFAS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5/action/storage_attestation","attest_author":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5/action/author_attestation","sign_citation":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5/action/citation_signature","submit_replication":"https://pith.science/pith/GVOBEEXV57ZXZXUQI7D2UWFAS5/action/replication_record"}},"created_at":"2026-05-18T02:49:21.043379+00:00","updated_at":"2026-05-18T02:49:21.043379+00:00"}