{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HOT25PNY3VCS4MLWRIADSDC5CQ","short_pith_number":"pith:HOT25PNY","canonical_record":{"source":{"id":"1207.4616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T11:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"995ddd3b74485ddf58a1e52f084da9a1b4c4ff567b66a228289a67f75ea850b3","abstract_canon_sha256":"e018a9b63fc67d2c9de4117df66af6c8f8fd94bafb1c7419c9f9febdedf8acdb"},"schema_version":"1.0"},"canonical_sha256":"3ba7aebdb8dd452e31768a00390c5d1417a9d00fd0d01ae2b7169aaaa39a64b3","source":{"kind":"arxiv","id":"1207.4616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4616","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4616v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4616","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"HOT25PNY3VCS","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HOT25PNY3VCS4MLW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HOT25PNY","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HOT25PNY3VCS4MLWRIADSDC5CQ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T11:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"995ddd3b74485ddf58a1e52f084da9a1b4c4ff567b66a228289a67f75ea850b3","abstract_canon_sha256":"e018a9b63fc67d2c9de4117df66af6c8f8fd94bafb1c7419c9f9febdedf8acdb"},"schema_version":"1.0"},"canonical_sha256":"3ba7aebdb8dd452e31768a00390c5d1417a9d00fd0d01ae2b7169aaaa39a64b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.430873Z","signature_b64":"BV/PVcfm0iphMBkzOdaumohebNCQq9xrj5qvkTXNAYBHKznzJgOZ3MXv1hZcLeQ/z7Yxq1Ts5gcSuEsxcAp3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba7aebdb8dd452e31768a00390c5d1417a9d00fd0d01ae2b7169aaaa39a64b3","last_reissued_at":"2026-05-18T03:50:36.430141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.430141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4616","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sy8mQLEHNTqpUxL900XkWAmbsqZ1NG+DJ/fMhPMSJEoDFfrHGFSuFHSOhK6/7SbqFGoUzwvuW/ckGeSvTjVEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:47:31.121727Z"},"content_sha256":"f472851cee98c472e16e60632027258d1779324e3fe2e74c530dd81ef114d1f8","schema_version":"1.0","event_id":"sha256:f472851cee98c472e16e60632027258d1779324e3fe2e74c530dd81ef114d1f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HOT25PNY3VCS4MLWRIADSDC5CQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Algorithms for Maximum Clique: a computational study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick Prosser","submitted_at":"2012-07-19T11:26:59Z","abstract_excerpt":"We investigate a number of recently reported exact algorithms for the maximum clique problem (MCQ, MCR, MCS, BBMC). The program code used is presented and critiqued showing how small changes in implementation can have a drastic effect on performance. The computational study demonstrates how problem features and hardware platforms influence algorithm behaviour. The minimum width order (smallest-last) is investigated, and MCS is broken into its consituent parts and we discover that one of these parts degrades performance. It is shown that the standard procedure used for rescaling published resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4616","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5bZ0YN6wRycJyYs5QrM/C8kuAmkp924h9AqFwoIiK+7jaT6ZSiAH10ftCI07TRYTmVbnvkz8SiVvdB5GjYSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:47:31.122416Z"},"content_sha256":"55a73e81bbbd5edd7a29c0c15a2eb1abdddd3c2072a68534f0f91253113b049b","schema_version":"1.0","event_id":"sha256:55a73e81bbbd5edd7a29c0c15a2eb1abdddd3c2072a68534f0f91253113b049b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOT25PNY3VCS4MLWRIADSDC5CQ/bundle.json","state_url":"https://pith.science/pith/HOT25PNY3VCS4MLWRIADSDC5CQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOT25PNY3VCS4MLWRIADSDC5CQ/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-10T02:47:31Z","links":{"resolver":"https://pith.science/pith/HOT25PNY3VCS4MLWRIADSDC5CQ","bundle":"https://pith.science/pith/HOT25PNY3VCS4MLWRIADSDC5CQ/bundle.json","state":"https://pith.science/pith/HOT25PNY3VCS4MLWRIADSDC5CQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOT25PNY3VCS4MLWRIADSDC5CQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HOT25PNY3VCS4MLWRIADSDC5CQ","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":"e018a9b63fc67d2c9de4117df66af6c8f8fd94bafb1c7419c9f9febdedf8acdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T11:26:59Z","title_canon_sha256":"995ddd3b74485ddf58a1e52f084da9a1b4c4ff567b66a228289a67f75ea850b3"},"schema_version":"1.0","source":{"id":"1207.4616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4616","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4616v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4616","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"HOT25PNY3VCS","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HOT25PNY3VCS4MLW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HOT25PNY","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:55a73e81bbbd5edd7a29c0c15a2eb1abdddd3c2072a68534f0f91253113b049b","target":"graph","created_at":"2026-05-18T03:50:36Z","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":"We investigate a number of recently reported exact algorithms for the maximum clique problem (MCQ, MCR, MCS, BBMC). The program code used is presented and critiqued showing how small changes in implementation can have a drastic effect on performance. The computational study demonstrates how problem features and hardware platforms influence algorithm behaviour. The minimum width order (smallest-last) is investigated, and MCS is broken into its consituent parts and we discover that one of these parts degrades performance. It is shown that the standard procedure used for rescaling published resul","authors_text":"Patrick Prosser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T11:26:59Z","title":"Exact Algorithms for Maximum Clique: a computational study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4616","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:f472851cee98c472e16e60632027258d1779324e3fe2e74c530dd81ef114d1f8","target":"record","created_at":"2026-05-18T03:50:36Z","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":"e018a9b63fc67d2c9de4117df66af6c8f8fd94bafb1c7419c9f9febdedf8acdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T11:26:59Z","title_canon_sha256":"995ddd3b74485ddf58a1e52f084da9a1b4c4ff567b66a228289a67f75ea850b3"},"schema_version":"1.0","source":{"id":"1207.4616","kind":"arxiv","version":1}},"canonical_sha256":"3ba7aebdb8dd452e31768a00390c5d1417a9d00fd0d01ae2b7169aaaa39a64b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ba7aebdb8dd452e31768a00390c5d1417a9d00fd0d01ae2b7169aaaa39a64b3","first_computed_at":"2026-05-18T03:50:36.430141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:36.430141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BV/PVcfm0iphMBkzOdaumohebNCQq9xrj5qvkTXNAYBHKznzJgOZ3MXv1hZcLeQ/z7Yxq1Ts5gcSuEsxcAp3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:36.430873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f472851cee98c472e16e60632027258d1779324e3fe2e74c530dd81ef114d1f8","sha256:55a73e81bbbd5edd7a29c0c15a2eb1abdddd3c2072a68534f0f91253113b049b"],"state_sha256":"5762f652d21b28249d702bc0bb4bc1069501a3d88cd5952281f5e153654ec837"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hm8H9hvgAicUVZzWTgvLplDV1eEqcNSk82HA4Clrl5a+WpHl5M8gXdponjv2YJhvxUHH6lWzY75rSB8UQS1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:47:31.126669Z","bundle_sha256":"dec268a9cba935fae0a4ab87194e3e6253d6f12f948ef38f7d07e98a181fbec9"}}