{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JDDTAELXDFJ7IE44LCLJZLSSXU","short_pith_number":"pith:JDDTAELX","schema_version":"1.0","canonical_sha256":"48c73011771953f4139c58969cae52bd03b6eeb990980edd527dafcd4fc6beaf","source":{"kind":"arxiv","id":"1902.00846","version":1},"attestation_state":"computed","paper":{"title":"A Billion Updates per Second Using 30,000 Hierarchical In-Memory D4M Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.NI"],"primary_cat":"cs.DB","authors_text":"Albert Reuther, Andrew Prout, Anne Klein, Antonio Rosa, Chansup Byun, Charles Yee, David Bestor, Jeremy Kepner, Julie Mullen, Lauren Milechin, Matthew Hubbell, Micheal Houle, Micheal Jones, Peter Michaleas, Siddharth Samsi, Vijay Gadepally, William Arcand, William Bergeron","submitted_at":"2019-02-03T04:58:07Z","abstract_excerpt":"Analyzing large scale networks requires high performance streaming updates of graph representations of these data. Associative arrays are mathematical objects combining properties of spreadsheets, databases, matrices, and graphs, and are well-suited for representing and analyzing streaming network data. The Dynamic Distributed Dimensional Data Model (D4M) library implements associative arrays in a variety of languages (Python, Julia, and Matlab/Octave) and provides a lightweight in-memory database. Associative arrays are designed for block updates. Streaming updates to a large associative arra"},"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":"1902.00846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-03T04:58:07Z","cross_cats_sorted":["cs.DC","cs.DS","cs.NI"],"title_canon_sha256":"1bac7440eea19c1488ad320a55f635e95aec44e2224e4c093a208ae4b5588861","abstract_canon_sha256":"be4e8627013e5b6a2d39c44839ccab76c1c772091b3880e606aa40bdb0342aec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:51.973545Z","signature_b64":"z67jH3LkMSFF9gRynicUckalLTkuZeHtoJRsfGOcU+TO8pCFIv+ucQPXsBjVK/ow5/slPgz9RtIJfObGKIpEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c73011771953f4139c58969cae52bd03b6eeb990980edd527dafcd4fc6beaf","last_reissued_at":"2026-05-17T23:54:51.973101Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:51.973101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Billion Updates per Second Using 30,000 Hierarchical In-Memory D4M Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.NI"],"primary_cat":"cs.DB","authors_text":"Albert Reuther, Andrew Prout, Anne Klein, Antonio Rosa, Chansup Byun, Charles Yee, David Bestor, Jeremy Kepner, Julie Mullen, Lauren Milechin, Matthew Hubbell, Micheal Houle, Micheal Jones, Peter Michaleas, Siddharth Samsi, Vijay Gadepally, William Arcand, William Bergeron","submitted_at":"2019-02-03T04:58:07Z","abstract_excerpt":"Analyzing large scale networks requires high performance streaming updates of graph representations of these data. Associative arrays are mathematical objects combining properties of spreadsheets, databases, matrices, and graphs, and are well-suited for representing and analyzing streaming network data. The Dynamic Distributed Dimensional Data Model (D4M) library implements associative arrays in a variety of languages (Python, Julia, and Matlab/Octave) and provides a lightweight in-memory database. Associative arrays are designed for block updates. Streaming updates to a large associative arra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00846","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":""},"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":"1902.00846","created_at":"2026-05-17T23:54:51.973169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00846v1","created_at":"2026-05-17T23:54:51.973169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00846","created_at":"2026-05-17T23:54:51.973169+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDDTAELXDFJ7","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDDTAELXDFJ7IE44","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDDTAELX","created_at":"2026-05-18T12:33:18.533446+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/JDDTAELXDFJ7IE44LCLJZLSSXU","json":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU.json","graph_json":"https://pith.science/api/pith-number/JDDTAELXDFJ7IE44LCLJZLSSXU/graph.json","events_json":"https://pith.science/api/pith-number/JDDTAELXDFJ7IE44LCLJZLSSXU/events.json","paper":"https://pith.science/paper/JDDTAELX"},"agent_actions":{"view_html":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU","download_json":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU.json","view_paper":"https://pith.science/paper/JDDTAELX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00846&json=true","fetch_graph":"https://pith.science/api/pith-number/JDDTAELXDFJ7IE44LCLJZLSSXU/graph.json","fetch_events":"https://pith.science/api/pith-number/JDDTAELXDFJ7IE44LCLJZLSSXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU/action/storage_attestation","attest_author":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU/action/author_attestation","sign_citation":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU/action/citation_signature","submit_replication":"https://pith.science/pith/JDDTAELXDFJ7IE44LCLJZLSSXU/action/replication_record"}},"created_at":"2026-05-17T23:54:51.973169+00:00","updated_at":"2026-05-17T23:54:51.973169+00:00"}