{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:I65F74YJ7XTV3XJ5W62Q2YSYHA","short_pith_number":"pith:I65F74YJ","schema_version":"1.0","canonical_sha256":"47ba5ff309fde75ddd3db7b50d6258382971747cf1d38967f00f2487f8a675a7","source":{"kind":"arxiv","id":"2103.00776","version":1},"attestation_state":"computed","paper":{"title":"Single-Shot Motion Completion with Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"(2) University of Michigan, (3) NetEase), Bohan Zhang (3), Tianyang Shi (1), Yenan Lin (3), Yinglin Duan (1), Yi Yuan (1) ((1) NetEase Fuxi AI Lab, Zhehui Qian (3), Zhengxia Zou (2)","submitted_at":"2021-03-01T06:00:17Z","abstract_excerpt":"Motion completion is a challenging and long-discussed problem, which is of great significance in film and game applications. For different motion completion scenarios (in-betweening, in-filling, and blending), most previous methods deal with the completion problems with case-by-case designs. In this work, we propose a simple but effective method to solve multiple motion completion problems under a unified framework and achieves a new state of the art accuracy under multiple evaluation settings. Inspired by the recent great success of attention-based models, we consider the completion as a sequ"},"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":"2103.00776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-03-01T06:00:17Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"9ea619701e0cd1576202ad63a5520f8a0d06aca00439308a7ff84e40668953f7","abstract_canon_sha256":"f9649eeabfb4ade1a1449e393cb985e621388edce89bf23724edffeed147ad4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:09.350992Z","signature_b64":"4pSnO57ff6GRdBbVK1arfd5NhBycmTTV516hK5yJeQSBGMvcH7q+31HnlV2+K1uV+IV6PodFj6l1eOfwTqObAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47ba5ff309fde75ddd3db7b50d6258382971747cf1d38967f00f2487f8a675a7","last_reissued_at":"2026-07-05T02:19:09.350502Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:09.350502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-Shot Motion Completion with Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"(2) University of Michigan, (3) NetEase), Bohan Zhang (3), Tianyang Shi (1), Yenan Lin (3), Yinglin Duan (1), Yi Yuan (1) ((1) NetEase Fuxi AI Lab, Zhehui Qian (3), Zhengxia Zou (2)","submitted_at":"2021-03-01T06:00:17Z","abstract_excerpt":"Motion completion is a challenging and long-discussed problem, which is of great significance in film and game applications. For different motion completion scenarios (in-betweening, in-filling, and blending), most previous methods deal with the completion problems with case-by-case designs. In this work, we propose a simple but effective method to solve multiple motion completion problems under a unified framework and achieves a new state of the art accuracy under multiple evaluation settings. Inspired by the recent great success of attention-based models, we consider the completion as a sequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.00776","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/2103.00776/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":"2103.00776","created_at":"2026-07-05T02:19:09.350563+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.00776v1","created_at":"2026-07-05T02:19:09.350563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.00776","created_at":"2026-07-05T02:19:09.350563+00:00"},{"alias_kind":"pith_short_12","alias_value":"I65F74YJ7XTV","created_at":"2026-07-05T02:19:09.350563+00:00"},{"alias_kind":"pith_short_16","alias_value":"I65F74YJ7XTV3XJ5","created_at":"2026-07-05T02:19:09.350563+00:00"},{"alias_kind":"pith_short_8","alias_value":"I65F74YJ","created_at":"2026-07-05T02:19:09.350563+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2209.14916","citing_title":"Human Motion Diffusion Model","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02742","citing_title":"Adaptive Interpolation-Synthesis for Motion In-Betweening on Keyframe-Based Animation","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA","json":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA.json","graph_json":"https://pith.science/api/pith-number/I65F74YJ7XTV3XJ5W62Q2YSYHA/graph.json","events_json":"https://pith.science/api/pith-number/I65F74YJ7XTV3XJ5W62Q2YSYHA/events.json","paper":"https://pith.science/paper/I65F74YJ"},"agent_actions":{"view_html":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA","download_json":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA.json","view_paper":"https://pith.science/paper/I65F74YJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.00776&json=true","fetch_graph":"https://pith.science/api/pith-number/I65F74YJ7XTV3XJ5W62Q2YSYHA/graph.json","fetch_events":"https://pith.science/api/pith-number/I65F74YJ7XTV3XJ5W62Q2YSYHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA/action/storage_attestation","attest_author":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA/action/author_attestation","sign_citation":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA/action/citation_signature","submit_replication":"https://pith.science/pith/I65F74YJ7XTV3XJ5W62Q2YSYHA/action/replication_record"}},"created_at":"2026-07-05T02:19:09.350563+00:00","updated_at":"2026-07-05T02:19:09.350563+00:00"}