{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZDD5B46FY6B2MUZWSVB6REWHBV","short_pith_number":"pith:ZDD5B46F","schema_version":"1.0","canonical_sha256":"c8c7d0f3c5c783a653369543e892c70d7da5af8c0c91d67a3e94108bc7e36581","source":{"kind":"arxiv","id":"2307.04187","version":1},"attestation_state":"computed","paper":{"title":"Predictive Coding For Animation-Based Video Compression","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Giuseppe Valenzise, Goluck Konuko, St\\'ephane Lathuili\\`ere","submitted_at":"2023-07-09T14:40:54Z","abstract_excerpt":"We address the problem of efficiently compressing video for conferencing-type applications. We build on recent approaches based on image animation, which can achieve good reconstruction quality at very low bitrate by representing face motions with a compact set of sparse keypoints. However, these methods encode video in a frame-by-frame fashion, i.e. each frame is reconstructed from a reference frame, which limits the reconstruction quality when the bandwidth is larger. Instead, we propose a predictive coding scheme which uses image animation as a predictor, and codes the residual with respect"},"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":"2307.04187","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2023-07-09T14:40:54Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"71345ef61a8ab1f8580f0ed162e1181fb9e8c51c77f16a34de5ac14961409033","abstract_canon_sha256":"4f2df580a6c26c66ebc91cc6e8a13fe9b7debfcc0a05eda6127f99045e9dad71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:09.972181Z","signature_b64":"XsTmksuGeW3FUjXtPCxMxu0ebk1w+gjVEPhp2NeFO3ena+I4eEFq53/J+Tt6KVbqgsgrAiZ5gCHxyeZc5MyICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8c7d0f3c5c783a653369543e892c70d7da5af8c0c91d67a3e94108bc7e36581","last_reissued_at":"2026-07-05T06:29:09.971742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:09.971742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predictive Coding For Animation-Based Video Compression","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Giuseppe Valenzise, Goluck Konuko, St\\'ephane Lathuili\\`ere","submitted_at":"2023-07-09T14:40:54Z","abstract_excerpt":"We address the problem of efficiently compressing video for conferencing-type applications. We build on recent approaches based on image animation, which can achieve good reconstruction quality at very low bitrate by representing face motions with a compact set of sparse keypoints. However, these methods encode video in a frame-by-frame fashion, i.e. each frame is reconstructed from a reference frame, which limits the reconstruction quality when the bandwidth is larger. Instead, we propose a predictive coding scheme which uses image animation as a predictor, and codes the residual with respect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04187","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/2307.04187/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":"2307.04187","created_at":"2026-07-05T06:29:09.971799+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04187v1","created_at":"2026-07-05T06:29:09.971799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04187","created_at":"2026-07-05T06:29:09.971799+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDD5B46FY6B2","created_at":"2026-07-05T06:29:09.971799+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDD5B46FY6B2MUZW","created_at":"2026-07-05T06:29:09.971799+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDD5B46F","created_at":"2026-07-05T06:29:09.971799+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV","json":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV.json","graph_json":"https://pith.science/api/pith-number/ZDD5B46FY6B2MUZWSVB6REWHBV/graph.json","events_json":"https://pith.science/api/pith-number/ZDD5B46FY6B2MUZWSVB6REWHBV/events.json","paper":"https://pith.science/paper/ZDD5B46F"},"agent_actions":{"view_html":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV","download_json":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV.json","view_paper":"https://pith.science/paper/ZDD5B46F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04187&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDD5B46FY6B2MUZWSVB6REWHBV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDD5B46FY6B2MUZWSVB6REWHBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV/action/storage_attestation","attest_author":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV/action/author_attestation","sign_citation":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV/action/citation_signature","submit_replication":"https://pith.science/pith/ZDD5B46FY6B2MUZWSVB6REWHBV/action/replication_record"}},"created_at":"2026-07-05T06:29:09.971799+00:00","updated_at":"2026-07-05T06:29:09.971799+00:00"}