{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GCZQGTJHF3F7VOWDCAT2VKSORG","short_pith_number":"pith:GCZQGTJH","canonical_record":{"source":{"id":"1708.02620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-08T19:40:09Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b7400e501826e2e480ce5b3d85d6a8ed2d9f57011b6bfdad457a1aa2797cadf7","abstract_canon_sha256":"e8bab9a771e3e0e64c1c7eb16fb64835ac4c0faf44992cd8d9b612870e0dd5d9"},"schema_version":"1.0"},"canonical_sha256":"30b3034d272ecbfabac31027aaaa4e89bcddbe9f4b1a1e5da5326502bac588f0","source":{"kind":"arxiv","id":"1708.02620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02620","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02620v1","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02620","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"pith_short_12","alias_value":"GCZQGTJHF3F7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GCZQGTJHF3F7VOWD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GCZQGTJH","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GCZQGTJHF3F7VOWDCAT2VKSORG","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-08T19:40:09Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b7400e501826e2e480ce5b3d85d6a8ed2d9f57011b6bfdad457a1aa2797cadf7","abstract_canon_sha256":"e8bab9a771e3e0e64c1c7eb16fb64835ac4c0faf44992cd8d9b612870e0dd5d9"},"schema_version":"1.0"},"canonical_sha256":"30b3034d272ecbfabac31027aaaa4e89bcddbe9f4b1a1e5da5326502bac588f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:20.182841Z","signature_b64":"fmGasE1zKi1nMp6c2xbq5sIeBA4VNPI6JOJV3SEmhOqbt+PJjIIEQn9Z1U55iR43W8OCLRDaMy9XgsNlpfLUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30b3034d272ecbfabac31027aaaa4e89bcddbe9f4b1a1e5da5326502bac588f0","last_reissued_at":"2026-05-18T00:38:20.182273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:20.182273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02620","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:38:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMOTggiEirVv3kY69FIdndI9dG44zG29q9oD33F+Kj/dGRkSzJSS/g+MydxRbsnLviq8L8rds+lDBQay39P0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:04:25.484598Z"},"content_sha256":"13af917c1470f8ce67b26397c7bdb70c900a94a04a24c45cd971393689787138","schema_version":"1.0","event_id":"sha256:13af917c1470f8ce67b26397c7bdb70c900a94a04a24c45cd971393689787138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GCZQGTJHF3F7VOWDCAT2VKSORG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"stat.ML","authors_text":"Alfred O. Hero, Pin-Yu Chen","submitted_at":"2017-08-08T19:40:09Z","abstract_excerpt":"Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a multilayer spectral graph clustering (SGC) framework that performs convex layer aggregation. Under a multilayer signal plus noise model, we provide a phase transition analysis of clustering reliability. Moreover, we use the phase transition criterion to propose a multilayer i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02620","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:38:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oedf0hEOwLV3iCqjEiScNyGOrbpnnASUO+gbSrIg0MT1dWMm28L8Xq9v0PlBdmPrV2FKnA646zQy6OZqiJ8yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:04:25.484963Z"},"content_sha256":"68bd3dbbf8373ebef15f118ed746e45a3d082f12ed4b440f2d1687cdcd96a0de","schema_version":"1.0","event_id":"sha256:68bd3dbbf8373ebef15f118ed746e45a3d082f12ed4b440f2d1687cdcd96a0de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCZQGTJHF3F7VOWDCAT2VKSORG/bundle.json","state_url":"https://pith.science/pith/GCZQGTJHF3F7VOWDCAT2VKSORG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCZQGTJHF3F7VOWDCAT2VKSORG/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-30T12:04:25Z","links":{"resolver":"https://pith.science/pith/GCZQGTJHF3F7VOWDCAT2VKSORG","bundle":"https://pith.science/pith/GCZQGTJHF3F7VOWDCAT2VKSORG/bundle.json","state":"https://pith.science/pith/GCZQGTJHF3F7VOWDCAT2VKSORG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCZQGTJHF3F7VOWDCAT2VKSORG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GCZQGTJHF3F7VOWDCAT2VKSORG","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":"e8bab9a771e3e0e64c1c7eb16fb64835ac4c0faf44992cd8d9b612870e0dd5d9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-08T19:40:09Z","title_canon_sha256":"b7400e501826e2e480ce5b3d85d6a8ed2d9f57011b6bfdad457a1aa2797cadf7"},"schema_version":"1.0","source":{"id":"1708.02620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02620","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02620v1","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02620","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"pith_short_12","alias_value":"GCZQGTJHF3F7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GCZQGTJHF3F7VOWD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GCZQGTJH","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:68bd3dbbf8373ebef15f118ed746e45a3d082f12ed4b440f2d1687cdcd96a0de","target":"graph","created_at":"2026-05-18T00:38:20Z","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. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a multilayer spectral graph clustering (SGC) framework that performs convex layer aggregation. Under a multilayer signal plus noise model, we provide a phase transition analysis of clustering reliability. Moreover, we use the phase transition criterion to propose a multilayer i","authors_text":"Alfred O. Hero, Pin-Yu Chen","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-08T19:40:09Z","title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02620","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:13af917c1470f8ce67b26397c7bdb70c900a94a04a24c45cd971393689787138","target":"record","created_at":"2026-05-18T00:38:20Z","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":"e8bab9a771e3e0e64c1c7eb16fb64835ac4c0faf44992cd8d9b612870e0dd5d9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-08T19:40:09Z","title_canon_sha256":"b7400e501826e2e480ce5b3d85d6a8ed2d9f57011b6bfdad457a1aa2797cadf7"},"schema_version":"1.0","source":{"id":"1708.02620","kind":"arxiv","version":1}},"canonical_sha256":"30b3034d272ecbfabac31027aaaa4e89bcddbe9f4b1a1e5da5326502bac588f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30b3034d272ecbfabac31027aaaa4e89bcddbe9f4b1a1e5da5326502bac588f0","first_computed_at":"2026-05-18T00:38:20.182273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:20.182273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmGasE1zKi1nMp6c2xbq5sIeBA4VNPI6JOJV3SEmhOqbt+PJjIIEQn9Z1U55iR43W8OCLRDaMy9XgsNlpfLUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:20.182841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13af917c1470f8ce67b26397c7bdb70c900a94a04a24c45cd971393689787138","sha256:68bd3dbbf8373ebef15f118ed746e45a3d082f12ed4b440f2d1687cdcd96a0de"],"state_sha256":"c16a14f45b428960cc8a17cfa16879fe96a4e93da96be5b3cc8c0aa4bac07d6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdNUeElvYP0oXkBJHGRXBnejwMXd3bUkUPJ2OPDDE2IZyj+yVmLcI0/Xph8KVN4fZZOi3jrSK+rJeu6Td1SdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:04:25.487027Z","bundle_sha256":"5ad83dd67f2a351ae9af238b69edcea7ebbb136d361ecc31bae873ed141daefc"}}