{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:M5R5CGDQWGLITBABQRTZZM5ZUT","short_pith_number":"pith:M5R5CGDQ","canonical_record":{"source":{"id":"1610.08928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-27T19:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e3f5924834c07bd2b54468a8a1123fd91cb4bcbaef8f09ec3758a3eb56b87f2","abstract_canon_sha256":"f64d295d4cfa2e3c5fd7fe88d21e12ce40d4ce4c3b8304675cb81dde4b722bc4"},"schema_version":"1.0"},"canonical_sha256":"6763d11870b19689840184679cb3b9a4fe880d16212258905a96393cdcf4d9e7","source":{"kind":"arxiv","id":"1610.08928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08928","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08928v1","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08928","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"M5R5CGDQWGLI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M5R5CGDQWGLITBAB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M5R5CGDQ","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:M5R5CGDQWGLITBABQRTZZM5ZUT","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-27T19:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e3f5924834c07bd2b54468a8a1123fd91cb4bcbaef8f09ec3758a3eb56b87f2","abstract_canon_sha256":"f64d295d4cfa2e3c5fd7fe88d21e12ce40d4ce4c3b8304675cb81dde4b722bc4"},"schema_version":"1.0"},"canonical_sha256":"6763d11870b19689840184679cb3b9a4fe880d16212258905a96393cdcf4d9e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:06.899396Z","signature_b64":"uPLH4XbjD7F1/XrA/gXC1vXFcrVnfqco7rK+s4TLgSiAR/jp68ZtIO9fxAVlYoO/MCXKbdmhHIUdxYXRhfeaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6763d11870b19689840184679cb3b9a4fe880d16212258905a96393cdcf4d9e7","last_reissued_at":"2026-05-18T01:01:06.898737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:06.898737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08928","source_version":1,"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-05-18T01:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qdt5AnXzwjgGpHilanQfqQ1mbpSTaQwWodFz3f8xTJfU6kR4kE8eM4PSAxjE+wvmUaYx8RfreSqEHTL91vA+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:18:30.524956Z"},"content_sha256":"601c56659bf5c560262d000ec22dea8d49ceb2551194fb0185a9a5654cd3cfc8","schema_version":"1.0","event_id":"sha256:601c56659bf5c560262d000ec22dea8d49ceb2551194fb0185a9a5654cd3cfc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:M5R5CGDQWGLITBABQRTZZM5ZUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rapid Posterior Exploration in Bayesian Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Finale Doshi-Velez, M. Arjumand Masood","submitted_at":"2016-10-27T19:00:22Z","abstract_excerpt":"Non-negative Matrix Factorization (NMF) is a popular tool for data exploration. Bayesian NMF promises to also characterize uncertainty in the factorization. Unfortunately, current inference approaches such as MCMC mix slowly and tend to get stuck on single modes. We introduce a novel approach using rapidly-exploring random trees (RRTs) to asymptotically cover regions of high posterior density. These are placed in a principled Bayesian framework via an online extension to nonparametric variational inference. On experiments on real and synthetic data, we obtain greater coverage of the posterior "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08928","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":""},"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-05-18T01:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/bBf3wbUujUXVSWq8BtINVYGpLCsjoWFSEG0fGUnVazj75edCP5zD8ZiOF/Wzr4Q+SZ08l45lnWYgCN0EOgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:18:30.525333Z"},"content_sha256":"e03ca264bc68393d4e5521120f7fb8ed41e9fec3cab78f29b96d94497e34d8f5","schema_version":"1.0","event_id":"sha256:e03ca264bc68393d4e5521120f7fb8ed41e9fec3cab78f29b96d94497e34d8f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5R5CGDQWGLITBABQRTZZM5ZUT/bundle.json","state_url":"https://pith.science/pith/M5R5CGDQWGLITBABQRTZZM5ZUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5R5CGDQWGLITBABQRTZZM5ZUT/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-05-28T02:18:30Z","links":{"resolver":"https://pith.science/pith/M5R5CGDQWGLITBABQRTZZM5ZUT","bundle":"https://pith.science/pith/M5R5CGDQWGLITBABQRTZZM5ZUT/bundle.json","state":"https://pith.science/pith/M5R5CGDQWGLITBABQRTZZM5ZUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5R5CGDQWGLITBABQRTZZM5ZUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M5R5CGDQWGLITBABQRTZZM5ZUT","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":"f64d295d4cfa2e3c5fd7fe88d21e12ce40d4ce4c3b8304675cb81dde4b722bc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-27T19:00:22Z","title_canon_sha256":"8e3f5924834c07bd2b54468a8a1123fd91cb4bcbaef8f09ec3758a3eb56b87f2"},"schema_version":"1.0","source":{"id":"1610.08928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08928","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08928v1","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08928","created_at":"2026-05-18T01:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"M5R5CGDQWGLI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M5R5CGDQWGLITBAB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M5R5CGDQ","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:e03ca264bc68393d4e5521120f7fb8ed41e9fec3cab78f29b96d94497e34d8f5","target":"graph","created_at":"2026-05-18T01:01:06Z","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"},"paper":{"abstract_excerpt":"Non-negative Matrix Factorization (NMF) is a popular tool for data exploration. Bayesian NMF promises to also characterize uncertainty in the factorization. Unfortunately, current inference approaches such as MCMC mix slowly and tend to get stuck on single modes. We introduce a novel approach using rapidly-exploring random trees (RRTs) to asymptotically cover regions of high posterior density. These are placed in a principled Bayesian framework via an online extension to nonparametric variational inference. On experiments on real and synthetic data, we obtain greater coverage of the posterior ","authors_text":"Finale Doshi-Velez, M. Arjumand Masood","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-27T19:00:22Z","title":"Rapid Posterior Exploration in Bayesian Non-negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08928","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:601c56659bf5c560262d000ec22dea8d49ceb2551194fb0185a9a5654cd3cfc8","target":"record","created_at":"2026-05-18T01:01:06Z","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":"f64d295d4cfa2e3c5fd7fe88d21e12ce40d4ce4c3b8304675cb81dde4b722bc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-27T19:00:22Z","title_canon_sha256":"8e3f5924834c07bd2b54468a8a1123fd91cb4bcbaef8f09ec3758a3eb56b87f2"},"schema_version":"1.0","source":{"id":"1610.08928","kind":"arxiv","version":1}},"canonical_sha256":"6763d11870b19689840184679cb3b9a4fe880d16212258905a96393cdcf4d9e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6763d11870b19689840184679cb3b9a4fe880d16212258905a96393cdcf4d9e7","first_computed_at":"2026-05-18T01:01:06.898737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:06.898737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uPLH4XbjD7F1/XrA/gXC1vXFcrVnfqco7rK+s4TLgSiAR/jp68ZtIO9fxAVlYoO/MCXKbdmhHIUdxYXRhfeaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:06.899396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:601c56659bf5c560262d000ec22dea8d49ceb2551194fb0185a9a5654cd3cfc8","sha256:e03ca264bc68393d4e5521120f7fb8ed41e9fec3cab78f29b96d94497e34d8f5"],"state_sha256":"6042b08d8f816052334cbab580a5993e445121c3d9bb8db95247c183ba8c4528"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAXaGKzZP2EdznWF2JZh6br+7AM7ejwr6x8xwDf407AmGiwpm+v70kur1dkGD0E1UqVkMbQrUzzMJtvloeOYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:18:30.527333Z","bundle_sha256":"ef88b89725f999c76868de2a279b2360a0012b13f7e8380bf322e4c548fbefc7"}}