{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:V5VNIBFJRK46KLEIEDNHZNQBVA","short_pith_number":"pith:V5VNIBFJ","schema_version":"1.0","canonical_sha256":"af6ad404a98ab9e52c8820da7cb601a803bb0ad591df0f06d90a5b2e56b7b74a","source":{"kind":"arxiv","id":"2109.08083","version":1},"attestation_state":"computed","paper":{"title":"The $n$-queens problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Candida Bowtell, Peter Keevash","submitted_at":"2021-09-16T16:16:56Z","abstract_excerpt":"The famous $n$-queens problem asks how many ways there are to place $n$ queens on an $n \\times n$ chessboard so that no two queens can attack one another. The toroidal $n$-queens problem asks the same question where the board is considered on the surface of the torus and was asked by P\\'{o}lya in 1918. Let $Q(n)$ denote the number of $n$-queens configurations on the classical board and $T(n)$ the number of toroidal $n$-queens configurations. P\\'{o}lya showed that $T(n)>0$ if and only if $n \\equiv 1,5 \\mod 6$ and much more recently, in 2017, Luria showed that $T(n)\\leq ((1+o(1))ne^{-3})^n$ and "},"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":"2109.08083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-16T16:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"89d504945547729b8548190792dd17e3db42a462e5214157f8b6d68afe81c7e9","abstract_canon_sha256":"5826ee10d32ee1b551f83dc6d9cef30aacd44fc635afccf107edc2e032178482"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:05.005483Z","signature_b64":"h3Fae35He/mMB1VbTaN8JA0aTEsuuiu9TCLNFIq0W1fbHijoFucZxfrOKgFn2HsdSiO3RcyxWKGRwt54xwF/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af6ad404a98ab9e52c8820da7cb601a803bb0ad591df0f06d90a5b2e56b7b74a","last_reissued_at":"2026-07-05T03:15:05.005063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:05.005063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $n$-queens problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Candida Bowtell, Peter Keevash","submitted_at":"2021-09-16T16:16:56Z","abstract_excerpt":"The famous $n$-queens problem asks how many ways there are to place $n$ queens on an $n \\times n$ chessboard so that no two queens can attack one another. The toroidal $n$-queens problem asks the same question where the board is considered on the surface of the torus and was asked by P\\'{o}lya in 1918. Let $Q(n)$ denote the number of $n$-queens configurations on the classical board and $T(n)$ the number of toroidal $n$-queens configurations. P\\'{o}lya showed that $T(n)>0$ if and only if $n \\equiv 1,5 \\mod 6$ and much more recently, in 2017, Luria showed that $T(n)\\leq ((1+o(1))ne^{-3})^n$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.08083","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.08083/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.08083","created_at":"2026-07-05T03:15:05.005119+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.08083v1","created_at":"2026-07-05T03:15:05.005119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.08083","created_at":"2026-07-05T03:15:05.005119+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5VNIBFJRK46","created_at":"2026-07-05T03:15:05.005119+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5VNIBFJRK46KLEI","created_at":"2026-07-05T03:15:05.005119+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5VNIBFJ","created_at":"2026-07-05T03:15:05.005119+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05255","citing_title":"No-$(k+1)$-in-line problem for $k \\geqslant 3$","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2606.02843","citing_title":"The extensible no-$(k(n)+1)$-in-line problem","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2410.06429","citing_title":"A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10326","citing_title":"Statistical mechanics of the $N$-queens problem","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10326","citing_title":"Statistical mechanics of the $N$-queens problem","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA","json":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA.json","graph_json":"https://pith.science/api/pith-number/V5VNIBFJRK46KLEIEDNHZNQBVA/graph.json","events_json":"https://pith.science/api/pith-number/V5VNIBFJRK46KLEIEDNHZNQBVA/events.json","paper":"https://pith.science/paper/V5VNIBFJ"},"agent_actions":{"view_html":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA","download_json":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA.json","view_paper":"https://pith.science/paper/V5VNIBFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.08083&json=true","fetch_graph":"https://pith.science/api/pith-number/V5VNIBFJRK46KLEIEDNHZNQBVA/graph.json","fetch_events":"https://pith.science/api/pith-number/V5VNIBFJRK46KLEIEDNHZNQBVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA/action/storage_attestation","attest_author":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA/action/author_attestation","sign_citation":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA/action/citation_signature","submit_replication":"https://pith.science/pith/V5VNIBFJRK46KLEIEDNHZNQBVA/action/replication_record"}},"created_at":"2026-07-05T03:15:05.005119+00:00","updated_at":"2026-07-05T03:15:05.005119+00:00"}