{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CPEA3VBI4N4JSOEXBWH2F6ZCG2","short_pith_number":"pith:CPEA3VBI","canonical_record":{"source":{"id":"1903.06697","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T04:46:07Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"7628d186fd2e6e154db4dccb8da47796644451bd196d5da5f43d364dd0b056fd","abstract_canon_sha256":"31bc913a1c0660d1b3f413ae0c8f32d4da63b32b8253f1c5f625dec502c9de88"},"schema_version":"1.0"},"canonical_sha256":"13c80dd428e3789938970d8fa2fb2236ad6576f2efe1cd3163ddbfb14ab226b9","source":{"kind":"arxiv","id":"1903.06697","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06697","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06697v3","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06697","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"CPEA3VBI4N4J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPEA3VBI4N4JSOEX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPEA3VBI","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CPEA3VBI4N4JSOEXBWH2F6ZCG2","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06697","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T04:46:07Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"7628d186fd2e6e154db4dccb8da47796644451bd196d5da5f43d364dd0b056fd","abstract_canon_sha256":"31bc913a1c0660d1b3f413ae0c8f32d4da63b32b8253f1c5f625dec502c9de88"},"schema_version":"1.0"},"canonical_sha256":"13c80dd428e3789938970d8fa2fb2236ad6576f2efe1cd3163ddbfb14ab226b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.303347Z","signature_b64":"ZCgKw01KHnCByb7euRBYNng64d30BGAXvm0INnJZypP2qFxZh9t4+4LD/R7xGsLgv7Bd2byQ+ow5Fk8YH5V2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13c80dd428e3789938970d8fa2fb2236ad6576f2efe1cd3163ddbfb14ab226b9","last_reissued_at":"2026-05-17T23:47:39.302907Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.302907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06697","source_version":3,"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-17T23:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"co85g4pJnTacLjb56XivIVJIUTyO4s6F6QwnEWiUgnDudpHxRaMHaWwMKwXQ2lA0iX7cRw6l80CTF5kHTrKsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:37:06.587546Z"},"content_sha256":"d8466c7df6c663c6b7991fa9950a71b07aaf13d1690ca53cab34ed5b83382cf5","schema_version":"1.0","event_id":"sha256:d8466c7df6c663c6b7991fa9950a71b07aaf13d1690ca53cab34ed5b83382cf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CPEA3VBI4N4JSOEXBWH2F6ZCG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Processing on FPGAs: Taxonomy, Survey, Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Dimitri Stanojevic, Johannes De Fine Licht, Maciej Besta, Tal Ben-Nun, Torsten Hoefler","submitted_at":"2019-02-25T04:46:07Z","abstract_excerpt":"Graph processing has become an important part of various areas, such as machine learning, computational sciences, medical applications, social network analysis, and many others. Various graphs, for example web or social networks, may contain up to trillions of edges. The sheer size of such datasets, combined with the irregular nature of graph processing, poses unique challenges for the runtime and the consumed power. Field Programmable Gate Arrays (FPGAs) can be an energy-efficient solution to deliver specialized hardware for graph processing. This is reflected by the recent interest in develo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06697","kind":"arxiv","version":3},"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-17T23:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RpSVS2CS1j5TTRMxpXkKHS4MqbnW9Tyrp+avHGoRqTxBwdNiAaHv/n5TzC+44B9qt/JTednTHqxpWbq+kvwFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:37:06.587881Z"},"content_sha256":"58c6422dc6268a4ce424facd035b1a2f9b0a5a4c6bcc28ac69d3058d748e3ff4","schema_version":"1.0","event_id":"sha256:58c6422dc6268a4ce424facd035b1a2f9b0a5a4c6bcc28ac69d3058d748e3ff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPEA3VBI4N4JSOEXBWH2F6ZCG2/bundle.json","state_url":"https://pith.science/pith/CPEA3VBI4N4JSOEXBWH2F6ZCG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPEA3VBI4N4JSOEXBWH2F6ZCG2/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-01T14:37:06Z","links":{"resolver":"https://pith.science/pith/CPEA3VBI4N4JSOEXBWH2F6ZCG2","bundle":"https://pith.science/pith/CPEA3VBI4N4JSOEXBWH2F6ZCG2/bundle.json","state":"https://pith.science/pith/CPEA3VBI4N4JSOEXBWH2F6ZCG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPEA3VBI4N4JSOEXBWH2F6ZCG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CPEA3VBI4N4JSOEXBWH2F6ZCG2","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":"31bc913a1c0660d1b3f413ae0c8f32d4da63b32b8253f1c5f625dec502c9de88","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T04:46:07Z","title_canon_sha256":"7628d186fd2e6e154db4dccb8da47796644451bd196d5da5f43d364dd0b056fd"},"schema_version":"1.0","source":{"id":"1903.06697","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06697","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06697v3","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06697","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"CPEA3VBI4N4J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPEA3VBI4N4JSOEX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPEA3VBI","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:58c6422dc6268a4ce424facd035b1a2f9b0a5a4c6bcc28ac69d3058d748e3ff4","target":"graph","created_at":"2026-05-17T23:47:39Z","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":"Graph processing has become an important part of various areas, such as machine learning, computational sciences, medical applications, social network analysis, and many others. Various graphs, for example web or social networks, may contain up to trillions of edges. The sheer size of such datasets, combined with the irregular nature of graph processing, poses unique challenges for the runtime and the consumed power. Field Programmable Gate Arrays (FPGAs) can be an energy-efficient solution to deliver specialized hardware for graph processing. This is reflected by the recent interest in develo","authors_text":"Dimitri Stanojevic, Johannes De Fine Licht, Maciej Besta, Tal Ben-Nun, Torsten Hoefler","cross_cats":["cs.AR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T04:46:07Z","title":"Graph Processing on FPGAs: Taxonomy, Survey, Challenges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06697","kind":"arxiv","version":3},"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:d8466c7df6c663c6b7991fa9950a71b07aaf13d1690ca53cab34ed5b83382cf5","target":"record","created_at":"2026-05-17T23:47:39Z","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":"31bc913a1c0660d1b3f413ae0c8f32d4da63b32b8253f1c5f625dec502c9de88","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T04:46:07Z","title_canon_sha256":"7628d186fd2e6e154db4dccb8da47796644451bd196d5da5f43d364dd0b056fd"},"schema_version":"1.0","source":{"id":"1903.06697","kind":"arxiv","version":3}},"canonical_sha256":"13c80dd428e3789938970d8fa2fb2236ad6576f2efe1cd3163ddbfb14ab226b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13c80dd428e3789938970d8fa2fb2236ad6576f2efe1cd3163ddbfb14ab226b9","first_computed_at":"2026-05-17T23:47:39.302907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.302907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZCgKw01KHnCByb7euRBYNng64d30BGAXvm0INnJZypP2qFxZh9t4+4LD/R7xGsLgv7Bd2byQ+ow5Fk8YH5V2BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.303347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06697","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8466c7df6c663c6b7991fa9950a71b07aaf13d1690ca53cab34ed5b83382cf5","sha256:58c6422dc6268a4ce424facd035b1a2f9b0a5a4c6bcc28ac69d3058d748e3ff4"],"state_sha256":"e3034efbf9fac6bc85d944b62af537059688ccc904d1796c8b201f56ad4a4534"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jz1ILarpHVjg0tbnc4y0pBXhVWxx4zkQYS1Ckt/pKRTlWHYYQrTq/803Ljez+KXc4dms3itTR/l6tq/vnwhDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:37:06.589809Z","bundle_sha256":"f06c51e8a8175bfc8df0cc68706d53399dbd25e6d4f90e84d0758b0ae7ec860a"}}