{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JNUNXG4OWFTWIIBSOG3XQM6ZWE","short_pith_number":"pith:JNUNXG4O","canonical_record":{"source":{"id":"2402.08134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T00:02:05Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"2ba34aa3ff79f40058bdc650fd94cc4f3f2309b646d0fcf925008c6e1ac4dfa7","abstract_canon_sha256":"5edfb25fdd4a0c11c2495365e49ec72e6cc1c975942485aa2fee2e0c1da7e804"},"schema_version":"1.0"},"canonical_sha256":"4b68db9b8eb16764203271b77833d9b102e9fdc1cf67d84c19c45b689149cecc","source":{"kind":"arxiv","id":"2402.08134","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.08134","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"2402.08134v2","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08134","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"JNUNXG4OWFTW","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNUNXG4OWFTWIIBS","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNUNXG4O","created_at":"2026-07-05T09:41:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JNUNXG4OWFTWIIBSOG3XQM6ZWE","target":"record","payload":{"canonical_record":{"source":{"id":"2402.08134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T00:02:05Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"2ba34aa3ff79f40058bdc650fd94cc4f3f2309b646d0fcf925008c6e1ac4dfa7","abstract_canon_sha256":"5edfb25fdd4a0c11c2495365e49ec72e6cc1c975942485aa2fee2e0c1da7e804"},"schema_version":"1.0"},"canonical_sha256":"4b68db9b8eb16764203271b77833d9b102e9fdc1cf67d84c19c45b689149cecc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:31.950938Z","signature_b64":"18AQmLJKBFx+o0pxUuHFjqfxZq9lU584Q3Y4xZT/CPrJnSCq8ICI469Aatbam+ZRRB9yOop8C1rXYGuWeGxcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b68db9b8eb16764203271b77833d9b102e9fdc1cf67d84c19c45b689149cecc","last_reissued_at":"2026-07-05T09:41:31.950477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:31.950477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.08134","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-05T09:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lYaiBlh0CQ62fY4TCOWLC0fqRc5U2ntJ0Nvr3Zfsr18IVizuweQ+kkwcJq2aYw0fW45TDH0MI/tUab7WhTfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:18:17.119491Z"},"content_sha256":"05fabb709008df439207ba0f3abd44d20d7053b41fc5149de7d8224c9b11350b","schema_version":"1.0","event_id":"sha256:05fabb709008df439207ba0f3abd44d20d7053b41fc5149de7d8224c9b11350b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JNUNXG4OWFTWIIBSOG3XQM6ZWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Algorithms for Symmetric Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Grey Ballard, Haesun Park, Koby Hayashi, Sinan G. Aksoy","submitted_at":"2024-02-13T00:02:05Z","abstract_excerpt":"Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a symmetric matrix with a product of a nonnegative, low-rank matrix and its transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first algorithm uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to rapidly compute a SymNMF of the approximation. The second algorithm uses randomized leverage score sampling to approximately solve constraine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08134","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/2402.08134/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-05T09:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"646A2siVreO/r32Wl0zatbLy/kmvulYLYkFx6LYrwYwgqsZNyvdo2E4l+D1zsbp15VzsX+QcLA8wne516lu5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:18:17.120360Z"},"content_sha256":"86afa6f4f1a84934ac5da5feef66515ab653491042cc0210626c802196dab4ac","schema_version":"1.0","event_id":"sha256:86afa6f4f1a84934ac5da5feef66515ab653491042cc0210626c802196dab4ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNUNXG4OWFTWIIBSOG3XQM6ZWE/bundle.json","state_url":"https://pith.science/pith/JNUNXG4OWFTWIIBSOG3XQM6ZWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNUNXG4OWFTWIIBSOG3XQM6ZWE/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-09T02:18:17Z","links":{"resolver":"https://pith.science/pith/JNUNXG4OWFTWIIBSOG3XQM6ZWE","bundle":"https://pith.science/pith/JNUNXG4OWFTWIIBSOG3XQM6ZWE/bundle.json","state":"https://pith.science/pith/JNUNXG4OWFTWIIBSOG3XQM6ZWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNUNXG4OWFTWIIBSOG3XQM6ZWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JNUNXG4OWFTWIIBSOG3XQM6ZWE","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":"5edfb25fdd4a0c11c2495365e49ec72e6cc1c975942485aa2fee2e0c1da7e804","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T00:02:05Z","title_canon_sha256":"2ba34aa3ff79f40058bdc650fd94cc4f3f2309b646d0fcf925008c6e1ac4dfa7"},"schema_version":"1.0","source":{"id":"2402.08134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.08134","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"2402.08134v2","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08134","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"JNUNXG4OWFTW","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNUNXG4OWFTWIIBS","created_at":"2026-07-05T09:41:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNUNXG4O","created_at":"2026-07-05T09:41:31Z"}],"graph_snapshots":[{"event_id":"sha256:86afa6f4f1a84934ac5da5feef66515ab653491042cc0210626c802196dab4ac","target":"graph","created_at":"2026-07-05T09:41:31Z","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/2402.08134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a symmetric matrix with a product of a nonnegative, low-rank matrix and its transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first algorithm uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to rapidly compute a SymNMF of the approximation. The second algorithm uses randomized leverage score sampling to approximately solve constraine","authors_text":"Grey Ballard, Haesun Park, Koby Hayashi, Sinan G. Aksoy","cross_cats":["cs.NA","math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T00:02:05Z","title":"Randomized Algorithms for Symmetric Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08134","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:05fabb709008df439207ba0f3abd44d20d7053b41fc5149de7d8224c9b11350b","target":"record","created_at":"2026-07-05T09:41:31Z","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":"5edfb25fdd4a0c11c2495365e49ec72e6cc1c975942485aa2fee2e0c1da7e804","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T00:02:05Z","title_canon_sha256":"2ba34aa3ff79f40058bdc650fd94cc4f3f2309b646d0fcf925008c6e1ac4dfa7"},"schema_version":"1.0","source":{"id":"2402.08134","kind":"arxiv","version":2}},"canonical_sha256":"4b68db9b8eb16764203271b77833d9b102e9fdc1cf67d84c19c45b689149cecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b68db9b8eb16764203271b77833d9b102e9fdc1cf67d84c19c45b689149cecc","first_computed_at":"2026-07-05T09:41:31.950477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:31.950477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"18AQmLJKBFx+o0pxUuHFjqfxZq9lU584Q3Y4xZT/CPrJnSCq8ICI469Aatbam+ZRRB9yOop8C1rXYGuWeGxcDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:31.950938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.08134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05fabb709008df439207ba0f3abd44d20d7053b41fc5149de7d8224c9b11350b","sha256:86afa6f4f1a84934ac5da5feef66515ab653491042cc0210626c802196dab4ac"],"state_sha256":"19efbccf1305c1e4066d57808812f2472605495e4ca5b1dc67dfc31bdc0317bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVGYRDEBDuJeEqct6cQcWrEtFp77XDQzJNNwwzYeHTTdN3H2oHCnV9KO3kGrpLIaxBOnA4xYBoQDk8j/Avl+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:18:17.126723Z","bundle_sha256":"13bd1086e6891e2de637a796ed7a2af2af9c80f486793961be1a28fd7b96032a"}}