{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:62XPQAO73FDESXERTJEE2F56ZD","short_pith_number":"pith:62XPQAO7","canonical_record":{"source":{"id":"2106.14402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-28T05:32:37Z","cross_cats_sorted":["cs.DM","cs.PF","math.CO"],"title_canon_sha256":"93b5fe0898fbfe969e6f8a3f0473c18f3b8a8ba0c10f1820335f2b7aaa7eb39f","abstract_canon_sha256":"3db4f2d82b140b43f6abf2b1b2eeaf9c0e38f78dd5f175b7256cc78923dd1499"},"schema_version":"1.0"},"canonical_sha256":"f6aef801dfd946495c919a484d17bec8ccb4d1d05015449a66b59c6cc823820a","source":{"kind":"arxiv","id":"2106.14402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14402","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14402v1","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14402","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"62XPQAO73FDE","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"pith_short_16","alias_value":"62XPQAO73FDESXER","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"pith_short_8","alias_value":"62XPQAO7","created_at":"2026-07-05T02:52:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:62XPQAO73FDESXERTJEE2F56ZD","target":"record","payload":{"canonical_record":{"source":{"id":"2106.14402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-28T05:32:37Z","cross_cats_sorted":["cs.DM","cs.PF","math.CO"],"title_canon_sha256":"93b5fe0898fbfe969e6f8a3f0473c18f3b8a8ba0c10f1820335f2b7aaa7eb39f","abstract_canon_sha256":"3db4f2d82b140b43f6abf2b1b2eeaf9c0e38f78dd5f175b7256cc78923dd1499"},"schema_version":"1.0"},"canonical_sha256":"f6aef801dfd946495c919a484d17bec8ccb4d1d05015449a66b59c6cc823820a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:50.286477Z","signature_b64":"vhNfbhuFkKkW5Rmq74o7zO2pgLTXhG77AKPQXxfpEjIAkWRyk89HfRNnA5OsUN+AqGsTFJty0+YvqZ8ViYphDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6aef801dfd946495c919a484d17bec8ccb4d1d05015449a66b59c6cc823820a","last_reissued_at":"2026-07-05T02:52:50.286096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:50.286096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.14402","source_version":1,"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-05T02:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fp1SIxRqmLezUnurbsB7JBXeQPsqGdBj+/JJuh6xuVNf3o6IW+EkhCqNcYEd72WCocHqaZy9AySyiDTk1XneBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:09:51.001377Z"},"content_sha256":"09b6a1bac835e040b15b62b88c5723a29add602fefb5dd0d38a4a2efd27e849d","schema_version":"1.0","event_id":"sha256:09b6a1bac835e040b15b62b88c5723a29add602fefb5dd0d38a4a2efd27e849d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:62XPQAO73FDESXERTJEE2F56ZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.PF","math.CO"],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Buluc, John R. Gilbert, Md Taufique Hussain, Oguz Selvitopi","submitted_at":"2021-06-28T05:32:37Z","abstract_excerpt":"Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The Combinatorial BLAS library implements key computational primitives for rapid development of combinatorial algorithms in distributed-memory systems. During the decade since its first introduction, the Combinatorial BLAS library has evolved and expanded significantly.\n  This paper details many of the key technical features of Combinatorial BLAS version 2.0, such as communication avoidance, hierarchical parallelism via in-node multith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14402","kind":"arxiv","version":1},"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/2106.14402/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-05T02:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIcvldn8sNWOKpferZgZdAMWOGFdknSdaM2tRojNnL1LiYyKF5Q5lF20wRmeaLllY52rtXQ86HHQC0a1L0ogBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:09:51.001745Z"},"content_sha256":"3de2734fb431d63a811864ef09cd014e72342fa75a20c010e66654e44c2bf9b0","schema_version":"1.0","event_id":"sha256:3de2734fb431d63a811864ef09cd014e72342fa75a20c010e66654e44c2bf9b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62XPQAO73FDESXERTJEE2F56ZD/bundle.json","state_url":"https://pith.science/pith/62XPQAO73FDESXERTJEE2F56ZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62XPQAO73FDESXERTJEE2F56ZD/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-07-06T23:09:51Z","links":{"resolver":"https://pith.science/pith/62XPQAO73FDESXERTJEE2F56ZD","bundle":"https://pith.science/pith/62XPQAO73FDESXERTJEE2F56ZD/bundle.json","state":"https://pith.science/pith/62XPQAO73FDESXERTJEE2F56ZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62XPQAO73FDESXERTJEE2F56ZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:62XPQAO73FDESXERTJEE2F56ZD","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":"3db4f2d82b140b43f6abf2b1b2eeaf9c0e38f78dd5f175b7256cc78923dd1499","cross_cats_sorted":["cs.DM","cs.PF","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-28T05:32:37Z","title_canon_sha256":"93b5fe0898fbfe969e6f8a3f0473c18f3b8a8ba0c10f1820335f2b7aaa7eb39f"},"schema_version":"1.0","source":{"id":"2106.14402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14402","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14402v1","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14402","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"62XPQAO73FDE","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"pith_short_16","alias_value":"62XPQAO73FDESXER","created_at":"2026-07-05T02:52:50Z"},{"alias_kind":"pith_short_8","alias_value":"62XPQAO7","created_at":"2026-07-05T02:52:50Z"}],"graph_snapshots":[{"event_id":"sha256:3de2734fb431d63a811864ef09cd014e72342fa75a20c010e66654e44c2bf9b0","target":"graph","created_at":"2026-07-05T02:52:50Z","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/2106.14402/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The Combinatorial BLAS library implements key computational primitives for rapid development of combinatorial algorithms in distributed-memory systems. During the decade since its first introduction, the Combinatorial BLAS library has evolved and expanded significantly.\n  This paper details many of the key technical features of Combinatorial BLAS version 2.0, such as communication avoidance, hierarchical parallelism via in-node multith","authors_text":"Ariful Azad, Aydin Buluc, John R. Gilbert, Md Taufique Hussain, Oguz Selvitopi","cross_cats":["cs.DM","cs.PF","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-28T05:32:37Z","title":"Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14402","kind":"arxiv","version":1},"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:09b6a1bac835e040b15b62b88c5723a29add602fefb5dd0d38a4a2efd27e849d","target":"record","created_at":"2026-07-05T02:52:50Z","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":"3db4f2d82b140b43f6abf2b1b2eeaf9c0e38f78dd5f175b7256cc78923dd1499","cross_cats_sorted":["cs.DM","cs.PF","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-06-28T05:32:37Z","title_canon_sha256":"93b5fe0898fbfe969e6f8a3f0473c18f3b8a8ba0c10f1820335f2b7aaa7eb39f"},"schema_version":"1.0","source":{"id":"2106.14402","kind":"arxiv","version":1}},"canonical_sha256":"f6aef801dfd946495c919a484d17bec8ccb4d1d05015449a66b59c6cc823820a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6aef801dfd946495c919a484d17bec8ccb4d1d05015449a66b59c6cc823820a","first_computed_at":"2026-07-05T02:52:50.286096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:52:50.286096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhNfbhuFkKkW5Rmq74o7zO2pgLTXhG77AKPQXxfpEjIAkWRyk89HfRNnA5OsUN+AqGsTFJty0+YvqZ8ViYphDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:52:50.286477Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.14402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09b6a1bac835e040b15b62b88c5723a29add602fefb5dd0d38a4a2efd27e849d","sha256:3de2734fb431d63a811864ef09cd014e72342fa75a20c010e66654e44c2bf9b0"],"state_sha256":"67f8ee3f1c12e909307821e8fdaf98b17fd06d4d34d0e9dff7f9902b7dd536fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rb5cn71KjWK7Em/l064QXQ0fmqqnfFi/pgmK9feg+FgNas6WCKTkmoZL+j9LABW8PEY8J13HkGvdBQ1KX6ZSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:09:51.003572Z","bundle_sha256":"735ad5a4748ec3bd7c6febe94d95011a371e05161d11357a41e9a29704d4a01e"}}