{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LLMXS5I4NZ5OT6LQ6K4TI7ULOD","short_pith_number":"pith:LLMXS5I4","canonical_record":{"source":{"id":"1506.00473","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-01T12:33:41Z","cross_cats_sorted":[],"title_canon_sha256":"e83cb801df470eacbd192ed23dcffb60b749341f46f2145331207cbea3bf7fec","abstract_canon_sha256":"7e7f7b0d0b2c7781bf732ba1bd36995d5ac8b4b681b020759390db61d2bc2ef3"},"schema_version":"1.0"},"canonical_sha256":"5ad979751c6e7ae9f970f2b9347e8b70d9860a0b73282b96e3c5cb9c29980a2e","source":{"kind":"arxiv","id":"1506.00473","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00473","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00473v3","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00473","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"LLMXS5I4NZ5O","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLMXS5I4NZ5OT6LQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLMXS5I4","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LLMXS5I4NZ5OT6LQ6K4TI7ULOD","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00473","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-01T12:33:41Z","cross_cats_sorted":[],"title_canon_sha256":"e83cb801df470eacbd192ed23dcffb60b749341f46f2145331207cbea3bf7fec","abstract_canon_sha256":"7e7f7b0d0b2c7781bf732ba1bd36995d5ac8b4b681b020759390db61d2bc2ef3"},"schema_version":"1.0"},"canonical_sha256":"5ad979751c6e7ae9f970f2b9347e8b70d9860a0b73282b96e3c5cb9c29980a2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.478127Z","signature_b64":"ReKNHz/HTinOx8w0dLHbZxvjytwzgY4AWaGLBdxUBopljslyCE0+3Wlr00bZvmu6/D9F33zfHi3GQeLCKXTyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ad979751c6e7ae9f970f2b9347e8b70d9860a0b73282b96e3c5cb9c29980a2e","last_reissued_at":"2026-05-18T01:20:50.477652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.477652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00473","source_version":3,"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-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJajpGlTeksaHpGzn8hqp9wSrKINhckgbTg6AZeBXYXe9FlkUcg7VtQFgg8Qe9/wV30hN2XV7HfZVVQri1jMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:12:22.504958Z"},"content_sha256":"bae34d42d5ded3e982ec70e8ef004972a0d3f5e21168a7a410a1ca53033f0898","schema_version":"1.0","event_id":"sha256:bae34d42d5ded3e982ec70e8ef004972a0d3f5e21168a7a410a1ca53033f0898"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LLMXS5I4NZ5OT6LQ6K4TI7ULOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Video Super-Resolution Based On a Sequential Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ang\\'elique Dr\\'emeau, C\\'edric Herzet, Patrick H\\'eas","submitted_at":"2015-06-01T12:33:41Z","abstract_excerpt":"In this work, we propose a novel procedure for video super-resolution, that is the recovery of a sequence of high-resolution images from its low-resolution counterpart. Our approach is based on a \"sequential\" model (i.e., each high-resolution frame is supposed to be a displaced version of the preceding one) and considers the use of sparsity-enforcing priors. Both the recovery of the high-resolution images and the motion fields relating them is tackled. This leads to a large-dimensional, non-convex and non-smooth problem. We propose an algorithmic framework to address the latter. Our approach r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00473","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"},"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-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDd45pGX2+ApPijavnIjlixP6WMZgnz0sedI0L4rYYDwM2jsvui2iR0g6/CyxRLyo/0HbRbfF/gz0madi4F8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:12:22.505723Z"},"content_sha256":"17efe13e0b1d9105580dfd023882bc6f7a88a6a3f45fd8c1640042445ab813c3","schema_version":"1.0","event_id":"sha256:17efe13e0b1d9105580dfd023882bc6f7a88a6a3f45fd8c1640042445ab813c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/bundle.json","state_url":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/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-11T08:12:22Z","links":{"resolver":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD","bundle":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/bundle.json","state":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LLMXS5I4NZ5OT6LQ6K4TI7ULOD","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":"7e7f7b0d0b2c7781bf732ba1bd36995d5ac8b4b681b020759390db61d2bc2ef3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-01T12:33:41Z","title_canon_sha256":"e83cb801df470eacbd192ed23dcffb60b749341f46f2145331207cbea3bf7fec"},"schema_version":"1.0","source":{"id":"1506.00473","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00473","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00473v3","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00473","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"LLMXS5I4NZ5O","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLMXS5I4NZ5OT6LQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLMXS5I4","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:17efe13e0b1d9105580dfd023882bc6f7a88a6a3f45fd8c1640042445ab813c3","target":"graph","created_at":"2026-05-18T01:20:50Z","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":"In this work, we propose a novel procedure for video super-resolution, that is the recovery of a sequence of high-resolution images from its low-resolution counterpart. Our approach is based on a \"sequential\" model (i.e., each high-resolution frame is supposed to be a displaced version of the preceding one) and considers the use of sparsity-enforcing priors. Both the recovery of the high-resolution images and the motion fields relating them is tackled. This leads to a large-dimensional, non-convex and non-smooth problem. We propose an algorithmic framework to address the latter. Our approach r","authors_text":"Ang\\'elique Dr\\'emeau, C\\'edric Herzet, Patrick H\\'eas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-01T12:33:41Z","title":"An Efficient Algorithm for Video Super-Resolution Based On a Sequential Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00473","kind":"arxiv","version":3},"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:bae34d42d5ded3e982ec70e8ef004972a0d3f5e21168a7a410a1ca53033f0898","target":"record","created_at":"2026-05-18T01:20:50Z","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":"7e7f7b0d0b2c7781bf732ba1bd36995d5ac8b4b681b020759390db61d2bc2ef3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-01T12:33:41Z","title_canon_sha256":"e83cb801df470eacbd192ed23dcffb60b749341f46f2145331207cbea3bf7fec"},"schema_version":"1.0","source":{"id":"1506.00473","kind":"arxiv","version":3}},"canonical_sha256":"5ad979751c6e7ae9f970f2b9347e8b70d9860a0b73282b96e3c5cb9c29980a2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ad979751c6e7ae9f970f2b9347e8b70d9860a0b73282b96e3c5cb9c29980a2e","first_computed_at":"2026-05-18T01:20:50.477652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.477652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ReKNHz/HTinOx8w0dLHbZxvjytwzgY4AWaGLBdxUBopljslyCE0+3Wlr00bZvmu6/D9F33zfHi3GQeLCKXTyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.478127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00473","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bae34d42d5ded3e982ec70e8ef004972a0d3f5e21168a7a410a1ca53033f0898","sha256:17efe13e0b1d9105580dfd023882bc6f7a88a6a3f45fd8c1640042445ab813c3"],"state_sha256":"e247d7d091a8673047d8f1e17e57cc9d9fe3411cc64266bad44e3f96a9a4ffb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmFi9vbYKg4yDFkDm1v/zqWr+ngcmrETSBuGVZupGPgze4tBqEy74A9gYbRsLix0Gtu/uCaaBU93ajdR4ngWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:12:22.510483Z","bundle_sha256":"26324cabdec661fa7e119683087a6c86539bc362106da4ff4cdb538a520185f4"}}