{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JYKFJSXFMP77HFO3SRKKZMWOE6","short_pith_number":"pith:JYKFJSXF","canonical_record":{"source":{"id":"1910.07408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-10-14T10:09:14Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"c51fdcf326532afb3299068338acfe0b7fde895ab170d0a9c7c332b409120554","abstract_canon_sha256":"7d13be83a524008db86ee2b44d78dda5e34a8687c11e5133172b070c9dd15ba5"},"schema_version":"1.0"},"canonical_sha256":"4e1454cae563fff395db9454acb2ce27ac3e0feb185f31927e588ee6cefb135b","source":{"kind":"arxiv","id":"1910.07408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.07408","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"arxiv_version","alias_value":"1910.07408v1","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.07408","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"pith_short_12","alias_value":"JYKFJSXFMP77","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"pith_short_16","alias_value":"JYKFJSXFMP77HFO3","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"pith_short_8","alias_value":"JYKFJSXF","created_at":"2026-07-05T00:34:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JYKFJSXFMP77HFO3SRKKZMWOE6","target":"record","payload":{"canonical_record":{"source":{"id":"1910.07408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-10-14T10:09:14Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"c51fdcf326532afb3299068338acfe0b7fde895ab170d0a9c7c332b409120554","abstract_canon_sha256":"7d13be83a524008db86ee2b44d78dda5e34a8687c11e5133172b070c9dd15ba5"},"schema_version":"1.0"},"canonical_sha256":"4e1454cae563fff395db9454acb2ce27ac3e0feb185f31927e588ee6cefb135b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:34:18.608682Z","signature_b64":"LSY6lTJnnTZUadLi7We1pCDEKbCEBclDGSOqkzD2G9L/MSsAeEF1wDXtm4rXaGLlxq4GaxO4QnQuX2ilEMtqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e1454cae563fff395db9454acb2ce27ac3e0feb185f31927e588ee6cefb135b","last_reissued_at":"2026-07-05T00:34:18.608286Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:34:18.608286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.07408","source_version":1,"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-07-05T00:34:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXyHHDb/NdYMOELECI5xV8+K2KQzPLLtmnXbX93zL2x4MLQfPBafYV6EsbCzHYGGFGkrpaaBUdhXUkIqsfChCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:27:08.985363Z"},"content_sha256":"39f617de3cf1eeb13acd7c466a692a19a3e09a3b480f1d4af34fdaf7b40df2c2","schema_version":"1.0","event_id":"sha256:39f617de3cf1eeb13acd7c466a692a19a3e09a3b480f1d4af34fdaf7b40df2c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JYKFJSXFMP77HFO3SRKKZMWOE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraVF-M: Graph Processing System Generation for Multi-FPGA Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Hayden K.-H. So, Nina Engelhardt","submitted_at":"2019-10-14T10:09:14Z","abstract_excerpt":"Due to the irregular nature of connections in most graph datasets, partitioning graph analysis algorithms across multiple computational nodes that do not share a common memory inevitably leads to large amounts of interconnect traffic. Previous research has shown that FPGAs can outcompete software-based graph processing in shared memory contexts, but it remains an open question if this advantage can be maintained in distributed systems.\n  In this work, we present GraVF-M, a framework designed to ease the implementation of FPGA-based graph processing accelerators for multi-FPGA platforms with di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.07408","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.07408/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:34:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPT+NFKj5iCxuJtwBmiF7LAsBw5+WoCAwxF0jmpE8EAkbUHe71RqYeJh/ILjbSx13ZTwKPcQNSCmzlxharg2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:27:08.986306Z"},"content_sha256":"30fac2759bbbbca06406fc9dbfd590b2d86c6ada7d2e5655417555227f2515fb","schema_version":"1.0","event_id":"sha256:30fac2759bbbbca06406fc9dbfd590b2d86c6ada7d2e5655417555227f2515fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYKFJSXFMP77HFO3SRKKZMWOE6/bundle.json","state_url":"https://pith.science/pith/JYKFJSXFMP77HFO3SRKKZMWOE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYKFJSXFMP77HFO3SRKKZMWOE6/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-08-23T02:27:08Z","links":{"resolver":"https://pith.science/pith/JYKFJSXFMP77HFO3SRKKZMWOE6","bundle":"https://pith.science/pith/JYKFJSXFMP77HFO3SRKKZMWOE6/bundle.json","state":"https://pith.science/pith/JYKFJSXFMP77HFO3SRKKZMWOE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYKFJSXFMP77HFO3SRKKZMWOE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JYKFJSXFMP77HFO3SRKKZMWOE6","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":"7d13be83a524008db86ee2b44d78dda5e34a8687c11e5133172b070c9dd15ba5","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-10-14T10:09:14Z","title_canon_sha256":"c51fdcf326532afb3299068338acfe0b7fde895ab170d0a9c7c332b409120554"},"schema_version":"1.0","source":{"id":"1910.07408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.07408","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"arxiv_version","alias_value":"1910.07408v1","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.07408","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"pith_short_12","alias_value":"JYKFJSXFMP77","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"pith_short_16","alias_value":"JYKFJSXFMP77HFO3","created_at":"2026-07-05T00:34:18Z"},{"alias_kind":"pith_short_8","alias_value":"JYKFJSXF","created_at":"2026-07-05T00:34:18Z"}],"graph_snapshots":[{"event_id":"sha256:30fac2759bbbbca06406fc9dbfd590b2d86c6ada7d2e5655417555227f2515fb","target":"graph","created_at":"2026-07-05T00:34:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.07408/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Due to the irregular nature of connections in most graph datasets, partitioning graph analysis algorithms across multiple computational nodes that do not share a common memory inevitably leads to large amounts of interconnect traffic. Previous research has shown that FPGAs can outcompete software-based graph processing in shared memory contexts, but it remains an open question if this advantage can be maintained in distributed systems.\n  In this work, we present GraVF-M, a framework designed to ease the implementation of FPGA-based graph processing accelerators for multi-FPGA platforms with di","authors_text":"Hayden K.-H. So, Nina Engelhardt","cross_cats":["cs.AR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-10-14T10:09:14Z","title":"GraVF-M: Graph Processing System Generation for Multi-FPGA Platforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.07408","kind":"arxiv","version":1},"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:39f617de3cf1eeb13acd7c466a692a19a3e09a3b480f1d4af34fdaf7b40df2c2","target":"record","created_at":"2026-07-05T00:34:18Z","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":"7d13be83a524008db86ee2b44d78dda5e34a8687c11e5133172b070c9dd15ba5","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-10-14T10:09:14Z","title_canon_sha256":"c51fdcf326532afb3299068338acfe0b7fde895ab170d0a9c7c332b409120554"},"schema_version":"1.0","source":{"id":"1910.07408","kind":"arxiv","version":1}},"canonical_sha256":"4e1454cae563fff395db9454acb2ce27ac3e0feb185f31927e588ee6cefb135b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e1454cae563fff395db9454acb2ce27ac3e0feb185f31927e588ee6cefb135b","first_computed_at":"2026-07-05T00:34:18.608286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:34:18.608286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LSY6lTJnnTZUadLi7We1pCDEKbCEBclDGSOqkzD2G9L/MSsAeEF1wDXtm4rXaGLlxq4GaxO4QnQuX2ilEMtqBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:34:18.608682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.07408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39f617de3cf1eeb13acd7c466a692a19a3e09a3b480f1d4af34fdaf7b40df2c2","sha256:30fac2759bbbbca06406fc9dbfd590b2d86c6ada7d2e5655417555227f2515fb"],"state_sha256":"a693a08b6960710ab37cc98ace66f8453f8ae8f778694a4836c0709461bcb66b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYJE3IV77dmRqXrD/vuvWHm5Ssqt3K0dleFPqZpViu6fipaNbXjhHD5nxUrmQWuaO3lzYCIsdOoJ5uARzWl4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T02:27:08.992583Z","bundle_sha256":"0e0f50a2cace315b368e7ac5fe8bf0a65efb1110c554265340663a9b5d8940d8"}}