{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZCEEEJ4C62Q5YWECUTGQZEPSJ7","short_pith_number":"pith:ZCEEEJ4C","schema_version":"1.0","canonical_sha256":"c888422782f6a1dc5882a4cd0c91f24fd207a91601bd0273acc49453b3562e00","source":{"kind":"arxiv","id":"1606.00950","version":1},"attestation_state":"computed","paper":{"title":"Graph Clustering with Density-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jinhu Liu, Junming Shao, Qinli Yang, Stefan Kramer","submitted_at":"2016-06-03T02:23:30Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.00950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-03T02:23:30Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"51c701642d9bc31c8835ac8e4174c34b38d48e5b96be23f8ade20a1601267fb3","abstract_canon_sha256":"1eb7e83ab42956fdf8c12a2c62503547249ebb393489cd8aa64d79bc0f668ed3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:00.027291Z","signature_b64":"iPGtSVXovKl1jUK4JrrGf2ancSN/mLSr/BIKpsWJLR6FpzSh/9caTl4bO43NO9QmOOSeCQXHa2mkvs5GGL38Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c888422782f6a1dc5882a4cd0c91f24fd207a91601bd0273acc49453b3562e00","last_reissued_at":"2026-05-18T01:13:00.026871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:00.026871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Clustering with Density-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jinhu Liu, Junming Shao, Qinli Yang, Stefan Kramer","submitted_at":"2016-06-03T02:23:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00950","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00950","created_at":"2026-05-18T01:13:00.026944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00950v1","created_at":"2026-05-18T01:13:00.026944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00950","created_at":"2026-05-18T01:13:00.026944+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCEEEJ4C62Q5","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCEEEJ4C62Q5YWEC","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCEEEJ4C","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7","json":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7.json","graph_json":"https://pith.science/api/pith-number/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/graph.json","events_json":"https://pith.science/api/pith-number/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/events.json","paper":"https://pith.science/paper/ZCEEEJ4C"},"agent_actions":{"view_html":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7","download_json":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7.json","view_paper":"https://pith.science/paper/ZCEEEJ4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00950&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/action/storage_attestation","attest_author":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/action/author_attestation","sign_citation":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/action/citation_signature","submit_replication":"https://pith.science/pith/ZCEEEJ4C62Q5YWECUTGQZEPSJ7/action/replication_record"}},"created_at":"2026-05-18T01:13:00.026944+00:00","updated_at":"2026-05-18T01:13:00.026944+00:00"}