{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3AVAYZ3YY2SCFEXSSXKXBX4RJL","short_pith_number":"pith:3AVAYZ3Y","canonical_record":{"source":{"id":"2008.10380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-08-21T12:21:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8226993883a7a050ccb79fe1a7b3fe365375958d149246a0d7a7d4e53efbacc3","abstract_canon_sha256":"4b1f993853e6e71bb3bd32692058e4223a77e84ffde21bb6c69da50f7784c0d0"},"schema_version":"1.0"},"canonical_sha256":"d82a0c6778c6a42292f295d570df914af1df044121f335d43cd08d22246a7acb","source":{"kind":"arxiv","id":"2008.10380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.10380","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"2008.10380v1","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.10380","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"3AVAYZ3YY2SC","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_16","alias_value":"3AVAYZ3YY2SCFEXS","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_8","alias_value":"3AVAYZ3Y","created_at":"2026-07-05T03:36:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3AVAYZ3YY2SCFEXSSXKXBX4RJL","target":"record","payload":{"canonical_record":{"source":{"id":"2008.10380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-08-21T12:21:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8226993883a7a050ccb79fe1a7b3fe365375958d149246a0d7a7d4e53efbacc3","abstract_canon_sha256":"4b1f993853e6e71bb3bd32692058e4223a77e84ffde21bb6c69da50f7784c0d0"},"schema_version":"1.0"},"canonical_sha256":"d82a0c6778c6a42292f295d570df914af1df044121f335d43cd08d22246a7acb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:36:51.587129Z","signature_b64":"QenXnUjojZ/1tXqZdq6SnV1KYmJ7SP0mLDMiHkdOYLi9deX3z2/XzRCDvbb+E7jwHu7cGngmIEV9Kqwt8VPVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82a0c6778c6a42292f295d570df914af1df044121f335d43cd08d22246a7acb","last_reissued_at":"2026-07-05T03:36:51.586636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:36:51.586636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.10380","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-07-05T03:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yD0CQ4pXZWkBqMGS0CnQuPYjX+t1fCqhIn99mA+tN1OADl4OKdmktGbaULlXNU8QUOIH9UBmsyvRa8hgvDEeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T21:10:01.200597Z"},"content_sha256":"e4ff3eccf68c382b237f67b21f5136e0c2c2b4ec6824053391d667f177d57216","schema_version":"1.0","event_id":"sha256:e4ff3eccf68c382b237f67b21f5136e0c2c2b4ec6824053391d667f177d57216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3AVAYZ3YY2SCFEXSSXKXBX4RJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Francesco Piccialli, Gang Mei, Jingzhi Tu, Lei Xiao","submitted_at":"2020-08-21T12:21:05Z","abstract_excerpt":"Clustering analysis has been widely used in trust evaluation on various complex networks such as wireless sensors networks and online social networks. Spectral clustering is one of the most commonly used algorithms for graph-structured data (networks). However, the conventional spectral clustering is inherently difficult to work with large-scale networks due to the fact that it needs computationally expensive matrix manipulations. To deal with large networks, in this paper, we propose an efficient graph clustering algorithm, KCoreMotif, specifically for large networks by exploiting k-core deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.10380","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.10380/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSTdR+uWJpE9DMFr5fJbNvpHu2p79L8iFT+G1C89r6xac7vv10eBefsk7MCAMKLnvJi9x1+6NQB/7WcJP/vICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T21:10:01.200979Z"},"content_sha256":"45fedf3d8605750767e4ede51d3046e61422052afb40a897e5dbfab3f6e73ea9","schema_version":"1.0","event_id":"sha256:45fedf3d8605750767e4ede51d3046e61422052afb40a897e5dbfab3f6e73ea9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AVAYZ3YY2SCFEXSSXKXBX4RJL/bundle.json","state_url":"https://pith.science/pith/3AVAYZ3YY2SCFEXSSXKXBX4RJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AVAYZ3YY2SCFEXSSXKXBX4RJL/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-07-08T21:10:01Z","links":{"resolver":"https://pith.science/pith/3AVAYZ3YY2SCFEXSSXKXBX4RJL","bundle":"https://pith.science/pith/3AVAYZ3YY2SCFEXSSXKXBX4RJL/bundle.json","state":"https://pith.science/pith/3AVAYZ3YY2SCFEXSSXKXBX4RJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AVAYZ3YY2SCFEXSSXKXBX4RJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3AVAYZ3YY2SCFEXSSXKXBX4RJL","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":"4b1f993853e6e71bb3bd32692058e4223a77e84ffde21bb6c69da50f7784c0d0","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-08-21T12:21:05Z","title_canon_sha256":"8226993883a7a050ccb79fe1a7b3fe365375958d149246a0d7a7d4e53efbacc3"},"schema_version":"1.0","source":{"id":"2008.10380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.10380","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"2008.10380v1","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.10380","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"3AVAYZ3YY2SC","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_16","alias_value":"3AVAYZ3YY2SCFEXS","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_8","alias_value":"3AVAYZ3Y","created_at":"2026-07-05T03:36:51Z"}],"graph_snapshots":[{"event_id":"sha256:45fedf3d8605750767e4ede51d3046e61422052afb40a897e5dbfab3f6e73ea9","target":"graph","created_at":"2026-07-05T03:36: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.10380/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering analysis has been widely used in trust evaluation on various complex networks such as wireless sensors networks and online social networks. Spectral clustering is one of the most commonly used algorithms for graph-structured data (networks). However, the conventional spectral clustering is inherently difficult to work with large-scale networks due to the fact that it needs computationally expensive matrix manipulations. To deal with large networks, in this paper, we propose an efficient graph clustering algorithm, KCoreMotif, specifically for large networks by exploiting k-core deco","authors_text":"Francesco Piccialli, Gang Mei, Jingzhi Tu, Lei Xiao","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-08-21T12:21:05Z","title":"KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.10380","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:e4ff3eccf68c382b237f67b21f5136e0c2c2b4ec6824053391d667f177d57216","target":"record","created_at":"2026-07-05T03:36: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":"4b1f993853e6e71bb3bd32692058e4223a77e84ffde21bb6c69da50f7784c0d0","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-08-21T12:21:05Z","title_canon_sha256":"8226993883a7a050ccb79fe1a7b3fe365375958d149246a0d7a7d4e53efbacc3"},"schema_version":"1.0","source":{"id":"2008.10380","kind":"arxiv","version":1}},"canonical_sha256":"d82a0c6778c6a42292f295d570df914af1df044121f335d43cd08d22246a7acb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d82a0c6778c6a42292f295d570df914af1df044121f335d43cd08d22246a7acb","first_computed_at":"2026-07-05T03:36:51.586636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:36:51.586636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QenXnUjojZ/1tXqZdq6SnV1KYmJ7SP0mLDMiHkdOYLi9deX3z2/XzRCDvbb+E7jwHu7cGngmIEV9Kqwt8VPVDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:36:51.587129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.10380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4ff3eccf68c382b237f67b21f5136e0c2c2b4ec6824053391d667f177d57216","sha256:45fedf3d8605750767e4ede51d3046e61422052afb40a897e5dbfab3f6e73ea9"],"state_sha256":"d9c62e423dcd158d9fa990fd1336bf9084e7f49a4a2b7c8d12074bcb689c47fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7X2ShC9IGxT/r5xCKABOrJJgBwKVR5lC3Nc5b3lJwWbO0sJwfXB8W/Y6XPIAIXXSRPHLUAQrmE3RrQs2+nziCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T21:10:01.203086Z","bundle_sha256":"7e8258bfa2b4941d950f4179ec4aaf2bb5a3b5f2079ad7c917f10ff09b814b17"}}