{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KQFP6EMG334IV3VMJXPPXTVNBN","short_pith_number":"pith:KQFP6EMG","schema_version":"1.0","canonical_sha256":"540aff1186def88aeeac4ddefbcead0b7c0a1e908689bcfd8aac404f1c00c9d4","source":{"kind":"arxiv","id":"1703.07843","version":3},"attestation_state":"computed","paper":{"title":"Minimal multiple blocking sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Jeroen Schillewaert, Sam Mattheus","submitted_at":"2017-03-22T20:35:40Z","abstract_excerpt":"We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \\[\\frac{1}{2} n\\sqrt{4tn - (3t + 1)(t - 1)} + \\frac{1}{2} (t - 1)n + t.\\] This is the first general upper bound on the size of minimal $t$-fold blocking sets in finite projective planes and it generalizes the classical result of Bruen and Thas on minimal blocking sets. From the proof it directly follows that if equality occurs in this bound then every line intersects the blocking set $S$ in either $t$ points or $\\frac{1}{2}(\\sqrt{4tn - (3t + 1)(t - 1)} + t - 1) + 1$ points. We use th"},"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":"1703.07843","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T20:35:40Z","cross_cats_sorted":[],"title_canon_sha256":"410ab284c71e36cdc40acc00aad41b8506ff6d828575d0f162ad3706e1414fea","abstract_canon_sha256":"38c324e6594f83bab6fb31ed5595f4c6a1fb6ce3f916eb7a171272e8ac6ba153"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:23.347653Z","signature_b64":"OfoCFBDUKJzvd/ekbB+iutfCJkWqXWUZOoI3vSLh4AQlvNHlIFS8jgGzQg/qFHDlSzl04dbPOSb7azcCnPCyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"540aff1186def88aeeac4ddefbcead0b7c0a1e908689bcfd8aac404f1c00c9d4","last_reissued_at":"2026-05-17T23:58:23.346918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:23.346918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal multiple blocking sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Jeroen Schillewaert, Sam Mattheus","submitted_at":"2017-03-22T20:35:40Z","abstract_excerpt":"We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \\[\\frac{1}{2} n\\sqrt{4tn - (3t + 1)(t - 1)} + \\frac{1}{2} (t - 1)n + t.\\] This is the first general upper bound on the size of minimal $t$-fold blocking sets in finite projective planes and it generalizes the classical result of Bruen and Thas on minimal blocking sets. From the proof it directly follows that if equality occurs in this bound then every line intersects the blocking set $S$ in either $t$ points or $\\frac{1}{2}(\\sqrt{4tn - (3t + 1)(t - 1)} + t - 1) + 1$ points. We use th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07843","kind":"arxiv","version":3},"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":"1703.07843","created_at":"2026-05-17T23:58:23.347041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07843v3","created_at":"2026-05-17T23:58:23.347041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07843","created_at":"2026-05-17T23:58:23.347041+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQFP6EMG334I","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQFP6EMG334IV3VM","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQFP6EMG","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.16327","citing_title":"Generalized Hamming weights of additive codes and geometric counterparts","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN","json":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN.json","graph_json":"https://pith.science/api/pith-number/KQFP6EMG334IV3VMJXPPXTVNBN/graph.json","events_json":"https://pith.science/api/pith-number/KQFP6EMG334IV3VMJXPPXTVNBN/events.json","paper":"https://pith.science/paper/KQFP6EMG"},"agent_actions":{"view_html":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN","download_json":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN.json","view_paper":"https://pith.science/paper/KQFP6EMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07843&json=true","fetch_graph":"https://pith.science/api/pith-number/KQFP6EMG334IV3VMJXPPXTVNBN/graph.json","fetch_events":"https://pith.science/api/pith-number/KQFP6EMG334IV3VMJXPPXTVNBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN/action/storage_attestation","attest_author":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN/action/author_attestation","sign_citation":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN/action/citation_signature","submit_replication":"https://pith.science/pith/KQFP6EMG334IV3VMJXPPXTVNBN/action/replication_record"}},"created_at":"2026-05-17T23:58:23.347041+00:00","updated_at":"2026-05-17T23:58:23.347041+00:00"}