{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XRLHC5TZ7FSETNSSOPJWZTPTLQ","short_pith_number":"pith:XRLHC5TZ","schema_version":"1.0","canonical_sha256":"bc56717679f96449b65273d36ccdf35c053d3516b8f4118dcb77855fee17efb2","source":{"kind":"arxiv","id":"1312.3018","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.3018","created_at":"2026-05-18T02:32:06.263069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3018v2","created_at":"2026-05-18T02:32:06.263069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3018","created_at":"2026-05-18T02:32:06.263069+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRLHC5TZ7FSE","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRLHC5TZ7FSETNSS","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRLHC5TZ","created_at":"2026-05-18T12:28:06.772260+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/XRLHC5TZ7FSETNSSOPJWZTPTLQ","json":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ.json","graph_json":"https://pith.science/api/pith-number/XRLHC5TZ7FSETNSSOPJWZTPTLQ/graph.json","events_json":"https://pith.science/api/pith-number/XRLHC5TZ7FSETNSSOPJWZTPTLQ/events.json","paper":"https://pith.science/paper/XRLHC5TZ"},"agent_actions":{"view_html":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ","download_json":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ.json","view_paper":"https://pith.science/paper/XRLHC5TZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3018&json=true","fetch_graph":"https://pith.science/api/pith-number/XRLHC5TZ7FSETNSSOPJWZTPTLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XRLHC5TZ7FSETNSSOPJWZTPTLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/action/storage_attestation","attest_author":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/action/author_attestation","sign_citation":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/action/citation_signature","submit_replication":"https://pith.science/pith/XRLHC5TZ7FSETNSSOPJWZTPTLQ/action/replication_record"}},"created_at":"2026-05-18T02:32:06.263069+00:00","updated_at":"2026-05-18T02:32:06.263069+00:00"}