{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:P5KTTH64K37F3I4XEHUJUYWANM","short_pith_number":"pith:P5KTTH64","canonical_record":{"source":{"id":"1209.4560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T15:18:54Z","cross_cats_sorted":["cs.DC","cs.DM","cs.PF"],"title_canon_sha256":"6b80d477303e87a14c6970e317597f4d1257e3055bc91f762b617a8bedc3e390","abstract_canon_sha256":"663df404fea15755b0a48ff30b3294c3d244d2a8782ec6901fe874eec044e3c3"},"schema_version":"1.0"},"canonical_sha256":"7f55399fdc56fe5da39721e89a62c06b0bf8af2e7a72797a5181289b50225ae7","source":{"kind":"arxiv","id":"1209.4560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4560","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4560v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4560","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"P5KTTH64K37F","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P5KTTH64K37F3I4X","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P5KTTH64","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:P5KTTH64K37F3I4XEHUJUYWANM","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T15:18:54Z","cross_cats_sorted":["cs.DC","cs.DM","cs.PF"],"title_canon_sha256":"6b80d477303e87a14c6970e317597f4d1257e3055bc91f762b617a8bedc3e390","abstract_canon_sha256":"663df404fea15755b0a48ff30b3294c3d244d2a8782ec6901fe874eec044e3c3"},"schema_version":"1.0"},"canonical_sha256":"7f55399fdc56fe5da39721e89a62c06b0bf8af2e7a72797a5181289b50225ae7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:13.880012Z","signature_b64":"ADAFJAyurBbygQCV6Y1MWLk0p8/mNPa8wd6bhEYaHa/aA0A3V/CUt9T3sOx9WBnI9A4cwzKjkXzbFROnnxy/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f55399fdc56fe5da39721e89a62c06b0bf8af2e7a72797a5181289b50225ae7","last_reissued_at":"2026-05-18T03:30:13.879373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:13.879373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4560","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:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWFMs30qkQn4R/xUWTDBJ0lhJBBoAJNwot4CWe0qGeHuEWgzsWgZ3+4aaho8r2ndKQMKPFwLkGm7aWZdj67KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:04:06.401026Z"},"content_sha256":"0b1a9693d937a6603d7a36608376e6178c17a9398b9668214f56661b35af7051","schema_version":"1.0","event_id":"sha256:0b1a9693d937a6603d7a36608376e6178c17a9398b9668214f56661b35af7051"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:P5KTTH64K37F3I4XEHUJUYWANM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributing an Exact Algorithm for Maximum Clique: maximising the costup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","cs.PF"],"primary_cat":"cs.DS","authors_text":"Ciaran McCreesh, Patrick Prosser","submitted_at":"2012-09-20T15:18:54Z","abstract_excerpt":"We take an existing implementation of an algorithm for the maximum clique problem and modify it so that we can distribute it over an ad-hoc cluster of machines. Our goal was to achieve a significant speedup in performance with minimal development effort, i.e. a maximum costup. We present a simple modification to a state-of-the-art exact algorithm for maximum clique that allows us to distribute it across many machines. An empirical study over large hard benchmarks shows that speedups of an order of magnitude are routine for 25 or more machines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4560","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:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0Xx398iXeiu/adSNVGEDGe8tXV9EN5KEYUE3SDvVPufeWaq0Jd13Gp+o+EdftR4wIGek7s/Oqh0flng3fa5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:04:06.401765Z"},"content_sha256":"38b16fc533696abf1364e1758a2756d11899da77ad8ad7cdfdb58e726d61ea20","schema_version":"1.0","event_id":"sha256:38b16fc533696abf1364e1758a2756d11899da77ad8ad7cdfdb58e726d61ea20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5KTTH64K37F3I4XEHUJUYWANM/bundle.json","state_url":"https://pith.science/pith/P5KTTH64K37F3I4XEHUJUYWANM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5KTTH64K37F3I4XEHUJUYWANM/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-10T07:04:06Z","links":{"resolver":"https://pith.science/pith/P5KTTH64K37F3I4XEHUJUYWANM","bundle":"https://pith.science/pith/P5KTTH64K37F3I4XEHUJUYWANM/bundle.json","state":"https://pith.science/pith/P5KTTH64K37F3I4XEHUJUYWANM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5KTTH64K37F3I4XEHUJUYWANM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:P5KTTH64K37F3I4XEHUJUYWANM","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":"663df404fea15755b0a48ff30b3294c3d244d2a8782ec6901fe874eec044e3c3","cross_cats_sorted":["cs.DC","cs.DM","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T15:18:54Z","title_canon_sha256":"6b80d477303e87a14c6970e317597f4d1257e3055bc91f762b617a8bedc3e390"},"schema_version":"1.0","source":{"id":"1209.4560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4560","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4560v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4560","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"P5KTTH64K37F","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P5KTTH64K37F3I4X","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P5KTTH64","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:38b16fc533696abf1364e1758a2756d11899da77ad8ad7cdfdb58e726d61ea20","target":"graph","created_at":"2026-05-18T03:30:13Z","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 take an existing implementation of an algorithm for the maximum clique problem and modify it so that we can distribute it over an ad-hoc cluster of machines. Our goal was to achieve a significant speedup in performance with minimal development effort, i.e. a maximum costup. We present a simple modification to a state-of-the-art exact algorithm for maximum clique that allows us to distribute it across many machines. An empirical study over large hard benchmarks shows that speedups of an order of magnitude are routine for 25 or more machines.","authors_text":"Ciaran McCreesh, Patrick Prosser","cross_cats":["cs.DC","cs.DM","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T15:18:54Z","title":"Distributing an Exact Algorithm for Maximum Clique: maximising the costup"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4560","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:0b1a9693d937a6603d7a36608376e6178c17a9398b9668214f56661b35af7051","target":"record","created_at":"2026-05-18T03:30:13Z","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":"663df404fea15755b0a48ff30b3294c3d244d2a8782ec6901fe874eec044e3c3","cross_cats_sorted":["cs.DC","cs.DM","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T15:18:54Z","title_canon_sha256":"6b80d477303e87a14c6970e317597f4d1257e3055bc91f762b617a8bedc3e390"},"schema_version":"1.0","source":{"id":"1209.4560","kind":"arxiv","version":1}},"canonical_sha256":"7f55399fdc56fe5da39721e89a62c06b0bf8af2e7a72797a5181289b50225ae7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f55399fdc56fe5da39721e89a62c06b0bf8af2e7a72797a5181289b50225ae7","first_computed_at":"2026-05-18T03:30:13.879373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:13.879373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ADAFJAyurBbygQCV6Y1MWLk0p8/mNPa8wd6bhEYaHa/aA0A3V/CUt9T3sOx9WBnI9A4cwzKjkXzbFROnnxy/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:13.880012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b1a9693d937a6603d7a36608376e6178c17a9398b9668214f56661b35af7051","sha256:38b16fc533696abf1364e1758a2756d11899da77ad8ad7cdfdb58e726d61ea20"],"state_sha256":"f86cf1869f8b27d2af75d2bcbdd76e57c4b2121a851fa79e1c462ec955aec37e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZJ0nIeX7DaNCoSnGPUcdZh0GcTW/SzLoAbx7gFpJJtqY22DE4bont3KuOuiH8V1sTCtWvwadF/kpHGpPxvGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:04:06.405614Z","bundle_sha256":"6d2a261cffc19a4170d47589e99d947f303cad5a96824a90669b972ae1a7db9f"}}