{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EXIYQYSFKDF4B5MGTGXJDA44L5","short_pith_number":"pith:EXIYQYSF","canonical_record":{"source":{"id":"1902.04014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-02-11T17:45:22Z","cross_cats_sorted":["cs.SI","q-bio.MN"],"title_canon_sha256":"8f59305296ac5bca3cd6635f327eb29b7469278e8ce44fe6beb086d0086924d0","abstract_canon_sha256":"e49323114a5a4e7f5556b1e085fe5cbac6b774ef4eb78e75b43818c321996e9b"},"schema_version":"1.0"},"canonical_sha256":"25d188624550cbc0f58699ae91839c5f653559d4d939f8afef84601f7d19f877","source":{"kind":"arxiv","id":"1902.04014","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04014","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04014v2","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04014","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"EXIYQYSFKDF4","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXIYQYSFKDF4B5MG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXIYQYSF","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EXIYQYSFKDF4B5MGTGXJDA44L5","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-02-11T17:45:22Z","cross_cats_sorted":["cs.SI","q-bio.MN"],"title_canon_sha256":"8f59305296ac5bca3cd6635f327eb29b7469278e8ce44fe6beb086d0086924d0","abstract_canon_sha256":"e49323114a5a4e7f5556b1e085fe5cbac6b774ef4eb78e75b43818c321996e9b"},"schema_version":"1.0"},"canonical_sha256":"25d188624550cbc0f58699ae91839c5f653559d4d939f8afef84601f7d19f877","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:07.488815Z","signature_b64":"XTdSOx+w30zfsx+CuO39CBTIX5y9rAFpLxEAYy2hWrKKCz7aoe+UYY5R83lfI9eqtJNbvAwNU5OkCYd2dOEPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25d188624550cbc0f58699ae91839c5f653559d4d939f8afef84601f7d19f877","last_reissued_at":"2026-05-17T23:48:07.487522Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:07.487522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04014","source_version":2,"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-17T23:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnYbmHyfrKRK0rLeqB17jReCvoa6+UzIFhvKP0aWUk2x5H5KFdW6zK1PfKJy4gIUnDRak2sY82qBUK+FrhkJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:18.505198Z"},"content_sha256":"5bb8f13a660cb139d1ab5d1ef6577a058e0e6e5136197d82194e2b2755d0952f","schema_version":"1.0","event_id":"sha256:5bb8f13a660cb139d1ab5d1ef6577a058e0e6e5136197d82194e2b2755d0952f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EXIYQYSFKDF4B5MGTGXJDA44L5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast consensus clustering in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","q-bio.MN"],"primary_cat":"physics.soc-ph","authors_text":"Aditya Tandon, Aiiad Albeshri, Santo Fortunato, Vijey Thayananthan, Wadee Alhalabi","submitted_at":"2019-02-11T17:45:22Z","abstract_excerpt":"Algorithms for community detection are usually stochastic, leading to different partitions for different choices of random seeds. Consensus clustering has proven to be an effective technique to derive more stable and accurate partitions than the ones obtained by the direct application of the algorithm. However, the procedure requires the calculation of the consensus matrix, which can be quite dense if (some of) the clusters of the input partitions are large. Consequently, the complexity can get dangerously close to quadratic, which makes the technique inapplicable on large graphs. Here we pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04014","kind":"arxiv","version":2},"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-17T23:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxO1TNX2RU8ejgrjFOP/lnUpFgeZOQERKgxmgiPOEHzWrMD1A1d5lVyACD0Xr6YSmhmt25qSe9eKb5LBYrOhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:18.505562Z"},"content_sha256":"f4eb8ee303167d55a90d954746bb6d4547b7cc4ef18cd2d57dcb976f00b3a0ee","schema_version":"1.0","event_id":"sha256:f4eb8ee303167d55a90d954746bb6d4547b7cc4ef18cd2d57dcb976f00b3a0ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXIYQYSFKDF4B5MGTGXJDA44L5/bundle.json","state_url":"https://pith.science/pith/EXIYQYSFKDF4B5MGTGXJDA44L5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXIYQYSFKDF4B5MGTGXJDA44L5/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-02T05:25:18Z","links":{"resolver":"https://pith.science/pith/EXIYQYSFKDF4B5MGTGXJDA44L5","bundle":"https://pith.science/pith/EXIYQYSFKDF4B5MGTGXJDA44L5/bundle.json","state":"https://pith.science/pith/EXIYQYSFKDF4B5MGTGXJDA44L5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXIYQYSFKDF4B5MGTGXJDA44L5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EXIYQYSFKDF4B5MGTGXJDA44L5","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":"e49323114a5a4e7f5556b1e085fe5cbac6b774ef4eb78e75b43818c321996e9b","cross_cats_sorted":["cs.SI","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-02-11T17:45:22Z","title_canon_sha256":"8f59305296ac5bca3cd6635f327eb29b7469278e8ce44fe6beb086d0086924d0"},"schema_version":"1.0","source":{"id":"1902.04014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04014","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04014v2","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04014","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"EXIYQYSFKDF4","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXIYQYSFKDF4B5MG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXIYQYSF","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:f4eb8ee303167d55a90d954746bb6d4547b7cc4ef18cd2d57dcb976f00b3a0ee","target":"graph","created_at":"2026-05-17T23:48:07Z","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":"Algorithms for community detection are usually stochastic, leading to different partitions for different choices of random seeds. Consensus clustering has proven to be an effective technique to derive more stable and accurate partitions than the ones obtained by the direct application of the algorithm. However, the procedure requires the calculation of the consensus matrix, which can be quite dense if (some of) the clusters of the input partitions are large. Consequently, the complexity can get dangerously close to quadratic, which makes the technique inapplicable on large graphs. Here we pres","authors_text":"Aditya Tandon, Aiiad Albeshri, Santo Fortunato, Vijey Thayananthan, Wadee Alhalabi","cross_cats":["cs.SI","q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-02-11T17:45:22Z","title":"Fast consensus clustering in complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04014","kind":"arxiv","version":2},"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:5bb8f13a660cb139d1ab5d1ef6577a058e0e6e5136197d82194e2b2755d0952f","target":"record","created_at":"2026-05-17T23:48:07Z","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":"e49323114a5a4e7f5556b1e085fe5cbac6b774ef4eb78e75b43818c321996e9b","cross_cats_sorted":["cs.SI","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-02-11T17:45:22Z","title_canon_sha256":"8f59305296ac5bca3cd6635f327eb29b7469278e8ce44fe6beb086d0086924d0"},"schema_version":"1.0","source":{"id":"1902.04014","kind":"arxiv","version":2}},"canonical_sha256":"25d188624550cbc0f58699ae91839c5f653559d4d939f8afef84601f7d19f877","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25d188624550cbc0f58699ae91839c5f653559d4d939f8afef84601f7d19f877","first_computed_at":"2026-05-17T23:48:07.487522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:07.487522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XTdSOx+w30zfsx+CuO39CBTIX5y9rAFpLxEAYy2hWrKKCz7aoe+UYY5R83lfI9eqtJNbvAwNU5OkCYd2dOEPDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:07.488815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bb8f13a660cb139d1ab5d1ef6577a058e0e6e5136197d82194e2b2755d0952f","sha256:f4eb8ee303167d55a90d954746bb6d4547b7cc4ef18cd2d57dcb976f00b3a0ee"],"state_sha256":"54d68c9f67739bfcb45960acd9bff61495d1c68f81a968568651ee8380b99fe9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2Z+BHz7wbyTWd2gZ8FxJsguXz72E1ouaRTcsGq+zkwDUVdlLc62YWZGISyBt7jQ6g2AmZSfbITiZ0eOAoy9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:25:18.507510Z","bundle_sha256":"6ce971f5aebad1ca6c4ef4a60d9ed52cb1f44fdfcbd76ef535c3991ef0f758de"}}