{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YF65AQU6M4VUTBRQUNGZF5LDSA","short_pith_number":"pith:YF65AQU6","schema_version":"1.0","canonical_sha256":"c17dd0429e672b498630a34d92f563900c42911d17cc8a7c8b1e6c67e5b1d806","source":{"kind":"arxiv","id":"2403.07858","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Biclique Counting on GPU","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Linshan Qiu, Lu Chen, Xiangyu Ke, Yunjun Gao, Zhonggen Li","submitted_at":"2024-03-12T17:48:11Z","abstract_excerpt":"Counting (p,q)-bicliques in bipartite graphs poses a foundational challenge with broad applications, from densest subgraph discovery in algorithmic research to personalized content recommendation in practical scenarios. Despite its significance, current leading (p,q)-biclique counting algorithms fall short, particularly when faced with larger graph sizes and clique scales. Fortunately, the problem's inherent structure, allowing for the independent counting of each biclique starting from every vertex, combined with a substantial set intersections, makes it highly amenable to parallelization. Re"},"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":"2403.07858","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-12T17:48:11Z","cross_cats_sorted":[],"title_canon_sha256":"1aa3d31c25a167ded018d50bfe55cce0149f7a626b3c8021a30f0a665a5be148","abstract_canon_sha256":"5ba5586a7c2276ad600a76e3b44e08b2f362c43ab35ca6e3e8cff0276e70a7fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:28.615182Z","signature_b64":"ubxoEO7U6Je4rQYFJRKeikpT3Ok99BgbxfKRTP+Zv2AGj/vznP3zRUBT9oalS09UJwtFYZkoXKSXn3Qmai/vAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c17dd0429e672b498630a34d92f563900c42911d17cc8a7c8b1e6c67e5b1d806","last_reissued_at":"2026-07-05T07:58:28.614708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:28.614708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Biclique Counting on GPU","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Linshan Qiu, Lu Chen, Xiangyu Ke, Yunjun Gao, Zhonggen Li","submitted_at":"2024-03-12T17:48:11Z","abstract_excerpt":"Counting (p,q)-bicliques in bipartite graphs poses a foundational challenge with broad applications, from densest subgraph discovery in algorithmic research to personalized content recommendation in practical scenarios. Despite its significance, current leading (p,q)-biclique counting algorithms fall short, particularly when faced with larger graph sizes and clique scales. Fortunately, the problem's inherent structure, allowing for the independent counting of each biclique starting from every vertex, combined with a substantial set intersections, makes it highly amenable to parallelization. Re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07858","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/2403.07858/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":"2403.07858","created_at":"2026-07-05T07:58:28.614768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.07858v2","created_at":"2026-07-05T07:58:28.614768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07858","created_at":"2026-07-05T07:58:28.614768+00:00"},{"alias_kind":"pith_short_12","alias_value":"YF65AQU6M4VU","created_at":"2026-07-05T07:58:28.614768+00:00"},{"alias_kind":"pith_short_16","alias_value":"YF65AQU6M4VUTBRQ","created_at":"2026-07-05T07:58:28.614768+00:00"},{"alias_kind":"pith_short_8","alias_value":"YF65AQU6","created_at":"2026-07-05T07:58:28.614768+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01904","citing_title":"Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA","json":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA.json","graph_json":"https://pith.science/api/pith-number/YF65AQU6M4VUTBRQUNGZF5LDSA/graph.json","events_json":"https://pith.science/api/pith-number/YF65AQU6M4VUTBRQUNGZF5LDSA/events.json","paper":"https://pith.science/paper/YF65AQU6"},"agent_actions":{"view_html":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA","download_json":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA.json","view_paper":"https://pith.science/paper/YF65AQU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.07858&json=true","fetch_graph":"https://pith.science/api/pith-number/YF65AQU6M4VUTBRQUNGZF5LDSA/graph.json","fetch_events":"https://pith.science/api/pith-number/YF65AQU6M4VUTBRQUNGZF5LDSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/action/storage_attestation","attest_author":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/action/author_attestation","sign_citation":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/action/citation_signature","submit_replication":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/action/replication_record"}},"created_at":"2026-07-05T07:58:28.614768+00:00","updated_at":"2026-07-05T07:58:28.614768+00:00"}