{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7L4WYRGMYPW4EJMLT7JJJY3ES3","short_pith_number":"pith:7L4WYRGM","schema_version":"1.0","canonical_sha256":"faf96c44ccc3edc2258b9fd294e36496da9b1b09c0a6fb61791a6d39648f9a44","source":{"kind":"arxiv","id":"1711.08076","version":1},"attestation_state":"computed","paper":{"title":"Schur Number Five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM"],"primary_cat":"cs.LO","authors_text":"Marijn J.H. Heule","submitted_at":"2017-11-21T22:54:59Z","abstract_excerpt":"We present the solution of a century-old problem known as Schur Number Five: What is the largest (natural) number $n$ such that there exists a five-coloring of the positive numbers up to $n$ without a monochromatic solution of the equation $a + b = c$? We obtained the solution, $n = 160$, by encoding the problem into propositional logic and applying massively parallel satisfiability solving techniques on the resulting formula. We constructed and validated a proof of the solution to increase trust in the correctness of the multi-CPU-year computations. The proof is two petabytes in size and was "},"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":"1711.08076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-21T22:54:59Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"9dcf1102574e3d1dd86df8c9b071b615ae4fd040be5ffa8845ce64dc65e888f2","abstract_canon_sha256":"aa7ac08c153ec7c32869f9f05f16347e23f6cf116037b5b6b828e5fdebc4da62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.730597Z","signature_b64":"+nkj0PYZX620OF1bh20BkKTUsp8udGk54ArET+KX5+Zx5okKbs3pCiBu+bZlkaFkt9UaA4w35UrJNwKfhReqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faf96c44ccc3edc2258b9fd294e36496da9b1b09c0a6fb61791a6d39648f9a44","last_reissued_at":"2026-05-18T00:29:50.729925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.729925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Schur Number Five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM"],"primary_cat":"cs.LO","authors_text":"Marijn J.H. Heule","submitted_at":"2017-11-21T22:54:59Z","abstract_excerpt":"We present the solution of a century-old problem known as Schur Number Five: What is the largest (natural) number $n$ such that there exists a five-coloring of the positive numbers up to $n$ without a monochromatic solution of the equation $a + b = c$? We obtained the solution, $n = 160$, by encoding the problem into propositional logic and applying massively parallel satisfiability solving techniques on the resulting formula. We constructed and validated a proof of the solution to increase trust in the correctness of the multi-CPU-year computations. The proof is two petabytes in size and was "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08076","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":"1711.08076","created_at":"2026-05-18T00:29:50.730034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08076v1","created_at":"2026-05-18T00:29:50.730034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08076","created_at":"2026-05-18T00:29:50.730034+00:00"},{"alias_kind":"pith_short_12","alias_value":"7L4WYRGMYPW4","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7L4WYRGMYPW4EJML","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7L4WYRGM","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17411","citing_title":"Combinatorics of Schur ultrafilters","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3","json":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3.json","graph_json":"https://pith.science/api/pith-number/7L4WYRGMYPW4EJMLT7JJJY3ES3/graph.json","events_json":"https://pith.science/api/pith-number/7L4WYRGMYPW4EJMLT7JJJY3ES3/events.json","paper":"https://pith.science/paper/7L4WYRGM"},"agent_actions":{"view_html":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3","download_json":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3.json","view_paper":"https://pith.science/paper/7L4WYRGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08076&json=true","fetch_graph":"https://pith.science/api/pith-number/7L4WYRGMYPW4EJMLT7JJJY3ES3/graph.json","fetch_events":"https://pith.science/api/pith-number/7L4WYRGMYPW4EJMLT7JJJY3ES3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3/action/storage_attestation","attest_author":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3/action/author_attestation","sign_citation":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3/action/citation_signature","submit_replication":"https://pith.science/pith/7L4WYRGMYPW4EJMLT7JJJY3ES3/action/replication_record"}},"created_at":"2026-05-18T00:29:50.730034+00:00","updated_at":"2026-05-18T00:29:50.730034+00:00"}