{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I4YNRAG43U2X3V56QTNXBARAQM","short_pith_number":"pith:I4YNRAG4","schema_version":"1.0","canonical_sha256":"4730d880dcdd357dd7be84db708220832356ed618f592d95fe985dcded8cef5b","source":{"kind":"arxiv","id":"2607.24518","version":1},"attestation_state":"computed","paper":{"title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Dhruv Desai, Jake Goldberg, Lavinia Ghita, Roman Yokunda Enzmann","submitted_at":"2026-07-27T14:56:00Z","abstract_excerpt":"Symmetric non-negative matrix factorization (SymNMF) recovers latent group structure from a dependence matrix, but its dense, quadratic-memory objective has confined prior work to moderate sizes. We present a large-scale GPU study of seven algorithm families (over 30 configurations) on absolute Pearson correlation and tail pairwise dependence matrices from Extreme Value Theory, two proxies for empirical risk-factor estimation on large portfolios. A trace-identity reformulation eliminates all $n \\times n$ intermediates, so a single GPU reaches $n \\approx 10^5$ and multi-node distribution scales"},"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.24518","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-27T14:56:00Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"801dcacd184fef67dfe22eb8a2afd12e297b5c620e45b4dabee00f11c6a4ee44","abstract_canon_sha256":"5542b8c834da9def7c4e1c490900f85a7f21fe5d2e548f0c3db175b6175c2caf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:24:07.794527Z","signature_b64":"0658wINJXOEyY95p8N3sGFRgRtYHUZkm1XxMU2pvjz3pEM9jZDtkNSJn/OkuFVBpMr5BzLGa3gl+ZohZJ8CACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4730d880dcdd357dd7be84db708220832356ed618f592d95fe985dcded8cef5b","last_reissued_at":"2026-07-28T02:24:07.793663Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:24:07.793663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Dhruv Desai, Jake Goldberg, Lavinia Ghita, Roman Yokunda Enzmann","submitted_at":"2026-07-27T14:56:00Z","abstract_excerpt":"Symmetric non-negative matrix factorization (SymNMF) recovers latent group structure from a dependence matrix, but its dense, quadratic-memory objective has confined prior work to moderate sizes. We present a large-scale GPU study of seven algorithm families (over 30 configurations) on absolute Pearson correlation and tail pairwise dependence matrices from Extreme Value Theory, two proxies for empirical risk-factor estimation on large portfolios. A trace-identity reformulation eliminates all $n \\times n$ intermediates, so a single GPU reaches $n \\approx 10^5$ and multi-node distribution scales"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24518","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.24518/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.24518","created_at":"2026-07-28T02:24:07.794111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.24518v1","created_at":"2026-07-28T02:24:07.794111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24518","created_at":"2026-07-28T02:24:07.794111+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4YNRAG43U2X","created_at":"2026-07-28T02:24:07.794111+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4YNRAG43U2X3V56","created_at":"2026-07-28T02:24:07.794111+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4YNRAG4","created_at":"2026-07-28T02:24:07.794111+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/I4YNRAG43U2X3V56QTNXBARAQM","json":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM.json","graph_json":"https://pith.science/api/pith-number/I4YNRAG43U2X3V56QTNXBARAQM/graph.json","events_json":"https://pith.science/api/pith-number/I4YNRAG43U2X3V56QTNXBARAQM/events.json","paper":"https://pith.science/paper/I4YNRAG4"},"agent_actions":{"view_html":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM","download_json":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM.json","view_paper":"https://pith.science/paper/I4YNRAG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.24518&json=true","fetch_graph":"https://pith.science/api/pith-number/I4YNRAG43U2X3V56QTNXBARAQM/graph.json","fetch_events":"https://pith.science/api/pith-number/I4YNRAG43U2X3V56QTNXBARAQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM/action/storage_attestation","attest_author":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM/action/author_attestation","sign_citation":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM/action/citation_signature","submit_replication":"https://pith.science/pith/I4YNRAG43U2X3V56QTNXBARAQM/action/replication_record"}},"created_at":"2026-07-28T02:24:07.794111+00:00","updated_at":"2026-07-28T02:24:07.794111+00:00"}