{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6AZBO426IWFDGQJGCOSMBITGHG","short_pith_number":"pith:6AZBO426","schema_version":"1.0","canonical_sha256":"f03217735e458a33412613a4c0a2663997018d612f7b291808c71e2568990c7d","source":{"kind":"arxiv","id":"1903.07754","version":1},"attestation_state":"computed","paper":{"title":"A New Frontier for Pull-Based Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christos Kozyrakis, Samuel Grossman","submitted_at":"2019-03-18T22:56:34Z","abstract_excerpt":"The trade-off between pull-based and push-based graph processing engines is well-understood. On one hand, pull-based engines can achieve higher throughput because their workloads are read-dominant, rather than write-dominant, and can proceed without synchronization between threads. On the other hand, push-based engines are much better able to take advantage of the frontier optimization, which leverages the fact that often only a small subset of the graph needs to be accessed to complete an iteration of a graph processing application. Hybrid engines attempt to overcome this trade-off by dynamic"},"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":"1903.07754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-18T22:56:34Z","cross_cats_sorted":[],"title_canon_sha256":"5de0d6faca4e24d84cfcaf7aca0b958f319c9cd41720e172048626a372316c0d","abstract_canon_sha256":"ea8981ca0dc1756cf0e17e57780d9faea2324d98a9b82767b85f75e28f7e2b59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:54.091399Z","signature_b64":"LAreStZcwzwpr/QyeNO/fHPZzi6jw/4c7akNeiGZ+6lxU2N/DxoDMXAKYQAWxM3Wm561najqMeLBwP0Q7MsNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f03217735e458a33412613a4c0a2663997018d612f7b291808c71e2568990c7d","last_reissued_at":"2026-05-17T23:50:54.090694Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:54.090694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Frontier for Pull-Based Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christos Kozyrakis, Samuel Grossman","submitted_at":"2019-03-18T22:56:34Z","abstract_excerpt":"The trade-off between pull-based and push-based graph processing engines is well-understood. On one hand, pull-based engines can achieve higher throughput because their workloads are read-dominant, rather than write-dominant, and can proceed without synchronization between threads. On the other hand, push-based engines are much better able to take advantage of the frontier optimization, which leverages the fact that often only a small subset of the graph needs to be accessed to complete an iteration of a graph processing application. Hybrid engines attempt to overcome this trade-off by dynamic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07754","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":""},"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":"1903.07754","created_at":"2026-05-17T23:50:54.090801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07754v1","created_at":"2026-05-17T23:50:54.090801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07754","created_at":"2026-05-17T23:50:54.090801+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AZBO426IWFD","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AZBO426IWFDGQJG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AZBO426","created_at":"2026-05-18T12:33:10.108867+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/6AZBO426IWFDGQJGCOSMBITGHG","json":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG.json","graph_json":"https://pith.science/api/pith-number/6AZBO426IWFDGQJGCOSMBITGHG/graph.json","events_json":"https://pith.science/api/pith-number/6AZBO426IWFDGQJGCOSMBITGHG/events.json","paper":"https://pith.science/paper/6AZBO426"},"agent_actions":{"view_html":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG","download_json":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG.json","view_paper":"https://pith.science/paper/6AZBO426","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07754&json=true","fetch_graph":"https://pith.science/api/pith-number/6AZBO426IWFDGQJGCOSMBITGHG/graph.json","fetch_events":"https://pith.science/api/pith-number/6AZBO426IWFDGQJGCOSMBITGHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/action/storage_attestation","attest_author":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/action/author_attestation","sign_citation":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/action/citation_signature","submit_replication":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/action/replication_record"}},"created_at":"2026-05-17T23:50:54.090801+00:00","updated_at":"2026-05-17T23:50:54.090801+00:00"}