{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EAYCJFYLD76A2C2BLRPERDCEIU","short_pith_number":"pith:EAYCJFYL","schema_version":"1.0","canonical_sha256":"203024970b1ffc0d0b415c5e488c44452b057fbd26afb89b0a6045f6559cd431","source":{"kind":"arxiv","id":"2104.13209","version":2},"attestation_state":"computed","paper":{"title":"Parallel K-Clique Counting on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Izzat El Hajj, Jinjun Xiong, Mohammad Almasri, Rakesh Nagi, Wen-Mei Hwu","submitted_at":"2021-04-27T14:18:03Z","abstract_excerpt":"Counting k-cliques in a graph is an important problem in graph analysis with many applications such as community detection and graph partitioning. Counting k-cliques is typically done by traversing search trees starting at each vertex in the graph. Parallelizing k-clique counting has been well-studied on CPUs and many solutions exist. However, there are no performant solutions for k-clique counting on GPUs.\n  Parallelizing k-clique counting on GPUs comes with numerous challenges such as the need for extracting fine-grain multi-level parallelism, sensitivity to load imbalance, and constrained p"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2104.13209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-04-27T14:18:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1325a70e95dc703282cfa09288ab42b47bac68e6de016bde69287bfd941d0be2","abstract_canon_sha256":"28fa2dc10625dbd109697b36c45dcfa80011a66a20edd117a0212eccba076d7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:29:08.285294Z","signature_b64":"96wPaqURqeYMyfhHwrAkyctwz0m/Zr2zkUKXHPCqLbBMP3ayoqoBRLDxTi//CR9sOP/+J8bKTtbljGigHcHQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"203024970b1ffc0d0b415c5e488c44452b057fbd26afb89b0a6045f6559cd431","last_reissued_at":"2026-07-05T04:29:08.284781Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:29:08.284781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel K-Clique Counting on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Izzat El Hajj, Jinjun Xiong, Mohammad Almasri, Rakesh Nagi, Wen-Mei Hwu","submitted_at":"2021-04-27T14:18:03Z","abstract_excerpt":"Counting k-cliques in a graph is an important problem in graph analysis with many applications such as community detection and graph partitioning. Counting k-cliques is typically done by traversing search trees starting at each vertex in the graph. Parallelizing k-clique counting has been well-studied on CPUs and many solutions exist. However, there are no performant solutions for k-clique counting on GPUs.\n  Parallelizing k-clique counting on GPUs comes with numerous challenges such as the need for extracting fine-grain multi-level parallelism, sensitivity to load imbalance, and constrained p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.13209","kind":"arxiv","version":2},"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/2104.13209/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.13209","created_at":"2026-07-05T04:29:08.284844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.13209v2","created_at":"2026-07-05T04:29:08.284844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.13209","created_at":"2026-07-05T04:29:08.284844+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAYCJFYLD76A","created_at":"2026-07-05T04:29:08.284844+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAYCJFYLD76A2C2B","created_at":"2026-07-05T04:29:08.284844+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAYCJFYL","created_at":"2026-07-05T04:29:08.284844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU","json":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU.json","graph_json":"https://pith.science/api/pith-number/EAYCJFYLD76A2C2BLRPERDCEIU/graph.json","events_json":"https://pith.science/api/pith-number/EAYCJFYLD76A2C2BLRPERDCEIU/events.json","paper":"https://pith.science/paper/EAYCJFYL"},"agent_actions":{"view_html":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU","download_json":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU.json","view_paper":"https://pith.science/paper/EAYCJFYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.13209&json=true","fetch_graph":"https://pith.science/api/pith-number/EAYCJFYLD76A2C2BLRPERDCEIU/graph.json","fetch_events":"https://pith.science/api/pith-number/EAYCJFYLD76A2C2BLRPERDCEIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU/action/storage_attestation","attest_author":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU/action/author_attestation","sign_citation":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU/action/citation_signature","submit_replication":"https://pith.science/pith/EAYCJFYLD76A2C2BLRPERDCEIU/action/replication_record"}},"created_at":"2026-07-05T04:29:08.284844+00:00","updated_at":"2026-07-05T04:29:08.284844+00:00"}