{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QIXCYOYAD5IBPGZZ3ECXLCIXYT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d1b423ea5a6a4f99ed18d45563f6421089a449054a6b4e104f51a645e724ad90","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-06-10T07:59:34Z","title_canon_sha256":"e2cfbb7bae8dde2746843013747ab9451f0768aee3e598ed1975988dd5c63604"},"schema_version":"1.0","source":{"id":"2506.08535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08535","created_at":"2026-07-05T11:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08535v1","created_at":"2026-07-05T11:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08535","created_at":"2026-07-05T11:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"QIXCYOYAD5IB","created_at":"2026-07-05T11:18:51Z"},{"alias_kind":"pith_short_16","alias_value":"QIXCYOYAD5IBPGZZ","created_at":"2026-07-05T11:18:51Z"},{"alias_kind":"pith_short_8","alias_value":"QIXCYOYA","created_at":"2026-07-05T11:18:51Z"}],"graph_snapshots":[{"event_id":"sha256:12fbdf6884cd4051a7660b64743b53a4def6d2c47cd6bbd9a1593c456c3913a0","target":"graph","created_at":"2026-07-05T11:18:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.08535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the $D$-decomposition, a non-orthogonal matrix factorization of the form $A \\approx P D Q$, where $P \\in \\mathbb{R}^{n \\times k}$, $D \\in \\mathbb{R}^{k \\times k}$, and $Q \\in \\mathbb{R}^{k \\times n}$. The decomposition is defined variationally by minimizing a regularized Frobenius loss, allowing control over rank, sparsity, and conditioning. Unlike algebraic factorizations such as LU or SVD, it is computed by alternating minimization. We establish existence and perturbation stability of the solution and show that each update has complexity $\\mathcal{O}(n^2k)$. Benchmarks against t","authors_text":"Ronald Katende","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-06-10T07:59:34Z","title":"Structured Variational $D$-Decomposition for Accurate and Stable Low-Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08535","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:de1f011ffbe51e75d690793e7dda695580b7368d3209cf1950fa0fe80c23f643","target":"record","created_at":"2026-07-05T11:18:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d1b423ea5a6a4f99ed18d45563f6421089a449054a6b4e104f51a645e724ad90","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-06-10T07:59:34Z","title_canon_sha256":"e2cfbb7bae8dde2746843013747ab9451f0768aee3e598ed1975988dd5c63604"},"schema_version":"1.0","source":{"id":"2506.08535","kind":"arxiv","version":1}},"canonical_sha256":"822e2c3b001f50179b39d905758917c4dbc45efdab28763c21c00e8962b39c15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"822e2c3b001f50179b39d905758917c4dbc45efdab28763c21c00e8962b39c15","first_computed_at":"2026-07-05T11:18:51.438513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:51.438513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qXgjMzUT7OSAuohPz8T/I8hKqRsiwSg8LaHmobn05S8PVexfbXW1sIA1mW/WGEbVaQJjy6F+S+ONmcDT6cC3Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:51.438999Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.08535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de1f011ffbe51e75d690793e7dda695580b7368d3209cf1950fa0fe80c23f643","sha256:12fbdf6884cd4051a7660b64743b53a4def6d2c47cd6bbd9a1593c456c3913a0"],"state_sha256":"9b269b658821d3f9799a33960d762f0eacadcc73297257834d953e90c5635960"}