{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CFCEPLA65LL4KZMG6GIXGRCM5V","short_pith_number":"pith:CFCEPLA6","schema_version":"1.0","canonical_sha256":"114447ac1eead7c56586f19173444ced6029e498a240a232560983884584052e","source":{"kind":"arxiv","id":"1206.5350","version":2},"attestation_state":"computed","paper":{"title":"Martin Gardner's minimum no-3-in-a-line problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alec S. Cooper, Gregory S. Warrington, John R. Schmitt, Oleg Pikhurko","submitted_at":"2012-06-23T01:44:35Z","abstract_excerpt":"In Martin Gardner's October, 1976 Mathematical Games column in Scientific American, he posed the following problem: \"What is the smallest number of [queens] you can put on a board of side n such that no [queen] can be added without creating three in a row, a column, or a diagonal?\" We use the Combinatorial Nullstellensatz to prove that this number is at least n, except in the case when n is congruent to 3 modulo 4, in which case one less may suffice. A second, more elementary proof is also offered in the case that n is even."},"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":"1206.5350","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-23T01:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"c754f4a7d9f35fe8973c1801f7dc07c006b0ac0ec5a4feeb247466055f8fed30","abstract_canon_sha256":"be82a6b6189df7bbc737f3040e6ed3bcd2df4d8edcf8479949917d9de8de421f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:58.582271Z","signature_b64":"tlIvXDr2u0qdBj2rRPzaare+t6UgFDwfa8tn3nOB6xDzeMfGXRK6ByDEi4CRb4+HFgelws6ETREQAH72infoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"114447ac1eead7c56586f19173444ced6029e498a240a232560983884584052e","last_reissued_at":"2026-05-18T02:56:58.581879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:58.581879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Martin Gardner's minimum no-3-in-a-line problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alec S. Cooper, Gregory S. Warrington, John R. Schmitt, Oleg Pikhurko","submitted_at":"2012-06-23T01:44:35Z","abstract_excerpt":"In Martin Gardner's October, 1976 Mathematical Games column in Scientific American, he posed the following problem: \"What is the smallest number of [queens] you can put on a board of side n such that no [queen] can be added without creating three in a row, a column, or a diagonal?\" We use the Combinatorial Nullstellensatz to prove that this number is at least n, except in the case when n is congruent to 3 modulo 4, in which case one less may suffice. A second, more elementary proof is also offered in the case that n is even."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5350","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":"1206.5350","created_at":"2026-05-18T02:56:58.581932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5350v2","created_at":"2026-05-18T02:56:58.581932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5350","created_at":"2026-05-18T02:56:58.581932+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFCEPLA65LL4","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFCEPLA65LL4KZMG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFCEPLA6","created_at":"2026-05-18T12:27:01.376967+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/CFCEPLA65LL4KZMG6GIXGRCM5V","json":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V.json","graph_json":"https://pith.science/api/pith-number/CFCEPLA65LL4KZMG6GIXGRCM5V/graph.json","events_json":"https://pith.science/api/pith-number/CFCEPLA65LL4KZMG6GIXGRCM5V/events.json","paper":"https://pith.science/paper/CFCEPLA6"},"agent_actions":{"view_html":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V","download_json":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V.json","view_paper":"https://pith.science/paper/CFCEPLA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5350&json=true","fetch_graph":"https://pith.science/api/pith-number/CFCEPLA65LL4KZMG6GIXGRCM5V/graph.json","fetch_events":"https://pith.science/api/pith-number/CFCEPLA65LL4KZMG6GIXGRCM5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/action/storage_attestation","attest_author":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/action/author_attestation","sign_citation":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/action/citation_signature","submit_replication":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/action/replication_record"}},"created_at":"2026-05-18T02:56:58.581932+00:00","updated_at":"2026-05-18T02:56:58.581932+00:00"}