{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RCGC47DCQNARWXFYZKCA76M5U6","short_pith_number":"pith:RCGC47DC","schema_version":"1.0","canonical_sha256":"888c2e7c6283411b5cb8ca840ff99da7a3106081ef421c86d862a99c1a5fbf29","source":{"kind":"arxiv","id":"1708.06248","version":4},"attestation_state":"computed","paper":{"title":"GraphR: Accelerating Graph Processing Using ReRAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Hai Li, Linghao Song, Xuehai Qian, Yiran Chen, Youwei Zhuo","submitted_at":"2017-08-21T14:21:36Z","abstract_excerpt":"This paper presents GRAPHR, the first ReRAM-based graph processing accelerator. GRAPHR follows the principle of near-data processing and explores the opportunity of performing massive parallel analog operations with low hardware and energy cost. The analog computation is suit- able for graph processing because: 1) The algorithms are iterative and could inherently tolerate the imprecision; 2) Both probability calculation (e.g., PageRank and Collaborative Filtering) and typical graph algorithms involving integers (e.g., BFS/SSSP) are resilient to errors. The key insight of GRAPHR is that if a ve"},"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":"1708.06248","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-21T14:21:36Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"c97915845281d6ded63e54e38a065dba53e04d1f9a9653d51ab87d4f8a25d9e6","abstract_canon_sha256":"882be365173b65fe5c58517fb08d6a15f51e2b11f0c5bbc95e3adc2154057d8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:22.778575Z","signature_b64":"4fOSz3VJl3g/6moIDY+CoMh6MBhz2LRlOeDHp8bHU3QogyHaDVKlO8WdyGmaNmt0pEKFigWAFuyESG/UOCqzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888c2e7c6283411b5cb8ca840ff99da7a3106081ef421c86d862a99c1a5fbf29","last_reissued_at":"2026-05-18T00:28:22.778014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:22.778014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphR: Accelerating Graph Processing Using ReRAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Hai Li, Linghao Song, Xuehai Qian, Yiran Chen, Youwei Zhuo","submitted_at":"2017-08-21T14:21:36Z","abstract_excerpt":"This paper presents GRAPHR, the first ReRAM-based graph processing accelerator. GRAPHR follows the principle of near-data processing and explores the opportunity of performing massive parallel analog operations with low hardware and energy cost. The analog computation is suit- able for graph processing because: 1) The algorithms are iterative and could inherently tolerate the imprecision; 2) Both probability calculation (e.g., PageRank and Collaborative Filtering) and typical graph algorithms involving integers (e.g., BFS/SSSP) are resilient to errors. The key insight of GRAPHR is that if a ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06248","kind":"arxiv","version":4},"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":"1708.06248","created_at":"2026-05-18T00:28:22.778115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06248v4","created_at":"2026-05-18T00:28:22.778115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06248","created_at":"2026-05-18T00:28:22.778115+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCGC47DCQNAR","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCGC47DCQNARWXFY","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCGC47DC","created_at":"2026-05-18T12:31:39.905425+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/RCGC47DCQNARWXFYZKCA76M5U6","json":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6.json","graph_json":"https://pith.science/api/pith-number/RCGC47DCQNARWXFYZKCA76M5U6/graph.json","events_json":"https://pith.science/api/pith-number/RCGC47DCQNARWXFYZKCA76M5U6/events.json","paper":"https://pith.science/paper/RCGC47DC"},"agent_actions":{"view_html":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6","download_json":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6.json","view_paper":"https://pith.science/paper/RCGC47DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06248&json=true","fetch_graph":"https://pith.science/api/pith-number/RCGC47DCQNARWXFYZKCA76M5U6/graph.json","fetch_events":"https://pith.science/api/pith-number/RCGC47DCQNARWXFYZKCA76M5U6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/action/storage_attestation","attest_author":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/action/author_attestation","sign_citation":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/action/citation_signature","submit_replication":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/action/replication_record"}},"created_at":"2026-05-18T00:28:22.778115+00:00","updated_at":"2026-05-18T00:28:22.778115+00:00"}