{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4E5GCDSOVIZCTVS7QUTLNROBMG","short_pith_number":"pith:4E5GCDSO","schema_version":"1.0","canonical_sha256":"e13a610e4eaa3229d65f8526b6c5c161b832759a2481827ad445b2e9f7856890","source":{"kind":"arxiv","id":"2509.21592","version":2},"attestation_state":"computed","paper":{"title":"What Happens Next? Anticipating Future Motion by Generating Point Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Andrea Vedaldi, Christian Rupprecht, Gabrijel Boduljak, Iro Laina, Laurynas Karazija","submitted_at":"2025-09-25T21:03:56Z","abstract_excerpt":"We consider the problem of forecasting motion from a single image, i.e., predicting how objects in the world are likely to move, without the ability to observe other parameters such as the object velocities or the forces applied to them. We formulate this task as conditional generation of dense trajectory grids with a model that closely follows the architecture of modern video generators but outputs motion trajectories instead of pixels. This approach captures scene-wide dynamics and uncertainty, yielding more accurate and diverse predictions than prior regressors and generators. We extensivel"},"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":"2509.21592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-09-25T21:03:56Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d810fa99616d7d7c9b7977c7dfe24d1e2b734d5af2a35360b267e0759596fadf","abstract_canon_sha256":"f38bd04317da5d6cd549c79705b1880ba94bb5aa087f2cffa184127b47b5b5e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:55.509310Z","signature_b64":"h2HElGuf2mh6zlASUewfcfIcd3tusoMmw2uC+Z1vKgNf9Q0ilPPvfkvJCd2xuaPJzuoWB5J44iUalxmmaMGcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e13a610e4eaa3229d65f8526b6c5c161b832759a2481827ad445b2e9f7856890","last_reissued_at":"2026-05-26T02:03:55.508266Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:55.508266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Happens Next? Anticipating Future Motion by Generating Point Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Andrea Vedaldi, Christian Rupprecht, Gabrijel Boduljak, Iro Laina, Laurynas Karazija","submitted_at":"2025-09-25T21:03:56Z","abstract_excerpt":"We consider the problem of forecasting motion from a single image, i.e., predicting how objects in the world are likely to move, without the ability to observe other parameters such as the object velocities or the forces applied to them. We formulate this task as conditional generation of dense trajectory grids with a model that closely follows the architecture of modern video generators but outputs motion trajectories instead of pixels. This approach captures scene-wide dynamics and uncertainty, yielding more accurate and diverse predictions than prior regressors and generators. We extensivel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.21592","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/2509.21592/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":"2509.21592","created_at":"2026-05-26T02:03:55.508419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.21592v2","created_at":"2026-05-26T02:03:55.508419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.21592","created_at":"2026-05-26T02:03:55.508419+00:00"},{"alias_kind":"pith_short_12","alias_value":"4E5GCDSOVIZC","created_at":"2026-05-26T02:03:55.508419+00:00"},{"alias_kind":"pith_short_16","alias_value":"4E5GCDSOVIZCTVS7","created_at":"2026-05-26T02:03:55.508419+00:00"},{"alias_kind":"pith_short_8","alias_value":"4E5GCDSO","created_at":"2026-05-26T02:03:55.508419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.23045","citing_title":"The TIME Machine: On The Power of Motion for Efficient Perception","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2604.11737","citing_title":"Learning Long-term Motion Embeddings for Efficient Kinematics Generation","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG","json":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG.json","graph_json":"https://pith.science/api/pith-number/4E5GCDSOVIZCTVS7QUTLNROBMG/graph.json","events_json":"https://pith.science/api/pith-number/4E5GCDSOVIZCTVS7QUTLNROBMG/events.json","paper":"https://pith.science/paper/4E5GCDSO"},"agent_actions":{"view_html":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG","download_json":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG.json","view_paper":"https://pith.science/paper/4E5GCDSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.21592&json=true","fetch_graph":"https://pith.science/api/pith-number/4E5GCDSOVIZCTVS7QUTLNROBMG/graph.json","fetch_events":"https://pith.science/api/pith-number/4E5GCDSOVIZCTVS7QUTLNROBMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG/action/storage_attestation","attest_author":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG/action/author_attestation","sign_citation":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG/action/citation_signature","submit_replication":"https://pith.science/pith/4E5GCDSOVIZCTVS7QUTLNROBMG/action/replication_record"}},"created_at":"2026-05-26T02:03:55.508419+00:00","updated_at":"2026-05-26T02:03:55.508419+00:00"}