{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KGB77EJ5P2PWXFLTDWOR3FL7SY","short_pith_number":"pith:KGB77EJ5","schema_version":"1.0","canonical_sha256":"5183ff913d7e9f6b95731d9d1d957f963cdb5a1337837eca192ed49148e0f38b","source":{"kind":"arxiv","id":"2307.04350","version":3},"attestation_state":"computed","paper":{"title":"The Linked Data Benchmark Council (LDBC): Driving competition and collaboration in the graph data management space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alastair Green, Alexandru Iosup, Alin Deutsch, Altan Birler, Arnau Prat-P\\'erez, Atanas Kiryakov, Benjamin A. Steer, Bing Tong, Bin Yang, Brad Bebee, Chen Zhang, David P\\\"uroja, D\\'avid Szak\\'allas, Denise Gosnell, G\\'abor Sz\\'arnyas, George Fletcher, Heng Lin, Henry A. Gabb, Jack Waudby, Jan Hidders, Jason Zhang, Keith W. Hare, Leonid Libkin, Mingxi Wu, Oskar van Rest, Peter Boncz, Shipeng Qi, Tomas Kovatchev, Wenyuan Yu, Xiaojian Luo, Xinsheng Li, Yan Zhou, Zhihui Guo","submitted_at":"2023-07-10T05:20:36Z","abstract_excerpt":"Graph data management is instrumental for several use cases such as recommendation, root cause analysis, financial fraud detection, and enterprise knowledge representation. Efficiently supporting these use cases yields a number of unique requirements, including the need for a concise query language and graph-aware query optimization techniques. The goal of the Linked Data Benchmark Council (LDBC) is to design a set of standard benchmarks that capture representative categories of graph data management problems, making the performance of systems comparable and facilitating competition among vend"},"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":"2307.04350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-07-10T05:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"e5945b84dca9bb3f2ca301b874a082ee5c62ec249aa6c0db075c494500513c89","abstract_canon_sha256":"59805eb34855df9ee7c29e7aa99f00372f55ac9040b779ffd6bb435657ce49d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:55.252747Z","signature_b64":"Ea6JSyOyga2XUeVGlDgD3F6kJ7qpVeT98rDf9V7+MI/3B9SVAnfI6SWl7t2xZGUDk67gherIu57XWSXW3ElrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5183ff913d7e9f6b95731d9d1d957f963cdb5a1337837eca192ed49148e0f38b","last_reissued_at":"2026-07-05T09:00:55.252296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:55.252296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Linked Data Benchmark Council (LDBC): Driving competition and collaboration in the graph data management space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alastair Green, Alexandru Iosup, Alin Deutsch, Altan Birler, Arnau Prat-P\\'erez, Atanas Kiryakov, Benjamin A. Steer, Bing Tong, Bin Yang, Brad Bebee, Chen Zhang, David P\\\"uroja, D\\'avid Szak\\'allas, Denise Gosnell, G\\'abor Sz\\'arnyas, George Fletcher, Heng Lin, Henry A. Gabb, Jack Waudby, Jan Hidders, Jason Zhang, Keith W. Hare, Leonid Libkin, Mingxi Wu, Oskar van Rest, Peter Boncz, Shipeng Qi, Tomas Kovatchev, Wenyuan Yu, Xiaojian Luo, Xinsheng Li, Yan Zhou, Zhihui Guo","submitted_at":"2023-07-10T05:20:36Z","abstract_excerpt":"Graph data management is instrumental for several use cases such as recommendation, root cause analysis, financial fraud detection, and enterprise knowledge representation. Efficiently supporting these use cases yields a number of unique requirements, including the need for a concise query language and graph-aware query optimization techniques. The goal of the Linked Data Benchmark Council (LDBC) is to design a set of standard benchmarks that capture representative categories of graph data management problems, making the performance of systems comparable and facilitating competition among vend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04350","kind":"arxiv","version":3},"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/2307.04350/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":"2307.04350","created_at":"2026-07-05T09:00:55.252367+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04350v3","created_at":"2026-07-05T09:00:55.252367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04350","created_at":"2026-07-05T09:00:55.252367+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGB77EJ5P2PW","created_at":"2026-07-05T09:00:55.252367+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGB77EJ5P2PWXFLT","created_at":"2026-07-05T09:00:55.252367+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGB77EJ5","created_at":"2026-07-05T09:00:55.252367+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06127","citing_title":"Validation of graph databases against PG-Schema","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY","json":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY.json","graph_json":"https://pith.science/api/pith-number/KGB77EJ5P2PWXFLTDWOR3FL7SY/graph.json","events_json":"https://pith.science/api/pith-number/KGB77EJ5P2PWXFLTDWOR3FL7SY/events.json","paper":"https://pith.science/paper/KGB77EJ5"},"agent_actions":{"view_html":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY","download_json":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY.json","view_paper":"https://pith.science/paper/KGB77EJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04350&json=true","fetch_graph":"https://pith.science/api/pith-number/KGB77EJ5P2PWXFLTDWOR3FL7SY/graph.json","fetch_events":"https://pith.science/api/pith-number/KGB77EJ5P2PWXFLTDWOR3FL7SY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY/action/storage_attestation","attest_author":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY/action/author_attestation","sign_citation":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY/action/citation_signature","submit_replication":"https://pith.science/pith/KGB77EJ5P2PWXFLTDWOR3FL7SY/action/replication_record"}},"created_at":"2026-07-05T09:00:55.252367+00:00","updated_at":"2026-07-05T09:00:55.252367+00:00"}