{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CFCEPLA65LL4KZMG6GIXGRCM5V","short_pith_number":"pith:CFCEPLA6","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"},"canonical_sha256":"114447ac1eead7c56586f19173444ced6029e498a240a232560983884584052e","source":{"kind":"arxiv","id":"1206.5350","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5350","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5350v2","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5350","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"CFCEPLA65LL4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFCEPLA65LL4KZMG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFCEPLA6","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CFCEPLA65LL4KZMG6GIXGRCM5V","target":"record","payload":{"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"},"canonical_sha256":"114447ac1eead7c56586f19173444ced6029e498a240a232560983884584052e","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"},"source_kind":"arxiv","source_id":"1206.5350","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8H2HZkaoCu7FJb8oupUgjePz9MBDBtNR2HvcOZI8DtKNIhxICNvvAXS7hABAVAuaAAm9sF28td6m2a6ANZKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:41:18.903209Z"},"content_sha256":"44f35e60092d8dc547a8ca1ef5692716f580b050144b04809779d0843d438776","schema_version":"1.0","event_id":"sha256:44f35e60092d8dc547a8ca1ef5692716f580b050144b04809779d0843d438776"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CFCEPLA65LL4KZMG6GIXGRCM5V","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILRm5f0MOsi/CT4vYfr0vvvUPaQ06bjqv348a4BOmlxXUsPv1k5pVUUIqOi7BIRf7bH2ufVeOP9maUD+hOIrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:41:18.903887Z"},"content_sha256":"2713dbe1bad805cc31ddd84042e58a3434b119580fa8f9aab109857b1ea7733a","schema_version":"1.0","event_id":"sha256:2713dbe1bad805cc31ddd84042e58a3434b119580fa8f9aab109857b1ea7733a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/bundle.json","state_url":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T00:41:18Z","links":{"resolver":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V","bundle":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/bundle.json","state":"https://pith.science/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFCEPLA65LL4KZMG6GIXGRCM5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CFCEPLA65LL4KZMG6GIXGRCM5V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be82a6b6189df7bbc737f3040e6ed3bcd2df4d8edcf8479949917d9de8de421f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-23T01:44:35Z","title_canon_sha256":"c754f4a7d9f35fe8973c1801f7dc07c006b0ac0ec5a4feeb247466055f8fed30"},"schema_version":"1.0","source":{"id":"1206.5350","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5350","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5350v2","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5350","created_at":"2026-05-18T02:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"CFCEPLA65LL4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFCEPLA65LL4KZMG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFCEPLA6","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:2713dbe1bad805cc31ddd84042e58a3434b119580fa8f9aab109857b1ea7733a","target":"graph","created_at":"2026-05-18T02:56:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alec S. Cooper, Gregory S. Warrington, John R. Schmitt, Oleg Pikhurko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-23T01:44:35Z","title":"Martin Gardner's minimum no-3-in-a-line problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5350","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:44f35e60092d8dc547a8ca1ef5692716f580b050144b04809779d0843d438776","target":"record","created_at":"2026-05-18T02:56:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be82a6b6189df7bbc737f3040e6ed3bcd2df4d8edcf8479949917d9de8de421f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-23T01:44:35Z","title_canon_sha256":"c754f4a7d9f35fe8973c1801f7dc07c006b0ac0ec5a4feeb247466055f8fed30"},"schema_version":"1.0","source":{"id":"1206.5350","kind":"arxiv","version":2}},"canonical_sha256":"114447ac1eead7c56586f19173444ced6029e498a240a232560983884584052e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"114447ac1eead7c56586f19173444ced6029e498a240a232560983884584052e","first_computed_at":"2026-05-18T02:56:58.581879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:58.581879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tlIvXDr2u0qdBj2rRPzaare+t6UgFDwfa8tn3nOB6xDzeMfGXRK6ByDEi4CRb4+HFgelws6ETREQAH72infoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:58.582271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5350","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44f35e60092d8dc547a8ca1ef5692716f580b050144b04809779d0843d438776","sha256:2713dbe1bad805cc31ddd84042e58a3434b119580fa8f9aab109857b1ea7733a"],"state_sha256":"5d213b5bf8299ec0c58448dc2881c5e13491b48802385b30b17b666337479367"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDU/CTscKblR3gw1Lk7aHQKLyLs/DRwxcq4l41rcYQYqn0hs4b1wQ4XLSPH7tJqg/wjjy53z71Jpj0nSJWdzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T00:41:18.907179Z","bundle_sha256":"a455b78f59d61f9053701322fcd76df5c173bea68f617f0750bf367f15fcb36a"}}