{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S2AQZYJQYVQEIWN3JOSW52YMBD","short_pith_number":"pith:S2AQZYJQ","canonical_record":{"source":{"id":"1709.09471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-27T12:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"fef3cd88092bc95c764ebe8c1d1973628864f869bbcb7363b1b9d60f4e1e6a4f","abstract_canon_sha256":"d252b9ed97acf19d2a3ba910b8cb5feda2283d54c46fa22b85d603a28e23b41b"},"schema_version":"1.0"},"canonical_sha256":"96810ce130c5604459bb4ba56eeb0c08d49a9576f8a3ab9a3b0a446c01144d2a","source":{"kind":"arxiv","id":"1709.09471","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09471","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09471v3","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09471","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"S2AQZYJQYVQE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S2AQZYJQYVQEIWN3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S2AQZYJQ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S2AQZYJQYVQEIWN3JOSW52YMBD","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-27T12:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"fef3cd88092bc95c764ebe8c1d1973628864f869bbcb7363b1b9d60f4e1e6a4f","abstract_canon_sha256":"d252b9ed97acf19d2a3ba910b8cb5feda2283d54c46fa22b85d603a28e23b41b"},"schema_version":"1.0"},"canonical_sha256":"96810ce130c5604459bb4ba56eeb0c08d49a9576f8a3ab9a3b0a446c01144d2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:58.253839Z","signature_b64":"ntuknvw04zbQgVnBPCuA8/xtVBr2XItJfOR3PX4vTZjo9ydzYHl/fue/9MKeW07ua5KwvmcAY6PfQKAExxtFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96810ce130c5604459bb4ba56eeb0c08d49a9576f8a3ab9a3b0a446c01144d2a","last_reissued_at":"2026-05-18T00:33:58.252872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:58.252872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09471","source_version":3,"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:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8AwuJ3sfUW2LK0uyqXbnOHfJYVVQEFi779wHo2nG6rIF7l61r45SqZ+w8vEkvZvwueijdCSQHwTViqOpqSCUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:41:43.481996Z"},"content_sha256":"873fbcf64d0e878240a743b809521051138afcd0df2a5141760074142dbe9551","schema_version":"1.0","event_id":"sha256:873fbcf64d0e878240a743b809521051138afcd0df2a5141760074142dbe9551"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S2AQZYJQYVQEIWN3JOSW52YMBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diversified Coherent Core Search on Multi-Layer Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jianzhong Li, Rong Zhu, Zhaonian Zou","submitted_at":"2017-09-27T12:23:54Z","abstract_excerpt":"Mining dense subgraphs on multi-layer graphs is an interesting problem, which has witnessed lots of applications in practice. To overcome the limitations of the quasi-clique-based approach, we propose d-coherent core (d-CC), a new notion of dense subgraph on multi-layer graphs, which has several elegant properties. We formalize the diversified coherent core search (DCCS) problem, which finds k d-CCs that can cover the largest number of vertices. We propose a greedy algorithm with an approximation ratio of 1 - 1/e and two search algorithms with an approximation ratio of 1/4. The experiments ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09471","kind":"arxiv","version":3},"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:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IA5vacamJwHoz36sKlVVjLnKDnMnZQScLApje9CDi0wr5BEUNPimFNUfHLTR0K8qaczb0gnV3FnKoOXOdOlyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:41:43.482637Z"},"content_sha256":"9ed0daf37ce82ef86c64de39da225e7b64359c33725042a22d13ed5ad9c62f18","schema_version":"1.0","event_id":"sha256:9ed0daf37ce82ef86c64de39da225e7b64359c33725042a22d13ed5ad9c62f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/bundle.json","state_url":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/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-05-25T17:41:43Z","links":{"resolver":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD","bundle":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/bundle.json","state":"https://pith.science/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2AQZYJQYVQEIWN3JOSW52YMBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S2AQZYJQYVQEIWN3JOSW52YMBD","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":"d252b9ed97acf19d2a3ba910b8cb5feda2283d54c46fa22b85d603a28e23b41b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-27T12:23:54Z","title_canon_sha256":"fef3cd88092bc95c764ebe8c1d1973628864f869bbcb7363b1b9d60f4e1e6a4f"},"schema_version":"1.0","source":{"id":"1709.09471","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09471","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09471v3","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09471","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"S2AQZYJQYVQE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S2AQZYJQYVQEIWN3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S2AQZYJQ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:9ed0daf37ce82ef86c64de39da225e7b64359c33725042a22d13ed5ad9c62f18","target":"graph","created_at":"2026-05-18T00:33:58Z","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":"Mining dense subgraphs on multi-layer graphs is an interesting problem, which has witnessed lots of applications in practice. To overcome the limitations of the quasi-clique-based approach, we propose d-coherent core (d-CC), a new notion of dense subgraph on multi-layer graphs, which has several elegant properties. We formalize the diversified coherent core search (DCCS) problem, which finds k d-CCs that can cover the largest number of vertices. We propose a greedy algorithm with an approximation ratio of 1 - 1/e and two search algorithms with an approximation ratio of 1/4. The experiments ver","authors_text":"Jianzhong Li, Rong Zhu, Zhaonian Zou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-27T12:23:54Z","title":"Diversified Coherent Core Search on Multi-Layer Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09471","kind":"arxiv","version":3},"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:873fbcf64d0e878240a743b809521051138afcd0df2a5141760074142dbe9551","target":"record","created_at":"2026-05-18T00:33:58Z","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":"d252b9ed97acf19d2a3ba910b8cb5feda2283d54c46fa22b85d603a28e23b41b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-27T12:23:54Z","title_canon_sha256":"fef3cd88092bc95c764ebe8c1d1973628864f869bbcb7363b1b9d60f4e1e6a4f"},"schema_version":"1.0","source":{"id":"1709.09471","kind":"arxiv","version":3}},"canonical_sha256":"96810ce130c5604459bb4ba56eeb0c08d49a9576f8a3ab9a3b0a446c01144d2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96810ce130c5604459bb4ba56eeb0c08d49a9576f8a3ab9a3b0a446c01144d2a","first_computed_at":"2026-05-18T00:33:58.252872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:58.252872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ntuknvw04zbQgVnBPCuA8/xtVBr2XItJfOR3PX4vTZjo9ydzYHl/fue/9MKeW07ua5KwvmcAY6PfQKAExxtFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:58.253839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09471","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:873fbcf64d0e878240a743b809521051138afcd0df2a5141760074142dbe9551","sha256:9ed0daf37ce82ef86c64de39da225e7b64359c33725042a22d13ed5ad9c62f18"],"state_sha256":"bb484f66ed7c4c52e2629182f9bfafec52dc02d9729d21d57399f5116ee93a72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HB2myDvnbFNzCX2nGlZGZvz/NykOxSDIIfrwpOJ4kTDjtWtOJ/tO7DyJjNncGPMLUmgnyByigW85C2b/quiNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:41:43.486161Z","bundle_sha256":"1d68e81c3646774fca2085036d93541086fe85c4aa392bf06d5a89c6e2c099eb"}}