{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3UAQ22TP5EHKZTKDOFE2NLPKZ6","short_pith_number":"pith:3UAQ22TP","canonical_record":{"source":{"id":"2212.01473","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-12-02T22:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"789bf544ec45ed4fde1806134028f6ed330333f1bd5313be008989860e3020ac","abstract_canon_sha256":"19fdd2d97a3dd8d0a4b73869daf2a2b6be45410bcba5181ef19b8148f21593ea"},"schema_version":"1.0"},"canonical_sha256":"dd010d6a6fe90eaccd437149a6adeacf8b518d4b4c3dd653ecf10501f9c876eb","source":{"kind":"arxiv","id":"2212.01473","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.01473","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"2212.01473v3","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01473","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"3UAQ22TP5EHK","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_16","alias_value":"3UAQ22TP5EHKZTKD","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_8","alias_value":"3UAQ22TP","created_at":"2026-07-05T10:53:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3UAQ22TP5EHKZTKDOFE2NLPKZ6","target":"record","payload":{"canonical_record":{"source":{"id":"2212.01473","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-12-02T22:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"789bf544ec45ed4fde1806134028f6ed330333f1bd5313be008989860e3020ac","abstract_canon_sha256":"19fdd2d97a3dd8d0a4b73869daf2a2b6be45410bcba5181ef19b8148f21593ea"},"schema_version":"1.0"},"canonical_sha256":"dd010d6a6fe90eaccd437149a6adeacf8b518d4b4c3dd653ecf10501f9c876eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:07.436652Z","signature_b64":"PCZYsLGG4OBSst/h1FIzTARONXEhuKFmVrjukC3c397tGtZRtBxwcMboUPCg9zv33E0wcdR0dgGgoiwb0enCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd010d6a6fe90eaccd437149a6adeacf8b518d4b4c3dd653ecf10501f9c876eb","last_reissued_at":"2026-07-05T10:53:07.436161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:07.436161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.01473","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-05T10:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95impfqQ4nIArpk8SYzzmjTPFMXvsnYQLBCT6GfXK1agRTG9RI6LHI2H0VavxVRKL80XxLkCusIkChZoVUuGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:55:41.568235Z"},"content_sha256":"b6a1c50cd7a97a7063479ca88e37af30e23ad8eb1c711c819a9640781e5d5c02","schema_version":"1.0","event_id":"sha256:b6a1c50cd7a97a7063479ca88e37af30e23ad8eb1c711c819a9640781e5d5c02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3UAQ22TP5EHKZTKDOFE2NLPKZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallelizing Maximal Clique Enumeration on GPUs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Izzat El Hajj, Jinjun Xiong, Mohammad Almasri, Rakesh Nagi, Wen-Mei Hwu, Yen-Hsiang Chang","submitted_at":"2022-12-02T22:41:05Z","abstract_excerpt":"We present a GPU solution for exact maximal clique enumeration (MCE) that performs a search tree traversal following the Bron-Kerbosch algorithm. Prior works on parallelizing MCE on GPUs perform a breadth-first traversal of the tree, which has limited scalability because of the explosion in the number of tree nodes at deep levels. We propose to parallelize MCE on GPUs by performing depth-first traversal of independent subtrees in parallel. Since MCE suffers from high load imbalance and memory capacity requirements, we propose a worker list for dynamic load balancing, as well as partial induced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01473","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/2212.01473/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-05T10:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcNOkuoOMUJ0wWOWRaoKzhSgc0SbmR6a4XT7njzbMwKQKzWzGPgouLq3sVylSGb8BkH6w6KRrGczb0N7XAZmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:55:41.568819Z"},"content_sha256":"88b19789c685dfac02b9ce54112c0280f72c3e131af860811d6b9a12f0e41e4a","schema_version":"1.0","event_id":"sha256:88b19789c685dfac02b9ce54112c0280f72c3e131af860811d6b9a12f0e41e4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UAQ22TP5EHKZTKDOFE2NLPKZ6/bundle.json","state_url":"https://pith.science/pith/3UAQ22TP5EHKZTKDOFE2NLPKZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UAQ22TP5EHKZTKDOFE2NLPKZ6/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-12T17:55:41Z","links":{"resolver":"https://pith.science/pith/3UAQ22TP5EHKZTKDOFE2NLPKZ6","bundle":"https://pith.science/pith/3UAQ22TP5EHKZTKDOFE2NLPKZ6/bundle.json","state":"https://pith.science/pith/3UAQ22TP5EHKZTKDOFE2NLPKZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UAQ22TP5EHKZTKDOFE2NLPKZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3UAQ22TP5EHKZTKDOFE2NLPKZ6","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":"19fdd2d97a3dd8d0a4b73869daf2a2b6be45410bcba5181ef19b8148f21593ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-12-02T22:41:05Z","title_canon_sha256":"789bf544ec45ed4fde1806134028f6ed330333f1bd5313be008989860e3020ac"},"schema_version":"1.0","source":{"id":"2212.01473","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.01473","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"2212.01473v3","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01473","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"3UAQ22TP5EHK","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_16","alias_value":"3UAQ22TP5EHKZTKD","created_at":"2026-07-05T10:53:07Z"},{"alias_kind":"pith_short_8","alias_value":"3UAQ22TP","created_at":"2026-07-05T10:53:07Z"}],"graph_snapshots":[{"event_id":"sha256:88b19789c685dfac02b9ce54112c0280f72c3e131af860811d6b9a12f0e41e4a","target":"graph","created_at":"2026-07-05T10:53: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.01473/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a GPU solution for exact maximal clique enumeration (MCE) that performs a search tree traversal following the Bron-Kerbosch algorithm. Prior works on parallelizing MCE on GPUs perform a breadth-first traversal of the tree, which has limited scalability because of the explosion in the number of tree nodes at deep levels. We propose to parallelize MCE on GPUs by performing depth-first traversal of independent subtrees in parallel. Since MCE suffers from high load imbalance and memory capacity requirements, we propose a worker list for dynamic load balancing, as well as partial induced","authors_text":"Izzat El Hajj, Jinjun Xiong, Mohammad Almasri, Rakesh Nagi, Wen-Mei Hwu, Yen-Hsiang Chang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-12-02T22:41:05Z","title":"Parallelizing Maximal Clique Enumeration on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01473","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:b6a1c50cd7a97a7063479ca88e37af30e23ad8eb1c711c819a9640781e5d5c02","target":"record","created_at":"2026-07-05T10:53: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":"19fdd2d97a3dd8d0a4b73869daf2a2b6be45410bcba5181ef19b8148f21593ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-12-02T22:41:05Z","title_canon_sha256":"789bf544ec45ed4fde1806134028f6ed330333f1bd5313be008989860e3020ac"},"schema_version":"1.0","source":{"id":"2212.01473","kind":"arxiv","version":3}},"canonical_sha256":"dd010d6a6fe90eaccd437149a6adeacf8b518d4b4c3dd653ecf10501f9c876eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd010d6a6fe90eaccd437149a6adeacf8b518d4b4c3dd653ecf10501f9c876eb","first_computed_at":"2026-07-05T10:53:07.436161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:07.436161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PCZYsLGG4OBSst/h1FIzTARONXEhuKFmVrjukC3c397tGtZRtBxwcMboUPCg9zv33E0wcdR0dgGgoiwb0enCBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:07.436652Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.01473","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6a1c50cd7a97a7063479ca88e37af30e23ad8eb1c711c819a9640781e5d5c02","sha256:88b19789c685dfac02b9ce54112c0280f72c3e131af860811d6b9a12f0e41e4a"],"state_sha256":"c61c6e812cce996a1b924d79864cd1d8a69b5fe9fe01d7481c7482688615b82b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXu7mXsB44g+NZ4C78gVJTfYxB0X2bjOEkJYbYObrVVQ8JpG9z7DnMbT1mV1BvsRly8/DvRtUxy3gAy0YEugCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T17:55:41.573938Z","bundle_sha256":"ad0880065b9adb6f0ac21cdb94a927cedf78b857a58c0945d4a3ca8e425ca502"}}