{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CGGYICRU5R7M2YU35VOQ7U2ZYS","short_pith_number":"pith:CGGYICRU","canonical_record":{"source":{"id":"2201.08560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-01-21T06:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"560f017be221814f256864ce4bb87602dae9b3d5767f673864d0cf511ea19441","abstract_canon_sha256":"89c7785a746db5ec58ade1c29febc98455e838d126755a4a17c5e21c8bad6216"},"schema_version":"1.0"},"canonical_sha256":"118d840a34ec7ecd629bed5d0fd359c4b41b937a6009180fce5f308062efd6bf","source":{"kind":"arxiv","id":"2201.08560","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.08560","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"2201.08560v2","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.08560","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"CGGYICRU5R7M","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"pith_short_16","alias_value":"CGGYICRU5R7M2YU3","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"pith_short_8","alias_value":"CGGYICRU","created_at":"2026-07-05T03:59:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CGGYICRU5R7M2YU35VOQ7U2ZYS","target":"record","payload":{"canonical_record":{"source":{"id":"2201.08560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-01-21T06:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"560f017be221814f256864ce4bb87602dae9b3d5767f673864d0cf511ea19441","abstract_canon_sha256":"89c7785a746db5ec58ade1c29febc98455e838d126755a4a17c5e21c8bad6216"},"schema_version":"1.0"},"canonical_sha256":"118d840a34ec7ecd629bed5d0fd359c4b41b937a6009180fce5f308062efd6bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:59:01.350676Z","signature_b64":"+jDyOVoxvMtV/4Nw2QeXmSIp44MT0dO47sclPHtQXxO51QBSf4l/8wNRx6NHdF+6KzLmYJGWukAYtR35NTVXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118d840a34ec7ecd629bed5d0fd359c4b41b937a6009180fce5f308062efd6bf","last_reissued_at":"2026-07-05T03:59:01.350180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:59:01.350180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.08560","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-05T03:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrrkwN4yzAiUC2XsXeG/brmjEsykqCxdtwMxYznw5fSeE7+g4E4/0N28Ww9/0xaAFnRo1isS07OifQ8orqhxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:35:57.169862Z"},"content_sha256":"4d8795a10af0e99145ad6d24d74c14648726bd3518fc9694be80b603c6c3f26a","schema_version":"1.0","event_id":"sha256:4d8795a10af0e99145ad6d24d74c14648726bd3518fc9694be80b603c6c3f26a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CGGYICRU5R7M2YU35VOQ7U2ZYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ang Li, Hsin-Hsuan Sung, Jou-An Chen, Kevin Barker, Nathan Tallent, Xipeng Shen","submitted_at":"2022-01-21T06:35:12Z","abstract_excerpt":"In a general graph data structure like an adjacency matrix, when edges are homogeneous, the connectivity of two nodes can be sufficiently represented using a single bit. This insight has, however, not yet been adequately exploited by the existing matrix-centric graph processing frameworks. This work fills the void by systematically exploring the bit-level representation of graphs and the corresponding optimizations to the graph operations. It proposes a two-level representation named Bit-Block Compressed Sparse Row (B2SR) and presents a series of optimizations to the graph operations on B2SR b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.08560","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/2201.08560/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-05T03:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzZzUZGjc1vJVraTvg7e9SIIrrRquBJrkqxuFKWrjFmnkzFsu/oy4cEL1jzlkcK2FX3ofc6L52I0gPX5HoCNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:35:57.170385Z"},"content_sha256":"668622b11a1458fc5564b24aca77684c07bbebce017046837dc515615b68298c","schema_version":"1.0","event_id":"sha256:668622b11a1458fc5564b24aca77684c07bbebce017046837dc515615b68298c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGGYICRU5R7M2YU35VOQ7U2ZYS/bundle.json","state_url":"https://pith.science/pith/CGGYICRU5R7M2YU35VOQ7U2ZYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGGYICRU5R7M2YU35VOQ7U2ZYS/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-14T06:35:57Z","links":{"resolver":"https://pith.science/pith/CGGYICRU5R7M2YU35VOQ7U2ZYS","bundle":"https://pith.science/pith/CGGYICRU5R7M2YU35VOQ7U2ZYS/bundle.json","state":"https://pith.science/pith/CGGYICRU5R7M2YU35VOQ7U2ZYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGGYICRU5R7M2YU35VOQ7U2ZYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CGGYICRU5R7M2YU35VOQ7U2ZYS","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":"89c7785a746db5ec58ade1c29febc98455e838d126755a4a17c5e21c8bad6216","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-01-21T06:35:12Z","title_canon_sha256":"560f017be221814f256864ce4bb87602dae9b3d5767f673864d0cf511ea19441"},"schema_version":"1.0","source":{"id":"2201.08560","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.08560","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"2201.08560v2","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.08560","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"CGGYICRU5R7M","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"pith_short_16","alias_value":"CGGYICRU5R7M2YU3","created_at":"2026-07-05T03:59:01Z"},{"alias_kind":"pith_short_8","alias_value":"CGGYICRU","created_at":"2026-07-05T03:59:01Z"}],"graph_snapshots":[{"event_id":"sha256:668622b11a1458fc5564b24aca77684c07bbebce017046837dc515615b68298c","target":"graph","created_at":"2026-07-05T03:59:01Z","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/2201.08560/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a general graph data structure like an adjacency matrix, when edges are homogeneous, the connectivity of two nodes can be sufficiently represented using a single bit. This insight has, however, not yet been adequately exploited by the existing matrix-centric graph processing frameworks. This work fills the void by systematically exploring the bit-level representation of graphs and the corresponding optimizations to the graph operations. It proposes a two-level representation named Bit-Block Compressed Sparse Row (B2SR) and presents a series of optimizations to the graph operations on B2SR b","authors_text":"Ang Li, Hsin-Hsuan Sung, Jou-An Chen, Kevin Barker, Nathan Tallent, Xipeng Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-01-21T06:35:12Z","title":"Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.08560","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:4d8795a10af0e99145ad6d24d74c14648726bd3518fc9694be80b603c6c3f26a","target":"record","created_at":"2026-07-05T03:59:01Z","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":"89c7785a746db5ec58ade1c29febc98455e838d126755a4a17c5e21c8bad6216","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-01-21T06:35:12Z","title_canon_sha256":"560f017be221814f256864ce4bb87602dae9b3d5767f673864d0cf511ea19441"},"schema_version":"1.0","source":{"id":"2201.08560","kind":"arxiv","version":2}},"canonical_sha256":"118d840a34ec7ecd629bed5d0fd359c4b41b937a6009180fce5f308062efd6bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"118d840a34ec7ecd629bed5d0fd359c4b41b937a6009180fce5f308062efd6bf","first_computed_at":"2026-07-05T03:59:01.350180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:59:01.350180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+jDyOVoxvMtV/4Nw2QeXmSIp44MT0dO47sclPHtQXxO51QBSf4l/8wNRx6NHdF+6KzLmYJGWukAYtR35NTVXAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:59:01.350676Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.08560","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d8795a10af0e99145ad6d24d74c14648726bd3518fc9694be80b603c6c3f26a","sha256:668622b11a1458fc5564b24aca77684c07bbebce017046837dc515615b68298c"],"state_sha256":"f1d99b0a51b7156b8cacd330608d90573e66606571b7446f098b8bbf0c2d2a32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z90W2/A8a857FS1u/6776Qqe3hQ4RtygHfwUTI8JvinkVvAOrbBt4MPb+COdeem9lNc67L1qtHxhL0/fzzXcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:35:57.175537Z","bundle_sha256":"1300e3afe48dee0481a124666519bf91134cec5db42a3acd644bef46fc3c3ac7"}}