{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZCEEEJ4C62Q5YWECUTGQZEPSJ7","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":"1eb7e83ab42956fdf8c12a2c62503547249ebb393489cd8aa64d79bc0f668ed3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-03T02:23:30Z","title_canon_sha256":"51c701642d9bc31c8835ac8e4174c34b38d48e5b96be23f8ade20a1601267fb3"},"schema_version":"1.0","source":{"id":"1606.00950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00950","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00950v1","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00950","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZCEEEJ4C62Q5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZCEEEJ4C62Q5YWEC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZCEEEJ4C","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:cb608481dda2283b35150a356ea380f6f733032d93fe4ddcb75debde5965d500","target":"graph","created_at":"2026-05-18T01:13:00Z","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 can we find a good graph clustering of a real-world network, that allows insight into its underlying structure and also potential functions? In this paper, we introduce a new graph clustering algorithm Dcut from a density point of view. The basic idea is to envision the graph clustering as a density-cut problem, such that the vertices in the same cluster are densely connected and the vertices between clusters are sparsely connected. To identify meaningful clusters (communities) in a graph, a density-connected tree is first constructed in a local fashion. Owing to the density-connected tree","authors_text":"Jinhu Liu, Junming Shao, Qinli Yang, Stefan Kramer","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-03T02:23:30Z","title":"Graph Clustering with Density-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00950","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:3fd5c15074efde26aca8b30e4bfedc09dc385824164474e6226a63e825d4dcf2","target":"record","created_at":"2026-05-18T01:13:00Z","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":"1eb7e83ab42956fdf8c12a2c62503547249ebb393489cd8aa64d79bc0f668ed3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-03T02:23:30Z","title_canon_sha256":"51c701642d9bc31c8835ac8e4174c34b38d48e5b96be23f8ade20a1601267fb3"},"schema_version":"1.0","source":{"id":"1606.00950","kind":"arxiv","version":1}},"canonical_sha256":"c888422782f6a1dc5882a4cd0c91f24fd207a91601bd0273acc49453b3562e00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c888422782f6a1dc5882a4cd0c91f24fd207a91601bd0273acc49453b3562e00","first_computed_at":"2026-05-18T01:13:00.026871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:00.026871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iPGtSVXovKl1jUK4JrrGf2ancSN/mLSr/BIKpsWJLR6FpzSh/9caTl4bO43NO9QmOOSeCQXHa2mkvs5GGL38Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:00.027291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fd5c15074efde26aca8b30e4bfedc09dc385824164474e6226a63e825d4dcf2","sha256:cb608481dda2283b35150a356ea380f6f733032d93fe4ddcb75debde5965d500"],"state_sha256":"a399499796bfbcac80d2ff27d1d232be90c4587be02820f85d3a02701f7a670f"}