{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OPY2NIJANVK6BKWR7BWQCE5XTU","short_pith_number":"pith:OPY2NIJA","canonical_record":{"source":{"id":"1609.07200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-23T01:16:46Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"d4b480feaa1f269147b16cd0af9c54921102153b4bf9c94fe34137fff37a2871","abstract_canon_sha256":"86b0ad16a5e674b67e410878ed24f7f6436296c9960956565c8d8799380b0b24"},"schema_version":"1.0"},"canonical_sha256":"73f1a6a1206d55e0aad1f86d0113b79d25ad36306dab5fd240c7fd8efe262a61","source":{"kind":"arxiv","id":"1609.07200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07200","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07200v1","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07200","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"pith_short_12","alias_value":"OPY2NIJANVK6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPY2NIJANVK6BKWR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPY2NIJA","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OPY2NIJANVK6BKWR7BWQCE5XTU","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-23T01:16:46Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"d4b480feaa1f269147b16cd0af9c54921102153b4bf9c94fe34137fff37a2871","abstract_canon_sha256":"86b0ad16a5e674b67e410878ed24f7f6436296c9960956565c8d8799380b0b24"},"schema_version":"1.0"},"canonical_sha256":"73f1a6a1206d55e0aad1f86d0113b79d25ad36306dab5fd240c7fd8efe262a61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:21.535715Z","signature_b64":"npKxPPwL59AUKcnBC3pHlZP5jMitjWV+yF9LMwunNfU41ilSgDVbykK6ZR/MIVJ1tDhFsaZt4XpM6YM8fOjyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73f1a6a1206d55e0aad1f86d0113b79d25ad36306dab5fd240c7fd8efe262a61","last_reissued_at":"2026-05-18T00:23:21.534980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:21.534980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07200","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-18T00:23:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WvR5JbjEt7ValX1XY38tJscCPktjxnf8VldawFTP57lZ1q8EEytZoyTDmVo7w2QVWcl2Bymbzd0GazZHl/EYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:46:17.903589Z"},"content_sha256":"bf6ccc248133c0f4942ece3b635e94f71b6d623431e7de8cbbe9e49eeb342169","schema_version":"1.0","event_id":"sha256:bf6ccc248133c0f4942ece3b635e94f71b6d623431e7de8cbbe9e49eeb342169"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OPY2NIJANVK6BKWR7BWQCE5XTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alfred O. Hero III, Pin-Yu Chen","submitted_at":"2016-09-23T01:16:46Z","abstract_excerpt":"Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. New challenges arise in multilayer graph clustering for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a theoretical framework for multilayer spectral graph clustering of the nodes via convex layer aggregation. Under a novel multilayer signal plus noise model, we provide a phase transition analysis that establishes the existence of a critical value on the noise level that permits reliab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07200","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-18T00:23:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxZAAVzVivYqFDBpbB6TdWHO0BYsR7dEFtiWLUpjicYWO+3vIT3dJYulNRBDXwu7ZpM29byJP/35QTTO2tarBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:46:17.904257Z"},"content_sha256":"358394212f9018bca177f932e8b7af6a9cf389bd6bdd968369710acb1e2070dd","schema_version":"1.0","event_id":"sha256:358394212f9018bca177f932e8b7af6a9cf389bd6bdd968369710acb1e2070dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPY2NIJANVK6BKWR7BWQCE5XTU/bundle.json","state_url":"https://pith.science/pith/OPY2NIJANVK6BKWR7BWQCE5XTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPY2NIJANVK6BKWR7BWQCE5XTU/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-30T15:46:17Z","links":{"resolver":"https://pith.science/pith/OPY2NIJANVK6BKWR7BWQCE5XTU","bundle":"https://pith.science/pith/OPY2NIJANVK6BKWR7BWQCE5XTU/bundle.json","state":"https://pith.science/pith/OPY2NIJANVK6BKWR7BWQCE5XTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPY2NIJANVK6BKWR7BWQCE5XTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OPY2NIJANVK6BKWR7BWQCE5XTU","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":"86b0ad16a5e674b67e410878ed24f7f6436296c9960956565c8d8799380b0b24","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-23T01:16:46Z","title_canon_sha256":"d4b480feaa1f269147b16cd0af9c54921102153b4bf9c94fe34137fff37a2871"},"schema_version":"1.0","source":{"id":"1609.07200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07200","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07200v1","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07200","created_at":"2026-05-18T00:23:21Z"},{"alias_kind":"pith_short_12","alias_value":"OPY2NIJANVK6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPY2NIJANVK6BKWR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPY2NIJA","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:358394212f9018bca177f932e8b7af6a9cf389bd6bdd968369710acb1e2070dd","target":"graph","created_at":"2026-05-18T00:23:21Z","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":"Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. New challenges arise in multilayer graph clustering for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a theoretical framework for multilayer spectral graph clustering of the nodes via convex layer aggregation. Under a novel multilayer signal plus noise model, we provide a phase transition analysis that establishes the existence of a critical value on the noise level that permits reliab","authors_text":"Alfred O. Hero III, Pin-Yu Chen","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-23T01:16:46Z","title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07200","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:bf6ccc248133c0f4942ece3b635e94f71b6d623431e7de8cbbe9e49eeb342169","target":"record","created_at":"2026-05-18T00:23:21Z","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":"86b0ad16a5e674b67e410878ed24f7f6436296c9960956565c8d8799380b0b24","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-23T01:16:46Z","title_canon_sha256":"d4b480feaa1f269147b16cd0af9c54921102153b4bf9c94fe34137fff37a2871"},"schema_version":"1.0","source":{"id":"1609.07200","kind":"arxiv","version":1}},"canonical_sha256":"73f1a6a1206d55e0aad1f86d0113b79d25ad36306dab5fd240c7fd8efe262a61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73f1a6a1206d55e0aad1f86d0113b79d25ad36306dab5fd240c7fd8efe262a61","first_computed_at":"2026-05-18T00:23:21.534980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:21.534980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"npKxPPwL59AUKcnBC3pHlZP5jMitjWV+yF9LMwunNfU41ilSgDVbykK6ZR/MIVJ1tDhFsaZt4XpM6YM8fOjyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:21.535715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf6ccc248133c0f4942ece3b635e94f71b6d623431e7de8cbbe9e49eeb342169","sha256:358394212f9018bca177f932e8b7af6a9cf389bd6bdd968369710acb1e2070dd"],"state_sha256":"191156c8ebc7c5c10680853944b112995d5366363cca2c9292a76556272199ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCd9GYmmfDp/5iUzt4k/WBDgMp37KflABe7YCFWKkrORNv58LY9kyN2tHMqvvTR5xJvvMsY7QA+r2GQWMuyTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:46:17.907808Z","bundle_sha256":"5c1e74b44dd99bf01165d6b55321f7e745571a7d8feb993a7e2833827678dd6a"}}