{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y5NEKFAYG7HRKPDAAJ7SXGD63Q","short_pith_number":"pith:Y5NEKFAY","canonical_record":{"source":{"id":"1106.2233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-11T12:43:18Z","cross_cats_sorted":["cs.CV","cs.SI","stat.ML"],"title_canon_sha256":"5bd28649c00928e4b105e1e1b8d0f6d2a6c9090582358560a02880cf2129fac8","abstract_canon_sha256":"39f5751566bfc5ba87fa80eb8f2deb2be228ec9690b758414eeb5ef2cf0549c3"},"schema_version":"1.0"},"canonical_sha256":"c75a45141837cf153c60027f2b987edc082f8b88b4edccefaa2acec2a78d57ab","source":{"kind":"arxiv","id":"1106.2233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2233","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2233v1","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2233","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y5NEKFAYG7HR","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y5NEKFAYG7HRKPDA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y5NEKFAY","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y5NEKFAYG7HRKPDAAJ7SXGD63Q","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-11T12:43:18Z","cross_cats_sorted":["cs.CV","cs.SI","stat.ML"],"title_canon_sha256":"5bd28649c00928e4b105e1e1b8d0f6d2a6c9090582358560a02880cf2129fac8","abstract_canon_sha256":"39f5751566bfc5ba87fa80eb8f2deb2be228ec9690b758414eeb5ef2cf0549c3"},"schema_version":"1.0"},"canonical_sha256":"c75a45141837cf153c60027f2b987edc082f8b88b4edccefaa2acec2a78d57ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:40.306545Z","signature_b64":"GM4uzWMTM0pJKGd1Ncgz8NwflgzU0t947iwPBNxQ5K2UWgjHua2l29KhzznzjeUjroK5O7KTVRAUAP6EUE6fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c75a45141837cf153c60027f2b987edc082f8b88b4edccefaa2acec2a78d57ab","last_reissued_at":"2026-05-18T01:34:40.305905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:40.305905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2233","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:34:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RS/ga1E+PmYHZ8pmASvPcU0QKtIuJSj9OuIKFNFe4atJFC1sYSgRLoowtlD9pjMONwQaPm/krzMCLyhfTcLtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:50:04.473708Z"},"content_sha256":"595078c24e6de1b5f3e16980c2d7ffbf73cfba51c0c7b634d89c0811a0a65e86","schema_version":"1.0","event_id":"sha256:595078c24e6de1b5f3e16980c2d7ffbf73cfba51c0c7b634d89c0811a0a65e86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y5NEKFAYG7HRKPDAAJ7SXGD63Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering with Multi-Layer Graphs: A Spectral Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nikolai Nefedov, Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong","submitted_at":"2011-06-11T12:43:18Z","abstract_excerpt":"Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address the problem of combining different layers of the multi-layer graph for improved clustering of the vertices compared to using layers independently. We propose two novel methods, which are based on joint matrix factorization and graph regularization framework respectively, to efficiently combine the spectrum of the multiple graph layers, namely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2233","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:34:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MkLC9MSP4eYS754rQx7stCBWLsnoLwB9xPGM/BF4/OCwu9ySOexqYtjhHTl6upHd4+t+6uMVSrFmZPiKTVTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:50:04.474391Z"},"content_sha256":"d1da16159cf370315876b03c808661706afc326b95ab560125db3afb70b33609","schema_version":"1.0","event_id":"sha256:d1da16159cf370315876b03c808661706afc326b95ab560125db3afb70b33609"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5NEKFAYG7HRKPDAAJ7SXGD63Q/bundle.json","state_url":"https://pith.science/pith/Y5NEKFAYG7HRKPDAAJ7SXGD63Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5NEKFAYG7HRKPDAAJ7SXGD63Q/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-07T22:50:04Z","links":{"resolver":"https://pith.science/pith/Y5NEKFAYG7HRKPDAAJ7SXGD63Q","bundle":"https://pith.science/pith/Y5NEKFAYG7HRKPDAAJ7SXGD63Q/bundle.json","state":"https://pith.science/pith/Y5NEKFAYG7HRKPDAAJ7SXGD63Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5NEKFAYG7HRKPDAAJ7SXGD63Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y5NEKFAYG7HRKPDAAJ7SXGD63Q","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":"39f5751566bfc5ba87fa80eb8f2deb2be228ec9690b758414eeb5ef2cf0549c3","cross_cats_sorted":["cs.CV","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-11T12:43:18Z","title_canon_sha256":"5bd28649c00928e4b105e1e1b8d0f6d2a6c9090582358560a02880cf2129fac8"},"schema_version":"1.0","source":{"id":"1106.2233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2233","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2233v1","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2233","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y5NEKFAYG7HR","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y5NEKFAYG7HRKPDA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y5NEKFAY","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:d1da16159cf370315876b03c808661706afc326b95ab560125db3afb70b33609","target":"graph","created_at":"2026-05-18T01:34:40Z","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":"Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address the problem of combining different layers of the multi-layer graph for improved clustering of the vertices compared to using layers independently. We propose two novel methods, which are based on joint matrix factorization and graph regularization framework respectively, to efficiently combine the spectrum of the multiple graph layers, namely","authors_text":"Nikolai Nefedov, Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong","cross_cats":["cs.CV","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-11T12:43:18Z","title":"Clustering with Multi-Layer Graphs: A Spectral Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2233","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:595078c24e6de1b5f3e16980c2d7ffbf73cfba51c0c7b634d89c0811a0a65e86","target":"record","created_at":"2026-05-18T01:34:40Z","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":"39f5751566bfc5ba87fa80eb8f2deb2be228ec9690b758414eeb5ef2cf0549c3","cross_cats_sorted":["cs.CV","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-11T12:43:18Z","title_canon_sha256":"5bd28649c00928e4b105e1e1b8d0f6d2a6c9090582358560a02880cf2129fac8"},"schema_version":"1.0","source":{"id":"1106.2233","kind":"arxiv","version":1}},"canonical_sha256":"c75a45141837cf153c60027f2b987edc082f8b88b4edccefaa2acec2a78d57ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c75a45141837cf153c60027f2b987edc082f8b88b4edccefaa2acec2a78d57ab","first_computed_at":"2026-05-18T01:34:40.305905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:40.305905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GM4uzWMTM0pJKGd1Ncgz8NwflgzU0t947iwPBNxQ5K2UWgjHua2l29KhzznzjeUjroK5O7KTVRAUAP6EUE6fAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:40.306545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:595078c24e6de1b5f3e16980c2d7ffbf73cfba51c0c7b634d89c0811a0a65e86","sha256:d1da16159cf370315876b03c808661706afc326b95ab560125db3afb70b33609"],"state_sha256":"65685708d2a8b5045a13ebdd8b5362ea86aa03049e71d40aa963eea253f6e0a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QflMAONKglayEdtbTKTJxKwAPEZf5dPGyiEF9A0eTJYssPRPSx0ONCyHJUjDJCl9e6WnBk9OsI7lneLCg5hLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:50:04.479522Z","bundle_sha256":"88fbca81f0a39dca41a99dbb41a9d5575ce7aab1bfc4f7df8bc08da1de993eb9"}}