{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YLVG4XLSSHEFVUBWTO7XNK346T","short_pith_number":"pith:YLVG4XLS","schema_version":"1.0","canonical_sha256":"c2ea6e5d7291c85ad0369bbf76ab7cf4d5bf71f16a2119e1d09d5918bc1fc72c","source":{"kind":"arxiv","id":"1406.2049","version":1},"attestation_state":"computed","paper":{"title":"Image Tag Completion by Low-rank Factorization with Dual Reconstruction Structure Preserved","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CV","authors_text":"Bao-Di Liu, Bin Shen, Xue Li, Yu-Jin Zhang","submitted_at":"2014-06-09T01:22:43Z","abstract_excerpt":"A novel tag completion algorithm is proposed in this paper, which is designed with the following features: 1) Low-rank and error s-parsity: the incomplete initial tagging matrix D is decomposed into the complete tagging matrix A and a sparse error matrix E. However, instead of minimizing its nuclear norm, A is further factor-ized into a basis matrix U and a sparse coefficient matrix V, i.e. D=UV+E. This low-rank formulation encapsulating sparse coding enables our algorithm to recover latent structures from noisy initial data and avoid performing too much denoising; 2) Local reconstruction stru"},"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":"1406.2049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-06-09T01:22:43Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"6379b1f8c635c72fe389da602b639f05eea29439c62f753643fc9e18ec42e4d7","abstract_canon_sha256":"d8d2b0ccfcba60f90438151fd8bf12ff2d06cafadae37ab4386e2c9e055b0ea5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:11.826183Z","signature_b64":"7BddcVkOJgTBL/abf9s97E6kU7YP3NQk3sn3NkVlZG3kfkIBio4bzz1BmtDPgmb4hK4gzpqFmo4LAXY3XR6yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ea6e5d7291c85ad0369bbf76ab7cf4d5bf71f16a2119e1d09d5918bc1fc72c","last_reissued_at":"2026-05-18T02:50:11.825502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:11.825502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Image Tag Completion by Low-rank Factorization with Dual Reconstruction Structure Preserved","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CV","authors_text":"Bao-Di Liu, Bin Shen, Xue Li, Yu-Jin Zhang","submitted_at":"2014-06-09T01:22:43Z","abstract_excerpt":"A novel tag completion algorithm is proposed in this paper, which is designed with the following features: 1) Low-rank and error s-parsity: the incomplete initial tagging matrix D is decomposed into the complete tagging matrix A and a sparse error matrix E. However, instead of minimizing its nuclear norm, A is further factor-ized into a basis matrix U and a sparse coefficient matrix V, i.e. D=UV+E. This low-rank formulation encapsulating sparse coding enables our algorithm to recover latent structures from noisy initial data and avoid performing too much denoising; 2) Local reconstruction stru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2049","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":""},"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":"1406.2049","created_at":"2026-05-18T02:50:11.825601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2049v1","created_at":"2026-05-18T02:50:11.825601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2049","created_at":"2026-05-18T02:50:11.825601+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLVG4XLSSHEF","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLVG4XLSSHEFVUBW","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLVG4XLS","created_at":"2026-05-18T12:28:57.508820+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/YLVG4XLSSHEFVUBWTO7XNK346T","json":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T.json","graph_json":"https://pith.science/api/pith-number/YLVG4XLSSHEFVUBWTO7XNK346T/graph.json","events_json":"https://pith.science/api/pith-number/YLVG4XLSSHEFVUBWTO7XNK346T/events.json","paper":"https://pith.science/paper/YLVG4XLS"},"agent_actions":{"view_html":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T","download_json":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T.json","view_paper":"https://pith.science/paper/YLVG4XLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2049&json=true","fetch_graph":"https://pith.science/api/pith-number/YLVG4XLSSHEFVUBWTO7XNK346T/graph.json","fetch_events":"https://pith.science/api/pith-number/YLVG4XLSSHEFVUBWTO7XNK346T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T/action/storage_attestation","attest_author":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T/action/author_attestation","sign_citation":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T/action/citation_signature","submit_replication":"https://pith.science/pith/YLVG4XLSSHEFVUBWTO7XNK346T/action/replication_record"}},"created_at":"2026-05-18T02:50:11.825601+00:00","updated_at":"2026-05-18T02:50:11.825601+00:00"}