{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RCGC47DCQNARWXFYZKCA76M5U6","short_pith_number":"pith:RCGC47DC","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"},"canonical_sha256":"888c2e7c6283411b5cb8ca840ff99da7a3106081ef421c86d862a99c1a5fbf29","source":{"kind":"arxiv","id":"1708.06248","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06248","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06248v4","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06248","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"RCGC47DCQNAR","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCGC47DCQNARWXFY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCGC47DC","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RCGC47DCQNARWXFYZKCA76M5U6","target":"record","payload":{"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"},"canonical_sha256":"888c2e7c6283411b5cb8ca840ff99da7a3106081ef421c86d862a99c1a5fbf29","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"},"source_kind":"arxiv","source_id":"1708.06248","source_version":4,"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-18T00:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnDmqiSimOQ5yRyBLhQmkWBuczzBUi/yiNTfnOCqGb29TYtsfnf1ZZ/vI4VSsHftBCrsgAPwl5YttSe9tL08CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:06:28.621308Z"},"content_sha256":"b4c7adca800c409711861580da82a8fb2e7d457fcab2df3b09d51882b312da95","schema_version":"1.0","event_id":"sha256:b4c7adca800c409711861580da82a8fb2e7d457fcab2df3b09d51882b312da95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RCGC47DCQNARWXFYZKCA76M5U6","target":"graph","payload":{"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"},"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-18T00:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vEMd8dh+JURxGBjDjMPR01V25BcclWf9Q/TdiqTKrQJQv8WLhLpaWZRliW4TZGF8dtr9QTNObgfhH2Ge+JnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:06:28.621717Z"},"content_sha256":"bd8ec4683f38b69c4cb8df965709f89fce49f6d8619b5710f08fbaf956abdf16","schema_version":"1.0","event_id":"sha256:bd8ec4683f38b69c4cb8df965709f89fce49f6d8619b5710f08fbaf956abdf16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/bundle.json","state_url":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCGC47DCQNARWXFYZKCA76M5U6/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-01T01:06:28Z","links":{"resolver":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6","bundle":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/bundle.json","state":"https://pith.science/pith/RCGC47DCQNARWXFYZKCA76M5U6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCGC47DCQNARWXFYZKCA76M5U6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RCGC47DCQNARWXFYZKCA76M5U6","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":"882be365173b65fe5c58517fb08d6a15f51e2b11f0c5bbc95e3adc2154057d8c","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-21T14:21:36Z","title_canon_sha256":"c97915845281d6ded63e54e38a065dba53e04d1f9a9653d51ab87d4f8a25d9e6"},"schema_version":"1.0","source":{"id":"1708.06248","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06248","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06248v4","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06248","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"RCGC47DCQNAR","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCGC47DCQNARWXFY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCGC47DC","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:bd8ec4683f38b69c4cb8df965709f89fce49f6d8619b5710f08fbaf956abdf16","target":"graph","created_at":"2026-05-18T00:28:22Z","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":"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","authors_text":"Hai Li, Linghao Song, Xuehai Qian, Yiran Chen, Youwei Zhuo","cross_cats":["cs.AR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-21T14:21:36Z","title":"GraphR: Accelerating Graph Processing Using ReRAM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06248","kind":"arxiv","version":4},"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:b4c7adca800c409711861580da82a8fb2e7d457fcab2df3b09d51882b312da95","target":"record","created_at":"2026-05-18T00:28:22Z","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":"882be365173b65fe5c58517fb08d6a15f51e2b11f0c5bbc95e3adc2154057d8c","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-21T14:21:36Z","title_canon_sha256":"c97915845281d6ded63e54e38a065dba53e04d1f9a9653d51ab87d4f8a25d9e6"},"schema_version":"1.0","source":{"id":"1708.06248","kind":"arxiv","version":4}},"canonical_sha256":"888c2e7c6283411b5cb8ca840ff99da7a3106081ef421c86d862a99c1a5fbf29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"888c2e7c6283411b5cb8ca840ff99da7a3106081ef421c86d862a99c1a5fbf29","first_computed_at":"2026-05-18T00:28:22.778014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:22.778014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4fOSz3VJl3g/6moIDY+CoMh6MBhz2LRlOeDHp8bHU3QogyHaDVKlO8WdyGmaNmt0pEKFigWAFuyESG/UOCqzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:22.778575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06248","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4c7adca800c409711861580da82a8fb2e7d457fcab2df3b09d51882b312da95","sha256:bd8ec4683f38b69c4cb8df965709f89fce49f6d8619b5710f08fbaf956abdf16"],"state_sha256":"207fc6a188552b1043e4c48ae42db9bb7fd56465c188b440b2f608da1599bf79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UFTMwxz4Pf0SNWcQil0lG6EQlzrjWq07l8Nnnlk7oAGKG0d6U82WR+nwMtbNz/rN68LVYmiGaHUJ0Q6MTa3JAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:06:28.624409Z","bundle_sha256":"c513cbc41fce2418a8dad5044f34aee36defe302a9e5c4792844e98c1fce7ad8"}}