{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IDEYKR5RGXKXIPTUOKUUSIPACG","short_pith_number":"pith:IDEYKR5R","canonical_record":{"source":{"id":"2301.07300","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T04:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"22b7a1b49da9f557fbee7c0754f7f2e87f5bec3e0b3b7790a8577adb5dacc794","abstract_canon_sha256":"558545ab243d41fce0e11836ebcac30e82a8309b9bd2032b3f7be7c0c575536b"},"schema_version":"1.0"},"canonical_sha256":"40c98547b135d5743e7472a94921e011aa641fd427454d464225947131f1f8b9","source":{"kind":"arxiv","id":"2301.07300","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07300","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07300v3","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07300","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"IDEYKR5RGXKX","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"pith_short_16","alias_value":"IDEYKR5RGXKXIPTU","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"pith_short_8","alias_value":"IDEYKR5R","created_at":"2026-07-05T07:35:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IDEYKR5RGXKXIPTUOKUUSIPACG","target":"record","payload":{"canonical_record":{"source":{"id":"2301.07300","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T04:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"22b7a1b49da9f557fbee7c0754f7f2e87f5bec3e0b3b7790a8577adb5dacc794","abstract_canon_sha256":"558545ab243d41fce0e11836ebcac30e82a8309b9bd2032b3f7be7c0c575536b"},"schema_version":"1.0"},"canonical_sha256":"40c98547b135d5743e7472a94921e011aa641fd427454d464225947131f1f8b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:17.669277Z","signature_b64":"fudJTligAI/2oolzErpV9mFSexR9dKZVq+LhaRAUQoboPoGtIyOBpp7CUPk7Yb9BiDEpRP0TaEWIs4XNi8K+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c98547b135d5743e7472a94921e011aa641fd427454d464225947131f1f8b9","last_reissued_at":"2026-07-05T07:35:17.668814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:17.668814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.07300","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-07-05T07:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3uHtRS09uSy9mGSDPPbDF1YI5ctda3Dt1GhQjywi1UEK2+Qz25y2D/wmRWQDerzlS7eV90xbCgXpQFFGZs2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:09:32.069321Z"},"content_sha256":"422e2541102a99518582a7f0c97dcdf11c1b638e09709d977f730e76ad92f3eb","schema_version":"1.0","event_id":"sha256:422e2541102a99518582a7f0c97dcdf11c1b638e09709d977f730e76ad92f3eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IDEYKR5RGXKXIPTUOKUUSIPACG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two New Upper Bounds for the Maximum k-plex 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-01-18T04:31:40Z","abstract_excerpt":"A k-plex in a graph is a vertex set where each vertex is non-adjacent to at most k vertices (including itself) in this set, and the Maximum k-plex Problem (MKP) is to find the largest k-plex in the graph. As a practical NP-hard problem, MKP has many important real-world applications, such as the analysis of various complex networks. Branch-and-bound (BnB) algorithms are a type of well-studied and effective exact algorithms for MKP. Recent BnB MKP algorithms involve two kinds of upper bounds based on graph coloring and partition, respectively, that work in different perspectives and thus are co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07300","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.07300/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:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0BxvAUI5L1BeR5piO6Z/pFCyNCy3gudYYLA5fTJu17rl9kft7GGNBjCWodBIKRGoy/VlLmu/nEZBtvr70RQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:09:32.069846Z"},"content_sha256":"c4285b8b02590bd8e7816cb9f346e2eee74d958d7ee898a88dabec184aabe56a","schema_version":"1.0","event_id":"sha256:c4285b8b02590bd8e7816cb9f346e2eee74d958d7ee898a88dabec184aabe56a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDEYKR5RGXKXIPTUOKUUSIPACG/bundle.json","state_url":"https://pith.science/pith/IDEYKR5RGXKXIPTUOKUUSIPACG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDEYKR5RGXKXIPTUOKUUSIPACG/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-23T14:09:32Z","links":{"resolver":"https://pith.science/pith/IDEYKR5RGXKXIPTUOKUUSIPACG","bundle":"https://pith.science/pith/IDEYKR5RGXKXIPTUOKUUSIPACG/bundle.json","state":"https://pith.science/pith/IDEYKR5RGXKXIPTUOKUUSIPACG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDEYKR5RGXKXIPTUOKUUSIPACG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IDEYKR5RGXKXIPTUOKUUSIPACG","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":"558545ab243d41fce0e11836ebcac30e82a8309b9bd2032b3f7be7c0c575536b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T04:31:40Z","title_canon_sha256":"22b7a1b49da9f557fbee7c0754f7f2e87f5bec3e0b3b7790a8577adb5dacc794"},"schema_version":"1.0","source":{"id":"2301.07300","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07300","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07300v3","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07300","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"IDEYKR5RGXKX","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"pith_short_16","alias_value":"IDEYKR5RGXKXIPTU","created_at":"2026-07-05T07:35:17Z"},{"alias_kind":"pith_short_8","alias_value":"IDEYKR5R","created_at":"2026-07-05T07:35:17Z"}],"graph_snapshots":[{"event_id":"sha256:c4285b8b02590bd8e7816cb9f346e2eee74d958d7ee898a88dabec184aabe56a","target":"graph","created_at":"2026-07-05T07:35:17Z","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/2301.07300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A k-plex in a graph is a vertex set where each vertex is non-adjacent to at most k vertices (including itself) in this set, and the Maximum k-plex Problem (MKP) is to find the largest k-plex in the graph. As a practical NP-hard problem, MKP has many important real-world applications, such as the analysis of various complex networks. Branch-and-bound (BnB) algorithms are a type of well-studied and effective exact algorithms for MKP. Recent BnB MKP algorithms involve two kinds of upper bounds based on graph coloring and partition, respectively, that work in different perspectives and thus are co","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-01-18T04:31:40Z","title":"Two New Upper Bounds for the Maximum k-plex Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07300","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:422e2541102a99518582a7f0c97dcdf11c1b638e09709d977f730e76ad92f3eb","target":"record","created_at":"2026-07-05T07:35:17Z","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":"558545ab243d41fce0e11836ebcac30e82a8309b9bd2032b3f7be7c0c575536b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T04:31:40Z","title_canon_sha256":"22b7a1b49da9f557fbee7c0754f7f2e87f5bec3e0b3b7790a8577adb5dacc794"},"schema_version":"1.0","source":{"id":"2301.07300","kind":"arxiv","version":3}},"canonical_sha256":"40c98547b135d5743e7472a94921e011aa641fd427454d464225947131f1f8b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40c98547b135d5743e7472a94921e011aa641fd427454d464225947131f1f8b9","first_computed_at":"2026-07-05T07:35:17.668814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:17.668814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fudJTligAI/2oolzErpV9mFSexR9dKZVq+LhaRAUQoboPoGtIyOBpp7CUPk7Yb9BiDEpRP0TaEWIs4XNi8K+Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:17.669277Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.07300","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:422e2541102a99518582a7f0c97dcdf11c1b638e09709d977f730e76ad92f3eb","sha256:c4285b8b02590bd8e7816cb9f346e2eee74d958d7ee898a88dabec184aabe56a"],"state_sha256":"1636c02f9b33af607d4b471fa2eb3437fe7bb179c8b588a2e2920419cb4958c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/oubV0T83UFRfyWpOQv6vMEyZdokEE1fMqzGKb2qPy8pd0zDpUZoQIxdzJnYHASNkO8ooR+3jNNF2vBLNw6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T14:09:32.074689Z","bundle_sha256":"808aafcb2f64a56981cbd1bcebf69c13a550a1d7efde0665bd5f1ba93d0cef2d"}}