{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YF65AQU6M4VUTBRQUNGZF5LDSA","short_pith_number":"pith:YF65AQU6","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"},"canonical_sha256":"c17dd0429e672b498630a34d92f563900c42911d17cc8a7c8b1e6c67e5b1d806","source":{"kind":"arxiv","id":"2403.07858","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.07858","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"arxiv_version","alias_value":"2403.07858v2","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07858","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"pith_short_12","alias_value":"YF65AQU6M4VU","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"pith_short_16","alias_value":"YF65AQU6M4VUTBRQ","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"pith_short_8","alias_value":"YF65AQU6","created_at":"2026-07-05T07:58:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YF65AQU6M4VUTBRQUNGZF5LDSA","target":"record","payload":{"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"},"canonical_sha256":"c17dd0429e672b498630a34d92f563900c42911d17cc8a7c8b1e6c67e5b1d806","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"},"source_kind":"arxiv","source_id":"2403.07858","source_version":2,"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-05T07:58:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWRO5+n3vxApQXuUVQuDdS1XZualI6tC8Uwi87xOG1wthxKPjK+x+32u/yDUAMM48GtJdRojvSknrYJg+gowBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:23:06.867806Z"},"content_sha256":"7c55ba998ae81cb99df9d73f2ce4190968ac3b952066917a35f1d37a980b81e0","schema_version":"1.0","event_id":"sha256:7c55ba998ae81cb99df9d73f2ce4190968ac3b952066917a35f1d37a980b81e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YF65AQU6M4VUTBRQUNGZF5LDSA","target":"graph","payload":{"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"},"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-05T07:58:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIfvXMZyuTrne+d/RQjT9BXwTnPXlizTrRNuzZP2yn0mBuzicsQYhDBBA7VnXyZ3Y/u5TsoC1kn70l2qNXnFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:23:06.868397Z"},"content_sha256":"4f09b78918ba26cc707cd86010228ba197c5960994a7ef6b689788520f270562","schema_version":"1.0","event_id":"sha256:4f09b78918ba26cc707cd86010228ba197c5960994a7ef6b689788520f270562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/bundle.json","state_url":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/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-11T04:23:06Z","links":{"resolver":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA","bundle":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/bundle.json","state":"https://pith.science/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YF65AQU6M4VUTBRQUNGZF5LDSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YF65AQU6M4VUTBRQUNGZF5LDSA","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":"5ba5586a7c2276ad600a76e3b44e08b2f362c43ab35ca6e3e8cff0276e70a7fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-12T17:48:11Z","title_canon_sha256":"1aa3d31c25a167ded018d50bfe55cce0149f7a626b3c8021a30f0a665a5be148"},"schema_version":"1.0","source":{"id":"2403.07858","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.07858","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"arxiv_version","alias_value":"2403.07858v2","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07858","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"pith_short_12","alias_value":"YF65AQU6M4VU","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"pith_short_16","alias_value":"YF65AQU6M4VUTBRQ","created_at":"2026-07-05T07:58:28Z"},{"alias_kind":"pith_short_8","alias_value":"YF65AQU6","created_at":"2026-07-05T07:58:28Z"}],"graph_snapshots":[{"event_id":"sha256:4f09b78918ba26cc707cd86010228ba197c5960994a7ef6b689788520f270562","target":"graph","created_at":"2026-07-05T07:58:28Z","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/2403.07858/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Linshan Qiu, Lu Chen, Xiangyu Ke, Yunjun Gao, Zhonggen Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-12T17:48:11Z","title":"Accelerating Biclique Counting on GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07858","kind":"arxiv","version":2},"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:7c55ba998ae81cb99df9d73f2ce4190968ac3b952066917a35f1d37a980b81e0","target":"record","created_at":"2026-07-05T07:58:28Z","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":"5ba5586a7c2276ad600a76e3b44e08b2f362c43ab35ca6e3e8cff0276e70a7fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-12T17:48:11Z","title_canon_sha256":"1aa3d31c25a167ded018d50bfe55cce0149f7a626b3c8021a30f0a665a5be148"},"schema_version":"1.0","source":{"id":"2403.07858","kind":"arxiv","version":2}},"canonical_sha256":"c17dd0429e672b498630a34d92f563900c42911d17cc8a7c8b1e6c67e5b1d806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c17dd0429e672b498630a34d92f563900c42911d17cc8a7c8b1e6c67e5b1d806","first_computed_at":"2026-07-05T07:58:28.614708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:58:28.614708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubxoEO7U6Je4rQYFJRKeikpT3Ok99BgbxfKRTP+Zv2AGj/vznP3zRUBT9oalS09UJwtFYZkoXKSXn3Qmai/vAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:58:28.615182Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.07858","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c55ba998ae81cb99df9d73f2ce4190968ac3b952066917a35f1d37a980b81e0","sha256:4f09b78918ba26cc707cd86010228ba197c5960994a7ef6b689788520f270562"],"state_sha256":"5fcf8faa82dc51e5c6134199e4d9a741acaf05745446a9236e28ee15e692f3c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8oZsAcx6MGz9LEuGLK7GLVNXzUdHfNx4KYYQXMxLOESFhrRkiPvPTRUF1HHK/zF1SJuOrX37KDsgDEVIAMEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:23:06.881121Z","bundle_sha256":"ce75eadc2c2df990ce9a84276eecb5f715085f8bfebf0b7d3d193790be1da843"}}