{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XUA2GW2EDY45DPAVXJST64S4BE","short_pith_number":"pith:XUA2GW2E","canonical_record":{"source":{"id":"1805.10594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-27T08:01:21Z","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"title_canon_sha256":"72c763e2e6e52e979ef4b08de71315217e33a867baba89540fbad504de26561b","abstract_canon_sha256":"bb4b0762a41ebd26d6fae8689b9d1de7ede55ba4e5350189cf900e710f05d629"},"schema_version":"1.0"},"canonical_sha256":"bd01a35b441e39d1bc15ba653f725c093c9aa7a67142bdbec63f7fa93c51a370","source":{"kind":"arxiv","id":"1805.10594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10594","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10594v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10594","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"XUA2GW2EDY45","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XUA2GW2EDY45DPAV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XUA2GW2E","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XUA2GW2EDY45DPAVXJST64S4BE","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-27T08:01:21Z","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"title_canon_sha256":"72c763e2e6e52e979ef4b08de71315217e33a867baba89540fbad504de26561b","abstract_canon_sha256":"bb4b0762a41ebd26d6fae8689b9d1de7ede55ba4e5350189cf900e710f05d629"},"schema_version":"1.0"},"canonical_sha256":"bd01a35b441e39d1bc15ba653f725c093c9aa7a67142bdbec63f7fa93c51a370","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.978622Z","signature_b64":"v4kYQv7t8XW2f8IRTzv1+MJoAVUM+fywWoNjjoymrZTJcCEf9WXlgmaFsTAge1bXh4Nk06WOCvunG6/d2UsOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd01a35b441e39d1bc15ba653f725c093c9aa7a67142bdbec63f7fa93c51a370","last_reissued_at":"2026-05-18T00:14:51.977636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.977636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10594","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:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzOx8fNu3Or8syJ3TIA3L0s4MkyaH9aduUl7wuIKmbe4g7i4iCcyZ3rm4WqjpeZUC1GCRf54W4YCAoBpyocKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:29:44.118626Z"},"content_sha256":"834b10d8d1e82e47143335b2f302da2098fef1f63072e620fb35bbaf6fce4cde","schema_version":"1.0","event_id":"sha256:834b10d8d1e82e47143335b2f302da2098fef1f63072e620fb35bbaf6fce4cde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XUA2GW2EDY45DPAVXJST64S4BE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Clustering for Multiple Sparse Networks: I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Sharmodeep Bhattacharyya, Shirshendu Chatterjee","submitted_at":"2018-05-27T08:01:21Z","abstract_excerpt":"Although much of the focus of statistical works on networks has been on static networks, multiple networks are currently becoming more common among network data sets. Usually, a number of network data sets, which share some form of connection between each other are known as multiple or multi-layer networks. We consider the problem of identifying the common community structures for multiple networks. We consider extensions of the spectral clustering methods for the multiple sparse networks, and give theoretical guarantee that the spectral clustering methods produce consistent community detectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10594","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:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJHPrBQVEyVTTi42VXxDhKE08kZMYKiILfV0Bh5GIRgEbAMQFgo+V5kG9cL6m7Sehj/iTq3ku9OGDWkCp84RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:29:44.119288Z"},"content_sha256":"6adc9c8a344beaa4fd216ec0e05427582ed9ddef0f07406b85631580d1c53626","schema_version":"1.0","event_id":"sha256:6adc9c8a344beaa4fd216ec0e05427582ed9ddef0f07406b85631580d1c53626"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUA2GW2EDY45DPAVXJST64S4BE/bundle.json","state_url":"https://pith.science/pith/XUA2GW2EDY45DPAVXJST64S4BE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUA2GW2EDY45DPAVXJST64S4BE/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-21T18:29:44Z","links":{"resolver":"https://pith.science/pith/XUA2GW2EDY45DPAVXJST64S4BE","bundle":"https://pith.science/pith/XUA2GW2EDY45DPAVXJST64S4BE/bundle.json","state":"https://pith.science/pith/XUA2GW2EDY45DPAVXJST64S4BE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUA2GW2EDY45DPAVXJST64S4BE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XUA2GW2EDY45DPAVXJST64S4BE","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":"bb4b0762a41ebd26d6fae8689b9d1de7ede55ba4e5350189cf900e710f05d629","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-27T08:01:21Z","title_canon_sha256":"72c763e2e6e52e979ef4b08de71315217e33a867baba89540fbad504de26561b"},"schema_version":"1.0","source":{"id":"1805.10594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10594","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10594v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10594","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"XUA2GW2EDY45","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XUA2GW2EDY45DPAV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XUA2GW2E","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:6adc9c8a344beaa4fd216ec0e05427582ed9ddef0f07406b85631580d1c53626","target":"graph","created_at":"2026-05-18T00:14:51Z","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":"Although much of the focus of statistical works on networks has been on static networks, multiple networks are currently becoming more common among network data sets. Usually, a number of network data sets, which share some form of connection between each other are known as multiple or multi-layer networks. We consider the problem of identifying the common community structures for multiple networks. We consider extensions of the spectral clustering methods for the multiple sparse networks, and give theoretical guarantee that the spectral clustering methods produce consistent community detectio","authors_text":"Sharmodeep Bhattacharyya, Shirshendu Chatterjee","cross_cats":["cs.SI","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-27T08:01:21Z","title":"Spectral Clustering for Multiple Sparse Networks: I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10594","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:834b10d8d1e82e47143335b2f302da2098fef1f63072e620fb35bbaf6fce4cde","target":"record","created_at":"2026-05-18T00:14:51Z","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":"bb4b0762a41ebd26d6fae8689b9d1de7ede55ba4e5350189cf900e710f05d629","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-27T08:01:21Z","title_canon_sha256":"72c763e2e6e52e979ef4b08de71315217e33a867baba89540fbad504de26561b"},"schema_version":"1.0","source":{"id":"1805.10594","kind":"arxiv","version":1}},"canonical_sha256":"bd01a35b441e39d1bc15ba653f725c093c9aa7a67142bdbec63f7fa93c51a370","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd01a35b441e39d1bc15ba653f725c093c9aa7a67142bdbec63f7fa93c51a370","first_computed_at":"2026-05-18T00:14:51.977636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:51.977636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v4kYQv7t8XW2f8IRTzv1+MJoAVUM+fywWoNjjoymrZTJcCEf9WXlgmaFsTAge1bXh4Nk06WOCvunG6/d2UsOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:51.978622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:834b10d8d1e82e47143335b2f302da2098fef1f63072e620fb35bbaf6fce4cde","sha256:6adc9c8a344beaa4fd216ec0e05427582ed9ddef0f07406b85631580d1c53626"],"state_sha256":"78f8b9c66ab07bfd59bb0278e8eddbde72d2a3f9eed63e234c0a432e264905cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Go/fM0+8amKsjDwn9ONWxeikO8vMbBweqP0ziLaIB7rr00ys0Ck90THf2oELsNXE5POTWZhj6NxE0f4oak05BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:29:44.121653Z","bundle_sha256":"a7e666958476848006bf2385e843d4f1e445b98a72160065f3a12339964a53a6"}}