{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7IJSBR24XMM2EBQUIDSYAARNGH","short_pith_number":"pith:7IJSBR24","schema_version":"1.0","canonical_sha256":"fa1320c75cbb19a2061440e580022d31d25906cd8b7c5eb537b7d8b764d57a03","source":{"kind":"arxiv","id":"1901.08248","version":1},"attestation_state":"computed","paper":{"title":"TigerGraph: A Native MPP Graph Database","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alin Deutsch, Mingxi Wu, Victor Lee, Yu Xu","submitted_at":"2019-01-24T06:34:15Z","abstract_excerpt":"We present TigerGraph, a graph database system built from the ground up to support massively parallel computation of queries and analytics.\n  TigerGraph's high-level query language, GSQL, is designed for compatibility with SQL, while simultaneously allowing NoSQL programmers to continue thinking in Bulk-Synchronous Processing (BSP) terms and reap the benefits of high-level specification.\n  GSQL is sufficiently high-level to allow declarative SQL-style programming, yet sufficiently expressive to concisely specify the sophisticated iterative algorithms required by modern graph analytics and trad"},"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":"1901.08248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2019-01-24T06:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"bf56c375babb5bbe94a07d57068fd4a55f46a76dd4b0e6faa87218ebcc645ce4","abstract_canon_sha256":"c7b019c6fae3dca187c852777f22866d3e28a22dbae2182a779976674679d9d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.547969Z","signature_b64":"iq5tNaAHtdTFCNu2VNAmvMusCkRECRVp0Yfw8tAsqsCO2o+/MJbbEqwoAabYtlPrUMM4lDBxul3ZtY8bZKNNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa1320c75cbb19a2061440e580022d31d25906cd8b7c5eb537b7d8b764d57a03","last_reissued_at":"2026-05-17T23:55:37.547476Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.547476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TigerGraph: A Native MPP Graph Database","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alin Deutsch, Mingxi Wu, Victor Lee, Yu Xu","submitted_at":"2019-01-24T06:34:15Z","abstract_excerpt":"We present TigerGraph, a graph database system built from the ground up to support massively parallel computation of queries and analytics.\n  TigerGraph's high-level query language, GSQL, is designed for compatibility with SQL, while simultaneously allowing NoSQL programmers to continue thinking in Bulk-Synchronous Processing (BSP) terms and reap the benefits of high-level specification.\n  GSQL is sufficiently high-level to allow declarative SQL-style programming, yet sufficiently expressive to concisely specify the sophisticated iterative algorithms required by modern graph analytics and trad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08248","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":"1901.08248","created_at":"2026-05-17T23:55:37.547550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08248v1","created_at":"2026-05-17T23:55:37.547550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08248","created_at":"2026-05-17T23:55:37.547550+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IJSBR24XMM2","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IJSBR24XMM2EBQU","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IJSBR24","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.07405","citing_title":"In-Depth Benchmarking of Graph Database Systems with the Linked Data Benchmark Council (LDBC) Social Network Benchmark (SNB)","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2406.05417","citing_title":"Optimizing Navigational Graph Queries","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18913","citing_title":"LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH","json":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH.json","graph_json":"https://pith.science/api/pith-number/7IJSBR24XMM2EBQUIDSYAARNGH/graph.json","events_json":"https://pith.science/api/pith-number/7IJSBR24XMM2EBQUIDSYAARNGH/events.json","paper":"https://pith.science/paper/7IJSBR24"},"agent_actions":{"view_html":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH","download_json":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH.json","view_paper":"https://pith.science/paper/7IJSBR24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08248&json=true","fetch_graph":"https://pith.science/api/pith-number/7IJSBR24XMM2EBQUIDSYAARNGH/graph.json","fetch_events":"https://pith.science/api/pith-number/7IJSBR24XMM2EBQUIDSYAARNGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH/action/storage_attestation","attest_author":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH/action/author_attestation","sign_citation":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH/action/citation_signature","submit_replication":"https://pith.science/pith/7IJSBR24XMM2EBQUIDSYAARNGH/action/replication_record"}},"created_at":"2026-05-17T23:55:37.547550+00:00","updated_at":"2026-05-17T23:55:37.547550+00:00"}