{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7QLLCT3UQPAW5IKATLZ7RD7CYB","short_pith_number":"pith:7QLLCT3U","schema_version":"1.0","canonical_sha256":"fc16b14f7483c16ea1409af3f88fe2c0431cbd80c44c99520a3f9b2eb0b9ec82","source":{"kind":"arxiv","id":"1809.02434","version":2},"attestation_state":"computed","paper":{"title":"Top-k Overlapping Densest Subgraphs: Approximation and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Giancarlo Mauri, Italo Zoppis, Mohammad Mehdi Hosseinzadeh, Riccardo Dondi","submitted_at":"2018-09-07T12:21:03Z","abstract_excerpt":"A central problem in graph mining is finding dense subgraphs, with several applications in different fields, a notable example being identifying communities. While a lot of effort has been put on the problem of finding a single dense subgraph, only recently the focus has been shifted to the problem of finding a set of densest subgraphs. Some approaches aim at finding disjoint subgraphs, while in many real-world networks communities are often overlapping. An approach introduced to find possible overlapping subgraphs is the Top-k Overlapping Densest Subgraphs problem. For a given integer k >= 1,"},"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":"1809.02434","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-07T12:21:03Z","cross_cats_sorted":["cs.CC","cs.SI"],"title_canon_sha256":"ad8d14fb812b2fa8cf9a1ad0dc24fcf80e6f0dfa16c4f2a6b2ab89f6d8e4fa1e","abstract_canon_sha256":"ef69f9839cc7eeed9bfa1235498e5080cf3d56d50a2ae46cfb26617f25e14e78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:07.439596Z","signature_b64":"C+jIoU04AFmcO6ei/o/yJqT3h3JK4p1bVZt5kPMDr1m3iCua0e9X+S0TN/EEzz/BNBXxQZM4urqtBMJ2QP2xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc16b14f7483c16ea1409af3f88fe2c0431cbd80c44c99520a3f9b2eb0b9ec82","last_reissued_at":"2026-05-17T23:55:07.439056Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:07.439056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-k Overlapping Densest Subgraphs: Approximation and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Giancarlo Mauri, Italo Zoppis, Mohammad Mehdi Hosseinzadeh, Riccardo Dondi","submitted_at":"2018-09-07T12:21:03Z","abstract_excerpt":"A central problem in graph mining is finding dense subgraphs, with several applications in different fields, a notable example being identifying communities. While a lot of effort has been put on the problem of finding a single dense subgraph, only recently the focus has been shifted to the problem of finding a set of densest subgraphs. Some approaches aim at finding disjoint subgraphs, while in many real-world networks communities are often overlapping. An approach introduced to find possible overlapping subgraphs is the Top-k Overlapping Densest Subgraphs problem. For a given integer k >= 1,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02434","kind":"arxiv","version":2},"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":"1809.02434","created_at":"2026-05-17T23:55:07.439159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02434v2","created_at":"2026-05-17T23:55:07.439159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02434","created_at":"2026-05-17T23:55:07.439159+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QLLCT3UQPAW","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QLLCT3UQPAW5IKA","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QLLCT3U","created_at":"2026-05-18T12:32:11.075285+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/7QLLCT3UQPAW5IKATLZ7RD7CYB","json":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB.json","graph_json":"https://pith.science/api/pith-number/7QLLCT3UQPAW5IKATLZ7RD7CYB/graph.json","events_json":"https://pith.science/api/pith-number/7QLLCT3UQPAW5IKATLZ7RD7CYB/events.json","paper":"https://pith.science/paper/7QLLCT3U"},"agent_actions":{"view_html":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB","download_json":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB.json","view_paper":"https://pith.science/paper/7QLLCT3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02434&json=true","fetch_graph":"https://pith.science/api/pith-number/7QLLCT3UQPAW5IKATLZ7RD7CYB/graph.json","fetch_events":"https://pith.science/api/pith-number/7QLLCT3UQPAW5IKATLZ7RD7CYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB/action/storage_attestation","attest_author":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB/action/author_attestation","sign_citation":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB/action/citation_signature","submit_replication":"https://pith.science/pith/7QLLCT3UQPAW5IKATLZ7RD7CYB/action/replication_record"}},"created_at":"2026-05-17T23:55:07.439159+00:00","updated_at":"2026-05-17T23:55:07.439159+00:00"}