{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NVYRJ7JNTEPWL2KREWJ7DHKGJ2","short_pith_number":"pith:NVYRJ7JN","canonical_record":{"source":{"id":"1408.6485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-27T18:07:29Z","cross_cats_sorted":[],"title_canon_sha256":"07546a50ed90a873192b4fabbc89ed814c071ec27d27e7ac8cb0e75ed3998faf","abstract_canon_sha256":"4be6ed9afa9a308a295ef4fa6257aebf473bd6e7270a166c92699a1e8a8cc366"},"schema_version":"1.0"},"canonical_sha256":"6d7114fd2d991f65e9512593f19d464e9ea9cfd10808207c8917617ed109f91b","source":{"kind":"arxiv","id":"1408.6485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6485","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6485v1","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6485","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"NVYRJ7JNTEPW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NVYRJ7JNTEPWL2KR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NVYRJ7JN","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NVYRJ7JNTEPWL2KREWJ7DHKGJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1408.6485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-27T18:07:29Z","cross_cats_sorted":[],"title_canon_sha256":"07546a50ed90a873192b4fabbc89ed814c071ec27d27e7ac8cb0e75ed3998faf","abstract_canon_sha256":"4be6ed9afa9a308a295ef4fa6257aebf473bd6e7270a166c92699a1e8a8cc366"},"schema_version":"1.0"},"canonical_sha256":"6d7114fd2d991f65e9512593f19d464e9ea9cfd10808207c8917617ed109f91b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.437061Z","signature_b64":"N3BB6MTVtBSZ2xC03PmIwow4LZPOITAPNaZkVYmlqjiZCqDKjFS93aHIpLUDOMVE0UQOrvIcvgTCCyA2xa7TBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d7114fd2d991f65e9512593f19d464e9ea9cfd10808207c8917617ed109f91b","last_reissued_at":"2026-05-18T02:44:07.436629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.436629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.6485","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-18T02:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVnNwm6b/vH0nfHwkCb9OZuOpcnMQXj9yrDRPrcuxb0Vv3mkTENDfvbVv81X2peGekzcxicoE49IIssa7CjLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:53:43.924675Z"},"content_sha256":"a05d6f7c852f05ee32af8ce2ceb179261eb6eff8c757a327908847cb74090eba","schema_version":"1.0","event_id":"sha256:a05d6f7c852f05ee32af8ce2ceb179261eb6eff8c757a327908847cb74090eba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NVYRJ7JNTEPWL2KREWJ7DHKGJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Maximum k-Cliques Faster using Lazy Global Domination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ciaran McCreesh, Patrick Prosser","submitted_at":"2014-08-27T18:07:29Z","abstract_excerpt":"A clique in a graph is a set of vertices, each of which is adjacent to every other vertex in this set. A k-clique relaxes this requirement, requiring vertices to be within a distance k of each other, rather than directly adjacent. In theory, a maximum clique algorithm can easily be adapted to solve the maximum k-clique problem. We use a state of the art maximum clique algorithm to show that this is feasible in practice, and introduce a lazy global domination rule which sometimes vastly reduces the search space. We include experimental results for a range of real-world and benchmark graphs, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6485","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-18T02:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syLdhqvLLpp+PqDIPsEtmk5GIkm/O7/72G1mFtFsra0+T7X8jabcf9m2QzFS9Y6tAahnO5NOGdS0+MqmtLYUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:53:43.925354Z"},"content_sha256":"5408d9826f19e9b3715d62ce9e71fa4461699b1759710ef6f93d5ea7739bb6d8","schema_version":"1.0","event_id":"sha256:5408d9826f19e9b3715d62ce9e71fa4461699b1759710ef6f93d5ea7739bb6d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVYRJ7JNTEPWL2KREWJ7DHKGJ2/bundle.json","state_url":"https://pith.science/pith/NVYRJ7JNTEPWL2KREWJ7DHKGJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVYRJ7JNTEPWL2KREWJ7DHKGJ2/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-06-10T06:53:43Z","links":{"resolver":"https://pith.science/pith/NVYRJ7JNTEPWL2KREWJ7DHKGJ2","bundle":"https://pith.science/pith/NVYRJ7JNTEPWL2KREWJ7DHKGJ2/bundle.json","state":"https://pith.science/pith/NVYRJ7JNTEPWL2KREWJ7DHKGJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVYRJ7JNTEPWL2KREWJ7DHKGJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NVYRJ7JNTEPWL2KREWJ7DHKGJ2","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":"4be6ed9afa9a308a295ef4fa6257aebf473bd6e7270a166c92699a1e8a8cc366","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-27T18:07:29Z","title_canon_sha256":"07546a50ed90a873192b4fabbc89ed814c071ec27d27e7ac8cb0e75ed3998faf"},"schema_version":"1.0","source":{"id":"1408.6485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6485","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6485v1","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6485","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"NVYRJ7JNTEPW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NVYRJ7JNTEPWL2KR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NVYRJ7JN","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:5408d9826f19e9b3715d62ce9e71fa4461699b1759710ef6f93d5ea7739bb6d8","target":"graph","created_at":"2026-05-18T02:44:07Z","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":"A clique in a graph is a set of vertices, each of which is adjacent to every other vertex in this set. A k-clique relaxes this requirement, requiring vertices to be within a distance k of each other, rather than directly adjacent. In theory, a maximum clique algorithm can easily be adapted to solve the maximum k-clique problem. We use a state of the art maximum clique algorithm to show that this is feasible in practice, and introduce a lazy global domination rule which sometimes vastly reduces the search space. We include experimental results for a range of real-world and benchmark graphs, and","authors_text":"Ciaran McCreesh, Patrick Prosser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-27T18:07:29Z","title":"Finding Maximum k-Cliques Faster using Lazy Global Domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6485","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:a05d6f7c852f05ee32af8ce2ceb179261eb6eff8c757a327908847cb74090eba","target":"record","created_at":"2026-05-18T02:44:07Z","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":"4be6ed9afa9a308a295ef4fa6257aebf473bd6e7270a166c92699a1e8a8cc366","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-27T18:07:29Z","title_canon_sha256":"07546a50ed90a873192b4fabbc89ed814c071ec27d27e7ac8cb0e75ed3998faf"},"schema_version":"1.0","source":{"id":"1408.6485","kind":"arxiv","version":1}},"canonical_sha256":"6d7114fd2d991f65e9512593f19d464e9ea9cfd10808207c8917617ed109f91b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d7114fd2d991f65e9512593f19d464e9ea9cfd10808207c8917617ed109f91b","first_computed_at":"2026-05-18T02:44:07.436629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:07.436629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N3BB6MTVtBSZ2xC03PmIwow4LZPOITAPNaZkVYmlqjiZCqDKjFS93aHIpLUDOMVE0UQOrvIcvgTCCyA2xa7TBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:07.437061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.6485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a05d6f7c852f05ee32af8ce2ceb179261eb6eff8c757a327908847cb74090eba","sha256:5408d9826f19e9b3715d62ce9e71fa4461699b1759710ef6f93d5ea7739bb6d8"],"state_sha256":"4b464104e7e83db9383099020e1c9ce829bb72dbce295154ad129f1a4eec2454"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsGiBrH9vwKm6EwGQ1gwzFUHFM4SW8ATR7IN1sKR3O6AjXFm6qPIAaIPDaZjZqqQFLzqZWd35a2p6CFYZPmUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:53:43.928957Z","bundle_sha256":"752f1a089161986c93f713a64a97eec42ecca33326a60afa23e5ea85ab3321df"}}