{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JRZYRE7O2XPDV63IBJR6SKNMD4","short_pith_number":"pith:JRZYRE7O","canonical_record":{"source":{"id":"1802.06361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T10:52:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"202da74b5229587076b77805091ccc90324c58f7564bb16eddc4cebb7f6996eb","abstract_canon_sha256":"b2c5c2512a8c12884d8b1de2d05aaa43f16e61e5e214260994d8b0b1c1426513"},"schema_version":"1.0"},"canonical_sha256":"4c738893eed5de3afb680a63e929ac1f29ee98282181f24c89036ac100a0c982","source":{"kind":"arxiv","id":"1802.06361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06361","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06361v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06361","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"JRZYRE7O2XPD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JRZYRE7O2XPDV63I","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JRZYRE7O","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JRZYRE7O2XPDV63IBJR6SKNMD4","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T10:52:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"202da74b5229587076b77805091ccc90324c58f7564bb16eddc4cebb7f6996eb","abstract_canon_sha256":"b2c5c2512a8c12884d8b1de2d05aaa43f16e61e5e214260994d8b0b1c1426513"},"schema_version":"1.0"},"canonical_sha256":"4c738893eed5de3afb680a63e929ac1f29ee98282181f24c89036ac100a0c982","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.493562Z","signature_b64":"fZQ59zEuUjaGFqYASkTiOPo5CERquTMBNWphTE2WPPSJ9c7JV/Knb3Fm40fGT1iJZTayqCQCwn8qS64EuWCrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c738893eed5de3afb680a63e929ac1f29ee98282181f24c89036ac100a0c982","last_reissued_at":"2026-05-18T00:23:03.493006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.493006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06361","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-05-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvu/614snhOmhg0ljeeNsR/N7EkWN5/ti1i3cU4VuQcakeQViSEEboplKVLAvGW4MlnMmatGV8sThRpM2OrwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:02:57.576907Z"},"content_sha256":"190f694d6538252d18cb77410731fbb03bba92c3d58e2e453c3905c53e67fef9","schema_version":"1.0","event_id":"sha256:190f694d6538252d18cb77410731fbb03bba92c3d58e2e453c3905c53e67fef9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JRZYRE7O2XPDV63IBJR6SKNMD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Finding Dense Common Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jimmy Wu, Moses Charikar, Yonatan Naamad","submitted_at":"2018-02-18T10:52:52Z","abstract_excerpt":"We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the subgraphs induced by $S$ in each of the given graphs. Different choices for the aggregation function give rise to variants of the problem that were studied recently. We settle many of the questions left open by previous works, showing NP-hardness, hardness of approximation, non-trivial approximation algorithms, and an integrality gap for a natural relaxation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06361","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":""},"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-05-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAyjp7n5+JWEN7nAUs9CGji4SpqtfaabvmVo74uE52ZD5rMpSb30zmGN87duZTBbGADFk6r3ncVQ9sQEkFzIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:02:57.577512Z"},"content_sha256":"92c5fff7c6ec0a5c6336e156699b15252df577e32491f3c91794f1569c671ff5","schema_version":"1.0","event_id":"sha256:92c5fff7c6ec0a5c6336e156699b15252df577e32491f3c91794f1569c671ff5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRZYRE7O2XPDV63IBJR6SKNMD4/bundle.json","state_url":"https://pith.science/pith/JRZYRE7O2XPDV63IBJR6SKNMD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRZYRE7O2XPDV63IBJR6SKNMD4/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-12T20:02:57Z","links":{"resolver":"https://pith.science/pith/JRZYRE7O2XPDV63IBJR6SKNMD4","bundle":"https://pith.science/pith/JRZYRE7O2XPDV63IBJR6SKNMD4/bundle.json","state":"https://pith.science/pith/JRZYRE7O2XPDV63IBJR6SKNMD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRZYRE7O2XPDV63IBJR6SKNMD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JRZYRE7O2XPDV63IBJR6SKNMD4","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":"b2c5c2512a8c12884d8b1de2d05aaa43f16e61e5e214260994d8b0b1c1426513","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T10:52:52Z","title_canon_sha256":"202da74b5229587076b77805091ccc90324c58f7564bb16eddc4cebb7f6996eb"},"schema_version":"1.0","source":{"id":"1802.06361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06361","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06361v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06361","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"JRZYRE7O2XPD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JRZYRE7O2XPDV63I","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JRZYRE7O","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:92c5fff7c6ec0a5c6336e156699b15252df577e32491f3c91794f1569c671ff5","target":"graph","created_at":"2026-05-18T00:23:03Z","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"},"paper":{"abstract_excerpt":"We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the subgraphs induced by $S$ in each of the given graphs. Different choices for the aggregation function give rise to variants of the problem that were studied recently. We settle many of the questions left open by previous works, showing NP-hardness, hardness of approximation, non-trivial approximation algorithms, and an integrality gap for a natural relaxation","authors_text":"Jimmy Wu, Moses Charikar, Yonatan Naamad","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T10:52:52Z","title":"On Finding Dense Common Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06361","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:190f694d6538252d18cb77410731fbb03bba92c3d58e2e453c3905c53e67fef9","target":"record","created_at":"2026-05-18T00:23:03Z","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":"b2c5c2512a8c12884d8b1de2d05aaa43f16e61e5e214260994d8b0b1c1426513","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T10:52:52Z","title_canon_sha256":"202da74b5229587076b77805091ccc90324c58f7564bb16eddc4cebb7f6996eb"},"schema_version":"1.0","source":{"id":"1802.06361","kind":"arxiv","version":1}},"canonical_sha256":"4c738893eed5de3afb680a63e929ac1f29ee98282181f24c89036ac100a0c982","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c738893eed5de3afb680a63e929ac1f29ee98282181f24c89036ac100a0c982","first_computed_at":"2026-05-18T00:23:03.493006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.493006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZQ59zEuUjaGFqYASkTiOPo5CERquTMBNWphTE2WPPSJ9c7JV/Knb3Fm40fGT1iJZTayqCQCwn8qS64EuWCrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.493562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:190f694d6538252d18cb77410731fbb03bba92c3d58e2e453c3905c53e67fef9","sha256:92c5fff7c6ec0a5c6336e156699b15252df577e32491f3c91794f1569c671ff5"],"state_sha256":"1048ce1d4cc5f13216b884bea313fc6dc08f54a7f8dfc298398117544963c86e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30pDp1tHKElBXe5itWeP+F4u9u4hzitMYd/H4gmVFCUqN+10xnf/5knpO08LwpIdjDWR/sduvCnd2/EidbkrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:02:57.583603Z","bundle_sha256":"0ba35c4fdd88dfb8180d284585ee86b5d56cb841704ae553d6f223295ccfe58c"}}