{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TFJFKUGRU6U26JALPJOFXGPXLG","short_pith_number":"pith:TFJFKUGR","canonical_record":{"source":{"id":"1804.03327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T03:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"71686aacae650898f9592ffaa3f3103748e87b98ffd93e6a660694493c2dd1e5","abstract_canon_sha256":"93db17f8b217401c74fce34142fbe2893af519cf8a9fa264a8ff5ddb053960b0"},"schema_version":"1.0"},"canonical_sha256":"99525550d1a7a9af240b7a5c5b99f759ac3b227f7d15402e53383c141caefe03","source":{"kind":"arxiv","id":"1804.03327","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03327","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03327v3","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03327","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"TFJFKUGRU6U2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TFJFKUGRU6U26JAL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TFJFKUGR","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TFJFKUGRU6U26JALPJOFXGPXLG","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T03:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"71686aacae650898f9592ffaa3f3103748e87b98ffd93e6a660694493c2dd1e5","abstract_canon_sha256":"93db17f8b217401c74fce34142fbe2893af519cf8a9fa264a8ff5ddb053960b0"},"schema_version":"1.0"},"canonical_sha256":"99525550d1a7a9af240b7a5c5b99f759ac3b227f7d15402e53383c141caefe03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:48.152422Z","signature_b64":"SR5r5/yHPLEyz6fxZy8WvZPmK6L+CPDZCEC9SxzmAvsrbCCp+m0/WHP8j9Wcrw9j4TOFGNb56cUmTOMFKxppDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99525550d1a7a9af240b7a5c5b99f759ac3b227f7d15402e53383c141caefe03","last_reissued_at":"2026-05-18T00:12:48.151745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:48.151745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03327","source_version":3,"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-05-18T00:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U32lfMwQBskU12Fb4HrIWNrqTW6yWYTODUCZWDtGqPsRw8GI7yoPl33YyEfxAJYna/wDem9/QoE5LWQxadCKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:50:49.892546Z"},"content_sha256":"87e7a474316e6e1e2eaa3abce03ce4422adba57a01325182b3efb083019e9de4","schema_version":"1.0","event_id":"sha256:87e7a474316e6e1e2eaa3abce03ce4422adba57a01325182b3efb083019e9de4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TFJFKUGRU6U26JALPJOFXGPXLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementing Push-Pull Efficiently in GraphBLAS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aydin Buluc, Carl Yang, John D. Owens","submitted_at":"2018-04-10T03:33:03Z","abstract_excerpt":"We factor Beamer's push-pull, also known as direction-optimized breadth-first-search (DOBFS) into 3 separable optimizations, and analyze them for generalizability, asymptotic speedup, and contribution to overall speedup. We demonstrate that masking is critical for high performance and can be generalized to all graph algorithms where the sparsity pattern of the output is known a priori. We show that these graph algorithm optimizations, which together constitute DOBFS, can be neatly and separably described using linear algebra and can be expressed in the GraphBLAS linear-algebra-based framework."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03327","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOK3Uboq+6l8pXptamQ8bD0JtpUKTWVAFCKsnACX3NNKk22ukM/i6OdfUuIukpgD2OetV3HhX8IxzbT11pwLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:50:49.893087Z"},"content_sha256":"6d63a25975d020fbbca1d60ff3ff595a86c45bfae70510396d6b1f134c39f50e","schema_version":"1.0","event_id":"sha256:6d63a25975d020fbbca1d60ff3ff595a86c45bfae70510396d6b1f134c39f50e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/bundle.json","state_url":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFJFKUGRU6U26JALPJOFXGPXLG/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-05-28T07:50:49Z","links":{"resolver":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG","bundle":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/bundle.json","state":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFJFKUGRU6U26JALPJOFXGPXLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TFJFKUGRU6U26JALPJOFXGPXLG","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":"93db17f8b217401c74fce34142fbe2893af519cf8a9fa264a8ff5ddb053960b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T03:33:03Z","title_canon_sha256":"71686aacae650898f9592ffaa3f3103748e87b98ffd93e6a660694493c2dd1e5"},"schema_version":"1.0","source":{"id":"1804.03327","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03327","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03327v3","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03327","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"TFJFKUGRU6U2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TFJFKUGRU6U26JAL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TFJFKUGR","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6d63a25975d020fbbca1d60ff3ff595a86c45bfae70510396d6b1f134c39f50e","target":"graph","created_at":"2026-05-18T00:12:48Z","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"},"paper":{"abstract_excerpt":"We factor Beamer's push-pull, also known as direction-optimized breadth-first-search (DOBFS) into 3 separable optimizations, and analyze them for generalizability, asymptotic speedup, and contribution to overall speedup. We demonstrate that masking is critical for high performance and can be generalized to all graph algorithms where the sparsity pattern of the output is known a priori. We show that these graph algorithm optimizations, which together constitute DOBFS, can be neatly and separably described using linear algebra and can be expressed in the GraphBLAS linear-algebra-based framework.","authors_text":"Aydin Buluc, Carl Yang, John D. Owens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T03:33:03Z","title":"Implementing Push-Pull Efficiently in GraphBLAS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03327","kind":"arxiv","version":3},"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:87e7a474316e6e1e2eaa3abce03ce4422adba57a01325182b3efb083019e9de4","target":"record","created_at":"2026-05-18T00:12:48Z","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":"93db17f8b217401c74fce34142fbe2893af519cf8a9fa264a8ff5ddb053960b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T03:33:03Z","title_canon_sha256":"71686aacae650898f9592ffaa3f3103748e87b98ffd93e6a660694493c2dd1e5"},"schema_version":"1.0","source":{"id":"1804.03327","kind":"arxiv","version":3}},"canonical_sha256":"99525550d1a7a9af240b7a5c5b99f759ac3b227f7d15402e53383c141caefe03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99525550d1a7a9af240b7a5c5b99f759ac3b227f7d15402e53383c141caefe03","first_computed_at":"2026-05-18T00:12:48.151745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:48.151745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SR5r5/yHPLEyz6fxZy8WvZPmK6L+CPDZCEC9SxzmAvsrbCCp+m0/WHP8j9Wcrw9j4TOFGNb56cUmTOMFKxppDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:48.152422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03327","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87e7a474316e6e1e2eaa3abce03ce4422adba57a01325182b3efb083019e9de4","sha256:6d63a25975d020fbbca1d60ff3ff595a86c45bfae70510396d6b1f134c39f50e"],"state_sha256":"e6cf71daf672f623767d1f7fbe1245ea222399cf29fd98f8831c4e76c07cf54b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1o3zNPkVEHZkmeGt39ofeRQXpvtUPK71sT/CUDKugLL9f6/JtP44igxOhEJVGRXpPPVlOkzQqKGFW68VqXW9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:50:49.895011Z","bundle_sha256":"cef733c617101fb622f38ce534086f8c55064ccf7b83a3ac4fa5a01ae3285500"}}