{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ERIJFOA6Q7VEBAEFKC5JTMFAQB","short_pith_number":"pith:ERIJFOA6","canonical_record":{"source":{"id":"1705.05225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T13:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"546fa61e833e0d7442ae8d13e1a562dd01181a093d963b693794218908d1e75c","abstract_canon_sha256":"0fb01248175960374553d791195b883a0231562b65262ebcd423079b47e60c68"},"schema_version":"1.0"},"canonical_sha256":"245092b81e87ea40808550ba99b0a0806ddaba75aef1359394a8ecd04547e7f6","source":{"kind":"arxiv","id":"1705.05225","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05225","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05225v2","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05225","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"ERIJFOA6Q7VE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ERIJFOA6Q7VEBAEF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ERIJFOA6","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ERIJFOA6Q7VEBAEFKC5JTMFAQB","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T13:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"546fa61e833e0d7442ae8d13e1a562dd01181a093d963b693794218908d1e75c","abstract_canon_sha256":"0fb01248175960374553d791195b883a0231562b65262ebcd423079b47e60c68"},"schema_version":"1.0"},"canonical_sha256":"245092b81e87ea40808550ba99b0a0806ddaba75aef1359394a8ecd04547e7f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:22.864055Z","signature_b64":"tGh3s3fiXbsu/6LIx19jPDb+ExAUr7RVE5MyXPpkjpGokTLvSSTZIBTAgWDhtFmjt78MUw4GgXTWTa1wlvwWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245092b81e87ea40808550ba99b0a0806ddaba75aef1359394a8ecd04547e7f6","last_reissued_at":"2026-05-18T00:44:22.863431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:22.863431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05225","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-18T00:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plLXU7INHh2HB2EGrBnt6q9OYdbqyi+6N/7fCPDp+SZJOQYJ6jl6252VHPHEv1AzCdJUkdtmR/J+vm5fmLMuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:39:22.220393Z"},"content_sha256":"962f74dd0e2895b7a899b7e9236844fda54cb680020901a220053675dccba3b6","schema_version":"1.0","event_id":"sha256:962f74dd0e2895b7a899b7e9236844fda54cb680020901a220053675dccba3b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ERIJFOA6Q7VEBAEFKC5JTMFAQB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New bounds on the number of n-queens configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zur Luria","submitted_at":"2017-05-15T13:34:59Z","abstract_excerpt":"In how many ways can $n$ queens be placed on an $n \\times n$ chessboard so that no two queens attack each other? This is the famous $n$-queens problem. Let $Q(n)$ denote the number of such configurations, and let $T(n)$ be the number of configurations on a toroidal chessboard. We show that for every $n$ of the form $4^k+1$, $T(n)$ and $Q(n)$ are both at least $n^{\\Omega(n)}$. This result confirms a conjecture of Rivin, Vardi and Zimmerman for these values of $n$. We also present new upper bounds on $T(n)$ and $Q(n)$ using the entropy method, and conjecture that in the case of $T(n)$ the bound "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05225","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-18T00:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"if2Jo53sDzt//MLAZ4Esz9klzzL69OcHxmJxWm5Lc85hrtVaeVmnNpfVrJsXVaFmiGhJxzGWzt5TkfSCG3DGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:39:22.221085Z"},"content_sha256":"baf54a79e938681fc696a632f5e76979694a314a6e915a218257fcf0e7c5e63f","schema_version":"1.0","event_id":"sha256:baf54a79e938681fc696a632f5e76979694a314a6e915a218257fcf0e7c5e63f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERIJFOA6Q7VEBAEFKC5JTMFAQB/bundle.json","state_url":"https://pith.science/pith/ERIJFOA6Q7VEBAEFKC5JTMFAQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERIJFOA6Q7VEBAEFKC5JTMFAQB/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-06-05T21:39:22Z","links":{"resolver":"https://pith.science/pith/ERIJFOA6Q7VEBAEFKC5JTMFAQB","bundle":"https://pith.science/pith/ERIJFOA6Q7VEBAEFKC5JTMFAQB/bundle.json","state":"https://pith.science/pith/ERIJFOA6Q7VEBAEFKC5JTMFAQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERIJFOA6Q7VEBAEFKC5JTMFAQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ERIJFOA6Q7VEBAEFKC5JTMFAQB","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":"0fb01248175960374553d791195b883a0231562b65262ebcd423079b47e60c68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T13:34:59Z","title_canon_sha256":"546fa61e833e0d7442ae8d13e1a562dd01181a093d963b693794218908d1e75c"},"schema_version":"1.0","source":{"id":"1705.05225","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05225","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05225v2","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05225","created_at":"2026-05-18T00:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"ERIJFOA6Q7VE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ERIJFOA6Q7VEBAEF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ERIJFOA6","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:baf54a79e938681fc696a632f5e76979694a314a6e915a218257fcf0e7c5e63f","target":"graph","created_at":"2026-05-18T00:44:22Z","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 how many ways can $n$ queens be placed on an $n \\times n$ chessboard so that no two queens attack each other? This is the famous $n$-queens problem. Let $Q(n)$ denote the number of such configurations, and let $T(n)$ be the number of configurations on a toroidal chessboard. We show that for every $n$ of the form $4^k+1$, $T(n)$ and $Q(n)$ are both at least $n^{\\Omega(n)}$. This result confirms a conjecture of Rivin, Vardi and Zimmerman for these values of $n$. We also present new upper bounds on $T(n)$ and $Q(n)$ using the entropy method, and conjecture that in the case of $T(n)$ the bound ","authors_text":"Zur Luria","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T13:34:59Z","title":"New bounds on the number of n-queens configurations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05225","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:962f74dd0e2895b7a899b7e9236844fda54cb680020901a220053675dccba3b6","target":"record","created_at":"2026-05-18T00:44:22Z","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":"0fb01248175960374553d791195b883a0231562b65262ebcd423079b47e60c68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T13:34:59Z","title_canon_sha256":"546fa61e833e0d7442ae8d13e1a562dd01181a093d963b693794218908d1e75c"},"schema_version":"1.0","source":{"id":"1705.05225","kind":"arxiv","version":2}},"canonical_sha256":"245092b81e87ea40808550ba99b0a0806ddaba75aef1359394a8ecd04547e7f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"245092b81e87ea40808550ba99b0a0806ddaba75aef1359394a8ecd04547e7f6","first_computed_at":"2026-05-18T00:44:22.863431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:22.863431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tGh3s3fiXbsu/6LIx19jPDb+ExAUr7RVE5MyXPpkjpGokTLvSSTZIBTAgWDhtFmjt78MUw4GgXTWTa1wlvwWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:22.864055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05225","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:962f74dd0e2895b7a899b7e9236844fda54cb680020901a220053675dccba3b6","sha256:baf54a79e938681fc696a632f5e76979694a314a6e915a218257fcf0e7c5e63f"],"state_sha256":"8e3a1f8f0e1f1798543916aded651a4eb3ffbbf28d198428146aeabd620fe917"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoJw1KmCRLUKj68CinwD/XF8E2oKOWfXIWrRIW6LAjgsYuOFC0TeOuEceUuPtXYh1NaLlbdKeKYGTuwMyu7sAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:39:22.225269Z","bundle_sha256":"f1a3e5cc351b12d2bbfbb3a86ade8d731084c1b4f28df839952806debafa8431"}}