{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2UF7S7N32GBJYJDAI4ALWPBLD3","short_pith_number":"pith:2UF7S7N3","canonical_record":{"source":{"id":"1511.06820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-11-21T02:57:41Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"9be00150c52641218cf9b0e645b5297af1d2028b527645743d10c2e62e7d30a6","abstract_canon_sha256":"78ed1935016600c647879257c589ed5cafc67bb1eaf739c0ec477bfaba6d6437"},"schema_version":"1.0"},"canonical_sha256":"d50bf97dbbd1829c24604700bb3c2b1edf4b0b2df6b9ef4bdd37c5ac3abf5cbd","source":{"kind":"arxiv","id":"1511.06820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06820","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06820v1","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06820","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"2UF7S7N32GBJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UF7S7N32GBJYJDA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UF7S7N3","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2UF7S7N32GBJYJDAI4ALWPBLD3","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-11-21T02:57:41Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"9be00150c52641218cf9b0e645b5297af1d2028b527645743d10c2e62e7d30a6","abstract_canon_sha256":"78ed1935016600c647879257c589ed5cafc67bb1eaf739c0ec477bfaba6d6437"},"schema_version":"1.0"},"canonical_sha256":"d50bf97dbbd1829c24604700bb3c2b1edf4b0b2df6b9ef4bdd37c5ac3abf5cbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:17.447443Z","signature_b64":"4JFeXbjGNXkMAtO+tirbzOdUofE7Tlodm64bZs6wY9GM93Sv3pfn0azjoN3lfU+SHlDtKeHBlk2XgMbSD8xnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d50bf97dbbd1829c24604700bb3c2b1edf4b0b2df6b9ef4bdd37c5ac3abf5cbd","last_reissued_at":"2026-05-18T01:26:17.446931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:17.446931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06820","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-18T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F81+lAiLLX1klSza8tlhbH1/nVpFYpZNiOL8tdNnfP3RIEYfIbGEHO9NN6OaZmWXr88pibfJOXlxne+IeEjsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:27:50.767061Z"},"content_sha256":"610470fffaa82cd9adeca073e6406cbfcc0a2759b47af6da2eeb292963c0ef15","schema_version":"1.0","event_id":"sha256:610470fffaa82cd9adeca073e6406cbfcc0a2759b47af6da2eeb292963c0ef15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2UF7S7N32GBJYJDAI4ALWPBLD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Empirical Comparison of the Summarization Power of Graph Clustering Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Danai Koutra, Neil Shah, Yike Liu","submitted_at":"2015-11-21T02:57:41Z","abstract_excerpt":"How do graph clustering techniques compare with respect to their summarization power? How well can they summarize a million-node graph with a few representative structures? Graph clustering or community detection algorithms can summarize a graph in terms of coherent and tightly connected clusters. In this paper, we compare and contrast different techniques: METIS, Louvain, spectral clustering, SlashBurn and KCBC, our proposed k-core-based clustering method. Unlike prior work that focuses on various measures of cluster quality, we use vocabulary structures that often appear in real graphs and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06820","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-18T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Nc5kvUutduqhAncqzJDRz7UuaT3r/u9rLQiWgupEogoFgmDbtfOuTMhewz+UUY/5Q9Ckr5+gY7f+/ye/JeRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:27:50.767762Z"},"content_sha256":"66d1d9e67341c8f4772d70d0c185d21fdd5471a14062fed5a52370ee041773dc","schema_version":"1.0","event_id":"sha256:66d1d9e67341c8f4772d70d0c185d21fdd5471a14062fed5a52370ee041773dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UF7S7N32GBJYJDAI4ALWPBLD3/bundle.json","state_url":"https://pith.science/pith/2UF7S7N32GBJYJDAI4ALWPBLD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UF7S7N32GBJYJDAI4ALWPBLD3/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-06T08:27:50Z","links":{"resolver":"https://pith.science/pith/2UF7S7N32GBJYJDAI4ALWPBLD3","bundle":"https://pith.science/pith/2UF7S7N32GBJYJDAI4ALWPBLD3/bundle.json","state":"https://pith.science/pith/2UF7S7N32GBJYJDAI4ALWPBLD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UF7S7N32GBJYJDAI4ALWPBLD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2UF7S7N32GBJYJDAI4ALWPBLD3","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":"78ed1935016600c647879257c589ed5cafc67bb1eaf739c0ec477bfaba6d6437","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-11-21T02:57:41Z","title_canon_sha256":"9be00150c52641218cf9b0e645b5297af1d2028b527645743d10c2e62e7d30a6"},"schema_version":"1.0","source":{"id":"1511.06820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06820","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06820v1","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06820","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"2UF7S7N32GBJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UF7S7N32GBJYJDA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UF7S7N3","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:66d1d9e67341c8f4772d70d0c185d21fdd5471a14062fed5a52370ee041773dc","target":"graph","created_at":"2026-05-18T01:26:17Z","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":"How do graph clustering techniques compare with respect to their summarization power? How well can they summarize a million-node graph with a few representative structures? Graph clustering or community detection algorithms can summarize a graph in terms of coherent and tightly connected clusters. In this paper, we compare and contrast different techniques: METIS, Louvain, spectral clustering, SlashBurn and KCBC, our proposed k-core-based clustering method. Unlike prior work that focuses on various measures of cluster quality, we use vocabulary structures that often appear in real graphs and t","authors_text":"Danai Koutra, Neil Shah, Yike Liu","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-11-21T02:57:41Z","title":"An Empirical Comparison of the Summarization Power of Graph Clustering Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06820","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:610470fffaa82cd9adeca073e6406cbfcc0a2759b47af6da2eeb292963c0ef15","target":"record","created_at":"2026-05-18T01:26:17Z","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":"78ed1935016600c647879257c589ed5cafc67bb1eaf739c0ec477bfaba6d6437","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-11-21T02:57:41Z","title_canon_sha256":"9be00150c52641218cf9b0e645b5297af1d2028b527645743d10c2e62e7d30a6"},"schema_version":"1.0","source":{"id":"1511.06820","kind":"arxiv","version":1}},"canonical_sha256":"d50bf97dbbd1829c24604700bb3c2b1edf4b0b2df6b9ef4bdd37c5ac3abf5cbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d50bf97dbbd1829c24604700bb3c2b1edf4b0b2df6b9ef4bdd37c5ac3abf5cbd","first_computed_at":"2026-05-18T01:26:17.446931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:17.446931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JFeXbjGNXkMAtO+tirbzOdUofE7Tlodm64bZs6wY9GM93Sv3pfn0azjoN3lfU+SHlDtKeHBlk2XgMbSD8xnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:17.447443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:610470fffaa82cd9adeca073e6406cbfcc0a2759b47af6da2eeb292963c0ef15","sha256:66d1d9e67341c8f4772d70d0c185d21fdd5471a14062fed5a52370ee041773dc"],"state_sha256":"8d235d87c9d9b5cafa996ba3784f164f62d228b26bea44448fefdb5f867ac71f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWHsyt9TSvhA+paLt+az8hzqHVXtLoVRtx2FhvdFClRwSmM88KkNMdQaiyS4yW8JZ4WmArwfXgflj6/mMeOhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:27:50.771432Z","bundle_sha256":"6901c35ca41ae2d8c114e1e511d61d6826ea864c8d1e3fe3dca7de76d0cf5daa"}}