{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3SK6TXL4CHPX3NJK3HWULSE5WS","short_pith_number":"pith:3SK6TXL4","schema_version":"1.0","canonical_sha256":"dc95e9dd7c11df7db52ad9ed45c89db48f838a94f7deb9848b7f26f2795224cb","source":{"kind":"arxiv","id":"2204.04823","version":1},"attestation_state":"computed","paper":{"title":"ACuTE: Automatic Curriculum Transfer from Simple to Complex Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christopher Thierauf, Gyan Tatiya, Jivko Sinapov, Ramtin Hosseini, Yash Shukla","submitted_at":"2022-04-11T01:37:07Z","abstract_excerpt":"Despite recent advances in Reinforcement Learning (RL), many problems, especially real-world tasks, remain prohibitively expensive to learn. To address this issue, several lines of research have explored how tasks, or data samples themselves, can be sequenced into a curriculum to learn a problem that may otherwise be too difficult to learn from scratch. However, generating and optimizing a curriculum in a realistic scenario still requires extensive interactions with the environment. To address this challenge, we formulate the curriculum transfer problem, in which the schema of a curriculum opt"},"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":"2204.04823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-04-11T01:37:07Z","cross_cats_sorted":[],"title_canon_sha256":"c42f5ca3eb8dbc9f69c9d9fd61def5eb2870f4d69269abfbfb1332f7e3520d36","abstract_canon_sha256":"1af3609c73f3717f2ee2e37194ae82322b7f599cbb9901329d4ef89d6dcb00b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:13:01.957641Z","signature_b64":"7HL5YAylK908/1Gav56Io/1bmWeWGtmIb9ncGMvh21gmmPRoMVRSjl3thDt17ZU/DtuIMWl0QyIre3MECN2wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc95e9dd7c11df7db52ad9ed45c89db48f838a94f7deb9848b7f26f2795224cb","last_reissued_at":"2026-07-05T04:13:01.957219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:13:01.957219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ACuTE: Automatic Curriculum Transfer from Simple to Complex Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christopher Thierauf, Gyan Tatiya, Jivko Sinapov, Ramtin Hosseini, Yash Shukla","submitted_at":"2022-04-11T01:37:07Z","abstract_excerpt":"Despite recent advances in Reinforcement Learning (RL), many problems, especially real-world tasks, remain prohibitively expensive to learn. To address this issue, several lines of research have explored how tasks, or data samples themselves, can be sequenced into a curriculum to learn a problem that may otherwise be too difficult to learn from scratch. However, generating and optimizing a curriculum in a realistic scenario still requires extensive interactions with the environment. To address this challenge, we formulate the curriculum transfer problem, in which the schema of a curriculum opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04823","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.04823/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":"2204.04823","created_at":"2026-07-05T04:13:01.957276+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.04823v1","created_at":"2026-07-05T04:13:01.957276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04823","created_at":"2026-07-05T04:13:01.957276+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SK6TXL4CHPX","created_at":"2026-07-05T04:13:01.957276+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SK6TXL4CHPX3NJK","created_at":"2026-07-05T04:13:01.957276+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SK6TXL4","created_at":"2026-07-05T04:13:01.957276+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08545","citing_title":"Curriculum Generation under Structured Parametric Environments for Robust Navigation Policies","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS","json":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS.json","graph_json":"https://pith.science/api/pith-number/3SK6TXL4CHPX3NJK3HWULSE5WS/graph.json","events_json":"https://pith.science/api/pith-number/3SK6TXL4CHPX3NJK3HWULSE5WS/events.json","paper":"https://pith.science/paper/3SK6TXL4"},"agent_actions":{"view_html":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS","download_json":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS.json","view_paper":"https://pith.science/paper/3SK6TXL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.04823&json=true","fetch_graph":"https://pith.science/api/pith-number/3SK6TXL4CHPX3NJK3HWULSE5WS/graph.json","fetch_events":"https://pith.science/api/pith-number/3SK6TXL4CHPX3NJK3HWULSE5WS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS/action/storage_attestation","attest_author":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS/action/author_attestation","sign_citation":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS/action/citation_signature","submit_replication":"https://pith.science/pith/3SK6TXL4CHPX3NJK3HWULSE5WS/action/replication_record"}},"created_at":"2026-07-05T04:13:01.957276+00:00","updated_at":"2026-07-05T04:13:01.957276+00:00"}