{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TFJFKUGRU6U26JALPJOFXGPXLG","short_pith_number":"pith:TFJFKUGR","schema_version":"1.0","canonical_sha256":"99525550d1a7a9af240b7a5c5b99f759ac3b227f7d15402e53383c141caefe03","source":{"kind":"arxiv","id":"1804.03327","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.03327","created_at":"2026-05-18T00:12:48.151861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03327v3","created_at":"2026-05-18T00:12:48.151861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03327","created_at":"2026-05-18T00:12:48.151861+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFJFKUGRU6U2","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFJFKUGRU6U26JAL","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFJFKUGR","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG","json":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG.json","graph_json":"https://pith.science/api/pith-number/TFJFKUGRU6U26JALPJOFXGPXLG/graph.json","events_json":"https://pith.science/api/pith-number/TFJFKUGRU6U26JALPJOFXGPXLG/events.json","paper":"https://pith.science/paper/TFJFKUGR"},"agent_actions":{"view_html":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG","download_json":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG.json","view_paper":"https://pith.science/paper/TFJFKUGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03327&json=true","fetch_graph":"https://pith.science/api/pith-number/TFJFKUGRU6U26JALPJOFXGPXLG/graph.json","fetch_events":"https://pith.science/api/pith-number/TFJFKUGRU6U26JALPJOFXGPXLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/action/storage_attestation","attest_author":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/action/author_attestation","sign_citation":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/action/citation_signature","submit_replication":"https://pith.science/pith/TFJFKUGRU6U26JALPJOFXGPXLG/action/replication_record"}},"created_at":"2026-05-18T00:12:48.151861+00:00","updated_at":"2026-05-18T00:12:48.151861+00:00"}