{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S2AQZYJQYVQEIWN3JOSW52YMBD","short_pith_number":"pith:S2AQZYJQ","schema_version":"1.0","canonical_sha256":"96810ce130c5604459bb4ba56eeb0c08d49a9576f8a3ab9a3b0a446c01144d2a","source":{"kind":"arxiv","id":"1709.09471","version":3},"attestation_state":"computed","paper":{"title":"Diversified Coherent Core Search on Multi-Layer Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jianzhong Li, Rong Zhu, Zhaonian Zou","submitted_at":"2017-09-27T12:23:54Z","abstract_excerpt":"Mining dense subgraphs on multi-layer graphs is an interesting problem, which has witnessed lots of applications in practice. To overcome the limitations of the quasi-clique-based approach, we propose d-coherent core (d-CC), a new notion of dense subgraph on multi-layer graphs, which has several elegant properties. We formalize the diversified coherent core search (DCCS) problem, which finds k d-CCs that can cover the largest number of vertices. We propose a greedy algorithm with an approximation ratio of 1 - 1/e and two search algorithms with an approximation ratio of 1/4. The experiments ver"},"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":"1709.09471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-27T12:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"fef3cd88092bc95c764ebe8c1d1973628864f869bbcb7363b1b9d60f4e1e6a4f","abstract_canon_sha256":"d252b9ed97acf19d2a3ba910b8cb5feda2283d54c46fa22b85d603a28e23b41b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:58.253839Z","signature_b64":"ntuknvw04zbQgVnBPCuA8/xtVBr2XItJfOR3PX4vTZjo9ydzYHl/fue/9MKeW07ua5KwvmcAY6PfQKAExxtFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96810ce130c5604459bb4ba56eeb0c08d49a9576f8a3ab9a3b0a446c01144d2a","last_reissued_at":"2026-05-18T00:33:58.252872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:58.252872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diversified Coherent Core Search on Multi-Layer Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jianzhong Li, Rong Zhu, Zhaonian Zou","submitted_at":"2017-09-27T12:23:54Z","abstract_excerpt":"Mining dense subgraphs on multi-layer graphs is an interesting problem, which has witnessed lots of applications in practice. To overcome the limitations of the quasi-clique-based approach, we propose d-coherent core (d-CC), a new notion of dense subgraph on multi-layer graphs, which has several elegant properties. We formalize the diversified coherent core search (DCCS) problem, which finds k d-CCs that can cover the largest number of vertices. We propose a greedy algorithm with an approximation ratio of 1 - 1/e and two search algorithms with an approximation ratio of 1/4. The experiments ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09471","kind":"arxiv","version":3},"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":"1709.09471","created_at":"2026-05-18T00:33:58.253006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09471v3","created_at":"2026-05-18T00:33:58.253006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09471","created_at":"2026-05-18T00:33:58.253006+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2AQZYJQYVQE","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2AQZYJQYVQEIWN3","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2AQZYJQ","created_at":"2026-05-18T12:31:43.269735+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/S2AQZYJQYVQEIWN3JOSW52YMBD","json":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD.json","graph_json":"https://pith.science/api/pith-number/S2AQZYJQYVQEIWN3JOSW52YMBD/graph.json","events_json":"https://pith.science/api/pith-number/S2AQZYJQYVQEIWN3JOSW52YMBD/events.json","paper":"https://pith.science/paper/S2AQZYJQ"},"agent_actions":{"view_html":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD","download_json":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD.json","view_paper":"https://pith.science/paper/S2AQZYJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09471&json=true","fetch_graph":"https://pith.science/api/pith-number/S2AQZYJQYVQEIWN3JOSW52YMBD/graph.json","fetch_events":"https://pith.science/api/pith-number/S2AQZYJQYVQEIWN3JOSW52YMBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/action/storage_attestation","attest_author":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/action/author_attestation","sign_citation":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/action/citation_signature","submit_replication":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/action/replication_record"}},"created_at":"2026-05-18T00:33:58.253006+00:00","updated_at":"2026-05-18T00:33:58.253006+00:00"}