{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RUKTZSXNZS2WBMQFQJS2MHISK5","short_pith_number":"pith:RUKTZSXN","schema_version":"1.0","canonical_sha256":"8d153ccaedccb560b2058265a61d125751a487e63517c0f47a88fe38b237b7dd","source":{"kind":"arxiv","id":"2402.16801","version":2},"attestation_state":"computed","paper":{"title":"Craftax: A Lightning-Fast Benchmark for Open-Ended Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Benjamin Ellis, Jakob Foerster, Matthew Jackson, Michael Beukman, Michael Matthews, Mikayel Samvelyan, Samuel Coward","submitted_at":"2024-02-26T18:19:07Z","abstract_excerpt":"Benchmarks play a crucial role in the development and analysis of reinforcement learning (RL) algorithms. We identify that existing benchmarks used for research into open-ended learning fall into one of two categories. Either they are too slow for meaningful research to be performed without enormous computational resources, like Crafter, NetHack and Minecraft, or they are not complex enough to pose a significant challenge, like Minigrid and Procgen. To remedy this, we first present Craftax-Classic: a ground-up rewrite of Crafter in JAX that runs up to 250x faster than the Python-native origina"},"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":"2402.16801","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-26T18:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"e20d0fc95c09d92be7b0970fb48833e1d7478ea935f6fb871cec92cf60074d04","abstract_canon_sha256":"71fa519245b7862f3baabd5a0f7fd9114c9ff1350d69cdb2c6d6c05b13d63042"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:20.669936Z","signature_b64":"XUoMRsnkxJ27A/ZIWrU/iEsAxEfVRC9KwHERR+hZWubYIcLMk/hP2xEI1v8St54k4zLZS6vtOZZhpce5FYx7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d153ccaedccb560b2058265a61d125751a487e63517c0f47a88fe38b237b7dd","last_reissued_at":"2026-07-05T08:26:20.669446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:20.669446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Craftax: A Lightning-Fast Benchmark for Open-Ended Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Benjamin Ellis, Jakob Foerster, Matthew Jackson, Michael Beukman, Michael Matthews, Mikayel Samvelyan, Samuel Coward","submitted_at":"2024-02-26T18:19:07Z","abstract_excerpt":"Benchmarks play a crucial role in the development and analysis of reinforcement learning (RL) algorithms. We identify that existing benchmarks used for research into open-ended learning fall into one of two categories. Either they are too slow for meaningful research to be performed without enormous computational resources, like Crafter, NetHack and Minecraft, or they are not complex enough to pose a significant challenge, like Minigrid and Procgen. To remedy this, we first present Craftax-Classic: a ground-up rewrite of Crafter in JAX that runs up to 250x faster than the Python-native origina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16801","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.16801/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":"2402.16801","created_at":"2026-07-05T08:26:20.669501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.16801v2","created_at":"2026-07-05T08:26:20.669501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16801","created_at":"2026-07-05T08:26:20.669501+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUKTZSXNZS2W","created_at":"2026-07-05T08:26:20.669501+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUKTZSXNZS2WBMQF","created_at":"2026-07-05T08:26:20.669501+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUKTZSXN","created_at":"2026-07-05T08:26:20.669501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31700","citing_title":"Diffusing Blame: Task-Dependent Credit Assignment in Biologically Plausible Dual-Stream Networks","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21800","citing_title":"stable-worldmodel: A Platform for Reproducible World Modeling Research and Evaluation","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2603.12145","citing_title":"Automatic Generation of High-Performance RL Environments","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01358","citing_title":"PACE: Parameter Change for Unsupervised Environment Design","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5","json":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5.json","graph_json":"https://pith.science/api/pith-number/RUKTZSXNZS2WBMQFQJS2MHISK5/graph.json","events_json":"https://pith.science/api/pith-number/RUKTZSXNZS2WBMQFQJS2MHISK5/events.json","paper":"https://pith.science/paper/RUKTZSXN"},"agent_actions":{"view_html":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5","download_json":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5.json","view_paper":"https://pith.science/paper/RUKTZSXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.16801&json=true","fetch_graph":"https://pith.science/api/pith-number/RUKTZSXNZS2WBMQFQJS2MHISK5/graph.json","fetch_events":"https://pith.science/api/pith-number/RUKTZSXNZS2WBMQFQJS2MHISK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5/action/storage_attestation","attest_author":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5/action/author_attestation","sign_citation":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5/action/citation_signature","submit_replication":"https://pith.science/pith/RUKTZSXNZS2WBMQFQJS2MHISK5/action/replication_record"}},"created_at":"2026-07-05T08:26:20.669501+00:00","updated_at":"2026-07-05T08:26:20.669501+00:00"}