{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ETDQLNJEQUHN2LCN23QD52FKJA","short_pith_number":"pith:ETDQLNJE","schema_version":"1.0","canonical_sha256":"24c705b524850edd2c4dd6e03ee8aa4834583a59ef17350dcc3bc780b0a5c750","source":{"kind":"arxiv","id":"2404.10974","version":2},"attestation_state":"computed","paper":{"title":"Compressive Bayesian non-negative matrix factorization for mutational signatures analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Alessandro Zito, Jeffrey W. Miller","submitted_at":"2024-04-17T01:09:04Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is widely used in many applications for dimensionality reduction. Inferring an appropriate number of factors for NMF is a challenging problem, and several approaches based on information criteria or sparsity-inducing priors have been proposed. However, inference in these models is often complicated and computationally challenging. In this paper, we introduce a novel methodology for overfitted Bayesian NMF models using ``compressive hyperpriors'' that force unneeded factors down to negligible values while only imposing mild shrinkage on needed factors. Th"},"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":"2404.10974","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2024-04-17T01:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"0bd29f92a9dacafe779fc552d56f0e5178d434f982d62c615813c8c7f0a64dbd","abstract_canon_sha256":"f93370546126bd41c3f157010bd2089cf9350203444cb9b8997099ed6f88f2ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:39.451774Z","signature_b64":"cnK0n9WymRx7gFXoIHQxaf+Oc2xOQ4sIpUxLNlN6R7Rbyt4BaH+lGQVkH8thNj4+nquNBhPL5910dgHbI6n1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24c705b524850edd2c4dd6e03ee8aa4834583a59ef17350dcc3bc780b0a5c750","last_reissued_at":"2026-07-05T10:14:39.451304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:39.451304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressive Bayesian non-negative matrix factorization for mutational signatures analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Alessandro Zito, Jeffrey W. Miller","submitted_at":"2024-04-17T01:09:04Z","abstract_excerpt":"Non-negative matrix factorization (NMF) is widely used in many applications for dimensionality reduction. Inferring an appropriate number of factors for NMF is a challenging problem, and several approaches based on information criteria or sparsity-inducing priors have been proposed. However, inference in these models is often complicated and computationally challenging. In this paper, we introduce a novel methodology for overfitted Bayesian NMF models using ``compressive hyperpriors'' that force unneeded factors down to negligible values while only imposing mild shrinkage on needed factors. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.10974","kind":"arxiv","version":2},"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/2404.10974/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":"2404.10974","created_at":"2026-07-05T10:14:39.451361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.10974v2","created_at":"2026-07-05T10:14:39.451361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10974","created_at":"2026-07-05T10:14:39.451361+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETDQLNJEQUHN","created_at":"2026-07-05T10:14:39.451361+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETDQLNJEQUHN2LCN","created_at":"2026-07-05T10:14:39.451361+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETDQLNJE","created_at":"2026-07-05T10:14:39.451361+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07841","citing_title":"Large-scale empirical tuning and comparison of default optimizers for variational inference","ref_index":116,"is_internal_anchor":false},{"citing_arxiv_id":"2509.02772","citing_title":"Inference on covariance structure in high-dimensional multi-view data","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA","json":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA.json","graph_json":"https://pith.science/api/pith-number/ETDQLNJEQUHN2LCN23QD52FKJA/graph.json","events_json":"https://pith.science/api/pith-number/ETDQLNJEQUHN2LCN23QD52FKJA/events.json","paper":"https://pith.science/paper/ETDQLNJE"},"agent_actions":{"view_html":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA","download_json":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA.json","view_paper":"https://pith.science/paper/ETDQLNJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.10974&json=true","fetch_graph":"https://pith.science/api/pith-number/ETDQLNJEQUHN2LCN23QD52FKJA/graph.json","fetch_events":"https://pith.science/api/pith-number/ETDQLNJEQUHN2LCN23QD52FKJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/action/storage_attestation","attest_author":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/action/author_attestation","sign_citation":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/action/citation_signature","submit_replication":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/action/replication_record"}},"created_at":"2026-07-05T10:14:39.451361+00:00","updated_at":"2026-07-05T10:14:39.451361+00:00"}