{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4EBSFDG7AETQU7JHCEIAX2MHRS","short_pith_number":"pith:4EBSFDG7","schema_version":"1.0","canonical_sha256":"e103228cdf01270a7d2711100be9878cb8efb0eb63251cb5dd2e3f1405b51f32","source":{"kind":"arxiv","id":"2308.15936","version":1},"attestation_state":"computed","paper":{"title":"Jaccard-constrained dense subgraph discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.DS","authors_text":"Chamalee Wickrama Arachchi, Nikolaj Tatti","submitted_at":"2023-08-30T10:33:02Z","abstract_excerpt":"Finding dense subgraphs is a core problem in graph mining with many applications in diverse domains. At the same time many real-world networks vary over time, that is, the dataset can be represented as a sequence of graph snapshots. Hence, it is natural to consider the question of finding dense subgraphs in a temporal network that are allowed to vary over time to a certain degree. In this paper, we search for dense subgraphs that have large pairwise Jaccard similarity coefficients. More formally, given a set of graph snapshots and a weight $\\lambda$, we find a collection of dense subgraphs suc"},"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":"2308.15936","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-30T10:33:02Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"a1f15893416dede9e1a59eec148b80acfe3ff50c83dc231c633c641abd35bad7","abstract_canon_sha256":"b35f3dc49658e6a8856816714954e658b6e5acf8195897e4afc4d511a7266c2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:15.683490Z","signature_b64":"udbqQvtOf4f+A1xOpilpnazhXu62BWyxapV5ugcBZpxEmLi7uLYsADF0+Yb2evUZ++s+c/DFb8lwtw5doY7LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e103228cdf01270a7d2711100be9878cb8efb0eb63251cb5dd2e3f1405b51f32","last_reissued_at":"2026-07-05T06:46:15.682886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:15.682886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jaccard-constrained dense subgraph discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.DS","authors_text":"Chamalee Wickrama Arachchi, Nikolaj Tatti","submitted_at":"2023-08-30T10:33:02Z","abstract_excerpt":"Finding dense subgraphs is a core problem in graph mining with many applications in diverse domains. At the same time many real-world networks vary over time, that is, the dataset can be represented as a sequence of graph snapshots. Hence, it is natural to consider the question of finding dense subgraphs in a temporal network that are allowed to vary over time to a certain degree. In this paper, we search for dense subgraphs that have large pairwise Jaccard similarity coefficients. More formally, given a set of graph snapshots and a weight $\\lambda$, we find a collection of dense subgraphs suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15936","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/2308.15936/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":"2308.15936","created_at":"2026-07-05T06:46:15.683117+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.15936v1","created_at":"2026-07-05T06:46:15.683117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15936","created_at":"2026-07-05T06:46:15.683117+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EBSFDG7AETQ","created_at":"2026-07-05T06:46:15.683117+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EBSFDG7AETQU7JH","created_at":"2026-07-05T06:46:15.683117+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EBSFDG7","created_at":"2026-07-05T06:46:15.683117+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01435","citing_title":"Dense Subgraph Discovery Meets Strong Triadic Closure","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS","json":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS.json","graph_json":"https://pith.science/api/pith-number/4EBSFDG7AETQU7JHCEIAX2MHRS/graph.json","events_json":"https://pith.science/api/pith-number/4EBSFDG7AETQU7JHCEIAX2MHRS/events.json","paper":"https://pith.science/paper/4EBSFDG7"},"agent_actions":{"view_html":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS","download_json":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS.json","view_paper":"https://pith.science/paper/4EBSFDG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.15936&json=true","fetch_graph":"https://pith.science/api/pith-number/4EBSFDG7AETQU7JHCEIAX2MHRS/graph.json","fetch_events":"https://pith.science/api/pith-number/4EBSFDG7AETQU7JHCEIAX2MHRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/action/storage_attestation","attest_author":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/action/author_attestation","sign_citation":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/action/citation_signature","submit_replication":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/action/replication_record"}},"created_at":"2026-07-05T06:46:15.683117+00:00","updated_at":"2026-07-05T06:46:15.683117+00:00"}