{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PJG7I5Z3OC7S5MDEWX7MDOT7YP","short_pith_number":"pith:PJG7I5Z3","schema_version":"1.0","canonical_sha256":"7a4df4773b70bf2eb064b5fec1ba7fc3ef825c6b015a3441b1676f79149f0965","source":{"kind":"arxiv","id":"2607.04875","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Entrywise Power Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","math.CO","stat.ML"],"primary_cat":"cs.CC","authors_text":"Arnaud Vandaele, Nicolas Gillis, Stefano Sicilia, Subhayan Saha","submitted_at":"2026-07-06T09:50:20Z","abstract_excerpt":"Given a nonnegative matrix $X$, a factorization rank $r$ and a real parameter $p$, entrywise power matrix factorization (EPMF) looks for a low-rank matrix $X_r$ such that $X = |X_r|^{\\circ p}$ (exact case) or $X \\approx |X_r|^{\\circ p}$ (approximate case), where $(\\cdot)^{\\circ p}$ denotes the component-wise exponent. EPMF includes the modulus model ($p=1$) and component-wise square factorization ($p=2$) as special cases, the latter being closely related to the square root rank. We analyze the computational complexity of the exact decision problem and the Frobenius-norm approximation problem, "},"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":"2607.04875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-06T09:50:20Z","cross_cats_sorted":["cs.IR","math.CO","stat.ML"],"title_canon_sha256":"725e6824583f616cbfb277198583d9b8e0be5055639e7db56ab93bdb9697a94c","abstract_canon_sha256":"86a98b6026cebcb08f57649d8bcd1cace2bbd8af48fdc70dc60bd282ad466af2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:20:08.753623Z","signature_b64":"I2xd7rc5SbdUtLO4lLilCnlKJ31ffbsFDYb/NOeHQnuWep/5JjlGJ8BkXv1u0PBdjGtPw38yMmD2uVcmOxHFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a4df4773b70bf2eb064b5fec1ba7fc3ef825c6b015a3441b1676f79149f0965","last_reissued_at":"2026-07-07T02:20:08.752813Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:20:08.752813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Entrywise Power Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","math.CO","stat.ML"],"primary_cat":"cs.CC","authors_text":"Arnaud Vandaele, Nicolas Gillis, Stefano Sicilia, Subhayan Saha","submitted_at":"2026-07-06T09:50:20Z","abstract_excerpt":"Given a nonnegative matrix $X$, a factorization rank $r$ and a real parameter $p$, entrywise power matrix factorization (EPMF) looks for a low-rank matrix $X_r$ such that $X = |X_r|^{\\circ p}$ (exact case) or $X \\approx |X_r|^{\\circ p}$ (approximate case), where $(\\cdot)^{\\circ p}$ denotes the component-wise exponent. EPMF includes the modulus model ($p=1$) and component-wise square factorization ($p=2$) as special cases, the latter being closely related to the square root rank. We analyze the computational complexity of the exact decision problem and the Frobenius-norm approximation problem, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04875","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/2607.04875/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":"2607.04875","created_at":"2026-07-07T02:20:08.752952+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04875v1","created_at":"2026-07-07T02:20:08.752952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04875","created_at":"2026-07-07T02:20:08.752952+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJG7I5Z3OC7S","created_at":"2026-07-07T02:20:08.752952+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJG7I5Z3OC7S5MDE","created_at":"2026-07-07T02:20:08.752952+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJG7I5Z3","created_at":"2026-07-07T02:20:08.752952+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/PJG7I5Z3OC7S5MDEWX7MDOT7YP","json":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP.json","graph_json":"https://pith.science/api/pith-number/PJG7I5Z3OC7S5MDEWX7MDOT7YP/graph.json","events_json":"https://pith.science/api/pith-number/PJG7I5Z3OC7S5MDEWX7MDOT7YP/events.json","paper":"https://pith.science/paper/PJG7I5Z3"},"agent_actions":{"view_html":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP","download_json":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP.json","view_paper":"https://pith.science/paper/PJG7I5Z3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04875&json=true","fetch_graph":"https://pith.science/api/pith-number/PJG7I5Z3OC7S5MDEWX7MDOT7YP/graph.json","fetch_events":"https://pith.science/api/pith-number/PJG7I5Z3OC7S5MDEWX7MDOT7YP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP/action/storage_attestation","attest_author":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP/action/author_attestation","sign_citation":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP/action/citation_signature","submit_replication":"https://pith.science/pith/PJG7I5Z3OC7S5MDEWX7MDOT7YP/action/replication_record"}},"created_at":"2026-07-07T02:20:08.752952+00:00","updated_at":"2026-07-07T02:20:08.752952+00:00"}