{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3UTE5SKZA3BARQ2UYNUQYRG3YG","short_pith_number":"pith:3UTE5SKZ","schema_version":"1.0","canonical_sha256":"dd264ec95906c208c354c3690c44dbc19dff2385da1a9eccfb325c1e08daceac","source":{"kind":"arxiv","id":"1706.01941","version":1},"attestation_state":"computed","paper":{"title":"Upper bounds on the smallest size of a complete cap in $\\mathrm{PG}(N,q)$, $N\\ge3$, under a certain probabilistic conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alexander A. Davydov, Fernanda Pambianco, Giorgio Faina, Stefano Marcugini","submitted_at":"2017-06-06T19:42:19Z","abstract_excerpt":"In the projective space $\\mathrm{PG}(N,q)$ over the Galois field of order $q$, $N\\ge3$, an iterative step-by-step construction of complete caps by adding a new point on every step is considered. It is proved that uncovered points are evenly placed on the space. A natural conjecture on an estimate of the number of new covered points on every step is done. For a part of the iterative process, this estimate is proved rigorously. Under the conjecture mentioned, new upper bounds on the smallest size $t_{2}(N,q)$ of a complete cap in $\\mathrm{PG}(N,q)$ are obtained, in particular, \\begin{align*} t_{"},"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":"1706.01941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-06T19:42:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f92ffadcf84ae95edce5829dd7366c07a70d45984d43549c8579af7e2a98fbd0","abstract_canon_sha256":"755b488ec62fb7b2f96468916b98ddde7a0ec39fc2fea0b03e1336e55a169864"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:50.724708Z","signature_b64":"hSSg4en9o2lxRSZam7/4MwfNxCvveydeABZ3johYtThfAI59T8fV4//53ICC/lYyUXaOdZ3qEsKPGbqTS1ioAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd264ec95906c208c354c3690c44dbc19dff2385da1a9eccfb325c1e08daceac","last_reissued_at":"2026-05-18T00:42:50.724016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:50.724016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds on the smallest size of a complete cap in $\\mathrm{PG}(N,q)$, $N\\ge3$, under a certain probabilistic conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alexander A. Davydov, Fernanda Pambianco, Giorgio Faina, Stefano Marcugini","submitted_at":"2017-06-06T19:42:19Z","abstract_excerpt":"In the projective space $\\mathrm{PG}(N,q)$ over the Galois field of order $q$, $N\\ge3$, an iterative step-by-step construction of complete caps by adding a new point on every step is considered. It is proved that uncovered points are evenly placed on the space. A natural conjecture on an estimate of the number of new covered points on every step is done. For a part of the iterative process, this estimate is proved rigorously. Under the conjecture mentioned, new upper bounds on the smallest size $t_{2}(N,q)$ of a complete cap in $\\mathrm{PG}(N,q)$ are obtained, in particular, \\begin{align*} t_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01941","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":"1706.01941","created_at":"2026-05-18T00:42:50.724140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01941v1","created_at":"2026-05-18T00:42:50.724140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01941","created_at":"2026-05-18T00:42:50.724140+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UTE5SKZA3BA","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UTE5SKZA3BARQ2U","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UTE5SKZ","created_at":"2026-05-18T12:30:58.224056+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/3UTE5SKZA3BARQ2UYNUQYRG3YG","json":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG.json","graph_json":"https://pith.science/api/pith-number/3UTE5SKZA3BARQ2UYNUQYRG3YG/graph.json","events_json":"https://pith.science/api/pith-number/3UTE5SKZA3BARQ2UYNUQYRG3YG/events.json","paper":"https://pith.science/paper/3UTE5SKZ"},"agent_actions":{"view_html":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG","download_json":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG.json","view_paper":"https://pith.science/paper/3UTE5SKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01941&json=true","fetch_graph":"https://pith.science/api/pith-number/3UTE5SKZA3BARQ2UYNUQYRG3YG/graph.json","fetch_events":"https://pith.science/api/pith-number/3UTE5SKZA3BARQ2UYNUQYRG3YG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/action/storage_attestation","attest_author":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/action/author_attestation","sign_citation":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/action/citation_signature","submit_replication":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/action/replication_record"}},"created_at":"2026-05-18T00:42:50.724140+00:00","updated_at":"2026-05-18T00:42:50.724140+00:00"}