{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MGOFYMQZ6SAEHUIILWORZH2YNV","short_pith_number":"pith:MGOFYMQZ","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"},"canonical_sha256":"619c5c3219f48043d1085d9d1c9f586d7e57647543a483f478b7eb3f736b6e75","source":{"kind":"arxiv","id":"2502.01435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01435","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01435v1","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01435","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"MGOFYMQZ6SAE","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"pith_short_16","alias_value":"MGOFYMQZ6SAEHUII","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"pith_short_8","alias_value":"MGOFYMQZ","created_at":"2026-07-05T10:08:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MGOFYMQZ6SAEHUIILWORZH2YNV","target":"record","payload":{"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"},"canonical_sha256":"619c5c3219f48043d1085d9d1c9f586d7e57647543a483f478b7eb3f736b6e75","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"},"source_kind":"arxiv","source_id":"2502.01435","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQb7/Nd6f1WisQwOFXsvdatFxngxx10satHzkGJ7TxQuu0+k6sDiPY/+wmCIrFDyOcjWxtHTZOPmEnPp81StCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:22:38.961832Z"},"content_sha256":"b54cfde39519a2445bf63d369561da16c5a85548875a7a7835b7b68df97b6078","schema_version":"1.0","event_id":"sha256:b54cfde39519a2445bf63d369561da16c5a85548875a7a7835b7b68df97b6078"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MGOFYMQZ6SAEHUIILWORZH2YNV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQiF6Ep7o3lk3hE2pgoCo0iPPP4utCR/FImVLwTkcpb7Otl3IYhSOjO8uuP51R6ViIEs66kYNZzDZv7tZIUKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:22:38.962220Z"},"content_sha256":"76e51285e11668fc0d5da842aede085db061008579aa41788dad8cae27c679f5","schema_version":"1.0","event_id":"sha256:76e51285e11668fc0d5da842aede085db061008579aa41788dad8cae27c679f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/bundle.json","state_url":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T22:22:38Z","links":{"resolver":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV","bundle":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/bundle.json","state":"https://pith.science/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGOFYMQZ6SAEHUIILWORZH2YNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MGOFYMQZ6SAEHUIILWORZH2YNV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7eb98759d2b82c68d477b6c0c8feecc4a1f792270ec2c0c169d7af5132da6aa9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-03T15:18:18Z","title_canon_sha256":"153a3582c4d3b43dee9e05d6b1809f5118a0ee06ad5549b59253d7ebec14da60"},"schema_version":"1.0","source":{"id":"2502.01435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01435","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01435v1","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01435","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"MGOFYMQZ6SAE","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"pith_short_16","alias_value":"MGOFYMQZ6SAEHUII","created_at":"2026-07-05T10:08:55Z"},{"alias_kind":"pith_short_8","alias_value":"MGOFYMQZ","created_at":"2026-07-05T10:08:55Z"}],"graph_snapshots":[{"event_id":"sha256:76e51285e11668fc0d5da842aede085db061008579aa41788dad8cae27c679f5","target":"graph","created_at":"2026-07-05T10:08:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.01435/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-03T15:18:18Z","title":"Dense Subgraph Discovery Meets Strong Triadic Closure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01435","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b54cfde39519a2445bf63d369561da16c5a85548875a7a7835b7b68df97b6078","target":"record","created_at":"2026-07-05T10:08:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7eb98759d2b82c68d477b6c0c8feecc4a1f792270ec2c0c169d7af5132da6aa9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-03T15:18:18Z","title_canon_sha256":"153a3582c4d3b43dee9e05d6b1809f5118a0ee06ad5549b59253d7ebec14da60"},"schema_version":"1.0","source":{"id":"2502.01435","kind":"arxiv","version":1}},"canonical_sha256":"619c5c3219f48043d1085d9d1c9f586d7e57647543a483f478b7eb3f736b6e75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"619c5c3219f48043d1085d9d1c9f586d7e57647543a483f478b7eb3f736b6e75","first_computed_at":"2026-07-05T10:08:55.124239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:55.124239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQ6qkMvXd5KwDui8bxMXCQETbVWT60x5sDAu57zT4f2bbgeJUtd1YDT8mu2sewQKCYe84bATDYpcEEMTQ0ypBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:55.124738Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b54cfde39519a2445bf63d369561da16c5a85548875a7a7835b7b68df97b6078","sha256:76e51285e11668fc0d5da842aede085db061008579aa41788dad8cae27c679f5"],"state_sha256":"c9bc89f3d7e7c1442356bac16b9bd47c21628b37f1633271665ea2206c8a3e84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOPVhldnyDMBSRhd1mj2hsp/XxeUc2RFQ0q4Zr9yqQcsq2uM18cqzoo0IdQwuIdbo4sSeGi7wD+i/Tc5AhSNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:22:38.964446Z","bundle_sha256":"d761e07fa71abfbf414691f89f19662431a755ca2446ed9a8acd5241ccb7e319"}}