{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MGOFYMQZ6SAEHUIILWORZH2YNV","short_pith_number":"pith:MGOFYMQZ","schema_version":"1.0","canonical_sha256":"619c5c3219f48043d1085d9d1c9f586d7e57647543a483f478b7eb3f736b6e75","source":{"kind":"arxiv","id":"2502.01435","version":1},"attestation_state":"computed","paper":{"title":"Dense Subgraph Discovery Meets Strong Triadic Closure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti","submitted_at":"2025-02-03T15:18:18Z","abstract_excerpt":"Finding dense subgraphs is a core problem with numerous graph mining applications such as community detection in social networks and anomaly detection. However, in many real-world networks connections are not equal. One way to label edges as either strong or weak is to use strong triadic closure~(STC). Here, if one node connects strongly with two other nodes, then those two nodes should be connected at least with a weak edge. STC-labelings are not unique and finding the maximum number of strong edges is NP-hard. In this paper, we apply STC to dense subgraph discovery. More formally, our score "},"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":"2502.01435","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-03T15:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"153a3582c4d3b43dee9e05d6b1809f5118a0ee06ad5549b59253d7ebec14da60","abstract_canon_sha256":"7eb98759d2b82c68d477b6c0c8feecc4a1f792270ec2c0c169d7af5132da6aa9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:55.124738Z","signature_b64":"kQ6qkMvXd5KwDui8bxMXCQETbVWT60x5sDAu57zT4f2bbgeJUtd1YDT8mu2sewQKCYe84bATDYpcEEMTQ0ypBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"619c5c3219f48043d1085d9d1c9f586d7e57647543a483f478b7eb3f736b6e75","last_reissued_at":"2026-07-05T10:08:55.124239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:55.124239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense Subgraph Discovery Meets Strong Triadic Closure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti","submitted_at":"2025-02-03T15:18:18Z","abstract_excerpt":"Finding dense subgraphs is a core problem with numerous graph mining applications such as community detection in social networks and anomaly detection. However, in many real-world networks connections are not equal. One way to label edges as either strong or weak is to use strong triadic closure~(STC). Here, if one node connects strongly with two other nodes, then those two nodes should be connected at least with a weak edge. STC-labelings are not unique and finding the maximum number of strong edges is NP-hard. In this paper, we apply STC to dense subgraph discovery. More formally, our score "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01435","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.01435/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.01435","created_at":"2026-07-05T10:08:55.124296+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01435v1","created_at":"2026-07-05T10:08:55.124296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01435","created_at":"2026-07-05T10:08:55.124296+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGOFYMQZ6SAE","created_at":"2026-07-05T10:08:55.124296+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGOFYMQZ6SAEHUII","created_at":"2026-07-05T10:08:55.124296+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGOFYMQZ","created_at":"2026-07-05T10:08:55.124296+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/MGOFYMQZ6SAEHUIILWORZH2YNV","json":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV.json","graph_json":"https://pith.science/api/pith-number/MGOFYMQZ6SAEHUIILWORZH2YNV/graph.json","events_json":"https://pith.science/api/pith-number/MGOFYMQZ6SAEHUIILWORZH2YNV/events.json","paper":"https://pith.science/paper/MGOFYMQZ"},"agent_actions":{"view_html":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV","download_json":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV.json","view_paper":"https://pith.science/paper/MGOFYMQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01435&json=true","fetch_graph":"https://pith.science/api/pith-number/MGOFYMQZ6SAEHUIILWORZH2YNV/graph.json","fetch_events":"https://pith.science/api/pith-number/MGOFYMQZ6SAEHUIILWORZH2YNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/action/storage_attestation","attest_author":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/action/author_attestation","sign_citation":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/action/citation_signature","submit_replication":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/action/replication_record"}},"created_at":"2026-07-05T10:08:55.124296+00:00","updated_at":"2026-07-05T10:08:55.124296+00:00"}