{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KR45GQ6335SK6DDGGERO7M6AMN","short_pith_number":"pith:KR45GQ63","canonical_record":{"source":{"id":"2404.09997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-01-19T10:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"63d0eaead3606aa28883831cfd27551bc8a6863ef5c2b28c03ff2b89ff5ad892","abstract_canon_sha256":"a4530540c076a740ff5fc1021eba29d0eed08870e4d853eba4d80899429b4547"},"schema_version":"1.0"},"canonical_sha256":"5479d343dbdf64af0c663122efb3c06357a4916a469b73ae4b4709c93d7c88e9","source":{"kind":"arxiv","id":"2404.09997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.09997","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"2404.09997v1","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.09997","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"KR45GQ6335SK","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"pith_short_16","alias_value":"KR45GQ6335SK6DDG","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"pith_short_8","alias_value":"KR45GQ63","created_at":"2026-07-05T08:08:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KR45GQ6335SK6DDGGERO7M6AMN","target":"record","payload":{"canonical_record":{"source":{"id":"2404.09997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-01-19T10:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"63d0eaead3606aa28883831cfd27551bc8a6863ef5c2b28c03ff2b89ff5ad892","abstract_canon_sha256":"a4530540c076a740ff5fc1021eba29d0eed08870e4d853eba4d80899429b4547"},"schema_version":"1.0"},"canonical_sha256":"5479d343dbdf64af0c663122efb3c06357a4916a469b73ae4b4709c93d7c88e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:23.528325Z","signature_b64":"WeiYH4lopd7S/yBJdDAM3AR7Oq65Wxb1oEmJqFc5KjLkHTzji6YnYETb6cuw/Om+WlOkBfBO8XbikSUjzuGSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5479d343dbdf64af0c663122efb3c06357a4916a469b73ae4b4709c93d7c88e9","last_reissued_at":"2026-07-05T08:08:23.527768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:23.527768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.09997","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-05T08:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X38Vof0AortYC7V+5buExyB80OsAeiA2swymsAMoc6PQkB/xVwRUbiefxN9aKnRJ6LvToNKJYJbdNbKijgVdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:08:49.122671Z"},"content_sha256":"2414a4a69c689ade903f7583c7c1fafe89824fd035c246a22a505d31e3fb0bfb","schema_version":"1.0","event_id":"sha256:2414a4a69c689ade903f7583c7c1fafe89824fd035c246a22a505d31e3fb0bfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KR45GQ6335SK6DDGGERO7M6AMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Chu-Min Li, Jinghui Xue, Jiongzhi Zheng, Kun He, Yanli Liu","submitted_at":"2024-01-19T10:47:22Z","abstract_excerpt":"In many real-world problems and applications, finding only a single element, even though the best, among all possible candidates, cannot fully meet the requirements. We may wish to have a collection where each individual is not only outstanding but also distinctive. Diversified Top-k (DTk) problems are a kind of combinatorial optimization problem for finding such a promising collection of multiple sub-structures, such as subgraphs like cliques and social communities. In this paper, we address two representative and practical DTk problems, DTk Clique search (DTkC) and DTk Weight Clique search ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.09997","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/2404.09997/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-05T08:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+NsyI+3Wavd85sIo8S0qury/dzjLEShG7P17ANm6132/55dhFp0niwdRi2kfxyqTbNYQimSwBo0ZLB6Zkd8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:08:49.123191Z"},"content_sha256":"72c91a778ef5f0d71ff4f2ebe32dad2c8ac6a8cc0321ed60aca749a2d6616f7b","schema_version":"1.0","event_id":"sha256:72c91a778ef5f0d71ff4f2ebe32dad2c8ac6a8cc0321ed60aca749a2d6616f7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KR45GQ6335SK6DDGGERO7M6AMN/bundle.json","state_url":"https://pith.science/pith/KR45GQ6335SK6DDGGERO7M6AMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KR45GQ6335SK6DDGGERO7M6AMN/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-23T10:08:49Z","links":{"resolver":"https://pith.science/pith/KR45GQ6335SK6DDGGERO7M6AMN","bundle":"https://pith.science/pith/KR45GQ6335SK6DDGGERO7M6AMN/bundle.json","state":"https://pith.science/pith/KR45GQ6335SK6DDGGERO7M6AMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KR45GQ6335SK6DDGGERO7M6AMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KR45GQ6335SK6DDGGERO7M6AMN","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":"a4530540c076a740ff5fc1021eba29d0eed08870e4d853eba4d80899429b4547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-01-19T10:47:22Z","title_canon_sha256":"63d0eaead3606aa28883831cfd27551bc8a6863ef5c2b28c03ff2b89ff5ad892"},"schema_version":"1.0","source":{"id":"2404.09997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.09997","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"2404.09997v1","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.09997","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"KR45GQ6335SK","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"pith_short_16","alias_value":"KR45GQ6335SK6DDG","created_at":"2026-07-05T08:08:23Z"},{"alias_kind":"pith_short_8","alias_value":"KR45GQ63","created_at":"2026-07-05T08:08:23Z"}],"graph_snapshots":[{"event_id":"sha256:72c91a778ef5f0d71ff4f2ebe32dad2c8ac6a8cc0321ed60aca749a2d6616f7b","target":"graph","created_at":"2026-07-05T08:08:23Z","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/2404.09997/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In many real-world problems and applications, finding only a single element, even though the best, among all possible candidates, cannot fully meet the requirements. We may wish to have a collection where each individual is not only outstanding but also distinctive. Diversified Top-k (DTk) problems are a kind of combinatorial optimization problem for finding such a promising collection of multiple sub-structures, such as subgraphs like cliques and social communities. In this paper, we address two representative and practical DTk problems, DTk Clique search (DTkC) and DTk Weight Clique search (","authors_text":"Chu-Min Li, Jinghui Xue, Jiongzhi Zheng, Kun He, Yanli Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-01-19T10:47:22Z","title":"An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.09997","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:2414a4a69c689ade903f7583c7c1fafe89824fd035c246a22a505d31e3fb0bfb","target":"record","created_at":"2026-07-05T08:08:23Z","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":"a4530540c076a740ff5fc1021eba29d0eed08870e4d853eba4d80899429b4547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-01-19T10:47:22Z","title_canon_sha256":"63d0eaead3606aa28883831cfd27551bc8a6863ef5c2b28c03ff2b89ff5ad892"},"schema_version":"1.0","source":{"id":"2404.09997","kind":"arxiv","version":1}},"canonical_sha256":"5479d343dbdf64af0c663122efb3c06357a4916a469b73ae4b4709c93d7c88e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5479d343dbdf64af0c663122efb3c06357a4916a469b73ae4b4709c93d7c88e9","first_computed_at":"2026-07-05T08:08:23.527768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:08:23.527768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WeiYH4lopd7S/yBJdDAM3AR7Oq65Wxb1oEmJqFc5KjLkHTzji6YnYETb6cuw/Om+WlOkBfBO8XbikSUjzuGSBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:08:23.528325Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.09997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2414a4a69c689ade903f7583c7c1fafe89824fd035c246a22a505d31e3fb0bfb","sha256:72c91a778ef5f0d71ff4f2ebe32dad2c8ac6a8cc0321ed60aca749a2d6616f7b"],"state_sha256":"fdd5661096d93d92d2f20ced3c3b0374913479b4ebb6e7fa61e6ff328dedc569"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SL3KXo1nxQVQWr+K+vohY+5PZkPntl9ga+sf7hwsbnW9yQEYlQlEfa5ruTQ8srl6ut8x0EWxRqHE01VLN7H/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T10:08:49.128024Z","bundle_sha256":"578ca15fce887b3e54aecd36f77a6cd93a3634218a2915df49748dad43d18c8e"}}