{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BTRC3QH52FFS5FKXSCYFNUC7VC","short_pith_number":"pith:BTRC3QH5","schema_version":"1.0","canonical_sha256":"0ce22dc0fdd14b2e955790b056d05fa8a9d9cc2487d398df1894643ff4b4f6f8","source":{"kind":"arxiv","id":"1607.02096","version":1},"attestation_state":"computed","paper":{"title":"A k-core Decomposition Framework for Graph Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Charanpal Dhanjal, Christos Giatsidis, Dimitrios M. Thilikos, Emmanouil Kiagias, Fragkiskos D. Malliaros, Michalis Vazirgiannis, Nikolaos Tziortziotis","submitted_at":"2016-07-07T17:31:18Z","abstract_excerpt":"Graph clustering or community detection constitutes an important task for investigating the internal structure of graphs, with a plethora of applications in several domains. Traditional techniques for graph clustering, such as spectral methods, typically suffer from high time and space complexity. In this article, we present CoreCluster, an efficient graph clustering framework based on the concept of graph degeneracy, that can be used along with any known graph clustering algorithm. Our approach capitalizes on processing the graph in an hierarchical manner provided by its core expansion sequen"},"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":"1607.02096","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2016-07-07T17:31:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1a22355a84134e095afa9f693b62b8a28836353855295df9913bd2efa1868d10","abstract_canon_sha256":"e00836b8d0e5b18ed0b86edd555224930b528c0bf4e977f5ae5de439ee29f8fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:22.157055Z","signature_b64":"L58oIWSH/LdPH0Od75DuA5SbA0p+ifc2YDLDedtXhpQLSuJYtXjtrlOrbcFRg+RE40RSRFO3MqYZPjTVWrA2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ce22dc0fdd14b2e955790b056d05fa8a9d9cc2487d398df1894643ff4b4f6f8","last_reissued_at":"2026-05-18T01:11:22.156580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:22.156580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A k-core Decomposition Framework for Graph Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Charanpal Dhanjal, Christos Giatsidis, Dimitrios M. Thilikos, Emmanouil Kiagias, Fragkiskos D. Malliaros, Michalis Vazirgiannis, Nikolaos Tziortziotis","submitted_at":"2016-07-07T17:31:18Z","abstract_excerpt":"Graph clustering or community detection constitutes an important task for investigating the internal structure of graphs, with a plethora of applications in several domains. Traditional techniques for graph clustering, such as spectral methods, typically suffer from high time and space complexity. In this article, we present CoreCluster, an efficient graph clustering framework based on the concept of graph degeneracy, that can be used along with any known graph clustering algorithm. Our approach capitalizes on processing the graph in an hierarchical manner provided by its core expansion sequen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02096","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":"1607.02096","created_at":"2026-05-18T01:11:22.156648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02096v1","created_at":"2026-05-18T01:11:22.156648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02096","created_at":"2026-05-18T01:11:22.156648+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTRC3QH52FFS","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTRC3QH52FFS5FKX","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTRC3QH5","created_at":"2026-05-18T12:30:09.641336+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/BTRC3QH52FFS5FKXSCYFNUC7VC","json":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC.json","graph_json":"https://pith.science/api/pith-number/BTRC3QH52FFS5FKXSCYFNUC7VC/graph.json","events_json":"https://pith.science/api/pith-number/BTRC3QH52FFS5FKXSCYFNUC7VC/events.json","paper":"https://pith.science/paper/BTRC3QH5"},"agent_actions":{"view_html":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC","download_json":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC.json","view_paper":"https://pith.science/paper/BTRC3QH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02096&json=true","fetch_graph":"https://pith.science/api/pith-number/BTRC3QH52FFS5FKXSCYFNUC7VC/graph.json","fetch_events":"https://pith.science/api/pith-number/BTRC3QH52FFS5FKXSCYFNUC7VC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC/action/storage_attestation","attest_author":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC/action/author_attestation","sign_citation":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC/action/citation_signature","submit_replication":"https://pith.science/pith/BTRC3QH52FFS5FKXSCYFNUC7VC/action/replication_record"}},"created_at":"2026-05-18T01:11:22.156648+00:00","updated_at":"2026-05-18T01:11:22.156648+00:00"}