{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6NEOVFNW6JT4TDBHM7ND5J4QWP","short_pith_number":"pith:6NEOVFNW","schema_version":"1.0","canonical_sha256":"f348ea95b6f267c98c2767da3ea790b3cda9068a0def269e2df1fb8237bbfcfe","source":{"kind":"arxiv","id":"2311.03485","version":2},"attestation_state":"computed","paper":{"title":"CLIP-Motion: Learning Reward Functions for Robotic Actions Using Consecutive Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Stefan Edelkamp, Xuzhe Dang","submitted_at":"2023-11-06T19:48:03Z","abstract_excerpt":"This paper presents a novel method for learning reward functions for robotic motions by harnessing the power of a CLIP-based model. Traditional reward function design often hinges on manual feature engineering, which can struggle to generalize across an array of tasks. Our approach circumvents this challenge by capitalizing on CLIP's capability to process both state features and image inputs effectively. Given a pair of consecutive observations, our model excels in identifying the motion executed between them. We showcase results spanning various robotic activities, such as directing a gripper"},"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":"2311.03485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-11-06T19:48:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"141a8ed3e4def35e60d93a4c05a2062e3ff289cdf45519dfc1f44fdf70f61a4f","abstract_canon_sha256":"d7bbecf8865be60d8b6955b512f4226051ed6a284ed909504dd0de1bdaf1c96d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:38.241058Z","signature_b64":"w9Y3r/So9l8OMRn7LF6RzDuEwCMkQ6NIp/wmoj1DSHvLZg90HPcVenZtGGs1ZXJRcboXkOQH6mATmxLDcfSBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f348ea95b6f267c98c2767da3ea790b3cda9068a0def269e2df1fb8237bbfcfe","last_reissued_at":"2026-07-05T10:06:38.240594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:38.240594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CLIP-Motion: Learning Reward Functions for Robotic Actions Using Consecutive Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Stefan Edelkamp, Xuzhe Dang","submitted_at":"2023-11-06T19:48:03Z","abstract_excerpt":"This paper presents a novel method for learning reward functions for robotic motions by harnessing the power of a CLIP-based model. Traditional reward function design often hinges on manual feature engineering, which can struggle to generalize across an array of tasks. Our approach circumvents this challenge by capitalizing on CLIP's capability to process both state features and image inputs effectively. Given a pair of consecutive observations, our model excels in identifying the motion executed between them. We showcase results spanning various robotic activities, such as directing a gripper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03485","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/2311.03485/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":"2311.03485","created_at":"2026-07-05T10:06:38.240649+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03485v2","created_at":"2026-07-05T10:06:38.240649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03485","created_at":"2026-07-05T10:06:38.240649+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NEOVFNW6JT4","created_at":"2026-07-05T10:06:38.240649+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NEOVFNW6JT4TDBH","created_at":"2026-07-05T10:06:38.240649+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NEOVFNW","created_at":"2026-07-05T10:06:38.240649+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27994","citing_title":"Dreaming Across Towns: Semantic Rollout and Town-Adversarial Regularization for Zero-Shot Held-Out-Town Fixed-Route Driving in CARLA","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27994","citing_title":"Dreaming Across Towns: Semantic Rollout and Town-Adversarial Regularization for Zero-Shot Held-Out-Town Fixed-Route Driving in CARLA","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP","json":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP.json","graph_json":"https://pith.science/api/pith-number/6NEOVFNW6JT4TDBHM7ND5J4QWP/graph.json","events_json":"https://pith.science/api/pith-number/6NEOVFNW6JT4TDBHM7ND5J4QWP/events.json","paper":"https://pith.science/paper/6NEOVFNW"},"agent_actions":{"view_html":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP","download_json":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP.json","view_paper":"https://pith.science/paper/6NEOVFNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03485&json=true","fetch_graph":"https://pith.science/api/pith-number/6NEOVFNW6JT4TDBHM7ND5J4QWP/graph.json","fetch_events":"https://pith.science/api/pith-number/6NEOVFNW6JT4TDBHM7ND5J4QWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP/action/storage_attestation","attest_author":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP/action/author_attestation","sign_citation":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP/action/citation_signature","submit_replication":"https://pith.science/pith/6NEOVFNW6JT4TDBHM7ND5J4QWP/action/replication_record"}},"created_at":"2026-07-05T10:06:38.240649+00:00","updated_at":"2026-07-05T10:06:38.240649+00:00"}