{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LLMXS5I4NZ5OT6LQ6K4TI7ULOD","short_pith_number":"pith:LLMXS5I4","schema_version":"1.0","canonical_sha256":"5ad979751c6e7ae9f970f2b9347e8b70d9860a0b73282b96e3c5cb9c29980a2e","source":{"kind":"arxiv","id":"1506.00473","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00473","created_at":"2026-05-18T01:20:50.477730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00473v3","created_at":"2026-05-18T01:20:50.477730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00473","created_at":"2026-05-18T01:20:50.477730+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLMXS5I4NZ5O","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLMXS5I4NZ5OT6LQ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLMXS5I4","created_at":"2026-05-18T12:29:29.992203+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/LLMXS5I4NZ5OT6LQ6K4TI7ULOD","json":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD.json","graph_json":"https://pith.science/api/pith-number/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/graph.json","events_json":"https://pith.science/api/pith-number/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/events.json","paper":"https://pith.science/paper/LLMXS5I4"},"agent_actions":{"view_html":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD","download_json":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD.json","view_paper":"https://pith.science/paper/LLMXS5I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00473&json=true","fetch_graph":"https://pith.science/api/pith-number/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/graph.json","fetch_events":"https://pith.science/api/pith-number/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/action/storage_attestation","attest_author":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/action/author_attestation","sign_citation":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/action/citation_signature","submit_replication":"https://pith.science/pith/LLMXS5I4NZ5OT6LQ6K4TI7ULOD/action/replication_record"}},"created_at":"2026-05-18T01:20:50.477730+00:00","updated_at":"2026-05-18T01:20:50.477730+00:00"}