{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AKRNRNE76TJIA5HG2CPJSST7BH","short_pith_number":"pith:AKRNRNE7","schema_version":"1.0","canonical_sha256":"02a2d8b49ff4d28074e6d09e994a7f09c8990f97cd1ce43353ca317250da5a88","source":{"kind":"arxiv","id":"1201.3296","version":1},"attestation_state":"computed","paper":{"title":"A proof of the linearity conjecture for k-blocking sets in PG(n, p3), p prime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geertrui Van de Voorde, Leo Storme, Michel Lavrauw","submitted_at":"2012-01-16T15:56:34Z","abstract_excerpt":"In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking sets in PG(n, p^3), p prime, p >=7, are Fp-linear, proving the linearity conjecture (see [7]) in the case PG(n, p3), p prime, p >= 7."},"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":"1201.3296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-16T15:56:34Z","cross_cats_sorted":[],"title_canon_sha256":"0db103b22c083a635eb8b7faceb9c309065fab7ded396bbad5472fe2aceebdd0","abstract_canon_sha256":"60734bd1361cb2aa367839897e24cd19d1f91ff6df8a3367844fc306b035eece"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:31.687879Z","signature_b64":"YC/wHuAC3GM4ZFRfXL6pmcagXPJiKyB2mvGlAGCleSGfXRCdbsa/yBS0CgGhPWdQ4R0GO3P4Rbz85BM2AW1sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a2d8b49ff4d28074e6d09e994a7f09c8990f97cd1ce43353ca317250da5a88","last_reissued_at":"2026-05-18T04:04:31.687244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:31.687244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of the linearity conjecture for k-blocking sets in PG(n, p3), p prime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geertrui Van de Voorde, Leo Storme, Michel Lavrauw","submitted_at":"2012-01-16T15:56:34Z","abstract_excerpt":"In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking sets in PG(n, p^3), p prime, p >=7, are Fp-linear, proving the linearity conjecture (see [7]) in the case PG(n, p3), p prime, p >= 7."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3296","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":"1201.3296","created_at":"2026-05-18T04:04:31.687329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3296v1","created_at":"2026-05-18T04:04:31.687329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3296","created_at":"2026-05-18T04:04:31.687329+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKRNRNE76TJI","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKRNRNE76TJIA5HG","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKRNRNE7","created_at":"2026-05-18T12:26:58.693483+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/AKRNRNE76TJIA5HG2CPJSST7BH","json":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH.json","graph_json":"https://pith.science/api/pith-number/AKRNRNE76TJIA5HG2CPJSST7BH/graph.json","events_json":"https://pith.science/api/pith-number/AKRNRNE76TJIA5HG2CPJSST7BH/events.json","paper":"https://pith.science/paper/AKRNRNE7"},"agent_actions":{"view_html":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH","download_json":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH.json","view_paper":"https://pith.science/paper/AKRNRNE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3296&json=true","fetch_graph":"https://pith.science/api/pith-number/AKRNRNE76TJIA5HG2CPJSST7BH/graph.json","fetch_events":"https://pith.science/api/pith-number/AKRNRNE76TJIA5HG2CPJSST7BH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH/action/storage_attestation","attest_author":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH/action/author_attestation","sign_citation":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH/action/citation_signature","submit_replication":"https://pith.science/pith/AKRNRNE76TJIA5HG2CPJSST7BH/action/replication_record"}},"created_at":"2026-05-18T04:04:31.687329+00:00","updated_at":"2026-05-18T04:04:31.687329+00:00"}