{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FTI5Y46GHYK7OTORVLVLC442J5","short_pith_number":"pith:FTI5Y46G","schema_version":"1.0","canonical_sha256":"2cd1dc73c63e15f74dd1aaeab1739a4f6e6d7f25834bde5521dec0d327caa385","source":{"kind":"arxiv","id":"1807.01425","version":1},"attestation_state":"computed","paper":{"title":"Region Growing Curriculum Generation for Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Artem Molchanov, Gaurav Sukhatme, Karol Hausman, Stan Birchfield","submitted_at":"2018-07-04T01:49:29Z","abstract_excerpt":"Learning a policy capable of moving an agent between any two states in the environment is important for many robotics problems involving navigation and manipulation. Due to the sparsity of rewards in such tasks, applying reinforcement learning in these scenarios can be challenging. Common approaches for tackling this problem include reward engineering with auxiliary rewards, requiring domain-specific knowledge or changing the objective.\n  In this work, we introduce a method based on region-growing that allows learning in an environment with any pair of initial and goal states. Our algorithm fi"},"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":"1807.01425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-04T01:49:29Z","cross_cats_sorted":[],"title_canon_sha256":"1f89b51b5d0115cebc47c7058ef840a25c191b319d23ea53ec4b7dbb42e369eb","abstract_canon_sha256":"c505d2f35ddba85a06f107a812385f98355658c92b656185d23326e594a96cb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:29.702367Z","signature_b64":"jQ2Uytqv02KGZvXWHGtwF2/nkXxLhTd5B//6b3rD3gfjBBlNaBRj1iKLkRv4mrIW8fsZOigJ3Odn0b/Ih2qOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cd1dc73c63e15f74dd1aaeab1739a4f6e6d7f25834bde5521dec0d327caa385","last_reissued_at":"2026-05-18T00:11:29.701981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:29.701981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Region Growing Curriculum Generation for Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Artem Molchanov, Gaurav Sukhatme, Karol Hausman, Stan Birchfield","submitted_at":"2018-07-04T01:49:29Z","abstract_excerpt":"Learning a policy capable of moving an agent between any two states in the environment is important for many robotics problems involving navigation and manipulation. Due to the sparsity of rewards in such tasks, applying reinforcement learning in these scenarios can be challenging. Common approaches for tackling this problem include reward engineering with auxiliary rewards, requiring domain-specific knowledge or changing the objective.\n  In this work, we introduce a method based on region-growing that allows learning in an environment with any pair of initial and goal states. Our algorithm fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01425","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":""},"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":"1807.01425","created_at":"2026-05-18T00:11:29.702044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01425v1","created_at":"2026-05-18T00:11:29.702044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01425","created_at":"2026-05-18T00:11:29.702044+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTI5Y46GHYK7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTI5Y46GHYK7OTOR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTI5Y46G","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5","json":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5.json","graph_json":"https://pith.science/api/pith-number/FTI5Y46GHYK7OTORVLVLC442J5/graph.json","events_json":"https://pith.science/api/pith-number/FTI5Y46GHYK7OTORVLVLC442J5/events.json","paper":"https://pith.science/paper/FTI5Y46G"},"agent_actions":{"view_html":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5","download_json":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5.json","view_paper":"https://pith.science/paper/FTI5Y46G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01425&json=true","fetch_graph":"https://pith.science/api/pith-number/FTI5Y46GHYK7OTORVLVLC442J5/graph.json","fetch_events":"https://pith.science/api/pith-number/FTI5Y46GHYK7OTORVLVLC442J5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5/action/storage_attestation","attest_author":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5/action/author_attestation","sign_citation":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5/action/citation_signature","submit_replication":"https://pith.science/pith/FTI5Y46GHYK7OTORVLVLC442J5/action/replication_record"}},"created_at":"2026-05-18T00:11:29.702044+00:00","updated_at":"2026-05-18T00:11:29.702044+00:00"}