{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XRLHC5TZ7FSETNSSOPJWZTPTLQ","short_pith_number":"pith:XRLHC5TZ","canonical_record":{"source":{"id":"1312.3018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T01:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"9f7151c9c57c7b0caab07c7c4065bac56f10234d6df5014dd84cbb72e4c7708f","abstract_canon_sha256":"d364f21fd0e9399459371f1fe98defc6f65591770e76e8415bf8f3d9830ff095"},"schema_version":"1.0"},"canonical_sha256":"bc56717679f96449b65273d36ccdf35c053d3516b8f4118dcb77855fee17efb2","source":{"kind":"arxiv","id":"1312.3018","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3018","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3018v2","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3018","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"pith_short_12","alias_value":"XRLHC5TZ7FSE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XRLHC5TZ7FSETNSS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XRLHC5TZ","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XRLHC5TZ7FSETNSSOPJWZTPTLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T01:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"9f7151c9c57c7b0caab07c7c4065bac56f10234d6df5014dd84cbb72e4c7708f","abstract_canon_sha256":"d364f21fd0e9399459371f1fe98defc6f65591770e76e8415bf8f3d9830ff095"},"schema_version":"1.0"},"canonical_sha256":"bc56717679f96449b65273d36ccdf35c053d3516b8f4118dcb77855fee17efb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:06.263405Z","signature_b64":"HqGpllyyCgaCq3NsadodYoqcbXYueHcv9tDrCN0bQxLvCnbqZ54yEu4mZ3dLFdQtvS762VXDECfN7QlsjIYnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc56717679f96449b65273d36ccdf35c053d3516b8f4118dcb77855fee17efb2","last_reissued_at":"2026-05-18T02:32:06.263010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:06.263010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3018","source_version":2,"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:32:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILKi9qh12o/qY2gc4P8fJo2KiOpjXiVzrpzZQcqMS5+cYUThP55br0Y5mpWcOse2UyNn7KcKjHysxU6jM3vjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:10:53.838018Z"},"content_sha256":"e62bff68e3c1d612473832ea00dc067c75ebb4c6dd010987702dc0e76d3b1458","schema_version":"1.0","event_id":"sha256:e62bff68e3c1d612473832ea00dc067c75ebb4c6dd010987702dc0e76d3b1458"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XRLHC5TZ7FSETNSSOPJWZTPTLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abdullah Gharaibeh, Elizeu Santos-Neto, Lauro Beltrao Costa, Matei Ripeanu, Scott Sallinen, Tahsin Reza","submitted_at":"2013-12-11T01:40:29Z","abstract_excerpt":"The increasing scale and wealth of inter-connected data, such as those accrued by social network applications, demand the design of new techniques and platforms to efficiently derive actionable knowledge from large-scale graphs. However, real-world graphs are famously difficult to process efficiently. Not only they have a large memory footprint, but also most graph algorithms entail memory access patterns with poor locality, data-dependent parallelism and a low compute-to-memory access ratio. Moreover, most real-world graphs have a highly heterogeneous node degree distribution, hence partition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3018","kind":"arxiv","version":2},"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:32:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bIevro9ikuh/VngRKklBdJm9P0Lf9IOvDOijoddNiKqr8u58c7hQ7eXuCkhZ+0QvrZzHsbEVqp2ucWWAc0PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:10:53.838383Z"},"content_sha256":"3586f4035ffe747ed03db81a0da53e671fe44771928f3bc221a733739c0445ce","schema_version":"1.0","event_id":"sha256:3586f4035ffe747ed03db81a0da53e671fe44771928f3bc221a733739c0445ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/bundle.json","state_url":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/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-26T01:10:53Z","links":{"resolver":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ","bundle":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/bundle.json","state":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XRLHC5TZ7FSETNSSOPJWZTPTLQ","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":"d364f21fd0e9399459371f1fe98defc6f65591770e76e8415bf8f3d9830ff095","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T01:40:29Z","title_canon_sha256":"9f7151c9c57c7b0caab07c7c4065bac56f10234d6df5014dd84cbb72e4c7708f"},"schema_version":"1.0","source":{"id":"1312.3018","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3018","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3018v2","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3018","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"pith_short_12","alias_value":"XRLHC5TZ7FSE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XRLHC5TZ7FSETNSS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XRLHC5TZ","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:3586f4035ffe747ed03db81a0da53e671fe44771928f3bc221a733739c0445ce","target":"graph","created_at":"2026-05-18T02:32:06Z","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 increasing scale and wealth of inter-connected data, such as those accrued by social network applications, demand the design of new techniques and platforms to efficiently derive actionable knowledge from large-scale graphs. However, real-world graphs are famously difficult to process efficiently. Not only they have a large memory footprint, but also most graph algorithms entail memory access patterns with poor locality, data-dependent parallelism and a low compute-to-memory access ratio. Moreover, most real-world graphs have a highly heterogeneous node degree distribution, hence partition","authors_text":"Abdullah Gharaibeh, Elizeu Santos-Neto, Lauro Beltrao Costa, Matei Ripeanu, Scott Sallinen, Tahsin Reza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T01:40:29Z","title":"Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3018","kind":"arxiv","version":2},"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:e62bff68e3c1d612473832ea00dc067c75ebb4c6dd010987702dc0e76d3b1458","target":"record","created_at":"2026-05-18T02:32:06Z","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":"d364f21fd0e9399459371f1fe98defc6f65591770e76e8415bf8f3d9830ff095","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T01:40:29Z","title_canon_sha256":"9f7151c9c57c7b0caab07c7c4065bac56f10234d6df5014dd84cbb72e4c7708f"},"schema_version":"1.0","source":{"id":"1312.3018","kind":"arxiv","version":2}},"canonical_sha256":"bc56717679f96449b65273d36ccdf35c053d3516b8f4118dcb77855fee17efb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc56717679f96449b65273d36ccdf35c053d3516b8f4118dcb77855fee17efb2","first_computed_at":"2026-05-18T02:32:06.263010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:06.263010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HqGpllyyCgaCq3NsadodYoqcbXYueHcv9tDrCN0bQxLvCnbqZ54yEu4mZ3dLFdQtvS762VXDECfN7QlsjIYnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:06.263405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3018","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e62bff68e3c1d612473832ea00dc067c75ebb4c6dd010987702dc0e76d3b1458","sha256:3586f4035ffe747ed03db81a0da53e671fe44771928f3bc221a733739c0445ce"],"state_sha256":"8ed4f0887d1e53d4801026cb0dcf1b6523fd20a328e43f75561d00ac50da2de7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0QwTKCEtasiKoSg6DLyDxu77/1/SPCMHl9O6Yt9ZZr4HcAZSeJR+iUFbFSdnv8pkzMMQ505kzMtW+pHJXa8uAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:10:53.840357Z","bundle_sha256":"fef498a99ab19d83f4024bb598cb7b135835706596349752d99ab63c0825f244"}}