{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7TV43UEEIIPICT5G5HSPU5TYAP","short_pith_number":"pith:7TV43UEE","schema_version":"1.0","canonical_sha256":"fcebcdd084421e814fa6e9e4fa767803d9c91c8330d28f2794fe8ea166305a68","source":{"kind":"arxiv","id":"1605.00723","version":1},"attestation_state":"computed","paper":{"title":"Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek","submitted_at":"2016-05-03T01:32:34Z","abstract_excerpt":"The boolean Pythagorean Triples problem has been a longstanding open problem in Ramsey Theory: Can the set N = $\\{1, 2, ...\\}$ of natural numbers be divided into two parts, such that no part contains a triple $(a,b,c)$ with $a^2 + b^2 = c^2$ ? A prize for the solution was offered by Ronald Graham over two decades ago.\n  We solve this problem, proving in fact the impossibility, by using the Cube-and-Conquer paradigm, a hybrid SAT method for hard problems, employing both look-ahead and CDCL solvers. An important role is played by dedicated look-ahead heuristics, which indeed allowed to solve the"},"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":"1605.00723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-03T01:32:34Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3c13ba9a21d0b5a9921bd686f030fcd97170351a9edf8a14ca2b164744e3d50c","abstract_canon_sha256":"cb5189545d217e998d67165cff13e7412b8c880dfef0f4dcca3a0b9f33c1a2a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.703235Z","signature_b64":"7qO1upcwJ7crgHM5z0kr21kwqoeB/RZvJQoPcEAtUDEvYdSwYSNCmRmT+e8eAihD0kXKaIOcLz90JafiB1RrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcebcdd084421e814fa6e9e4fa767803d9c91c8330d28f2794fe8ea166305a68","last_reissued_at":"2026-05-18T01:12:19.702876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.702876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek","submitted_at":"2016-05-03T01:32:34Z","abstract_excerpt":"The boolean Pythagorean Triples problem has been a longstanding open problem in Ramsey Theory: Can the set N = $\\{1, 2, ...\\}$ of natural numbers be divided into two parts, such that no part contains a triple $(a,b,c)$ with $a^2 + b^2 = c^2$ ? A prize for the solution was offered by Ronald Graham over two decades ago.\n  We solve this problem, proving in fact the impossibility, by using the Cube-and-Conquer paradigm, a hybrid SAT method for hard problems, employing both look-ahead and CDCL solvers. An important role is played by dedicated look-ahead heuristics, which indeed allowed to solve the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00723","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":"1605.00723","created_at":"2026-05-18T01:12:19.702941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00723v1","created_at":"2026-05-18T01:12:19.702941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00723","created_at":"2026-05-18T01:12:19.702941+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TV43UEEIIPI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TV43UEEIIPICT5G","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TV43UEE","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2401.14996","citing_title":"A Resolution-Based Interactive Proof System for UNSAT","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP","json":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP.json","graph_json":"https://pith.science/api/pith-number/7TV43UEEIIPICT5G5HSPU5TYAP/graph.json","events_json":"https://pith.science/api/pith-number/7TV43UEEIIPICT5G5HSPU5TYAP/events.json","paper":"https://pith.science/paper/7TV43UEE"},"agent_actions":{"view_html":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP","download_json":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP.json","view_paper":"https://pith.science/paper/7TV43UEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00723&json=true","fetch_graph":"https://pith.science/api/pith-number/7TV43UEEIIPICT5G5HSPU5TYAP/graph.json","fetch_events":"https://pith.science/api/pith-number/7TV43UEEIIPICT5G5HSPU5TYAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP/action/storage_attestation","attest_author":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP/action/author_attestation","sign_citation":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP/action/citation_signature","submit_replication":"https://pith.science/pith/7TV43UEEIIPICT5G5HSPU5TYAP/action/replication_record"}},"created_at":"2026-05-18T01:12:19.702941+00:00","updated_at":"2026-05-18T01:12:19.702941+00:00"}