{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HRR2Z2YMBJEOVWOX4STMMGMXNR","short_pith_number":"pith:HRR2Z2YM","schema_version":"1.0","canonical_sha256":"3c63aceb0c0a48ead9d7e4a6c619976c51dc7fc62918313593ef13b5ba8dc339","source":{"kind":"arxiv","id":"2504.21468","version":1},"attestation_state":"computed","paper":{"title":"Quaternion Nuclear Norms Over Frobenius Norms Minimization for Robust Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guoqing Chen, Michael Kwok-Po Ng, Qiyu Jin, Tieyong Zeng, Yu Guo","submitted_at":"2025-04-30T09:44:09Z","abstract_excerpt":"Recovering hidden structures from incomplete or noisy data remains a pervasive challenge across many fields, particularly where multi-dimensional data representation is essential. Quaternion matrices, with their ability to naturally model multi-dimensional data, offer a promising framework for this problem. This paper introduces the quaternion nuclear norm over the Frobenius norm (QNOF) as a novel nonconvex approximation for the rank of quaternion matrices. QNOF is parameter-free and scale-invariant. Utilizing quaternion singular value decomposition, we prove that solving the QNOF can be simpl"},"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":"2504.21468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-04-30T09:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"a8e794782a2ad6ba5a021b0ed3b383bfcf095f8cd138453791430c4e320244eb","abstract_canon_sha256":"7fcf3a81e4a1ca8b92890507e96c750bff4751600800f363719a473a8abde50d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:24.300098Z","signature_b64":"r27ysn5BsuIPAM5qn02W5o/OP+xMxQVJsbCLwMLnPLHqfe+yjZLhaJ4+46tSOIHoUY9vnzKVxUhIDisIIfqwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c63aceb0c0a48ead9d7e4a6c619976c51dc7fc62918313593ef13b5ba8dc339","last_reissued_at":"2026-07-05T10:56:24.299605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:24.299605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quaternion Nuclear Norms Over Frobenius Norms Minimization for Robust Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guoqing Chen, Michael Kwok-Po Ng, Qiyu Jin, Tieyong Zeng, Yu Guo","submitted_at":"2025-04-30T09:44:09Z","abstract_excerpt":"Recovering hidden structures from incomplete or noisy data remains a pervasive challenge across many fields, particularly where multi-dimensional data representation is essential. Quaternion matrices, with their ability to naturally model multi-dimensional data, offer a promising framework for this problem. This paper introduces the quaternion nuclear norm over the Frobenius norm (QNOF) as a novel nonconvex approximation for the rank of quaternion matrices. QNOF is parameter-free and scale-invariant. Utilizing quaternion singular value decomposition, we prove that solving the QNOF can be simpl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21468","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/2504.21468/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":"2504.21468","created_at":"2026-07-05T10:56:24.299666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21468v1","created_at":"2026-07-05T10:56:24.299666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21468","created_at":"2026-07-05T10:56:24.299666+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRR2Z2YMBJEO","created_at":"2026-07-05T10:56:24.299666+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRR2Z2YMBJEOVWOX","created_at":"2026-07-05T10:56:24.299666+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRR2Z2YM","created_at":"2026-07-05T10:56:24.299666+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19046","citing_title":"Low-Rank Tensor Completion Based on Fractional Regularization with Ky Fan p-k Norm","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR","json":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR.json","graph_json":"https://pith.science/api/pith-number/HRR2Z2YMBJEOVWOX4STMMGMXNR/graph.json","events_json":"https://pith.science/api/pith-number/HRR2Z2YMBJEOVWOX4STMMGMXNR/events.json","paper":"https://pith.science/paper/HRR2Z2YM"},"agent_actions":{"view_html":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR","download_json":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR.json","view_paper":"https://pith.science/paper/HRR2Z2YM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21468&json=true","fetch_graph":"https://pith.science/api/pith-number/HRR2Z2YMBJEOVWOX4STMMGMXNR/graph.json","fetch_events":"https://pith.science/api/pith-number/HRR2Z2YMBJEOVWOX4STMMGMXNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR/action/storage_attestation","attest_author":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR/action/author_attestation","sign_citation":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR/action/citation_signature","submit_replication":"https://pith.science/pith/HRR2Z2YMBJEOVWOX4STMMGMXNR/action/replication_record"}},"created_at":"2026-07-05T10:56:24.299666+00:00","updated_at":"2026-07-05T10:56:24.299666+00:00"}