{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JZFZBXB36XTW2PFBRAFRT4LZRI","short_pith_number":"pith:JZFZBXB3","schema_version":"1.0","canonical_sha256":"4e4b90dc3bf5e76d3ca1880b19f1798a0fd93f035af28ba9c015a8c158ae9e5f","source":{"kind":"arxiv","id":"2011.15028","version":6},"attestation_state":"computed","paper":{"title":"The LDBC Graphalytics Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Ahmed Musaafir, Alexandru Iosup, Alexandru Uta, Arnau Prat P\\'erez, G\\'abor Sz\\'arnyas, Hassan Chafi, Ilie Gabriel T\\u{a}nase, Lifeng Nai, Michael Anderson, Mihai Capot\\u{a}, Narayanan Sundaram, Peter Boncz, Siegfried Depner, Stijn Heldens, Thomas Manhardt, Tim Hegeman, Wing Lung Ngai, Yinglong Xia","submitted_at":"2020-11-30T17:34:37Z","abstract_excerpt":"In this document, we describe LDBC Graphalytics, an industrial-grade benchmark for graph analysis platforms. The main goal of Graphalytics is to enable the fair and objective comparison of graph analysis platforms. Due to the diversity of bottlenecks and performance issues such platforms need to address, Graphalytics consists of a set of selected deterministic algorithms for full-graph analysis, standard graph datasets, synthetic dataset generators, and reference output for validation purposes. Its test harness produces deep metrics that quantify multiple kinds of systems scalability, weak and"},"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":"2011.15028","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-30T17:34:37Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"b8e437ceddd2cde9ad12e2967763f5b2c3e1d29ac6d0b52efbf1e1ffe3ceabde","abstract_canon_sha256":"84c1d290eb6038d7bfb03f5156bf2836b96cac4b03e47250b02b5f5c6995e696"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:36.945013Z","signature_b64":"Zzi5vsUZ3uGMq4PweyZjQ6CsuC+RB155YPiZTvbYfy4yZyBp2Xxdh4Xx4Avcxzxpqw6MtCRi622eztApOeKSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e4b90dc3bf5e76d3ca1880b19f1798a0fd93f035af28ba9c015a8c158ae9e5f","last_reissued_at":"2026-07-05T05:58:36.944480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:36.944480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The LDBC Graphalytics Benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Ahmed Musaafir, Alexandru Iosup, Alexandru Uta, Arnau Prat P\\'erez, G\\'abor Sz\\'arnyas, Hassan Chafi, Ilie Gabriel T\\u{a}nase, Lifeng Nai, Michael Anderson, Mihai Capot\\u{a}, Narayanan Sundaram, Peter Boncz, Siegfried Depner, Stijn Heldens, Thomas Manhardt, Tim Hegeman, Wing Lung Ngai, Yinglong Xia","submitted_at":"2020-11-30T17:34:37Z","abstract_excerpt":"In this document, we describe LDBC Graphalytics, an industrial-grade benchmark for graph analysis platforms. The main goal of Graphalytics is to enable the fair and objective comparison of graph analysis platforms. Due to the diversity of bottlenecks and performance issues such platforms need to address, Graphalytics consists of a set of selected deterministic algorithms for full-graph analysis, standard graph datasets, synthetic dataset generators, and reference output for validation purposes. Its test harness produces deep metrics that quantify multiple kinds of systems scalability, weak and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.15028","kind":"arxiv","version":6},"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/2011.15028/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":"2011.15028","created_at":"2026-07-05T05:58:36.944544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.15028v6","created_at":"2026-07-05T05:58:36.944544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.15028","created_at":"2026-07-05T05:58:36.944544+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZFZBXB36XTW","created_at":"2026-07-05T05:58:36.944544+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZFZBXB36XTW2PFB","created_at":"2026-07-05T05:58:36.944544+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZFZBXB3","created_at":"2026-07-05T05:58:36.944544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.03725","citing_title":"Task-Centered Benchmark for Interactive Network Visualization & Analysis","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI","json":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI.json","graph_json":"https://pith.science/api/pith-number/JZFZBXB36XTW2PFBRAFRT4LZRI/graph.json","events_json":"https://pith.science/api/pith-number/JZFZBXB36XTW2PFBRAFRT4LZRI/events.json","paper":"https://pith.science/paper/JZFZBXB3"},"agent_actions":{"view_html":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI","download_json":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI.json","view_paper":"https://pith.science/paper/JZFZBXB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.15028&json=true","fetch_graph":"https://pith.science/api/pith-number/JZFZBXB36XTW2PFBRAFRT4LZRI/graph.json","fetch_events":"https://pith.science/api/pith-number/JZFZBXB36XTW2PFBRAFRT4LZRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI/action/storage_attestation","attest_author":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI/action/author_attestation","sign_citation":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI/action/citation_signature","submit_replication":"https://pith.science/pith/JZFZBXB36XTW2PFBRAFRT4LZRI/action/replication_record"}},"created_at":"2026-07-05T05:58:36.944544+00:00","updated_at":"2026-07-05T05:58:36.944544+00:00"}