{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QV233RIYB32TI3LEIOJU6SY7OH","short_pith_number":"pith:QV233RIY","canonical_record":{"source":{"id":"1401.5921","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-23T10:01:35Z","cross_cats_sorted":[],"title_canon_sha256":"7513ff2263c8f831c56b42d5cb41979e8a4461fdd4aa2acdd757ba42e6b95332","abstract_canon_sha256":"d3ad7d6c77eed34ad76e402adaa1bef63d5d29197b52d17dde1a0493a36d2320"},"schema_version":"1.0"},"canonical_sha256":"8575bdc5180ef5346d6443934f4b1f71d44ad449e5faf7600c87c5a6cfbc6330","source":{"kind":"arxiv","id":"1401.5921","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5921","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5921v3","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5921","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"pith_short_12","alias_value":"QV233RIYB32T","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QV233RIYB32TI3LE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QV233RIY","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QV233RIYB32TI3LEIOJU6SY7OH","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5921","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-23T10:01:35Z","cross_cats_sorted":[],"title_canon_sha256":"7513ff2263c8f831c56b42d5cb41979e8a4461fdd4aa2acdd757ba42e6b95332","abstract_canon_sha256":"d3ad7d6c77eed34ad76e402adaa1bef63d5d29197b52d17dde1a0493a36d2320"},"schema_version":"1.0"},"canonical_sha256":"8575bdc5180ef5346d6443934f4b1f71d44ad449e5faf7600c87c5a6cfbc6330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:36.523685Z","signature_b64":"/NcOFcWq7L9UvYKI22z/CLy3SVBWPg6kqqXINNbS30+MKXRQtBK1wTIuyFb0Wsh/sKdALw+IcniaOww0y5FVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8575bdc5180ef5346d6443934f4b1f71d44ad449e5faf7600c87c5a6cfbc6330","last_reissued_at":"2026-05-18T02:43:36.523066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:36.523066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5921","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-05-18T02:43:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWaOzkl4KI6FH678rkdocDqfJCS/v7wCd1sG/vLAKvEihfPs+LfCU91rG3vid0/ZLUhmRel5UB9ZOMn898UxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:00:36.551050Z"},"content_sha256":"2a46657ad4cf4ec5d5cfa041ca664e6dca6c801f4a41a2f42eedfac192b54029","schema_version":"1.0","event_id":"sha256:2a46657ad4cf4ec5d5cfa041ca664e6dca6c801f4a41a2f42eedfac192b54029"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QV233RIYB32TI3LEIOJU6SY7OH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ciaran McCreesh, Patrick Prosser","submitted_at":"2014-01-23T10:01:35Z","abstract_excerpt":"Finding a maximum clique in a given graph is one of the fundamental NP-hard problems. We compare two multi-core thread-parallel adaptations of a state-of-the-art branch and bound algorithm for the maximum clique problem, and provide a novel explanation as to why they are successful. We show that load balance is sometimes a problem, but that the interaction of parallel search order and the most likely location of solutions within the search space is often the dominating consideration. We use this explanation to propose a new low-overhead, scalable work splitting mechanism. Our approach uses exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5921","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":""},"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:43:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7fwC3jHtG08vnTrO4+4dFDa2u9/trZo5jQl+JY4d0tRWrLKq8+7C5YJSJP6E0H8byUl/EPNP/rYgLvT5HWlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:00:36.551805Z"},"content_sha256":"11e1f70f836c05da60385f886bd2e18a3df3dcae06e0c1114037097ab879ef91","schema_version":"1.0","event_id":"sha256:11e1f70f836c05da60385f886bd2e18a3df3dcae06e0c1114037097ab879ef91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QV233RIYB32TI3LEIOJU6SY7OH/bundle.json","state_url":"https://pith.science/pith/QV233RIYB32TI3LEIOJU6SY7OH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QV233RIYB32TI3LEIOJU6SY7OH/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-10T03:00:36Z","links":{"resolver":"https://pith.science/pith/QV233RIYB32TI3LEIOJU6SY7OH","bundle":"https://pith.science/pith/QV233RIYB32TI3LEIOJU6SY7OH/bundle.json","state":"https://pith.science/pith/QV233RIYB32TI3LEIOJU6SY7OH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QV233RIYB32TI3LEIOJU6SY7OH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QV233RIYB32TI3LEIOJU6SY7OH","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":"d3ad7d6c77eed34ad76e402adaa1bef63d5d29197b52d17dde1a0493a36d2320","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-23T10:01:35Z","title_canon_sha256":"7513ff2263c8f831c56b42d5cb41979e8a4461fdd4aa2acdd757ba42e6b95332"},"schema_version":"1.0","source":{"id":"1401.5921","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5921","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5921v3","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5921","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"pith_short_12","alias_value":"QV233RIYB32T","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QV233RIYB32TI3LE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QV233RIY","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:11e1f70f836c05da60385f886bd2e18a3df3dcae06e0c1114037097ab879ef91","target":"graph","created_at":"2026-05-18T02:43: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":"Finding a maximum clique in a given graph is one of the fundamental NP-hard problems. We compare two multi-core thread-parallel adaptations of a state-of-the-art branch and bound algorithm for the maximum clique problem, and provide a novel explanation as to why they are successful. We show that load balance is sometimes a problem, but that the interaction of parallel search order and the most likely location of solutions within the search space is often the dominating consideration. We use this explanation to propose a new low-overhead, scalable work splitting mechanism. Our approach uses exp","authors_text":"Ciaran McCreesh, Patrick Prosser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-23T10:01:35Z","title":"The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5921","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:2a46657ad4cf4ec5d5cfa041ca664e6dca6c801f4a41a2f42eedfac192b54029","target":"record","created_at":"2026-05-18T02:43: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":"d3ad7d6c77eed34ad76e402adaa1bef63d5d29197b52d17dde1a0493a36d2320","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-23T10:01:35Z","title_canon_sha256":"7513ff2263c8f831c56b42d5cb41979e8a4461fdd4aa2acdd757ba42e6b95332"},"schema_version":"1.0","source":{"id":"1401.5921","kind":"arxiv","version":3}},"canonical_sha256":"8575bdc5180ef5346d6443934f4b1f71d44ad449e5faf7600c87c5a6cfbc6330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8575bdc5180ef5346d6443934f4b1f71d44ad449e5faf7600c87c5a6cfbc6330","first_computed_at":"2026-05-18T02:43:36.523066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:36.523066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/NcOFcWq7L9UvYKI22z/CLy3SVBWPg6kqqXINNbS30+MKXRQtBK1wTIuyFb0Wsh/sKdALw+IcniaOww0y5FVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:36.523685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5921","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a46657ad4cf4ec5d5cfa041ca664e6dca6c801f4a41a2f42eedfac192b54029","sha256:11e1f70f836c05da60385f886bd2e18a3df3dcae06e0c1114037097ab879ef91"],"state_sha256":"b6731b1e8275cc2f47f53bf221d443bba467d84ec4717f154fef0d59f344ffd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auMSVGYpu6t2dK1thGk+rUL4iMSYU+sgo2Jeix3vp+nrAyUEYKDT5mQBVngBCJHhlgUIJXUIr6159spb8kFjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T03:00:36.556644Z","bundle_sha256":"7ccb588fab4c17793e526caaf4b58897f5cdc889e321aeacef84cdf6ca82188e"}}