{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DQP2XHTXWFAMMDLYWTA43HSAR5","short_pith_number":"pith:DQP2XHTX","schema_version":"1.0","canonical_sha256":"1c1fab9e77b140c60d78b4c1cd9e408f4bdf2a24d444709fb31fb393f8ed6b5c","source":{"kind":"arxiv","id":"2110.02102","version":2},"attestation_state":"computed","paper":{"title":"CARL: A Benchmark for Contextual and Adaptive Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andr\\'e Biedenkapp, Bodo Rosenhahn, Carolin Benjamins, Frank Hutter, Frederik Schubert, Marius Lindauer, Theresa Eimer","submitted_at":"2021-10-05T15:04:01Z","abstract_excerpt":"While Reinforcement Learning has made great strides towards solving ever more complicated tasks, many algorithms are still brittle to even slight changes in their environment. This is a limiting factor for real-world applications of RL. Although the research community continuously aims at improving both robustness and generalization of RL algorithms, unfortunately it still lacks an open-source set of well-defined benchmark problems based on a consistent theoretical framework, which allows comparing different approaches in a fair, reliable and reproducibleway. To fill this gap, we propose CARL,"},"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":"2110.02102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-05T15:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"e751ddef6d79427b1e316336c9e67ee2cdd2ab18e0ae550bfb126154e59fc9f3","abstract_canon_sha256":"1369f1171e01eeedc8bd937a6bc6165880a6eaa019250d478f642705bb5e50fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:46.356048Z","signature_b64":"ni9wMqEz12JIMvoN0jpZTQPB4LWiOntKzspp04yUxBXQgKHF/g2LIqQarf1vrOiBwUN36RviIvLEOWbkjlaoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1fab9e77b140c60d78b4c1cd9e408f4bdf2a24d444709fb31fb393f8ed6b5c","last_reissued_at":"2026-07-05T03:37:46.355589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:46.355589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CARL: A Benchmark for Contextual and Adaptive Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andr\\'e Biedenkapp, Bodo Rosenhahn, Carolin Benjamins, Frank Hutter, Frederik Schubert, Marius Lindauer, Theresa Eimer","submitted_at":"2021-10-05T15:04:01Z","abstract_excerpt":"While Reinforcement Learning has made great strides towards solving ever more complicated tasks, many algorithms are still brittle to even slight changes in their environment. This is a limiting factor for real-world applications of RL. Although the research community continuously aims at improving both robustness and generalization of RL algorithms, unfortunately it still lacks an open-source set of well-defined benchmark problems based on a consistent theoretical framework, which allows comparing different approaches in a fair, reliable and reproducibleway. To fill this gap, we propose CARL,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02102","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/2110.02102/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":"2110.02102","created_at":"2026-07-05T03:37:46.355648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.02102v2","created_at":"2026-07-05T03:37:46.355648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02102","created_at":"2026-07-05T03:37:46.355648+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQP2XHTXWFAM","created_at":"2026-07-05T03:37:46.355648+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQP2XHTXWFAMMDLY","created_at":"2026-07-05T03:37:46.355648+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQP2XHTX","created_at":"2026-07-05T03:37:46.355648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08450","citing_title":"Zero-shot Imitation Learning by Latent Topology Mapping","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5","json":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5.json","graph_json":"https://pith.science/api/pith-number/DQP2XHTXWFAMMDLYWTA43HSAR5/graph.json","events_json":"https://pith.science/api/pith-number/DQP2XHTXWFAMMDLYWTA43HSAR5/events.json","paper":"https://pith.science/paper/DQP2XHTX"},"agent_actions":{"view_html":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5","download_json":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5.json","view_paper":"https://pith.science/paper/DQP2XHTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.02102&json=true","fetch_graph":"https://pith.science/api/pith-number/DQP2XHTXWFAMMDLYWTA43HSAR5/graph.json","fetch_events":"https://pith.science/api/pith-number/DQP2XHTXWFAMMDLYWTA43HSAR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5/action/storage_attestation","attest_author":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5/action/author_attestation","sign_citation":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5/action/citation_signature","submit_replication":"https://pith.science/pith/DQP2XHTXWFAMMDLYWTA43HSAR5/action/replication_record"}},"created_at":"2026-07-05T03:37:46.355648+00:00","updated_at":"2026-07-05T03:37:46.355648+00:00"}