{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5R5IFLMJSLWV32ZVB73TUQ5VGM","short_pith_number":"pith:5R5IFLMJ","canonical_record":{"source":{"id":"2308.07235","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-14T16:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"bee6bc3787feee6ef1d6bf7d5e0d78949bdaed4dd87aaa3ee7c947fc791f97c2","abstract_canon_sha256":"fded0b5f20c760ccaaa7761e4c0dd8dbbd4476eb582faea3ff8ced2ab7fa1a8e"},"schema_version":"1.0"},"canonical_sha256":"ec7a82ad8992ed5deb350ff73a43b5332b281079c770c6072ee01133ebf92e19","source":{"kind":"arxiv","id":"2308.07235","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07235","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07235v2","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07235","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"5R5IFLMJSLWV","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"pith_short_16","alias_value":"5R5IFLMJSLWV32ZV","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"pith_short_8","alias_value":"5R5IFLMJ","created_at":"2026-07-05T07:31:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5R5IFLMJSLWV32ZVB73TUQ5VGM","target":"record","payload":{"canonical_record":{"source":{"id":"2308.07235","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-14T16:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"bee6bc3787feee6ef1d6bf7d5e0d78949bdaed4dd87aaa3ee7c947fc791f97c2","abstract_canon_sha256":"fded0b5f20c760ccaaa7761e4c0dd8dbbd4476eb582faea3ff8ced2ab7fa1a8e"},"schema_version":"1.0"},"canonical_sha256":"ec7a82ad8992ed5deb350ff73a43b5332b281079c770c6072ee01133ebf92e19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:31:54.086812Z","signature_b64":"tFLj4sVBDmEKz758MNrSJLaSYWgF1qRX4mVTWaS44EF6adpukUIb63eYdg4bUF6Um3f8mqWUQkXyzLRVVgD4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec7a82ad8992ed5deb350ff73a43b5332b281079c770c6072ee01133ebf92e19","last_reissued_at":"2026-07-05T07:31:54.086442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:31:54.086442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.07235","source_version":2,"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-05T07:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6KHZJNS2nc6in5D/Pp3PTh+FcuyfxeGF55FABUQMqk2rorKLjp/I6V+37v/a2tVUdrg7MTsFSIDJKlpLcvgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T18:37:31.350104Z"},"content_sha256":"560c6151ed36195982a5c3e05f07f2339d76d7972e6ebc09ca5671b14dea66dc","schema_version":"1.0","event_id":"sha256:560c6151ed36195982a5c3e05f07f2339d76d7972e6ebc09ca5671b14dea66dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5R5IFLMJSLWV32ZVB73TUQ5VGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jiongzhi Zheng, Kun He, Mingming Jin","submitted_at":"2023-08-14T16:17:29Z","abstract_excerpt":"The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum k-defective clique in a given graph, where a k-defective clique is a relaxation clique missing at most k edges. MDCP is NP-hard and finds many real-world applications in analyzing dense but not necessarily complete subgraphs. Exact algorithms for MDCP mainly follow the Branch-and-bound (BnB) framework, whose performance heavily depends on the quality of the upper bound on the cardinality of a maximum k-defective clique. The state-of-the-art BnB MDCP algorithms calculate the upper bound quickly but conservatively as they ignor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07235","kind":"arxiv","version":2},"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.07235/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-05T07:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzufRQ6Uf7SoWLw7d0G9LVSX3jUxj55yFKR53YRIvOLeFCK6Qrmx4ASbFS1DrmNuraqqOd2EfPorNbysBHCsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T18:37:31.350668Z"},"content_sha256":"9dd96c92a61746bdb12132366200c0e8b220b41d8cc3774205b11800e3b4fb8c","schema_version":"1.0","event_id":"sha256:9dd96c92a61746bdb12132366200c0e8b220b41d8cc3774205b11800e3b4fb8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM/bundle.json","state_url":"https://pith.science/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM/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-23T18:37:31Z","links":{"resolver":"https://pith.science/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM","bundle":"https://pith.science/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM/bundle.json","state":"https://pith.science/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5R5IFLMJSLWV32ZVB73TUQ5VGM","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":"fded0b5f20c760ccaaa7761e4c0dd8dbbd4476eb582faea3ff8ced2ab7fa1a8e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-14T16:17:29Z","title_canon_sha256":"bee6bc3787feee6ef1d6bf7d5e0d78949bdaed4dd87aaa3ee7c947fc791f97c2"},"schema_version":"1.0","source":{"id":"2308.07235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07235","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07235v2","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07235","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"5R5IFLMJSLWV","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"pith_short_16","alias_value":"5R5IFLMJSLWV32ZV","created_at":"2026-07-05T07:31:54Z"},{"alias_kind":"pith_short_8","alias_value":"5R5IFLMJ","created_at":"2026-07-05T07:31:54Z"}],"graph_snapshots":[{"event_id":"sha256:9dd96c92a61746bdb12132366200c0e8b220b41d8cc3774205b11800e3b4fb8c","target":"graph","created_at":"2026-07-05T07:31:54Z","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.07235/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum k-defective clique in a given graph, where a k-defective clique is a relaxation clique missing at most k edges. MDCP is NP-hard and finds many real-world applications in analyzing dense but not necessarily complete subgraphs. Exact algorithms for MDCP mainly follow the Branch-and-bound (BnB) framework, whose performance heavily depends on the quality of the upper bound on the cardinality of a maximum k-defective clique. The state-of-the-art BnB MDCP algorithms calculate the upper bound quickly but conservatively as they ignor","authors_text":"Jiongzhi Zheng, Kun He, Mingming Jin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-14T16:17:29Z","title":"KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07235","kind":"arxiv","version":2},"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:560c6151ed36195982a5c3e05f07f2339d76d7972e6ebc09ca5671b14dea66dc","target":"record","created_at":"2026-07-05T07:31:54Z","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":"fded0b5f20c760ccaaa7761e4c0dd8dbbd4476eb582faea3ff8ced2ab7fa1a8e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-14T16:17:29Z","title_canon_sha256":"bee6bc3787feee6ef1d6bf7d5e0d78949bdaed4dd87aaa3ee7c947fc791f97c2"},"schema_version":"1.0","source":{"id":"2308.07235","kind":"arxiv","version":2}},"canonical_sha256":"ec7a82ad8992ed5deb350ff73a43b5332b281079c770c6072ee01133ebf92e19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec7a82ad8992ed5deb350ff73a43b5332b281079c770c6072ee01133ebf92e19","first_computed_at":"2026-07-05T07:31:54.086442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:31:54.086442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tFLj4sVBDmEKz758MNrSJLaSYWgF1qRX4mVTWaS44EF6adpukUIb63eYdg4bUF6Um3f8mqWUQkXyzLRVVgD4Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T07:31:54.086812Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:560c6151ed36195982a5c3e05f07f2339d76d7972e6ebc09ca5671b14dea66dc","sha256:9dd96c92a61746bdb12132366200c0e8b220b41d8cc3774205b11800e3b4fb8c"],"state_sha256":"d276830b9b88e274bb1b998ba39bed1a5143dd4162d87f68721613c29a433aca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6HKwwu5kF3A7SqpbrNp/rJCaZQfevdmfUkBo+3ON1ARqVsFkAEU51E6XkoB84A92NNvDvnGvCTOUPpVOXHXBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T18:37:31.354804Z","bundle_sha256":"4e2579bf542d226b55b027558883f5e9fa0670e9d54a7a3dbc02476d79562341"}}