{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FA76L4ZICAOPW6Z4HXOIW225NT","short_pith_number":"pith:FA76L4ZI","schema_version":"1.0","canonical_sha256":"283fe5f328101cfb7b3c3ddc8b6b5d6cf9c88dd9e6b2ef4a65e3722b28fda141","source":{"kind":"arxiv","id":"2001.02299","version":11},"attestation_state":"computed","paper":{"title":"The LDBC Social Network Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SI"],"primary_cat":"cs.DB","authors_text":"Alex Averbuch, Altan Birler, Andrey Gubichev, Arnau Prat-P\\'erez, Benjamin A. Steer, David P\\\"uroja, D\\'avid Szak\\'allas, G\\'abor Sz\\'arnyas, Jack Waudby, J\\'anos Benjamin Antal, Josep Llu\\'is Larriba Pey, J\\'ozsef Marton, Marcus Paradies, M\\'arton B\\'ur, Mingxi Wu, Minh-Duc Pham, Mirko Spasi\\'c, Moritz Kaufmann, Norbert Mart\\'inez, Orri Erling, Peter Boncz, Renzo Angles, Vlad Haprian, Yuchen Zhang","submitted_at":"2020-01-07T22:12:35Z","abstract_excerpt":"The Linked Data Benchmark Council's Social Network Benchmark (LDBC SNB) is an effort intended to test various functionalities of systems used for graph-like data management. For this, LDBC SNB uses the recognizable scenario of operating a social network, characterized by its graph-shaped data. LDBC SNB consists of two workloads that focus on different functionalities: the Interactive workload (interactive transactional queries) and the Business Intelligence workload (analytical queries). This document contains the definition of both workloads. This includes a detailed explanation of the data u"},"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.02299","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-01-07T22:12:35Z","cross_cats_sorted":["cs.PF","cs.SI"],"title_canon_sha256":"a55f977557feafe8750426bab2deb86e4ff1930b14a8124fa1c347735885520b","abstract_canon_sha256":"b33e5adcbaa6afdd6a06134c6d057be564e266efeda6b1108542de00a50c0775"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:06.156076Z","signature_b64":"AG8Z7uzYE+XTQ5I+BM/ti4S/ao8Cqod1pIQWqX30JdfdX066htET4angPVzz17prfVz/F/Fx5vdQzsv8SUenCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"283fe5f328101cfb7b3c3ddc8b6b5d6cf9c88dd9e6b2ef4a65e3722b28fda141","last_reissued_at":"2026-07-05T09:04:06.155642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:06.155642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The LDBC Social Network Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SI"],"primary_cat":"cs.DB","authors_text":"Alex Averbuch, Altan Birler, Andrey Gubichev, Arnau Prat-P\\'erez, Benjamin A. Steer, David P\\\"uroja, D\\'avid Szak\\'allas, G\\'abor Sz\\'arnyas, Jack Waudby, J\\'anos Benjamin Antal, Josep Llu\\'is Larriba Pey, J\\'ozsef Marton, Marcus Paradies, M\\'arton B\\'ur, Mingxi Wu, Minh-Duc Pham, Mirko Spasi\\'c, Moritz Kaufmann, Norbert Mart\\'inez, Orri Erling, Peter Boncz, Renzo Angles, Vlad Haprian, Yuchen Zhang","submitted_at":"2020-01-07T22:12:35Z","abstract_excerpt":"The Linked Data Benchmark Council's Social Network Benchmark (LDBC SNB) is an effort intended to test various functionalities of systems used for graph-like data management. For this, LDBC SNB uses the recognizable scenario of operating a social network, characterized by its graph-shaped data. LDBC SNB consists of two workloads that focus on different functionalities: the Interactive workload (interactive transactional queries) and the Business Intelligence workload (analytical queries). This document contains the definition of both workloads. This includes a detailed explanation of the data u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02299","kind":"arxiv","version":11},"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.02299/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.02299","created_at":"2026-07-05T09:04:06.155701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.02299v11","created_at":"2026-07-05T09:04:06.155701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02299","created_at":"2026-07-05T09:04:06.155701+00:00"},{"alias_kind":"pith_short_12","alias_value":"FA76L4ZICAOP","created_at":"2026-07-05T09:04:06.155701+00:00"},{"alias_kind":"pith_short_16","alias_value":"FA76L4ZICAOPW6Z4","created_at":"2026-07-05T09:04:06.155701+00:00"},{"alias_kind":"pith_short_8","alias_value":"FA76L4ZI","created_at":"2026-07-05T09:04:06.155701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.02548","citing_title":"The KG-ER Conceptual Schema Language","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT","json":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT.json","graph_json":"https://pith.science/api/pith-number/FA76L4ZICAOPW6Z4HXOIW225NT/graph.json","events_json":"https://pith.science/api/pith-number/FA76L4ZICAOPW6Z4HXOIW225NT/events.json","paper":"https://pith.science/paper/FA76L4ZI"},"agent_actions":{"view_html":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT","download_json":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT.json","view_paper":"https://pith.science/paper/FA76L4ZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.02299&json=true","fetch_graph":"https://pith.science/api/pith-number/FA76L4ZICAOPW6Z4HXOIW225NT/graph.json","fetch_events":"https://pith.science/api/pith-number/FA76L4ZICAOPW6Z4HXOIW225NT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT/action/storage_attestation","attest_author":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT/action/author_attestation","sign_citation":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT/action/citation_signature","submit_replication":"https://pith.science/pith/FA76L4ZICAOPW6Z4HXOIW225NT/action/replication_record"}},"created_at":"2026-07-05T09:04:06.155701+00:00","updated_at":"2026-07-05T09:04:06.155701+00:00"}