{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4AX7JZWMM7ORQNBPEAGNVKJCFL","short_pith_number":"pith:4AX7JZWM","schema_version":"1.0","canonical_sha256":"e02ff4e6cc67dd18342f200cdaa9222ac302b8c4b880b129ff4ab261d5939414","source":{"kind":"arxiv","id":"2005.13194","version":1},"attestation_state":"computed","paper":{"title":"Extrapolative-Interpolative Cycle-Consistency Learning for Video Frame Extrapolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hyeongmin Lee, Sangjin Lee, Sangyoun Lee, Taeoh Kim","submitted_at":"2020-05-27T06:42:21Z","abstract_excerpt":"Video frame extrapolation is a task to predict future frames when the past frames are given. Unlike previous studies that usually have been focused on the design of modules or construction of networks, we propose a novel Extrapolative-Interpolative Cycle (EIC) loss using pre-trained frame interpolation module to improve extrapolation performance. Cycle-consistency loss has been used for stable prediction between two function spaces in many visual tasks. We formulate this cycle-consistency using two mapping functions; frame extrapolation and interpolation. Since it is easier to predict intermed"},"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":"2005.13194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-27T06:42:21Z","cross_cats_sorted":[],"title_canon_sha256":"70bb1b86324d0df74c5ce14c411ba54c13c4704d88ac456b9d2c56a2e4ad3213","abstract_canon_sha256":"93b9f448b85eba2d8fd66c3e487d09f37a949145686a67e53b017c7c779f80cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:13.848572Z","signature_b64":"CG5k4RbNQ/5ATk252QwHkaZNlCOBJ/gfLfBWtH6rglr8GtnpxNKoF+IXzZDUD56zQLzJLcTnscQdw9GwAfLbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e02ff4e6cc67dd18342f200cdaa9222ac302b8c4b880b129ff4ab261d5939414","last_reissued_at":"2026-07-05T01:06:13.848196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:13.848196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extrapolative-Interpolative Cycle-Consistency Learning for Video Frame Extrapolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hyeongmin Lee, Sangjin Lee, Sangyoun Lee, Taeoh Kim","submitted_at":"2020-05-27T06:42:21Z","abstract_excerpt":"Video frame extrapolation is a task to predict future frames when the past frames are given. Unlike previous studies that usually have been focused on the design of modules or construction of networks, we propose a novel Extrapolative-Interpolative Cycle (EIC) loss using pre-trained frame interpolation module to improve extrapolation performance. Cycle-consistency loss has been used for stable prediction between two function spaces in many visual tasks. We formulate this cycle-consistency using two mapping functions; frame extrapolation and interpolation. Since it is easier to predict intermed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13194","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/2005.13194/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":"2005.13194","created_at":"2026-07-05T01:06:13.848252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.13194v1","created_at":"2026-07-05T01:06:13.848252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13194","created_at":"2026-07-05T01:06:13.848252+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AX7JZWMM7OR","created_at":"2026-07-05T01:06:13.848252+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AX7JZWMM7ORQNBP","created_at":"2026-07-05T01:06:13.848252+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AX7JZWM","created_at":"2026-07-05T01:06:13.848252+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01803","citing_title":"Discovering Chunks in Neural Embeddings for Interpretability","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL","json":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL.json","graph_json":"https://pith.science/api/pith-number/4AX7JZWMM7ORQNBPEAGNVKJCFL/graph.json","events_json":"https://pith.science/api/pith-number/4AX7JZWMM7ORQNBPEAGNVKJCFL/events.json","paper":"https://pith.science/paper/4AX7JZWM"},"agent_actions":{"view_html":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL","download_json":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL.json","view_paper":"https://pith.science/paper/4AX7JZWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.13194&json=true","fetch_graph":"https://pith.science/api/pith-number/4AX7JZWMM7ORQNBPEAGNVKJCFL/graph.json","fetch_events":"https://pith.science/api/pith-number/4AX7JZWMM7ORQNBPEAGNVKJCFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL/action/storage_attestation","attest_author":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL/action/author_attestation","sign_citation":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL/action/citation_signature","submit_replication":"https://pith.science/pith/4AX7JZWMM7ORQNBPEAGNVKJCFL/action/replication_record"}},"created_at":"2026-07-05T01:06:13.848252+00:00","updated_at":"2026-07-05T01:06:13.848252+00:00"}