{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N6DUJAPVZ7DNDOI4M6KSSCQUSJ","short_pith_number":"pith:N6DUJAPV","schema_version":"1.0","canonical_sha256":"6f874481f5cfc6d1b91c6795290a149252f44f4508370bcd213a55a50b752e80","source":{"kind":"arxiv","id":"1503.02368","version":7},"attestation_state":"computed","paper":{"title":"EmptyHeaded: A Relational Engine for Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Christopher R. Aberger, Christopher R\\'e, Kunle Olukotun, Susan Tu","submitted_at":"2015-03-09T04:02:36Z","abstract_excerpt":"There are two types of high-performance graph processing engines: low- and high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code, hence ensuring that efficiency is the burden of the user. In high-level engines, users write in query languages like datalog (SociaLite) or SQL (Grail). High-level engines are easier to use but are orders of magnitude slower than the low-level graph engines. We present EmptyHeaded, a high-level engine that supports a rich datalog-like query langua"},"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":"1503.02368","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-03-09T04:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"0e11087e5014025d6ee2d0210f70adf85dba5cfeab8ec395018fb570ee88fd9c","abstract_canon_sha256":"36ff0aef0787d32ba0261f77d76f5636f46d779a6ec8948fd230bcaa19822fba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.176216Z","signature_b64":"z+3quZrqCTApVDpMj7gYWe4TsrQIuh+lgbfSByiKyM9LKi9bf0XBr1yg/x+xj9ecdPOvXdMrKSdaoHbZu4gpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f874481f5cfc6d1b91c6795290a149252f44f4508370bcd213a55a50b752e80","last_reissued_at":"2026-05-18T00:53:21.175700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.175700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EmptyHeaded: A Relational Engine for Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Christopher R. Aberger, Christopher R\\'e, Kunle Olukotun, Susan Tu","submitted_at":"2015-03-09T04:02:36Z","abstract_excerpt":"There are two types of high-performance graph processing engines: low- and high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code, hence ensuring that efficiency is the burden of the user. In high-level engines, users write in query languages like datalog (SociaLite) or SQL (Grail). High-level engines are easier to use but are orders of magnitude slower than the low-level graph engines. We present EmptyHeaded, a high-level engine that supports a rich datalog-like query langua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02368","kind":"arxiv","version":7},"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":"1503.02368","created_at":"2026-05-18T00:53:21.175774+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02368v7","created_at":"2026-05-18T00:53:21.175774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02368","created_at":"2026-05-18T00:53:21.175774+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6DUJAPVZ7DN","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6DUJAPVZ7DNDOI4","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6DUJAPV","created_at":"2026-05-18T12:29:32.376354+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/N6DUJAPVZ7DNDOI4M6KSSCQUSJ","json":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ.json","graph_json":"https://pith.science/api/pith-number/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/graph.json","events_json":"https://pith.science/api/pith-number/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/events.json","paper":"https://pith.science/paper/N6DUJAPV"},"agent_actions":{"view_html":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ","download_json":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ.json","view_paper":"https://pith.science/paper/N6DUJAPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02368&json=true","fetch_graph":"https://pith.science/api/pith-number/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/action/storage_attestation","attest_author":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/action/author_attestation","sign_citation":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/action/citation_signature","submit_replication":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/action/replication_record"}},"created_at":"2026-05-18T00:53:21.175774+00:00","updated_at":"2026-05-18T00:53:21.175774+00:00"}