{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N6DUJAPVZ7DNDOI4M6KSSCQUSJ","short_pith_number":"pith:N6DUJAPV","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"},"canonical_sha256":"6f874481f5cfc6d1b91c6795290a149252f44f4508370bcd213a55a50b752e80","source":{"kind":"arxiv","id":"1503.02368","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02368","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02368v7","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02368","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"N6DUJAPVZ7DN","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N6DUJAPVZ7DNDOI4","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N6DUJAPV","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N6DUJAPVZ7DNDOI4M6KSSCQUSJ","target":"record","payload":{"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"},"canonical_sha256":"6f874481f5cfc6d1b91c6795290a149252f44f4508370bcd213a55a50b752e80","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"},"source_kind":"arxiv","source_id":"1503.02368","source_version":7,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBJuWfTCGIlKWrNHyr2qIuYN7N2HK3mdjdsml0K5OJ1EULFkje+IutmBottMDmqfpnxcTVSNNyrJntsrVQXEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:41:27.670649Z"},"content_sha256":"cbfe9ad28e70a307fd5240ffb4dfa6407ac9638a7d646bc38426b35c11d91ae1","schema_version":"1.0","event_id":"sha256:cbfe9ad28e70a307fd5240ffb4dfa6407ac9638a7d646bc38426b35c11d91ae1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N6DUJAPVZ7DNDOI4M6KSSCQUSJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EOGJq+gzwW9amUqbFqzVPzfqJDMRCpV+Vb8dh8aNuzrFF6/pyShIxxDs5VEWfXCVLIZwQPPawTbasCATpJFuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:41:27.671419Z"},"content_sha256":"d9d7285c7afeae2a12a21c524c7e674713a09240e9ab7a6c7672c9d07d9aca48","schema_version":"1.0","event_id":"sha256:d9d7285c7afeae2a12a21c524c7e674713a09240e9ab7a6c7672c9d07d9aca48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/bundle.json","state_url":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T15:41:27Z","links":{"resolver":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ","bundle":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/bundle.json","state":"https://pith.science/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6DUJAPVZ7DNDOI4M6KSSCQUSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N6DUJAPVZ7DNDOI4M6KSSCQUSJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"36ff0aef0787d32ba0261f77d76f5636f46d779a6ec8948fd230bcaa19822fba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-03-09T04:02:36Z","title_canon_sha256":"0e11087e5014025d6ee2d0210f70adf85dba5cfeab8ec395018fb570ee88fd9c"},"schema_version":"1.0","source":{"id":"1503.02368","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02368","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02368v7","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02368","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"N6DUJAPVZ7DN","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N6DUJAPVZ7DNDOI4","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N6DUJAPV","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:d9d7285c7afeae2a12a21c524c7e674713a09240e9ab7a6c7672c9d07d9aca48","target":"graph","created_at":"2026-05-18T00:53:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christopher R. Aberger, Christopher R\\'e, Kunle Olukotun, Susan Tu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-03-09T04:02:36Z","title":"EmptyHeaded: A Relational Engine for Graph Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02368","kind":"arxiv","version":7},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cbfe9ad28e70a307fd5240ffb4dfa6407ac9638a7d646bc38426b35c11d91ae1","target":"record","created_at":"2026-05-18T00:53:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"36ff0aef0787d32ba0261f77d76f5636f46d779a6ec8948fd230bcaa19822fba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-03-09T04:02:36Z","title_canon_sha256":"0e11087e5014025d6ee2d0210f70adf85dba5cfeab8ec395018fb570ee88fd9c"},"schema_version":"1.0","source":{"id":"1503.02368","kind":"arxiv","version":7}},"canonical_sha256":"6f874481f5cfc6d1b91c6795290a149252f44f4508370bcd213a55a50b752e80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f874481f5cfc6d1b91c6795290a149252f44f4508370bcd213a55a50b752e80","first_computed_at":"2026-05-18T00:53:21.175700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:21.175700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z+3quZrqCTApVDpMj7gYWe4TsrQIuh+lgbfSByiKyM9LKi9bf0XBr1yg/x+xj9ecdPOvXdMrKSdaoHbZu4gpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:21.176216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02368","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbfe9ad28e70a307fd5240ffb4dfa6407ac9638a7d646bc38426b35c11d91ae1","sha256:d9d7285c7afeae2a12a21c524c7e674713a09240e9ab7a6c7672c9d07d9aca48"],"state_sha256":"4dd5449b69cd16f90f73fc52dc9fd7bcf69048f717fe092fb1ff5d090e1a9589"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+ks87m21SPFEwCowy1uOaXOVZ9pwCFjr5JQmRBvyoiXeDIBo4l1GTkSHAu99dPGHUm555vlilHrZmD6a4cKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:41:27.675948Z","bundle_sha256":"4ad9db809484eee7aaab03d7bd5f76a3a51e768df3ebb92ee2ade442199ee2bd"}}