{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RLHQZSFVO6BGE3QJFISSZHMLM5","short_pith_number":"pith:RLHQZSFV","schema_version":"1.0","canonical_sha256":"8acf0cc8b57782626e092a252c9d8b6775658acf6cde0976a0224988012a0520","source":{"kind":"arxiv","id":"1802.06775","version":1},"attestation_state":"computed","paper":{"title":"Mining Density Contrast Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Enhong Chen, Jian Pei, Lingyang Chu, Yanyan Zhang, Yu Yang, Zhefeng Wang","submitted_at":"2018-02-18T01:42:08Z","abstract_excerpt":"Dense subgraph discovery is a key primitive in many graph mining applications, such as detecting communities in social networks and mining gene correlation from biological data. Most studies on dense subgraph mining only deal with one graph. However, in many applications, we have more than one graph describing relations among a same group of entities. In this paper, given two graphs sharing the same set of vertices, we investigate the problem of detecting subgraphs that contrast the most with respect to density. We call such subgraphs Density Contrast Subgraphs, or DCS in short. Two widely use"},"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":"1802.06775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-18T01:42:08Z","cross_cats_sorted":[],"title_canon_sha256":"59e85367c4573e0be7fdff622bfaac8bc4f1ee5a59af60f3dbfc07ea586c3f0d","abstract_canon_sha256":"495e96fbf885a61a8954b714742a78f95a9ee996770d2a76b0e0716df33782cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:54.319546Z","signature_b64":"u5rpSR084SA5AgvOG0L/Casg0jd66INwQGcjykdHWIQT1aNB9XzidyiuA4h57jhpTPAHXAwDgRJQworsljOGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8acf0cc8b57782626e092a252c9d8b6775658acf6cde0976a0224988012a0520","last_reissued_at":"2026-05-18T00:22:54.319145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:54.319145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mining Density Contrast Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Enhong Chen, Jian Pei, Lingyang Chu, Yanyan Zhang, Yu Yang, Zhefeng Wang","submitted_at":"2018-02-18T01:42:08Z","abstract_excerpt":"Dense subgraph discovery is a key primitive in many graph mining applications, such as detecting communities in social networks and mining gene correlation from biological data. Most studies on dense subgraph mining only deal with one graph. However, in many applications, we have more than one graph describing relations among a same group of entities. In this paper, given two graphs sharing the same set of vertices, we investigate the problem of detecting subgraphs that contrast the most with respect to density. We call such subgraphs Density Contrast Subgraphs, or DCS in short. Two widely use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06775","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":"1802.06775","created_at":"2026-05-18T00:22:54.319210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06775v1","created_at":"2026-05-18T00:22:54.319210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06775","created_at":"2026-05-18T00:22:54.319210+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLHQZSFVO6BG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLHQZSFVO6BGE3QJ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLHQZSFV","created_at":"2026-05-18T12:32:50.500415+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/RLHQZSFVO6BGE3QJFISSZHMLM5","json":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5.json","graph_json":"https://pith.science/api/pith-number/RLHQZSFVO6BGE3QJFISSZHMLM5/graph.json","events_json":"https://pith.science/api/pith-number/RLHQZSFVO6BGE3QJFISSZHMLM5/events.json","paper":"https://pith.science/paper/RLHQZSFV"},"agent_actions":{"view_html":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5","download_json":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5.json","view_paper":"https://pith.science/paper/RLHQZSFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06775&json=true","fetch_graph":"https://pith.science/api/pith-number/RLHQZSFVO6BGE3QJFISSZHMLM5/graph.json","fetch_events":"https://pith.science/api/pith-number/RLHQZSFVO6BGE3QJFISSZHMLM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5/action/storage_attestation","attest_author":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5/action/author_attestation","sign_citation":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5/action/citation_signature","submit_replication":"https://pith.science/pith/RLHQZSFVO6BGE3QJFISSZHMLM5/action/replication_record"}},"created_at":"2026-05-18T00:22:54.319210+00:00","updated_at":"2026-05-18T00:22:54.319210+00:00"}