{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VX6V5H33SPPGW3AIYEASYERBYL","short_pith_number":"pith:VX6V5H33","canonical_record":{"source":{"id":"1502.00727","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"6241449bcb77af355afe348a39036abc1615d4f52e213f3fb55ce7b49a0f5601","abstract_canon_sha256":"65e424afde79ba5af78f4e029bba8c6c6aac33db19c3245517abdc8b93963c27"},"schema_version":"1.0"},"canonical_sha256":"adfd5e9f7b93de6b6c08c1012c1221c2d7467ff12dc60b1a76e8ff4630fee597","source":{"kind":"arxiv","id":"1502.00727","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00727","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00727v7","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00727","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"VX6V5H33SPPG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VX6V5H33SPPGW3AI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VX6V5H33","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VX6V5H33SPPGW3AIYEASYERBYL","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00727","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"6241449bcb77af355afe348a39036abc1615d4f52e213f3fb55ce7b49a0f5601","abstract_canon_sha256":"65e424afde79ba5af78f4e029bba8c6c6aac33db19c3245517abdc8b93963c27"},"schema_version":"1.0"},"canonical_sha256":"adfd5e9f7b93de6b6c08c1012c1221c2d7467ff12dc60b1a76e8ff4630fee597","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:24.476819Z","signature_b64":"oTDFwLPzxKJYaC9qHLYW69pe258+mzfA4eL9mHMUwLRKVZ6bN8xf7YEaxY9eQQY4fFwA89ypJVhwj79T3e44Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adfd5e9f7b93de6b6c08c1012c1221c2d7467ff12dc60b1a76e8ff4630fee597","last_reissued_at":"2026-05-18T00:04:24.476298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:24.476298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00727","source_version":7,"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-18T00:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5W74zFL2RHA2JOqw8IjaA34UqzxdDchgBPEXN1sB4iNRIgkgO9GSyzV5aK5cGseea2G6aHyDQVzv6f242OdVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:02:10.913486Z"},"content_sha256":"1b17e6e5b10b32f32b11cb974bdf9b5cdc127e6e3e22d52e094e8f0e6b2487c6","schema_version":"1.0","event_id":"sha256:1b17e6e5b10b32f32b11cb974bdf9b5cdc127e6e3e22d52e094e8f0e6b2487c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VX6V5H33SPPGW3AIYEASYERBYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Laplacian Mixture Modeling for Network Analysis and Unsupervised Learning on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Daniel Korenblum","submitted_at":"2015-02-03T03:50:16Z","abstract_excerpt":"Laplacian mixture models identify overlapping regions of influence in unlabeled graph and network data in a scalable and computationally efficient way, yielding useful low-dimensional representations. By combining Laplacian eigenspace and finite mixture modeling methods, they provide probabilistic or fuzzy dimensionality reductions or domain decompositions for a variety of input data types, including mixture distributions, feature vectors, and graphs or networks. Provable optimal recovery using the algorithm is analytically shown for a nontrivial class of cluster graphs. Heuristic approximatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00727","kind":"arxiv","version":7},"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-18T00:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NRvXEWbG3A/QESVcziL+k0HGYjKtJNVkqB8JxM7DVtaUi/F6Tbw1Wf++2luMisR3ZJThW30qdfeo3yGxtuQUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:02:10.913834Z"},"content_sha256":"3e4f47a4d44524a45c75bdbaac51386c3d4b912a09cc16e58e69cf69356bafbb","schema_version":"1.0","event_id":"sha256:3e4f47a4d44524a45c75bdbaac51386c3d4b912a09cc16e58e69cf69356bafbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VX6V5H33SPPGW3AIYEASYERBYL/bundle.json","state_url":"https://pith.science/pith/VX6V5H33SPPGW3AIYEASYERBYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VX6V5H33SPPGW3AIYEASYERBYL/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-06-23T08:02:10Z","links":{"resolver":"https://pith.science/pith/VX6V5H33SPPGW3AIYEASYERBYL","bundle":"https://pith.science/pith/VX6V5H33SPPGW3AIYEASYERBYL/bundle.json","state":"https://pith.science/pith/VX6V5H33SPPGW3AIYEASYERBYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VX6V5H33SPPGW3AIYEASYERBYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VX6V5H33SPPGW3AIYEASYERBYL","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":"65e424afde79ba5af78f4e029bba8c6c6aac33db19c3245517abdc8b93963c27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:50:16Z","title_canon_sha256":"6241449bcb77af355afe348a39036abc1615d4f52e213f3fb55ce7b49a0f5601"},"schema_version":"1.0","source":{"id":"1502.00727","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00727","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00727v7","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00727","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"VX6V5H33SPPG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VX6V5H33SPPGW3AI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VX6V5H33","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:3e4f47a4d44524a45c75bdbaac51386c3d4b912a09cc16e58e69cf69356bafbb","target":"graph","created_at":"2026-05-18T00:04:24Z","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":"Laplacian mixture models identify overlapping regions of influence in unlabeled graph and network data in a scalable and computationally efficient way, yielding useful low-dimensional representations. By combining Laplacian eigenspace and finite mixture modeling methods, they provide probabilistic or fuzzy dimensionality reductions or domain decompositions for a variety of input data types, including mixture distributions, feature vectors, and graphs or networks. Provable optimal recovery using the algorithm is analytically shown for a nontrivial class of cluster graphs. Heuristic approximatio","authors_text":"Daniel Korenblum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:50:16Z","title":"Laplacian Mixture Modeling for Network Analysis and Unsupervised Learning on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00727","kind":"arxiv","version":7},"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:1b17e6e5b10b32f32b11cb974bdf9b5cdc127e6e3e22d52e094e8f0e6b2487c6","target":"record","created_at":"2026-05-18T00:04:24Z","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":"65e424afde79ba5af78f4e029bba8c6c6aac33db19c3245517abdc8b93963c27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-03T03:50:16Z","title_canon_sha256":"6241449bcb77af355afe348a39036abc1615d4f52e213f3fb55ce7b49a0f5601"},"schema_version":"1.0","source":{"id":"1502.00727","kind":"arxiv","version":7}},"canonical_sha256":"adfd5e9f7b93de6b6c08c1012c1221c2d7467ff12dc60b1a76e8ff4630fee597","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adfd5e9f7b93de6b6c08c1012c1221c2d7467ff12dc60b1a76e8ff4630fee597","first_computed_at":"2026-05-18T00:04:24.476298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:24.476298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oTDFwLPzxKJYaC9qHLYW69pe258+mzfA4eL9mHMUwLRKVZ6bN8xf7YEaxY9eQQY4fFwA89ypJVhwj79T3e44Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:24.476819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00727","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b17e6e5b10b32f32b11cb974bdf9b5cdc127e6e3e22d52e094e8f0e6b2487c6","sha256:3e4f47a4d44524a45c75bdbaac51386c3d4b912a09cc16e58e69cf69356bafbb"],"state_sha256":"3bb7e252bb3be1703c2038f16683afd4a20252f9f62e567332196a6b7341b42e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leJyLKftnqeFP1OHvkp97suHymBUizb2ns7c4Av2a44HhzkjQes8XK+z0J7bL4+3cNunI7Znc9N30dE0pE7cBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:02:10.916100Z","bundle_sha256":"32d723e24204c26f67c6fd90e85ccad08c1347b8215e41273c62bc77017c4fdf"}}