{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4EBSFDG7AETQU7JHCEIAX2MHRS","short_pith_number":"pith:4EBSFDG7","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"},"canonical_sha256":"e103228cdf01270a7d2711100be9878cb8efb0eb63251cb5dd2e3f1405b51f32","source":{"kind":"arxiv","id":"2308.15936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15936","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15936v1","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15936","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"4EBSFDG7AETQ","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"pith_short_16","alias_value":"4EBSFDG7AETQU7JH","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"pith_short_8","alias_value":"4EBSFDG7","created_at":"2026-07-05T06:46:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4EBSFDG7AETQU7JHCEIAX2MHRS","target":"record","payload":{"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"},"canonical_sha256":"e103228cdf01270a7d2711100be9878cb8efb0eb63251cb5dd2e3f1405b51f32","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"},"source_kind":"arxiv","source_id":"2308.15936","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-05T06:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARfzLiiVHZQsncZ91QmMfVSv4DW1oNP0H+ms/OHHg4bf2APQlW2Vp5ryagf7mSOVv6+cag/KWQRvqEccPp/WBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:16:33.519648Z"},"content_sha256":"ea20712e3acf78dc99c84d9acd9706de279c7df2c09847b3dffddea8378f9c8c","schema_version":"1.0","event_id":"sha256:ea20712e3acf78dc99c84d9acd9706de279c7df2c09847b3dffddea8378f9c8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4EBSFDG7AETQU7JHCEIAX2MHRS","target":"graph","payload":{"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"},"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-05T06:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9USLgJ+N2l9J57tti4qk3HYX1PLJZeeCtvHHO180PHnSyCPR7KRLADOQ/sIAHBCnJW+YgCaHmhQMnYY2rhiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:16:33.520243Z"},"content_sha256":"e53b399ca46d89a38ca1ac3a8500449ed157529c76eeea380faa9804ab08efb3","schema_version":"1.0","event_id":"sha256:e53b399ca46d89a38ca1ac3a8500449ed157529c76eeea380faa9804ab08efb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/bundle.json","state_url":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/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-12T15:16:33Z","links":{"resolver":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS","bundle":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/bundle.json","state":"https://pith.science/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EBSFDG7AETQU7JHCEIAX2MHRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4EBSFDG7AETQU7JHCEIAX2MHRS","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":"b35f3dc49658e6a8856816714954e658b6e5acf8195897e4afc4d511a7266c2c","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-30T10:33:02Z","title_canon_sha256":"a1f15893416dede9e1a59eec148b80acfe3ff50c83dc231c633c641abd35bad7"},"schema_version":"1.0","source":{"id":"2308.15936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15936","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15936v1","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15936","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"4EBSFDG7AETQ","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"pith_short_16","alias_value":"4EBSFDG7AETQU7JH","created_at":"2026-07-05T06:46:15Z"},{"alias_kind":"pith_short_8","alias_value":"4EBSFDG7","created_at":"2026-07-05T06:46:15Z"}],"graph_snapshots":[{"event_id":"sha256:e53b399ca46d89a38ca1ac3a8500449ed157529c76eeea380faa9804ab08efb3","target":"graph","created_at":"2026-07-05T06:46:15Z","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/2308.15936/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 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","authors_text":"Chamalee Wickrama Arachchi, Nikolaj Tatti","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-30T10:33:02Z","title":"Jaccard-constrained dense subgraph discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15936","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:ea20712e3acf78dc99c84d9acd9706de279c7df2c09847b3dffddea8378f9c8c","target":"record","created_at":"2026-07-05T06:46:15Z","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":"b35f3dc49658e6a8856816714954e658b6e5acf8195897e4afc4d511a7266c2c","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-30T10:33:02Z","title_canon_sha256":"a1f15893416dede9e1a59eec148b80acfe3ff50c83dc231c633c641abd35bad7"},"schema_version":"1.0","source":{"id":"2308.15936","kind":"arxiv","version":1}},"canonical_sha256":"e103228cdf01270a7d2711100be9878cb8efb0eb63251cb5dd2e3f1405b51f32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e103228cdf01270a7d2711100be9878cb8efb0eb63251cb5dd2e3f1405b51f32","first_computed_at":"2026-07-05T06:46:15.682886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:46:15.682886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"udbqQvtOf4f+A1xOpilpnazhXu62BWyxapV5ugcBZpxEmLi7uLYsADF0+Yb2evUZ++s+c/DFb8lwtw5doY7LAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:46:15.683490Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.15936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea20712e3acf78dc99c84d9acd9706de279c7df2c09847b3dffddea8378f9c8c","sha256:e53b399ca46d89a38ca1ac3a8500449ed157529c76eeea380faa9804ab08efb3"],"state_sha256":"ad45a3a36bba035215a621895f3abacc3586eff1f28fd602dff4bfc38ca0c062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCuyl7G/gBwT0xXKPf1TJwRQXQVTZFQgyJshcLx1x6HJJi2KwsC3iH9FG8VhajUsl2nxRhTXFBwH0dFHYeuDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T15:16:33.525394Z","bundle_sha256":"0a9ca0282bef0fa0653b72522bb17b6d7d1a35ca02dcb262b415d8956de85f38"}}