{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ETDQLNJEQUHN2LCN23QD52FKJA","short_pith_number":"pith:ETDQLNJE","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"},"canonical_sha256":"24c705b524850edd2c4dd6e03ee8aa4834583a59ef17350dcc3bc780b0a5c750","source":{"kind":"arxiv","id":"2404.10974","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.10974","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"arxiv_version","alias_value":"2404.10974v2","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10974","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"pith_short_12","alias_value":"ETDQLNJEQUHN","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"pith_short_16","alias_value":"ETDQLNJEQUHN2LCN","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"pith_short_8","alias_value":"ETDQLNJE","created_at":"2026-07-05T10:14:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ETDQLNJEQUHN2LCN23QD52FKJA","target":"record","payload":{"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"},"canonical_sha256":"24c705b524850edd2c4dd6e03ee8aa4834583a59ef17350dcc3bc780b0a5c750","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"},"source_kind":"arxiv","source_id":"2404.10974","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:14:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QD0TrEfsc14FApsNLMGnT/ouPHnyqCsdLQ/T/dZvvMgNtqD3gKxL18/9LYvX5PUKV2Q5pf9RF7SAHQcawDGkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:55:55.461391Z"},"content_sha256":"dd2e08da8f8269898134d58790fca0b373290c97c44da75c39f01c0238232b8e","schema_version":"1.0","event_id":"sha256:dd2e08da8f8269898134d58790fca0b373290c97c44da75c39f01c0238232b8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ETDQLNJEQUHN2LCN23QD52FKJA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:14:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A54mPC4PUybVPYLrtr7nkHo/o+OUzVGFLLoDlNMbRaOXBb0uzPK7/rjjr3IcWvHXvtdgac9fUmFj2n/IrzfRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:55:55.461875Z"},"content_sha256":"3f2943ea9dda8dce09f12b2d12abbdf5e9dca898da69dd8bf1e7253be2767aa6","schema_version":"1.0","event_id":"sha256:3f2943ea9dda8dce09f12b2d12abbdf5e9dca898da69dd8bf1e7253be2767aa6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/bundle.json","state_url":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETDQLNJEQUHN2LCN23QD52FKJA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T13:55:55Z","links":{"resolver":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA","bundle":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/bundle.json","state":"https://pith.science/pith/ETDQLNJEQUHN2LCN23QD52FKJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETDQLNJEQUHN2LCN23QD52FKJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ETDQLNJEQUHN2LCN23QD52FKJA","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":"f93370546126bd41c3f157010bd2089cf9350203444cb9b8997099ed6f88f2ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2024-04-17T01:09:04Z","title_canon_sha256":"0bd29f92a9dacafe779fc552d56f0e5178d434f982d62c615813c8c7f0a64dbd"},"schema_version":"1.0","source":{"id":"2404.10974","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.10974","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"arxiv_version","alias_value":"2404.10974v2","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10974","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"pith_short_12","alias_value":"ETDQLNJEQUHN","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"pith_short_16","alias_value":"ETDQLNJEQUHN2LCN","created_at":"2026-07-05T10:14:39Z"},{"alias_kind":"pith_short_8","alias_value":"ETDQLNJE","created_at":"2026-07-05T10:14:39Z"}],"graph_snapshots":[{"event_id":"sha256:3f2943ea9dda8dce09f12b2d12abbdf5e9dca898da69dd8bf1e7253be2767aa6","target":"graph","created_at":"2026-07-05T10:14:39Z","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/2404.10974/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alessandro Zito, Jeffrey W. Miller","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2024-04-17T01:09:04Z","title":"Compressive Bayesian non-negative matrix factorization for mutational signatures analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.10974","kind":"arxiv","version":2},"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:dd2e08da8f8269898134d58790fca0b373290c97c44da75c39f01c0238232b8e","target":"record","created_at":"2026-07-05T10:14:39Z","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":"f93370546126bd41c3f157010bd2089cf9350203444cb9b8997099ed6f88f2ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2024-04-17T01:09:04Z","title_canon_sha256":"0bd29f92a9dacafe779fc552d56f0e5178d434f982d62c615813c8c7f0a64dbd"},"schema_version":"1.0","source":{"id":"2404.10974","kind":"arxiv","version":2}},"canonical_sha256":"24c705b524850edd2c4dd6e03ee8aa4834583a59ef17350dcc3bc780b0a5c750","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24c705b524850edd2c4dd6e03ee8aa4834583a59ef17350dcc3bc780b0a5c750","first_computed_at":"2026-07-05T10:14:39.451304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:39.451304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cnK0n9WymRx7gFXoIHQxaf+Oc2xOQ4sIpUxLNlN6R7Rbyt4BaH+lGQVkH8thNj4+nquNBhPL5910dgHbI6n1Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:39.451774Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.10974","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd2e08da8f8269898134d58790fca0b373290c97c44da75c39f01c0238232b8e","sha256:3f2943ea9dda8dce09f12b2d12abbdf5e9dca898da69dd8bf1e7253be2767aa6"],"state_sha256":"df2647d7db40c4b319a628d726b887818f0489bfa5ce442a2588ee893c6ac266"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2MFmmjEDSy2tQhIvKW4AtQFw2sxH5SlNWyGsHG5eISG35pssj6rmfiIUdq8n9CkewpQnAH/VEQml5psblUNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:55:55.466367Z","bundle_sha256":"ac8b472ae8c76bf8ad2009bc9e7537f979d71fcd2d5e1378356ff3678d20d575"}}