{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YWY22IITOCW4DLETC5XF3MXIFM","short_pith_number":"pith:YWY22IIT","canonical_record":{"source":{"id":"1702.07939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-25T19:26:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"32f3b4aaf5e79990e74434501830b0005d06f4693b33372211c70d7d52b0ab37","abstract_canon_sha256":"22a87ca6cf2a8c30c616e6ebaeb18307a76db24651075bfd525f550e59a747dc"},"schema_version":"1.0"},"canonical_sha256":"c5b1ad211370adc1ac93176e5db2e82b1f89bba1378c1d2c5130cf9e26ca4fe2","source":{"kind":"arxiv","id":"1702.07939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07939","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07939v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07939","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"YWY22IITOCW4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YWY22IITOCW4DLET","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YWY22IIT","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YWY22IITOCW4DLETC5XF3MXIFM","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-25T19:26:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"32f3b4aaf5e79990e74434501830b0005d06f4693b33372211c70d7d52b0ab37","abstract_canon_sha256":"22a87ca6cf2a8c30c616e6ebaeb18307a76db24651075bfd525f550e59a747dc"},"schema_version":"1.0"},"canonical_sha256":"c5b1ad211370adc1ac93176e5db2e82b1f89bba1378c1d2c5130cf9e26ca4fe2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:56.639064Z","signature_b64":"3Fy7Q/mI4I1SfizpsvjCwL3SJOoG+lryMiHt5TWJFmG87bcUAXBIL+4omhZQAypQmDC9LRTX+fmCT2wADDeIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5b1ad211370adc1ac93176e5db2e82b1f89bba1378c1d2c5130cf9e26ca4fe2","last_reissued_at":"2026-05-18T00:49:56.638423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:56.638423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07939","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:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPKUNjljoUvT2QbdZiINplbuh5pvSX8c4eeYipg2sXSHxCOyaJohw+2XN3znQqdvq5eDatjCOUx+sefJpC2VAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:55:05.810754Z"},"content_sha256":"c478f08c4148c799bc222a4c21db24bc2742c2f5cbffc06669aac30ef1487a6d","schema_version":"1.0","event_id":"sha256:c478f08c4148c799bc222a4c21db24bc2742c2f5cbffc06669aac30ef1487a6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YWY22IITOCW4DLETC5XF3MXIFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alexander Davydov, Daniele Bartoli, Fernanda Pambianco, Massimo Giulietti, Stefano Marcugini","submitted_at":"2017-02-25T19:26:41Z","abstract_excerpt":"In a projective plane $\\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\\mathcal{S}$ is saturating (or dense) if any point of $\\Pi_{q}\\setminus \\mathcal{S}$ is collinear with two points in $\\mathcal{S}$. Modifying an approach of [31], we proved the following upper bound on the smallest size $s(2,q)$ of a saturating set in $\\Pi_{q}$: \\begin{equation*} s(2,q)\\leq \\sqrt{(q+1)\\left(3\\ln q+\\ln\\ln q +\\ln\\frac{3}{4}\\right)}+\\sqrt{\\frac{q}{3\\ln q}}+3. \\end{equation*} The bound holds for all q, not necessarily large.\n  By using inductive constructions, upper bounds on the smallest "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07939","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:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1ymALRRiH7L/TN6s//Okr4dHQCTBFosdPmBPIU0MjYN8vyzE78wGmzniHOefCSKB7guWKFb3QW0irdeqMGeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:55:05.811107Z"},"content_sha256":"a7ff8f85a12b49ad339915bf93044cbbef05ba0b69ca9bdf68e419dbb85253dc","schema_version":"1.0","event_id":"sha256:a7ff8f85a12b49ad339915bf93044cbbef05ba0b69ca9bdf68e419dbb85253dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWY22IITOCW4DLETC5XF3MXIFM/bundle.json","state_url":"https://pith.science/pith/YWY22IITOCW4DLETC5XF3MXIFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWY22IITOCW4DLETC5XF3MXIFM/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-20T04:55:05Z","links":{"resolver":"https://pith.science/pith/YWY22IITOCW4DLETC5XF3MXIFM","bundle":"https://pith.science/pith/YWY22IITOCW4DLETC5XF3MXIFM/bundle.json","state":"https://pith.science/pith/YWY22IITOCW4DLETC5XF3MXIFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWY22IITOCW4DLETC5XF3MXIFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YWY22IITOCW4DLETC5XF3MXIFM","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":"22a87ca6cf2a8c30c616e6ebaeb18307a76db24651075bfd525f550e59a747dc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-25T19:26:41Z","title_canon_sha256":"32f3b4aaf5e79990e74434501830b0005d06f4693b33372211c70d7d52b0ab37"},"schema_version":"1.0","source":{"id":"1702.07939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07939","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07939v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07939","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"YWY22IITOCW4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YWY22IITOCW4DLET","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YWY22IIT","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:a7ff8f85a12b49ad339915bf93044cbbef05ba0b69ca9bdf68e419dbb85253dc","target":"graph","created_at":"2026-05-18T00:49:56Z","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 a projective plane $\\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\\mathcal{S}$ is saturating (or dense) if any point of $\\Pi_{q}\\setminus \\mathcal{S}$ is collinear with two points in $\\mathcal{S}$. Modifying an approach of [31], we proved the following upper bound on the smallest size $s(2,q)$ of a saturating set in $\\Pi_{q}$: \\begin{equation*} s(2,q)\\leq \\sqrt{(q+1)\\left(3\\ln q+\\ln\\ln q +\\ln\\frac{3}{4}\\right)}+\\sqrt{\\frac{q}{3\\ln q}}+3. \\end{equation*} The bound holds for all q, not necessarily large.\n  By using inductive constructions, upper bounds on the smallest ","authors_text":"Alexander Davydov, Daniele Bartoli, Fernanda Pambianco, Massimo Giulietti, 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-02-25T19:26:41Z","title":"Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07939","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:c478f08c4148c799bc222a4c21db24bc2742c2f5cbffc06669aac30ef1487a6d","target":"record","created_at":"2026-05-18T00:49:56Z","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":"22a87ca6cf2a8c30c616e6ebaeb18307a76db24651075bfd525f550e59a747dc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-25T19:26:41Z","title_canon_sha256":"32f3b4aaf5e79990e74434501830b0005d06f4693b33372211c70d7d52b0ab37"},"schema_version":"1.0","source":{"id":"1702.07939","kind":"arxiv","version":1}},"canonical_sha256":"c5b1ad211370adc1ac93176e5db2e82b1f89bba1378c1d2c5130cf9e26ca4fe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5b1ad211370adc1ac93176e5db2e82b1f89bba1378c1d2c5130cf9e26ca4fe2","first_computed_at":"2026-05-18T00:49:56.638423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:56.638423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Fy7Q/mI4I1SfizpsvjCwL3SJOoG+lryMiHt5TWJFmG87bcUAXBIL+4omhZQAypQmDC9LRTX+fmCT2wADDeIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:56.639064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c478f08c4148c799bc222a4c21db24bc2742c2f5cbffc06669aac30ef1487a6d","sha256:a7ff8f85a12b49ad339915bf93044cbbef05ba0b69ca9bdf68e419dbb85253dc"],"state_sha256":"727aaf7842d5ee9b9953e0416507c6d80e6d7d9f5382226895f697ca3e150d3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFkEC74OqJoPVBbiTlBdboLqPQNkqnf/N30g+v/VsaAMDtbrB6xKYPckd93vocQkhHdVka5q0BHumNTZFLdmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:55:05.813123Z","bundle_sha256":"59f7398186e2012e56cf5d77fd89e09a196bb39b7a9ecb0757345a026243df84"}}