{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KMR7MGOR6TX2RQJS5CJHOJ67O4","short_pith_number":"pith:KMR7MGOR","schema_version":"1.0","canonical_sha256":"5323f619d1f4efa8c132e8927727df773ff28ca2385612d9235d1e1d65fb03b8","source":{"kind":"arxiv","id":"2304.03039","version":3},"attestation_state":"computed","paper":{"title":"A computation of D(9) using FPGA Supercomputing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Plessl, Heinrich Riebler, Jens Goemaere, Lennart Van Hirtum, Michael Lass, Patrick De Causmaecker, Tobias Kenter","submitted_at":"2023-04-06T12:54:38Z","abstract_excerpt":"This preprint makes the claim of having computed the $9^{th}$ Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. The resulting value is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value."},"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":"2304.03039","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2023-04-06T12:54:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b33cffc826599788d61cc6d31b1d41937692bc4d49fa959604ebfdbe3c01bda5","abstract_canon_sha256":"7ab298d2b1d593dcd2776d35e8d826196d4b5086fff9f749b1ae5ff49a7ea94e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:09.488137Z","signature_b64":"Ub3eaeOYNik1nqOYS5qeHtCV4f1B+aBWMRJ4PzqT+NfFKcIa9duYFeBDVOgCfWXGE3PjVFWqYm8RtaDx2ogkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5323f619d1f4efa8c132e8927727df773ff28ca2385612d9235d1e1d65fb03b8","last_reissued_at":"2026-07-05T06:02:09.487738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:09.487738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A computation of D(9) using FPGA Supercomputing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Plessl, Heinrich Riebler, Jens Goemaere, Lennart Van Hirtum, Michael Lass, Patrick De Causmaecker, Tobias Kenter","submitted_at":"2023-04-06T12:54:38Z","abstract_excerpt":"This preprint makes the claim of having computed the $9^{th}$ Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. The resulting value is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03039","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.03039/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.03039","created_at":"2026-07-05T06:02:09.487793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03039v3","created_at":"2026-07-05T06:02:09.487793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03039","created_at":"2026-07-05T06:02:09.487793+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMR7MGOR6TX2","created_at":"2026-07-05T06:02:09.487793+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMR7MGOR6TX2RQJS","created_at":"2026-07-05T06:02:09.487793+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMR7MGOR","created_at":"2026-07-05T06:02:09.487793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.12169","citing_title":"Automating Boundary Filling in Cubical Type Theories","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4","json":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4.json","graph_json":"https://pith.science/api/pith-number/KMR7MGOR6TX2RQJS5CJHOJ67O4/graph.json","events_json":"https://pith.science/api/pith-number/KMR7MGOR6TX2RQJS5CJHOJ67O4/events.json","paper":"https://pith.science/paper/KMR7MGOR"},"agent_actions":{"view_html":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4","download_json":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4.json","view_paper":"https://pith.science/paper/KMR7MGOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03039&json=true","fetch_graph":"https://pith.science/api/pith-number/KMR7MGOR6TX2RQJS5CJHOJ67O4/graph.json","fetch_events":"https://pith.science/api/pith-number/KMR7MGOR6TX2RQJS5CJHOJ67O4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4/action/storage_attestation","attest_author":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4/action/author_attestation","sign_citation":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4/action/citation_signature","submit_replication":"https://pith.science/pith/KMR7MGOR6TX2RQJS5CJHOJ67O4/action/replication_record"}},"created_at":"2026-07-05T06:02:09.487793+00:00","updated_at":"2026-07-05T06:02:09.487793+00:00"}