{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3R7V5ZXCHRA7SLXH2HZASSYRSX","short_pith_number":"pith:3R7V5ZXC","schema_version":"1.0","canonical_sha256":"dc7f5ee6e23c41f92ee7d1f2094b1195e5110f1493e62623574ded04c9cd9f01","source":{"kind":"arxiv","id":"1109.1573","version":2},"attestation_state":"computed","paper":{"title":"A Problem Concerning Nonincident Points and Lines in Projective Planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas R. Stinson","submitted_at":"2011-09-07T20:28:08Z","abstract_excerpt":"In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\\sqrt{q}-1). We also show that equality can be attained in this bound whenever q is an even power of two."},"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":"1109.1573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-07T20:28:08Z","cross_cats_sorted":[],"title_canon_sha256":"4085b889ee443da930ee3bbfa6003bae59c06eb6fd41d6bac4f0176896c45f5f","abstract_canon_sha256":"d7dab00612e21994044e217a7c37a7830f6e4393ff17aa97433fcc19a0687497"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:54.264997Z","signature_b64":"/cjKQDxPV6yv3F5Lzkuk1R1zXnDlCLDzMi3z/MDaLzYj/dAaJDi/1MQvDDieRiC44P9neG88DYCUfcfNDT+nBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc7f5ee6e23c41f92ee7d1f2094b1195e5110f1493e62623574ded04c9cd9f01","last_reissued_at":"2026-05-18T04:12:54.264278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:54.264278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Problem Concerning Nonincident Points and Lines in Projective Planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas R. Stinson","submitted_at":"2011-09-07T20:28:08Z","abstract_excerpt":"In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\\sqrt{q}-1). We also show that equality can be attained in this bound whenever q is an even power of two."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1573","kind":"arxiv","version":2},"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":"1109.1573","created_at":"2026-05-18T04:12:54.264402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1573v2","created_at":"2026-05-18T04:12:54.264402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1573","created_at":"2026-05-18T04:12:54.264402+00:00"},{"alias_kind":"pith_short_12","alias_value":"3R7V5ZXCHRA7","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3R7V5ZXCHRA7SLXH","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3R7V5ZXC","created_at":"2026-05-18T12:26:18.847500+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/3R7V5ZXCHRA7SLXH2HZASSYRSX","json":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX.json","graph_json":"https://pith.science/api/pith-number/3R7V5ZXCHRA7SLXH2HZASSYRSX/graph.json","events_json":"https://pith.science/api/pith-number/3R7V5ZXCHRA7SLXH2HZASSYRSX/events.json","paper":"https://pith.science/paper/3R7V5ZXC"},"agent_actions":{"view_html":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX","download_json":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX.json","view_paper":"https://pith.science/paper/3R7V5ZXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1573&json=true","fetch_graph":"https://pith.science/api/pith-number/3R7V5ZXCHRA7SLXH2HZASSYRSX/graph.json","fetch_events":"https://pith.science/api/pith-number/3R7V5ZXCHRA7SLXH2HZASSYRSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX/action/storage_attestation","attest_author":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX/action/author_attestation","sign_citation":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX/action/citation_signature","submit_replication":"https://pith.science/pith/3R7V5ZXCHRA7SLXH2HZASSYRSX/action/replication_record"}},"created_at":"2026-05-18T04:12:54.264402+00:00","updated_at":"2026-05-18T04:12:54.264402+00:00"}