{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J36DLLZ7ZURA6C5H2DASVC7AGQ","short_pith_number":"pith:J36DLLZ7","schema_version":"1.0","canonical_sha256":"4efc35af3fcd220f0ba7d0c12a8be03400e079fc2225eaafd444f43f8d8e116b","source":{"kind":"arxiv","id":"1907.08246","version":1},"attestation_state":"computed","paper":{"title":"Finding First and Most-Beautiful Queens by Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Domenico Salvagnin, Matteo Fischetti","submitted_at":"2019-07-18T18:55:41Z","abstract_excerpt":"The n-queens puzzle is a well-known combinatorial problem that requires to place n queens on an n x n chessboard so that no two queens can attack each other. Since the 19th century, this problem was studied by many mathematicians and computer scientists. While finding any solution to the n-queens puzzle is rather straightforward, it is very challenging to find the lexicographically first (or smallest) feasible solution. Solutions for this type are known in the literature for n <= 55, while for some larger chessboards only partial solutions are known. The present paper was motivated by the ques"},"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":"1907.08246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T18:55:41Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"5b9dc23d2cce21327867f5bbc8a5b932832b1e717a462955377e2f66fbd681bf","abstract_canon_sha256":"0bab189f22b546e56b3386c420ed7a7dba0199263eaea0de0a1aa6284614a6bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.447843Z","signature_b64":"TlsQMTS6g3QXmn9HXLbNKxHSumDK2/MgWuxR305SQfMvuMbHFZ/cG+GvXaSBgAidYmLRR0SuB78zYNNtn2FgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4efc35af3fcd220f0ba7d0c12a8be03400e079fc2225eaafd444f43f8d8e116b","last_reissued_at":"2026-05-17T23:40:10.447390Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.447390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding First and Most-Beautiful Queens by Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Domenico Salvagnin, Matteo Fischetti","submitted_at":"2019-07-18T18:55:41Z","abstract_excerpt":"The n-queens puzzle is a well-known combinatorial problem that requires to place n queens on an n x n chessboard so that no two queens can attack each other. Since the 19th century, this problem was studied by many mathematicians and computer scientists. While finding any solution to the n-queens puzzle is rather straightforward, it is very challenging to find the lexicographically first (or smallest) feasible solution. Solutions for this type are known in the literature for n <= 55, while for some larger chessboards only partial solutions are known. The present paper was motivated by the ques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08246","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":""},"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":"1907.08246","created_at":"2026-05-17T23:40:10.447461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08246v1","created_at":"2026-05-17T23:40:10.447461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08246","created_at":"2026-05-17T23:40:10.447461+00:00"},{"alias_kind":"pith_short_12","alias_value":"J36DLLZ7ZURA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"J36DLLZ7ZURA6C5H","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"J36DLLZ7","created_at":"2026-05-18T12:33:18.533446+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/J36DLLZ7ZURA6C5H2DASVC7AGQ","json":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ.json","graph_json":"https://pith.science/api/pith-number/J36DLLZ7ZURA6C5H2DASVC7AGQ/graph.json","events_json":"https://pith.science/api/pith-number/J36DLLZ7ZURA6C5H2DASVC7AGQ/events.json","paper":"https://pith.science/paper/J36DLLZ7"},"agent_actions":{"view_html":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ","download_json":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ.json","view_paper":"https://pith.science/paper/J36DLLZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08246&json=true","fetch_graph":"https://pith.science/api/pith-number/J36DLLZ7ZURA6C5H2DASVC7AGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/J36DLLZ7ZURA6C5H2DASVC7AGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ/action/storage_attestation","attest_author":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ/action/author_attestation","sign_citation":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ/action/citation_signature","submit_replication":"https://pith.science/pith/J36DLLZ7ZURA6C5H2DASVC7AGQ/action/replication_record"}},"created_at":"2026-05-17T23:40:10.447461+00:00","updated_at":"2026-05-17T23:40:10.447461+00:00"}