{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XWM7XB6OBZBKW7WBEXQSGADEGE","short_pith_number":"pith:XWM7XB6O","schema_version":"1.0","canonical_sha256":"bd99fb87ce0e42ab7ec125e1230064312d29c3bad6672689f3a0e39497b9a35b","source":{"kind":"arxiv","id":"2102.04942","version":1},"attestation_state":"computed","paper":{"title":"Robust Motion In-betweening","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Christopher Pal, Derek Nowrouzezahrai, F\\'elix G. Harvey, Mike Yurick","submitted_at":"2021-02-09T16:52:45Z","abstract_excerpt":"In this work we present a novel, robust transition generation technique that can serve as a new tool for 3D animators, based on adversarial recurrent neural networks. The system synthesizes high-quality motions that use temporally-sparse keyframes as animation constraints. This is reminiscent of the job of in-betweening in traditional animation pipelines, in which an animator draws motion frames between provided keyframes. We first show that a state-of-the-art motion prediction model cannot be easily converted into a robust transition generator when only adding conditioning information about f"},"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":"2102.04942","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2021-02-09T16:52:45Z","cross_cats_sorted":["cs.GR","cs.LG"],"title_canon_sha256":"4ba7da2a540316833167b89323d05e57f3c7ab4bc27cd7632d26404008664d37","abstract_canon_sha256":"9c2a9f0803daa70182f983d39aade36c92d553491fb14fcb4970ffd1e07715a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:06.532568Z","signature_b64":"knOhu1mlInY+4bsiKg0KkivciMjOovUDJT8nngw96SI4isPKNtMS58uannBPVzsk/6YKu5EV36NRwZrP1YITAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd99fb87ce0e42ab7ec125e1230064312d29c3bad6672689f3a0e39497b9a35b","last_reissued_at":"2026-07-05T02:14:06.532077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:06.532077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Motion In-betweening","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Christopher Pal, Derek Nowrouzezahrai, F\\'elix G. Harvey, Mike Yurick","submitted_at":"2021-02-09T16:52:45Z","abstract_excerpt":"In this work we present a novel, robust transition generation technique that can serve as a new tool for 3D animators, based on adversarial recurrent neural networks. The system synthesizes high-quality motions that use temporally-sparse keyframes as animation constraints. This is reminiscent of the job of in-betweening in traditional animation pipelines, in which an animator draws motion frames between provided keyframes. We first show that a state-of-the-art motion prediction model cannot be easily converted into a robust transition generator when only adding conditioning information about f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04942","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/2102.04942/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":"2102.04942","created_at":"2026-07-05T02:14:06.532141+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.04942v1","created_at":"2026-07-05T02:14:06.532141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04942","created_at":"2026-07-05T02:14:06.532141+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWM7XB6OBZBK","created_at":"2026-07-05T02:14:06.532141+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWM7XB6OBZBKW7WB","created_at":"2026-07-05T02:14:06.532141+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWM7XB6O","created_at":"2026-07-05T02:14:06.532141+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10340","citing_title":"OMG: Omni-Modal Motion Generation for Generalist Humanoid Control","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE","json":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE.json","graph_json":"https://pith.science/api/pith-number/XWM7XB6OBZBKW7WBEXQSGADEGE/graph.json","events_json":"https://pith.science/api/pith-number/XWM7XB6OBZBKW7WBEXQSGADEGE/events.json","paper":"https://pith.science/paper/XWM7XB6O"},"agent_actions":{"view_html":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE","download_json":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE.json","view_paper":"https://pith.science/paper/XWM7XB6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.04942&json=true","fetch_graph":"https://pith.science/api/pith-number/XWM7XB6OBZBKW7WBEXQSGADEGE/graph.json","fetch_events":"https://pith.science/api/pith-number/XWM7XB6OBZBKW7WBEXQSGADEGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE/action/storage_attestation","attest_author":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE/action/author_attestation","sign_citation":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE/action/citation_signature","submit_replication":"https://pith.science/pith/XWM7XB6OBZBKW7WBEXQSGADEGE/action/replication_record"}},"created_at":"2026-07-05T02:14:06.532141+00:00","updated_at":"2026-07-05T02:14:06.532141+00:00"}