{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZW575KC24I4AMGYIYF4MEE6D7K","short_pith_number":"pith:ZW575KC2","schema_version":"1.0","canonical_sha256":"cdbbfea85ae238061b08c178c213c3faa33d73107ae37c9d82a0a900b7e70392","source":{"kind":"arxiv","id":"1109.3847","version":1},"attestation_state":"computed","paper":{"title":"A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems","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-18T06:20:18Z","abstract_excerpt":"In this paper, we study the problem of finding the largest possible set of s points and s blocks in a Steiner triple system of order v, such that that none of the s points lie on any of the s blocks. We prove that s \\leq (2v+5 - \\sqrt{24v+25})/2. We also show that equality can be attained in this bound for infinitely many values of v."},"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.3847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-18T06:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"a8bc9ae9154c99a44a9c664f3e780022b56af7c4bfca9a905831430dfcf670cb","abstract_canon_sha256":"30645f6864dddcd094c266788a92a98f40d8617f55be46d9d04aa3fba2227e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:45.754802Z","signature_b64":"S5pAAu4NsQxtDhIgXSXEEUxuKbm/GZcLV+OoPrpTq4EwRQFBnLydd4Mc0QoH3U3TtSD/b8dnjuia7DYdZo6aCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdbbfea85ae238061b08c178c213c3faa33d73107ae37c9d82a0a900b7e70392","last_reissued_at":"2026-05-18T04:12:45.754123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:45.754123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems","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-18T06:20:18Z","abstract_excerpt":"In this paper, we study the problem of finding the largest possible set of s points and s blocks in a Steiner triple system of order v, such that that none of the s points lie on any of the s blocks. We prove that s \\leq (2v+5 - \\sqrt{24v+25})/2. We also show that equality can be attained in this bound for infinitely many values of v."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3847","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":"1109.3847","created_at":"2026-05-18T04:12:45.754227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3847v1","created_at":"2026-05-18T04:12:45.754227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3847","created_at":"2026-05-18T04:12:45.754227+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZW575KC24I4A","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZW575KC24I4AMGYI","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZW575KC2","created_at":"2026-05-18T12:26:50.516681+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/ZW575KC24I4AMGYIYF4MEE6D7K","json":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K.json","graph_json":"https://pith.science/api/pith-number/ZW575KC24I4AMGYIYF4MEE6D7K/graph.json","events_json":"https://pith.science/api/pith-number/ZW575KC24I4AMGYIYF4MEE6D7K/events.json","paper":"https://pith.science/paper/ZW575KC2"},"agent_actions":{"view_html":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K","download_json":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K.json","view_paper":"https://pith.science/paper/ZW575KC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3847&json=true","fetch_graph":"https://pith.science/api/pith-number/ZW575KC24I4AMGYIYF4MEE6D7K/graph.json","fetch_events":"https://pith.science/api/pith-number/ZW575KC24I4AMGYIYF4MEE6D7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K/action/storage_attestation","attest_author":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K/action/author_attestation","sign_citation":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K/action/citation_signature","submit_replication":"https://pith.science/pith/ZW575KC24I4AMGYIYF4MEE6D7K/action/replication_record"}},"created_at":"2026-05-18T04:12:45.754227+00:00","updated_at":"2026-05-18T04:12:45.754227+00:00"}