{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7Q3CQBCULWOJRTZXHBLCJK7P4X","short_pith_number":"pith:7Q3CQBCU","schema_version":"1.0","canonical_sha256":"fc362804545d9c98cf37385624abefe5d41fa29cb38d64f347b069e7419c9d41","source":{"kind":"arxiv","id":"2310.18334","version":1},"attestation_state":"computed","paper":{"title":"Hypersparse Traffic Matrix Construction using GraphBLAS on a DPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AR","authors_text":"Antonio Rosa, Chase Barber, Eugene Vasserman, George Amariucai, Jeremy Kepner, Kaleb Ernst, Kale DeYoung, Michael Jones, Nathan Fleming, Nathan Wells, Peter Michaleas, Sandeep Pisharody, William Bergeron","submitted_at":"2023-10-20T15:31:05Z","abstract_excerpt":"Low-power small form factor data processing units (DPUs) enable offloading and acceleration of a broad range of networking and security services. DPUs have accelerated the transition to programmable networking by enabling the replacement of FPGAs/ASICs in a wide range of network oriented devices. The GraphBLAS sparse matrix graph open standard math library is well-suited for constructing anonymized hypersparse traffic matrices of network traffic which can enable a wide range of network analytics. This paper measures the performance of the GraphBLAS on an ARM based NVIDIA DPU (BlueField 2) and,"},"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":"2310.18334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2023-10-20T15:31:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"78494f13d0189aa1bf82153516bf2c908cbbb427d5ca5c8f7f373cad757c9bfb","abstract_canon_sha256":"6ff4d7ed5b7152deb372f48a823bb5dba34a7711da23d0199b968a1619d1fefb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:06.799925Z","signature_b64":"GK+20u5Qniwh+df1x5iVgeIHInGt68MsAuq5W1KpPme0l6HaXrnDhuwL+GhqTt9QfTEsJTCqZOD+rhuLFKqcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc362804545d9c98cf37385624abefe5d41fa29cb38d64f347b069e7419c9d41","last_reissued_at":"2026-07-05T07:06:06.799434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:06.799434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypersparse Traffic Matrix Construction using GraphBLAS on a DPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AR","authors_text":"Antonio Rosa, Chase Barber, Eugene Vasserman, George Amariucai, Jeremy Kepner, Kaleb Ernst, Kale DeYoung, Michael Jones, Nathan Fleming, Nathan Wells, Peter Michaleas, Sandeep Pisharody, William Bergeron","submitted_at":"2023-10-20T15:31:05Z","abstract_excerpt":"Low-power small form factor data processing units (DPUs) enable offloading and acceleration of a broad range of networking and security services. DPUs have accelerated the transition to programmable networking by enabling the replacement of FPGAs/ASICs in a wide range of network oriented devices. The GraphBLAS sparse matrix graph open standard math library is well-suited for constructing anonymized hypersparse traffic matrices of network traffic which can enable a wide range of network analytics. This paper measures the performance of the GraphBLAS on an ARM based NVIDIA DPU (BlueField 2) and,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18334","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/2310.18334/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.18334","created_at":"2026-07-05T07:06:06.799496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18334v1","created_at":"2026-07-05T07:06:06.799496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18334","created_at":"2026-07-05T07:06:06.799496+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Q3CQBCULWOJ","created_at":"2026-07-05T07:06:06.799496+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Q3CQBCULWOJRTZX","created_at":"2026-07-05T07:06:06.799496+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Q3CQBCU","created_at":"2026-07-05T07:06:06.799496+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/7Q3CQBCULWOJRTZXHBLCJK7P4X","json":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X.json","graph_json":"https://pith.science/api/pith-number/7Q3CQBCULWOJRTZXHBLCJK7P4X/graph.json","events_json":"https://pith.science/api/pith-number/7Q3CQBCULWOJRTZXHBLCJK7P4X/events.json","paper":"https://pith.science/paper/7Q3CQBCU"},"agent_actions":{"view_html":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X","download_json":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X.json","view_paper":"https://pith.science/paper/7Q3CQBCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18334&json=true","fetch_graph":"https://pith.science/api/pith-number/7Q3CQBCULWOJRTZXHBLCJK7P4X/graph.json","fetch_events":"https://pith.science/api/pith-number/7Q3CQBCULWOJRTZXHBLCJK7P4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X/action/storage_attestation","attest_author":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X/action/author_attestation","sign_citation":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X/action/citation_signature","submit_replication":"https://pith.science/pith/7Q3CQBCULWOJRTZXHBLCJK7P4X/action/replication_record"}},"created_at":"2026-07-05T07:06:06.799496+00:00","updated_at":"2026-07-05T07:06:06.799496+00:00"}