{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GPJJRSX5W4ULMOVRQRQ6CYMD6M","short_pith_number":"pith:GPJJRSX5","canonical_record":{"source":{"id":"1407.0455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-07-02T05:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"3c0e082caa956ddfb4bf0b8e528c86875414d5aa0d673934f99194bf3357716e","abstract_canon_sha256":"0fc3985b06a820ead93dcd96940b001c64c024bd6b19afe0f0fadbb3edb7070a"},"schema_version":"1.0"},"canonical_sha256":"33d298cafdb728b63ab18461e16183f33abca02fe96536066a045185625b26ce","source":{"kind":"arxiv","id":"1407.0455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0455","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0455v1","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0455","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"GPJJRSX5W4UL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPJJRSX5W4ULMOVR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPJJRSX5","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GPJJRSX5W4ULMOVRQRQ6CYMD6M","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-07-02T05:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"3c0e082caa956ddfb4bf0b8e528c86875414d5aa0d673934f99194bf3357716e","abstract_canon_sha256":"0fc3985b06a820ead93dcd96940b001c64c024bd6b19afe0f0fadbb3edb7070a"},"schema_version":"1.0"},"canonical_sha256":"33d298cafdb728b63ab18461e16183f33abca02fe96536066a045185625b26ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:33.727926Z","signature_b64":"ZRU1pMgHNVZESOtFwlCuixr3ABjRkzHFl5Zh2iCNXh9ShzptBigqWr7fF2OMl09VeYi9QGmPIunIybvoeCb8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d298cafdb728b63ab18461e16183f33abca02fe96536066a045185625b26ce","last_reissued_at":"2026-05-18T02:48:33.727341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:33.727341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0455","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-18T02:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/klg688MeroqEr+XTNad7YkXUAB8QsACNVgfIYyG4ZEQmpg1tDFCKYtQZ7mPEbpwIczfViSuusfW1x/XXirDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:09:00.478819Z"},"content_sha256":"c57f1829d306a1417d7750b39172f9f7a5c34ed14eb26772fbc0d8e1d39b4301","schema_version":"1.0","event_id":"sha256:c57f1829d306a1417d7750b39172f9f7a5c34ed14eb26772fbc0d8e1d39b4301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GPJJRSX5W4ULMOVRQRQ6CYMD6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pregelix: Big(ger) Graph Analytics on A Dataflow Engine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jianfeng Jia, Michael J. Carey, Tyson Condie, Vinayak Borkar, Yingyi Bu","submitted_at":"2014-07-02T05:04:28Z","abstract_excerpt":"There is a growing need for distributed graph processing systems that are capable of gracefully scaling to very large graph datasets. Unfortunately, this challenge has not been easily met due to the intense memory pressure imposed by process-centric, message passing designs that many graph processing systems follow. Pregelix is a new open source distributed graph processing system that is based on an iterative dataflow design that is better tuned to handle both in-memory and out-of-core workloads. As such, Pregelix offers improved performance characteristics and scaling properties over current"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0455","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-18T02:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYoP+Qe5i14kxm8gEfeBtvKY4IIOVf9LUGDk0FsFcaa4sS6ozVdSdMRjYsqlRNmkdcokmtcxqgIsZOTMUqeVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:09:00.479166Z"},"content_sha256":"cbe5a15a2d11b2bba73234c33c255a1f794ea0ae7feaa9405fc4949f7aecb840","schema_version":"1.0","event_id":"sha256:cbe5a15a2d11b2bba73234c33c255a1f794ea0ae7feaa9405fc4949f7aecb840"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPJJRSX5W4ULMOVRQRQ6CYMD6M/bundle.json","state_url":"https://pith.science/pith/GPJJRSX5W4ULMOVRQRQ6CYMD6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPJJRSX5W4ULMOVRQRQ6CYMD6M/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-04T19:09:00Z","links":{"resolver":"https://pith.science/pith/GPJJRSX5W4ULMOVRQRQ6CYMD6M","bundle":"https://pith.science/pith/GPJJRSX5W4ULMOVRQRQ6CYMD6M/bundle.json","state":"https://pith.science/pith/GPJJRSX5W4ULMOVRQRQ6CYMD6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPJJRSX5W4ULMOVRQRQ6CYMD6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GPJJRSX5W4ULMOVRQRQ6CYMD6M","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":"0fc3985b06a820ead93dcd96940b001c64c024bd6b19afe0f0fadbb3edb7070a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-07-02T05:04:28Z","title_canon_sha256":"3c0e082caa956ddfb4bf0b8e528c86875414d5aa0d673934f99194bf3357716e"},"schema_version":"1.0","source":{"id":"1407.0455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0455","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0455v1","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0455","created_at":"2026-05-18T02:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"GPJJRSX5W4UL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPJJRSX5W4ULMOVR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPJJRSX5","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:cbe5a15a2d11b2bba73234c33c255a1f794ea0ae7feaa9405fc4949f7aecb840","target":"graph","created_at":"2026-05-18T02:48:33Z","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":"There is a growing need for distributed graph processing systems that are capable of gracefully scaling to very large graph datasets. Unfortunately, this challenge has not been easily met due to the intense memory pressure imposed by process-centric, message passing designs that many graph processing systems follow. Pregelix is a new open source distributed graph processing system that is based on an iterative dataflow design that is better tuned to handle both in-memory and out-of-core workloads. As such, Pregelix offers improved performance characteristics and scaling properties over current","authors_text":"Jianfeng Jia, Michael J. Carey, Tyson Condie, Vinayak Borkar, Yingyi Bu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-07-02T05:04:28Z","title":"Pregelix: Big(ger) Graph Analytics on A Dataflow Engine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0455","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:c57f1829d306a1417d7750b39172f9f7a5c34ed14eb26772fbc0d8e1d39b4301","target":"record","created_at":"2026-05-18T02:48:33Z","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":"0fc3985b06a820ead93dcd96940b001c64c024bd6b19afe0f0fadbb3edb7070a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-07-02T05:04:28Z","title_canon_sha256":"3c0e082caa956ddfb4bf0b8e528c86875414d5aa0d673934f99194bf3357716e"},"schema_version":"1.0","source":{"id":"1407.0455","kind":"arxiv","version":1}},"canonical_sha256":"33d298cafdb728b63ab18461e16183f33abca02fe96536066a045185625b26ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33d298cafdb728b63ab18461e16183f33abca02fe96536066a045185625b26ce","first_computed_at":"2026-05-18T02:48:33.727341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:33.727341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZRU1pMgHNVZESOtFwlCuixr3ABjRkzHFl5Zh2iCNXh9ShzptBigqWr7fF2OMl09VeYi9QGmPIunIybvoeCb8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:33.727926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c57f1829d306a1417d7750b39172f9f7a5c34ed14eb26772fbc0d8e1d39b4301","sha256:cbe5a15a2d11b2bba73234c33c255a1f794ea0ae7feaa9405fc4949f7aecb840"],"state_sha256":"1fdbf5ddd4b74301b7886e9c040339933856b2aaf59b3cb38ff8034b5337898d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YsMiaPJBG+Q1FjYB5jwhbpRN7PftVOmHed6QaViTXD71HAPrKN9gPqZU4TuFL5fKkLaQPJapnGVQxpzomz2tDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T19:09:00.481612Z","bundle_sha256":"80795ed6187a7a0e21e5403745c1d08b59dbc1d462cbccaa3c1a9616e0329c4b"}}