{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RQ4QRAUGMLBTBHZCJ2NRKKALQ5","short_pith_number":"pith:RQ4QRAUG","schema_version":"1.0","canonical_sha256":"8c3908828662c3309f224e9b15280b87754e0823d402c619c2d9ebd8c082bced","source":{"kind":"arxiv","id":"1905.01294","version":1},"attestation_state":"computed","paper":{"title":"RedisGraph GraphBLAS Enabled Graph Database","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DB","authors_text":"Jeffrey Lovitz, Jeremy Kepner, Keren Ouaknine, Pieter Cailliau, Roi Lipman, Tim Davis, Vijay Gadepally","submitted_at":"2019-05-01T23:39:42Z","abstract_excerpt":"RedisGraph is a Redis module developed by Redis Labs to add graph database functionality to the Redis database. RedisGraph represents connected data as adjacency matrices. By representing the data as sparse matrices and employing the power of GraphBLAS (a highly optimized library for sparse matrix operations), RedisGraph delivers a fast and efficient way to store, manage and process graphs. Initial benchmarks indicate that RedisGraph is significantly faster than comparable graph databases."},"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":"1905.01294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-01T23:39:42Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"a4a7903ff93e2d37a0eebcd03800165f563500f124fdb18915d1f9a0b4cd7021","abstract_canon_sha256":"dd1add710df19ce829863bb7fbe20a720dd02c7eb8ea51c2c65163ef0874c0a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:04.657192Z","signature_b64":"e3CVdxs3nmdFtWOs1mWZGi85rmm2SkFuPOcUke0Xe2rBcFSU9SKu5/IMhPeEBz4TMtE6d6k2kkauaTDwdyoMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c3908828662c3309f224e9b15280b87754e0823d402c619c2d9ebd8c082bced","last_reissued_at":"2026-07-05T00:23:04.656820Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:04.656820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RedisGraph GraphBLAS Enabled Graph Database","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DB","authors_text":"Jeffrey Lovitz, Jeremy Kepner, Keren Ouaknine, Pieter Cailliau, Roi Lipman, Tim Davis, Vijay Gadepally","submitted_at":"2019-05-01T23:39:42Z","abstract_excerpt":"RedisGraph is a Redis module developed by Redis Labs to add graph database functionality to the Redis database. RedisGraph represents connected data as adjacency matrices. By representing the data as sparse matrices and employing the power of GraphBLAS (a highly optimized library for sparse matrix operations), RedisGraph delivers a fast and efficient way to store, manage and process graphs. Initial benchmarks indicate that RedisGraph is significantly faster than comparable graph databases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01294","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/1905.01294/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":"1905.01294","created_at":"2026-07-05T00:23:04.656877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01294v1","created_at":"2026-07-05T00:23:04.656877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01294","created_at":"2026-07-05T00:23:04.656877+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ4QRAUGMLBT","created_at":"2026-07-05T00:23:04.656877+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ4QRAUGMLBTBHZC","created_at":"2026-07-05T00:23:04.656877+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ4QRAUG","created_at":"2026-07-05T00:23:04.656877+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/RQ4QRAUGMLBTBHZCJ2NRKKALQ5","json":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5.json","graph_json":"https://pith.science/api/pith-number/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/graph.json","events_json":"https://pith.science/api/pith-number/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/events.json","paper":"https://pith.science/paper/RQ4QRAUG"},"agent_actions":{"view_html":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5","download_json":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5.json","view_paper":"https://pith.science/paper/RQ4QRAUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01294&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/action/storage_attestation","attest_author":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/action/author_attestation","sign_citation":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/action/citation_signature","submit_replication":"https://pith.science/pith/RQ4QRAUGMLBTBHZCJ2NRKKALQ5/action/replication_record"}},"created_at":"2026-07-05T00:23:04.656877+00:00","updated_at":"2026-07-05T00:23:04.656877+00:00"}