{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6AZBO426IWFDGQJGCOSMBITGHG","short_pith_number":"pith:6AZBO426","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"},"canonical_sha256":"f03217735e458a33412613a4c0a2663997018d612f7b291808c71e2568990c7d","source":{"kind":"arxiv","id":"1903.07754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07754","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07754v1","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07754","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"pith_short_12","alias_value":"6AZBO426IWFD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6AZBO426IWFDGQJG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6AZBO426","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6AZBO426IWFDGQJGCOSMBITGHG","target":"record","payload":{"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"},"canonical_sha256":"f03217735e458a33412613a4c0a2663997018d612f7b291808c71e2568990c7d","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"},"source_kind":"arxiv","source_id":"1903.07754","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-05-17T23:50:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"loa0jjGTE2n6HuYBlPWzpC/I9CDy8JALRBQT51yHVBmQTfvavl5OZZEJ6nwRxeM6zftuUztEUKAobkr0eRTGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:15:26.970653Z"},"content_sha256":"5fe63d34df22700105fc02a8ffc62dd49715c629db4fbc2f09c7679db1ce46b1","schema_version":"1.0","event_id":"sha256:5fe63d34df22700105fc02a8ffc62dd49715c629db4fbc2f09c7679db1ce46b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6AZBO426IWFDGQJGCOSMBITGHG","target":"graph","payload":{"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"},"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-17T23:50:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GioHZuG/cEf/PJ2tG+xApbTQcu77XL4y/jo9PldJeKH9wOywqPvIeV28Bok6oa/v7NBtAjp2qZEA3xB+3N+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:15:26.971350Z"},"content_sha256":"b3c405700d720b6dfac39b6523922ad127587747d13eeafa64a7e8242a0ffebc","schema_version":"1.0","event_id":"sha256:b3c405700d720b6dfac39b6523922ad127587747d13eeafa64a7e8242a0ffebc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/bundle.json","state_url":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AZBO426IWFDGQJGCOSMBITGHG/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-06-11T04:15:26Z","links":{"resolver":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG","bundle":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/bundle.json","state":"https://pith.science/pith/6AZBO426IWFDGQJGCOSMBITGHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AZBO426IWFDGQJGCOSMBITGHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6AZBO426IWFDGQJGCOSMBITGHG","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":"ea8981ca0dc1756cf0e17e57780d9faea2324d98a9b82767b85f75e28f7e2b59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-18T22:56:34Z","title_canon_sha256":"5de0d6faca4e24d84cfcaf7aca0b958f319c9cd41720e172048626a372316c0d"},"schema_version":"1.0","source":{"id":"1903.07754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07754","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07754v1","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07754","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"pith_short_12","alias_value":"6AZBO426IWFD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6AZBO426IWFDGQJG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6AZBO426","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:b3c405700d720b6dfac39b6523922ad127587747d13eeafa64a7e8242a0ffebc","target":"graph","created_at":"2026-05-17T23:50:54Z","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":"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","authors_text":"Christos Kozyrakis, Samuel Grossman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-18T22:56:34Z","title":"A New Frontier for Pull-Based Graph Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07754","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:5fe63d34df22700105fc02a8ffc62dd49715c629db4fbc2f09c7679db1ce46b1","target":"record","created_at":"2026-05-17T23:50:54Z","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":"ea8981ca0dc1756cf0e17e57780d9faea2324d98a9b82767b85f75e28f7e2b59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-18T22:56:34Z","title_canon_sha256":"5de0d6faca4e24d84cfcaf7aca0b958f319c9cd41720e172048626a372316c0d"},"schema_version":"1.0","source":{"id":"1903.07754","kind":"arxiv","version":1}},"canonical_sha256":"f03217735e458a33412613a4c0a2663997018d612f7b291808c71e2568990c7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f03217735e458a33412613a4c0a2663997018d612f7b291808c71e2568990c7d","first_computed_at":"2026-05-17T23:50:54.090694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:54.090694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LAreStZcwzwpr/QyeNO/fHPZzi6jw/4c7akNeiGZ+6lxU2N/DxoDMXAKYQAWxM3Wm561najqMeLBwP0Q7MsNDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:54.091399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fe63d34df22700105fc02a8ffc62dd49715c629db4fbc2f09c7679db1ce46b1","sha256:b3c405700d720b6dfac39b6523922ad127587747d13eeafa64a7e8242a0ffebc"],"state_sha256":"67e7736c1ed63ef37893f91963752f208db78ca9f54a34c5dbbdafa6c4a7def6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sR2YBeIL3U2X4H5VCexKbUuPdKm2Jswx1UJSPOatNtCTeqhaoU5U3jPNotrVx53yfTEkRUqVeknHyASA4iXJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:15:26.975174Z","bundle_sha256":"f53eb519b1beac3f6d0fccf818a1e6fe6e73c5d17473c68749cbbdec265acf84"}}