{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SV6DZ2CQMUSGFAFABT7TBMOSGF","short_pith_number":"pith:SV6DZ2CQ","schema_version":"1.0","canonical_sha256":"957c3ce85065246280a00cff30b1d23148088d771dc8dbaded59f7cf51d0e377","source":{"kind":"arxiv","id":"2001.06935","version":2},"attestation_state":"computed","paper":{"title":"75,000,000,000 Streaming Inserts/Second Using Hierarchical Hypersparse GraphBLAS Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","cs.PF","cs.SI"],"primary_cat":"cs.DC","authors_text":"Albert Reuther, Andrew Prout, Anna Klein, Antonio Rosa, Chansup Byun, Charles Yee, David Bestor, Jeremy Kepner, Julie Mullen, Lauren Milechin, Matthew Hubbell, Michael Houle, Michael Jones, Peter Michaleas, Siddharth Samsi, Tim Davis, Vijay Gadepally, William Arcand, William Bergeron","submitted_at":"2020-01-20T01:41:17Z","abstract_excerpt":"The SuiteSparse GraphBLAS C-library implements high performance hypersparse matrices with bindings to a variety of languages (Python, Julia, and Matlab/Octave). GraphBLAS provides a lightweight in-memory database implementation of hypersparse matrices that are ideal for analyzing many types of network data, while providing rigorous mathematical guarantees, such as linearity. Streaming updates of hypersparse matrices put enormous pressure on the memory hierarchy. This work benchmarks an implementation of hierarchical hypersparse matrices that reduces memory pressure and dramatically increases t"},"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":"2001.06935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-01-20T01:41:17Z","cross_cats_sorted":["cs.DB","cs.DS","cs.PF","cs.SI"],"title_canon_sha256":"448e8243e5f1fc718e6546e4db31704d2a9ca652ea397f5fd1cbbc3321510ae0","abstract_canon_sha256":"a923345631dd90adb8554d024a1fa1ea7bdc1a1abd573dd76c88694a157acef4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:56.456663Z","signature_b64":"JtBppo5kwOO6oaa2FSsMhEOayhKUVDmUuQFVy59Rw1VAyDuIGHMNj3EIkqAr3Q19Ovb3QrAqGA6ZU7T5yqPvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"957c3ce85065246280a00cff30b1d23148088d771dc8dbaded59f7cf51d0e377","last_reissued_at":"2026-07-05T01:23:56.456148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:56.456148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"75,000,000,000 Streaming Inserts/Second Using Hierarchical Hypersparse GraphBLAS Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","cs.PF","cs.SI"],"primary_cat":"cs.DC","authors_text":"Albert Reuther, Andrew Prout, Anna Klein, Antonio Rosa, Chansup Byun, Charles Yee, David Bestor, Jeremy Kepner, Julie Mullen, Lauren Milechin, Matthew Hubbell, Michael Houle, Michael Jones, Peter Michaleas, Siddharth Samsi, Tim Davis, Vijay Gadepally, William Arcand, William Bergeron","submitted_at":"2020-01-20T01:41:17Z","abstract_excerpt":"The SuiteSparse GraphBLAS C-library implements high performance hypersparse matrices with bindings to a variety of languages (Python, Julia, and Matlab/Octave). GraphBLAS provides a lightweight in-memory database implementation of hypersparse matrices that are ideal for analyzing many types of network data, while providing rigorous mathematical guarantees, such as linearity. Streaming updates of hypersparse matrices put enormous pressure on the memory hierarchy. This work benchmarks an implementation of hierarchical hypersparse matrices that reduces memory pressure and dramatically increases t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.06935","kind":"arxiv","version":2},"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/2001.06935/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":"2001.06935","created_at":"2026-07-05T01:23:56.456208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.06935v2","created_at":"2026-07-05T01:23:56.456208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.06935","created_at":"2026-07-05T01:23:56.456208+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV6DZ2CQMUSG","created_at":"2026-07-05T01:23:56.456208+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV6DZ2CQMUSGFAFA","created_at":"2026-07-05T01:23:56.456208+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV6DZ2CQ","created_at":"2026-07-05T01:23:56.456208+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/SV6DZ2CQMUSGFAFABT7TBMOSGF","json":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF.json","graph_json":"https://pith.science/api/pith-number/SV6DZ2CQMUSGFAFABT7TBMOSGF/graph.json","events_json":"https://pith.science/api/pith-number/SV6DZ2CQMUSGFAFABT7TBMOSGF/events.json","paper":"https://pith.science/paper/SV6DZ2CQ"},"agent_actions":{"view_html":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF","download_json":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF.json","view_paper":"https://pith.science/paper/SV6DZ2CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.06935&json=true","fetch_graph":"https://pith.science/api/pith-number/SV6DZ2CQMUSGFAFABT7TBMOSGF/graph.json","fetch_events":"https://pith.science/api/pith-number/SV6DZ2CQMUSGFAFABT7TBMOSGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF/action/storage_attestation","attest_author":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF/action/author_attestation","sign_citation":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF/action/citation_signature","submit_replication":"https://pith.science/pith/SV6DZ2CQMUSGFAFABT7TBMOSGF/action/replication_record"}},"created_at":"2026-07-05T01:23:56.456208+00:00","updated_at":"2026-07-05T01:23:56.456208+00:00"}