{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O6IMAA32P3377255DD3DRWUNWR","short_pith_number":"pith:O6IMAA32","schema_version":"1.0","canonical_sha256":"7790c0037a7ef7ffebbd18f638da8db4489511c62b3bbe84a03a3263f7e9ae7b","source":{"kind":"arxiv","id":"2412.15182","version":2},"attestation_state":"computed","paper":{"title":"STRAP: Robot Sub-Trajectory Retrieval for Augmented Policy Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Abhishek Gupta, Bingqing Chen, Jacob Berg, Jonathan Francis, Marius Memmel","submitted_at":"2024-12-19T18:54:06Z","abstract_excerpt":"Robot learning is witnessing a significant increase in the size, diversity, and complexity of pre-collected datasets, mirroring trends in domains such as natural language processing and computer vision. Many robot learning methods treat such datasets as multi-task expert data and learn a multi-task, generalist policy by training broadly across them. Notably, while these generalist policies can improve the average performance across many tasks, the performance of generalist policies on any one task is often suboptimal due to negative transfer between partitions of the data, compared to task-spe"},"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":"2412.15182","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-19T18:54:06Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"ff6d29ff4dccc91fa683f075c3ff74f214ddedd45d0bee8e0751506bcfde641d","abstract_canon_sha256":"0c35708195eb17fa913232a3c97982560fc263196eea44b68ae725db18a5e5fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:15.919016Z","signature_b64":"JFpRzCCnUsnYOecMrOin1J3sOhCXRZH7KOwpsOf28xDaTYqROqG1ALhUNLAQz0DE23WHY89sGDJGY69CXtzVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7790c0037a7ef7ffebbd18f638da8db4489511c62b3bbe84a03a3263f7e9ae7b","last_reissued_at":"2026-07-05T11:55:15.918562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:15.918562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"STRAP: Robot Sub-Trajectory Retrieval for Augmented Policy Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Abhishek Gupta, Bingqing Chen, Jacob Berg, Jonathan Francis, Marius Memmel","submitted_at":"2024-12-19T18:54:06Z","abstract_excerpt":"Robot learning is witnessing a significant increase in the size, diversity, and complexity of pre-collected datasets, mirroring trends in domains such as natural language processing and computer vision. Many robot learning methods treat such datasets as multi-task expert data and learn a multi-task, generalist policy by training broadly across them. Notably, while these generalist policies can improve the average performance across many tasks, the performance of generalist policies on any one task is often suboptimal due to negative transfer between partitions of the data, compared to task-spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15182","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/2412.15182/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":"2412.15182","created_at":"2026-07-05T11:55:15.918620+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.15182v2","created_at":"2026-07-05T11:55:15.918620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15182","created_at":"2026-07-05T11:55:15.918620+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6IMAA32P337","created_at":"2026-07-05T11:55:15.918620+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6IMAA32P3377255","created_at":"2026-07-05T11:55:15.918620+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6IMAA32","created_at":"2026-07-05T11:55:15.918620+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10094","citing_title":"Retrieve-then-Steer: Online Success Memory for Test-Time Adaptation of Generative VLAs","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10094","citing_title":"Retrieve-then-Steer: Online Success Memory for Test-Time Adaptation of Generative VLAs","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23000","citing_title":"Learning from the Best: Smoothness-Driven Metrics for Data Quality in Imitation Learning","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR","json":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR.json","graph_json":"https://pith.science/api/pith-number/O6IMAA32P3377255DD3DRWUNWR/graph.json","events_json":"https://pith.science/api/pith-number/O6IMAA32P3377255DD3DRWUNWR/events.json","paper":"https://pith.science/paper/O6IMAA32"},"agent_actions":{"view_html":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR","download_json":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR.json","view_paper":"https://pith.science/paper/O6IMAA32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.15182&json=true","fetch_graph":"https://pith.science/api/pith-number/O6IMAA32P3377255DD3DRWUNWR/graph.json","fetch_events":"https://pith.science/api/pith-number/O6IMAA32P3377255DD3DRWUNWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR/action/storage_attestation","attest_author":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR/action/author_attestation","sign_citation":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR/action/citation_signature","submit_replication":"https://pith.science/pith/O6IMAA32P3377255DD3DRWUNWR/action/replication_record"}},"created_at":"2026-07-05T11:55:15.918620+00:00","updated_at":"2026-07-05T11:55:15.918620+00:00"}