{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SQ2RWU3JISYVN2BCGTUOMPE63K","short_pith_number":"pith:SQ2RWU3J","schema_version":"1.0","canonical_sha256":"94351b536944b156e82234e8e63c9edabb54acd68da3f4925e9280b458c5f87f","source":{"kind":"arxiv","id":"1808.07784","version":3},"attestation_state":"computed","paper":{"title":"Time-Agnostic Prediction: Predicting Predictable Video Frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Alexei A. Efros, Dinesh Jayaraman, Frederik Ebert, Sergey Levine","submitted_at":"2018-08-23T14:52:40Z","abstract_excerpt":"Prediction is arguably one of the most basic functions of an intelligent system. In general, the problem of predicting events in the future or between two waypoints is exceedingly difficult. However, most phenomena naturally pass through relatively predictable bottlenecks---while we cannot predict the precise trajectory of a robot arm between being at rest and holding an object up, we can be certain that it must have picked the object up. To exploit this, we decouple visual prediction from a rigid notion of time. While conventional approaches predict frames at regularly spaced temporal interva"},"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":"1808.07784","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-08-23T14:52:40Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"be310a54ffc807e052c2f9311722e4e649ced6f9dc7b6819c2f3d6d41fbbb4e3","abstract_canon_sha256":"cadf4b7898f4aeef600243e675a672e82fa4a746c5815dfef085b11301e5ed40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.769179Z","signature_b64":"qHB1hm/2aiKPiKO5o8gL7r3KAvEN4xWFxKV4IqQP4ITF7tgGsgIDUN0O5ASPmeouSztlHG8H/L+M64U9ZLKvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94351b536944b156e82234e8e63c9edabb54acd68da3f4925e9280b458c5f87f","last_reissued_at":"2026-05-18T00:02:24.768555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.768555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Agnostic Prediction: Predicting Predictable Video Frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Alexei A. Efros, Dinesh Jayaraman, Frederik Ebert, Sergey Levine","submitted_at":"2018-08-23T14:52:40Z","abstract_excerpt":"Prediction is arguably one of the most basic functions of an intelligent system. In general, the problem of predicting events in the future or between two waypoints is exceedingly difficult. However, most phenomena naturally pass through relatively predictable bottlenecks---while we cannot predict the precise trajectory of a robot arm between being at rest and holding an object up, we can be certain that it must have picked the object up. To exploit this, we decouple visual prediction from a rigid notion of time. While conventional approaches predict frames at regularly spaced temporal interva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07784","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1808.07784","created_at":"2026-05-18T00:02:24.768640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07784v3","created_at":"2026-05-18T00:02:24.768640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07784","created_at":"2026-05-18T00:02:24.768640+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQ2RWU3JISYV","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQ2RWU3JISYVN2BC","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQ2RWU3J","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00664","citing_title":"Learning World Graphs to Accelerate Hierarchical Reinforcement Learning","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K","json":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K.json","graph_json":"https://pith.science/api/pith-number/SQ2RWU3JISYVN2BCGTUOMPE63K/graph.json","events_json":"https://pith.science/api/pith-number/SQ2RWU3JISYVN2BCGTUOMPE63K/events.json","paper":"https://pith.science/paper/SQ2RWU3J"},"agent_actions":{"view_html":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K","download_json":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K.json","view_paper":"https://pith.science/paper/SQ2RWU3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07784&json=true","fetch_graph":"https://pith.science/api/pith-number/SQ2RWU3JISYVN2BCGTUOMPE63K/graph.json","fetch_events":"https://pith.science/api/pith-number/SQ2RWU3JISYVN2BCGTUOMPE63K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K/action/storage_attestation","attest_author":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K/action/author_attestation","sign_citation":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K/action/citation_signature","submit_replication":"https://pith.science/pith/SQ2RWU3JISYVN2BCGTUOMPE63K/action/replication_record"}},"created_at":"2026-05-18T00:02:24.768640+00:00","updated_at":"2026-05-18T00:02:24.768640+00:00"}