{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3UTE5SKZA3BARQ2UYNUQYRG3YG","short_pith_number":"pith:3UTE5SKZ","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"},"canonical_sha256":"dd264ec95906c208c354c3690c44dbc19dff2385da1a9eccfb325c1e08daceac","source":{"kind":"arxiv","id":"1706.01941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01941","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01941v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01941","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"3UTE5SKZA3BA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3UTE5SKZA3BARQ2U","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3UTE5SKZ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3UTE5SKZA3BARQ2UYNUQYRG3YG","target":"record","payload":{"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"},"canonical_sha256":"dd264ec95906c208c354c3690c44dbc19dff2385da1a9eccfb325c1e08daceac","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"},"source_kind":"arxiv","source_id":"1706.01941","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epLTu6nvBVrvE4v4fAvUtch7TB5PQNT6ghTQCHBJLWc8LkWEYHskLy86Ga3pz728rYk/III28ViNaeQhkIeUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:14:10.750506Z"},"content_sha256":"d2c4a1c8b9565f0e294578d823d8c0d9175a1103600f13dfa32030b37e701b9e","schema_version":"1.0","event_id":"sha256:d2c4a1c8b9565f0e294578d823d8c0d9175a1103600f13dfa32030b37e701b9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3UTE5SKZA3BARQ2UYNUQYRG3YG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KP/o8flW0M6KSa+eLe3Nrzj30jGGgX1q9C6VNV+bG90a51WxnItXCsBoAcZtw3x7Q5/UVoAhguZQRysztEOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:14:10.750853Z"},"content_sha256":"45e50c42d51e49d65c2bbc2cbcddd2eb8a4bfbac4d62e19bdac0d9e25788089b","schema_version":"1.0","event_id":"sha256:45e50c42d51e49d65c2bbc2cbcddd2eb8a4bfbac4d62e19bdac0d9e25788089b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/bundle.json","state_url":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T09:14:10Z","links":{"resolver":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG","bundle":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/bundle.json","state":"https://pith.science/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UTE5SKZA3BARQ2UYNUQYRG3YG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3UTE5SKZA3BARQ2UYNUQYRG3YG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"755b488ec62fb7b2f96468916b98ddde7a0ec39fc2fea0b03e1336e55a169864","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-06T19:42:19Z","title_canon_sha256":"f92ffadcf84ae95edce5829dd7366c07a70d45984d43549c8579af7e2a98fbd0"},"schema_version":"1.0","source":{"id":"1706.01941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01941","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01941v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01941","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"3UTE5SKZA3BA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3UTE5SKZA3BARQ2U","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3UTE5SKZ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:45e50c42d51e49d65c2bbc2cbcddd2eb8a4bfbac4d62e19bdac0d9e25788089b","target":"graph","created_at":"2026-05-18T00:42:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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_{","authors_text":"Alexander A. Davydov, Fernanda Pambianco, Giorgio Faina, Stefano Marcugini","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-06T19:42:19Z","title":"Upper bounds on the smallest size of a complete cap in $\\mathrm{PG}(N,q)$, $N\\ge3$, under a certain probabilistic conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01941","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d2c4a1c8b9565f0e294578d823d8c0d9175a1103600f13dfa32030b37e701b9e","target":"record","created_at":"2026-05-18T00:42:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"755b488ec62fb7b2f96468916b98ddde7a0ec39fc2fea0b03e1336e55a169864","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-06T19:42:19Z","title_canon_sha256":"f92ffadcf84ae95edce5829dd7366c07a70d45984d43549c8579af7e2a98fbd0"},"schema_version":"1.0","source":{"id":"1706.01941","kind":"arxiv","version":1}},"canonical_sha256":"dd264ec95906c208c354c3690c44dbc19dff2385da1a9eccfb325c1e08daceac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd264ec95906c208c354c3690c44dbc19dff2385da1a9eccfb325c1e08daceac","first_computed_at":"2026-05-18T00:42:50.724016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:50.724016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hSSg4en9o2lxRSZam7/4MwfNxCvveydeABZ3johYtThfAI59T8fV4//53ICC/lYyUXaOdZ3qEsKPGbqTS1ioAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:50.724708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2c4a1c8b9565f0e294578d823d8c0d9175a1103600f13dfa32030b37e701b9e","sha256:45e50c42d51e49d65c2bbc2cbcddd2eb8a4bfbac4d62e19bdac0d9e25788089b"],"state_sha256":"c6f01d158ea38dfed3ff201e9e8d1695c005706f4bc0c9c205a97d323cc79b54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCWsTE7RH4EJs2S4LNj/EcRo3SzUMwDXCScdQCjDklv5BkdLs6uTfKF8eAyRbbm7j42nsW51NkrzJcTWeZ/rBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:14:10.752787Z","bundle_sha256":"68a961646118c75ae177dd68c482976b5dcdba69c8f4567ce2a7e1a9c1ce97c4"}}