{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:N2CFWV37J2QDXMYFFF5BLCWVDG","short_pith_number":"pith:N2CFWV37","schema_version":"1.0","canonical_sha256":"6e845b577f4ea03bb305297a158ad519821942c5fe8eb53d0aba0ff9a2657933","source":{"kind":"arxiv","id":"1303.1879","version":2},"attestation_state":"computed","paper":{"title":"A $q$-Queens Problem. I. General Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher R. H. Hanusa, Seth Chaiken, Thomas Zaslavsky","submitted_at":"2013-03-08T03:45:23Z","abstract_excerpt":"By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen, on a polygonal convex board. The number of ways to place $q$ identical nonattacking pieces on a board of variable size $n$ but fixed shape is given by a quasipolynomial function of $n$, of degree $2q$, whose coefficients are polynomials in $q$. The number of combinatorially distinct types of nonattacking configuration is the evaluation of our quasipolynomial at $n=-1$. The quasipolynomial has an exact fo"},"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":"1303.1879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-08T03:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"6d780832e14984974c30fc5a243bfa3b379e882d48658218e59ae82b85e1b7c6","abstract_canon_sha256":"c165145a626e60f41c83ce1671132b293efc5203e5a4ed3d58bade11300da8cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:14.429715Z","signature_b64":"eVXDeB5/GJOuM3lEu7JRAv0xTlCwAftlqA/T4+3j6q++u4Tj2eKHjMoYiWH1FLH9ibGi8npJ03OFi+a2G/BdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e845b577f4ea03bb305297a158ad519821942c5fe8eb53d0aba0ff9a2657933","last_reissued_at":"2026-05-18T01:02:14.428973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:14.428973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $q$-Queens Problem. I. General Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher R. H. Hanusa, Seth Chaiken, Thomas Zaslavsky","submitted_at":"2013-03-08T03:45:23Z","abstract_excerpt":"By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen, on a polygonal convex board. The number of ways to place $q$ identical nonattacking pieces on a board of variable size $n$ but fixed shape is given by a quasipolynomial function of $n$, of degree $2q$, whose coefficients are polynomials in $q$. The number of combinatorially distinct types of nonattacking configuration is the evaluation of our quasipolynomial at $n=-1$. The quasipolynomial has an exact fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1879","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":"1303.1879","created_at":"2026-05-18T01:02:14.429069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1879v2","created_at":"2026-05-18T01:02:14.429069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1879","created_at":"2026-05-18T01:02:14.429069+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2CFWV37J2QD","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2CFWV37J2QDXMYF","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2CFWV37","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20229","citing_title":"The Arithmetic of Chess Piece Strength on the n x n Board","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG","json":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG.json","graph_json":"https://pith.science/api/pith-number/N2CFWV37J2QDXMYFFF5BLCWVDG/graph.json","events_json":"https://pith.science/api/pith-number/N2CFWV37J2QDXMYFFF5BLCWVDG/events.json","paper":"https://pith.science/paper/N2CFWV37"},"agent_actions":{"view_html":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG","download_json":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG.json","view_paper":"https://pith.science/paper/N2CFWV37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1879&json=true","fetch_graph":"https://pith.science/api/pith-number/N2CFWV37J2QDXMYFFF5BLCWVDG/graph.json","fetch_events":"https://pith.science/api/pith-number/N2CFWV37J2QDXMYFFF5BLCWVDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG/action/storage_attestation","attest_author":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG/action/author_attestation","sign_citation":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG/action/citation_signature","submit_replication":"https://pith.science/pith/N2CFWV37J2QDXMYFFF5BLCWVDG/action/replication_record"}},"created_at":"2026-05-18T01:02:14.429069+00:00","updated_at":"2026-05-18T01:02:14.429069+00:00"}