{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MUYG35ARQUXMSYT5DO44PJ2B5G","short_pith_number":"pith:MUYG35AR","schema_version":"1.0","canonical_sha256":"65306df411852ec9627d1bb9c7a741e998e8f620b00ea7ab3ed56407baaf8389","source":{"kind":"arxiv","id":"2211.00539","version":3},"attestation_state":"computed","paper":{"title":"Dungeons and Data: A Large-Scale NetHack Dataset","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Danielle Rothermel, Eric Hambro, Heinrich K\\\"uttler, Naila Murray, Roberta Raileanu, Tim Rockt\\\"aschel, Vegard Mella","submitted_at":"2022-11-01T15:43:29Z","abstract_excerpt":"Recent breakthroughs in the development of agents to solve challenging sequential decision making problems such as Go, StarCraft, or DOTA, have relied on both simulated environments and large-scale datasets. However, progress on this research has been hindered by the scarcity of open-sourced datasets and the prohibitive computational cost to work with them. Here we present the NetHack Learning Dataset (NLD), a large and highly-scalable dataset of trajectories from the popular game of NetHack, which is both extremely challenging for current methods and very fast to run. NLD consists of three pa"},"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":"2211.00539","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T15:43:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"31bd3a1df2bc209f7fc3af9d5f2a8b6344fba3a6fea0cc31a0d555c784cab932","abstract_canon_sha256":"c0f76486dec77320b19e4616097517310cef7a114f2e85aa68695d9046779727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:49.320662Z","signature_b64":"NyffTV9QAgJdRQSG5Wq5XXoR1LYRXw7foaTOHxwvHbUC69ztjl4P+Fa4MVL0pnhKfJCDX35ixDUli0++5TQYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65306df411852ec9627d1bb9c7a741e998e8f620b00ea7ab3ed56407baaf8389","last_reissued_at":"2026-07-05T07:15:49.320216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:49.320216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dungeons and Data: A Large-Scale NetHack Dataset","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Danielle Rothermel, Eric Hambro, Heinrich K\\\"uttler, Naila Murray, Roberta Raileanu, Tim Rockt\\\"aschel, Vegard Mella","submitted_at":"2022-11-01T15:43:29Z","abstract_excerpt":"Recent breakthroughs in the development of agents to solve challenging sequential decision making problems such as Go, StarCraft, or DOTA, have relied on both simulated environments and large-scale datasets. However, progress on this research has been hindered by the scarcity of open-sourced datasets and the prohibitive computational cost to work with them. Here we present the NetHack Learning Dataset (NLD), a large and highly-scalable dataset of trajectories from the popular game of NetHack, which is both extremely challenging for current methods and very fast to run. NLD consists of three pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00539","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/2211.00539/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":"2211.00539","created_at":"2026-07-05T07:15:49.320277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.00539v3","created_at":"2026-07-05T07:15:49.320277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00539","created_at":"2026-07-05T07:15:49.320277+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUYG35ARQUXM","created_at":"2026-07-05T07:15:49.320277+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUYG35ARQUXMSYT5","created_at":"2026-07-05T07:15:49.320277+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUYG35AR","created_at":"2026-07-05T07:15:49.320277+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14211","citing_title":"ASH: Agents that Self-Hone via Embodied Learning","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14211","citing_title":"ASH: Agents that Self-Hone via Embodied Learning","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G","json":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G.json","graph_json":"https://pith.science/api/pith-number/MUYG35ARQUXMSYT5DO44PJ2B5G/graph.json","events_json":"https://pith.science/api/pith-number/MUYG35ARQUXMSYT5DO44PJ2B5G/events.json","paper":"https://pith.science/paper/MUYG35AR"},"agent_actions":{"view_html":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G","download_json":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G.json","view_paper":"https://pith.science/paper/MUYG35AR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.00539&json=true","fetch_graph":"https://pith.science/api/pith-number/MUYG35ARQUXMSYT5DO44PJ2B5G/graph.json","fetch_events":"https://pith.science/api/pith-number/MUYG35ARQUXMSYT5DO44PJ2B5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G/action/storage_attestation","attest_author":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G/action/author_attestation","sign_citation":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G/action/citation_signature","submit_replication":"https://pith.science/pith/MUYG35ARQUXMSYT5DO44PJ2B5G/action/replication_record"}},"created_at":"2026-07-05T07:15:49.320277+00:00","updated_at":"2026-07-05T07:15:49.320277+00:00"}