{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CPHURL2RRANPYPXYJ5LLJRAR53","short_pith_number":"pith:CPHURL2R","canonical_record":{"source":{"id":"1401.4112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-16T18:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"eca59932e95bb5ef098edd4f001dcd221fbbd80f22f1b63699d2b8c1510eaec4","abstract_canon_sha256":"a53a06bae0d405b005951fbea46bd29b9abbdd0ffa502332fea62baa5dff3b5e"},"schema_version":"1.0"},"canonical_sha256":"13cf48af51881afc3ef84f56b4c411eecfbf279241589164b44425fbf16c97e9","source":{"kind":"arxiv","id":"1401.4112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4112","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4112v2","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4112","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"CPHURL2RRANP","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CPHURL2RRANPYPXY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CPHURL2R","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CPHURL2RRANPYPXYJ5LLJRAR53","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-16T18:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"eca59932e95bb5ef098edd4f001dcd221fbbd80f22f1b63699d2b8c1510eaec4","abstract_canon_sha256":"a53a06bae0d405b005951fbea46bd29b9abbdd0ffa502332fea62baa5dff3b5e"},"schema_version":"1.0"},"canonical_sha256":"13cf48af51881afc3ef84f56b4c411eecfbf279241589164b44425fbf16c97e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:14.095665Z","signature_b64":"rD/qCDSAXNR0Jvw+4HGLmb6LmSWnhoogdAxPGRDKG4pV/5OIi/wjn4S0p8J0u2n4A7lUOODwvE1IenEUcadbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13cf48af51881afc3ef84f56b4c411eecfbf279241589164b44425fbf16c97e9","last_reissued_at":"2026-05-18T02:52:14.095029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:14.095029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4112","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgIjr/w/kZ6mIkHAKmNO7XfscsvCgtLI0NXu0qDQJ65ThnWw8ml4qqRbLi8Y4ZO4SuIUU4aZMCcEy3U66AlrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:41:34.439358Z"},"content_sha256":"ee8d379ad4295c9ae7a3baf5d5e39909cf229135877ff6dafdbd5ab27fb867ca","schema_version":"1.0","event_id":"sha256:ee8d379ad4295c9ae7a3baf5d5e39909cf229135877ff6dafdbd5ab27fb867ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CPHURL2RRANPYPXYJ5LLJRAR53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A bi-level view of inpainting - based image compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ren\\'e Ranftl, Thomas Pock, Yunjin Chen","submitted_at":"2014-01-16T18:10:56Z","abstract_excerpt":"Inpainting based image compression approaches, especially linear and non-linear diffusion models, are an active research topic for lossy image compression. The major challenge in these compression models is to find a small set of descriptive supporting points, which allow for an accurate reconstruction of the original image. It turns out in practice that this is a challenging problem even for the simplest Laplacian interpolation model. In this paper, we revisit the Laplacian interpolation compression model and introduce two fast algorithms, namely successive preconditioning primal dual algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4112","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgAqNBDv+Lsn8e+MbeQPSGljxw1YBn2aOwYP6UwH+GznUf4EcNvLl6b/iNKaHa8qqvH5EY8N6k0HEkGSV4DiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:41:34.439699Z"},"content_sha256":"20ed5000dc069dcdde5f419baafc868ae6627ba9b2a52cf53da028de7771a39a","schema_version":"1.0","event_id":"sha256:20ed5000dc069dcdde5f419baafc868ae6627ba9b2a52cf53da028de7771a39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPHURL2RRANPYPXYJ5LLJRAR53/bundle.json","state_url":"https://pith.science/pith/CPHURL2RRANPYPXYJ5LLJRAR53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPHURL2RRANPYPXYJ5LLJRAR53/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T17:41:34Z","links":{"resolver":"https://pith.science/pith/CPHURL2RRANPYPXYJ5LLJRAR53","bundle":"https://pith.science/pith/CPHURL2RRANPYPXYJ5LLJRAR53/bundle.json","state":"https://pith.science/pith/CPHURL2RRANPYPXYJ5LLJRAR53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPHURL2RRANPYPXYJ5LLJRAR53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CPHURL2RRANPYPXYJ5LLJRAR53","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a53a06bae0d405b005951fbea46bd29b9abbdd0ffa502332fea62baa5dff3b5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-16T18:10:56Z","title_canon_sha256":"eca59932e95bb5ef098edd4f001dcd221fbbd80f22f1b63699d2b8c1510eaec4"},"schema_version":"1.0","source":{"id":"1401.4112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4112","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4112v2","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4112","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"CPHURL2RRANP","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CPHURL2RRANPYPXY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CPHURL2R","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:20ed5000dc069dcdde5f419baafc868ae6627ba9b2a52cf53da028de7771a39a","target":"graph","created_at":"2026-05-18T02:52:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Inpainting based image compression approaches, especially linear and non-linear diffusion models, are an active research topic for lossy image compression. The major challenge in these compression models is to find a small set of descriptive supporting points, which allow for an accurate reconstruction of the original image. It turns out in practice that this is a challenging problem even for the simplest Laplacian interpolation model. In this paper, we revisit the Laplacian interpolation compression model and introduce two fast algorithms, namely successive preconditioning primal dual algorit","authors_text":"Ren\\'e Ranftl, Thomas Pock, Yunjin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-16T18:10:56Z","title":"A bi-level view of inpainting - based image compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4112","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ee8d379ad4295c9ae7a3baf5d5e39909cf229135877ff6dafdbd5ab27fb867ca","target":"record","created_at":"2026-05-18T02:52:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a53a06bae0d405b005951fbea46bd29b9abbdd0ffa502332fea62baa5dff3b5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-16T18:10:56Z","title_canon_sha256":"eca59932e95bb5ef098edd4f001dcd221fbbd80f22f1b63699d2b8c1510eaec4"},"schema_version":"1.0","source":{"id":"1401.4112","kind":"arxiv","version":2}},"canonical_sha256":"13cf48af51881afc3ef84f56b4c411eecfbf279241589164b44425fbf16c97e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13cf48af51881afc3ef84f56b4c411eecfbf279241589164b44425fbf16c97e9","first_computed_at":"2026-05-18T02:52:14.095029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:14.095029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rD/qCDSAXNR0Jvw+4HGLmb6LmSWnhoogdAxPGRDKG4pV/5OIi/wjn4S0p8J0u2n4A7lUOODwvE1IenEUcadbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:14.095665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee8d379ad4295c9ae7a3baf5d5e39909cf229135877ff6dafdbd5ab27fb867ca","sha256:20ed5000dc069dcdde5f419baafc868ae6627ba9b2a52cf53da028de7771a39a"],"state_sha256":"58c7304a308526bbaa01402770cf3b46a403e3cc953b41f035d2a073f92c224d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pi98KNbktQ96ImGWuc+9MbjVRIqAvAjJ9Mv1AJBMZhVsll3qnJ9i4KWf1ZMJjxRGGWePqzyAqbtEtlFR7Wz4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:41:34.441913Z","bundle_sha256":"e09468979a29f7cfb685e254583738e7a3985aa54fc705ebac8c26456a6b591b"}}