{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QLJ5IERELV76TNU33W6NWRYEUW","short_pith_number":"pith:QLJ5IERE","canonical_record":{"source":{"id":"1905.08021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-17T10:59:26Z","cross_cats_sorted":[],"title_canon_sha256":"1128a703a4b2d49108fd7cab407c8baf0717a71f6a1a72922324833bfd6596f7","abstract_canon_sha256":"7692fe55d89c5b0c8d06bc27f2ec81f34994707ec82d718ddb9f357712822607"},"schema_version":"1.0"},"canonical_sha256":"82d3d412245d7fe9b69bddbcdb4704a5a021c03450ecf8c980578c2b2c708343","source":{"kind":"arxiv","id":"1905.08021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08021","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08021v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08021","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"QLJ5IERELV76","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QLJ5IERELV76TNU3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QLJ5IERE","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QLJ5IERELV76TNU33W6NWRYEUW","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-17T10:59:26Z","cross_cats_sorted":[],"title_canon_sha256":"1128a703a4b2d49108fd7cab407c8baf0717a71f6a1a72922324833bfd6596f7","abstract_canon_sha256":"7692fe55d89c5b0c8d06bc27f2ec81f34994707ec82d718ddb9f357712822607"},"schema_version":"1.0"},"canonical_sha256":"82d3d412245d7fe9b69bddbcdb4704a5a021c03450ecf8c980578c2b2c708343","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.850505Z","signature_b64":"MW21Yi9Gwf0ffUzFF7hIuAVzlSjEk5hdfDlWpyMoKM89tEus6y6zI6zWz3HLUu00UBCwceJn8kY3VDnz4biMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82d3d412245d7fe9b69bddbcdb4704a5a021c03450ecf8c980578c2b2c708343","last_reissued_at":"2026-05-17T23:45:47.849927Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.849927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08021","source_version":1,"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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rr8Ia1k64DTvwzSpCxUAhE0o638eeEG1LtmI+JWV/FNGslqnAG6bjiV/6sw0btpvyxtfjJHLFJUCddEDxmABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:06:35.654363Z"},"content_sha256":"57649d5fac35202f708e1e13540d080e8d5f283788ea75054645ae4e51ca6f77","schema_version":"1.0","event_id":"sha256:57649d5fac35202f708e1e13540d080e8d5f283788ea75054645ae4e51ca6f77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QLJ5IERELV76TNU33W6NWRYEUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Benny Kimelfeld, Oren Kalinsky, Yoav Etsion","submitted_at":"2019-05-17T10:59:26Z","abstract_excerpt":"Graph pattern matching (e.g., finding all cycles and cliques) has become an important component in many critical domains such as social networks, biology, and cyber-security. This development motivated research to develop faster algorithms that target graph pattern matching. In recent years, the database community has shown that mapping graph pattern matching problems to a new class of relational join algorithms provides an efficient framework for computing these problems.\n  In this paper, we argue that this new class of relational join algorithms is highly amenable to specialized hardware acc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08021","kind":"arxiv","version":1},"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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7JKJ0YAwgDIz4G83QW/Bu96btJ89dp7n4OdzzR3dKOXoQ1e2bbnuLr9XkZ5hrBdmzeaamv4pk3ay1w2bqDiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:06:35.654706Z"},"content_sha256":"fd42fac67efe808eb4adab3628e046141e95d734a2d0ca4fcbb9a8091553b275","schema_version":"1.0","event_id":"sha256:fd42fac67efe808eb4adab3628e046141e95d734a2d0ca4fcbb9a8091553b275"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLJ5IERELV76TNU33W6NWRYEUW/bundle.json","state_url":"https://pith.science/pith/QLJ5IERELV76TNU33W6NWRYEUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLJ5IERELV76TNU33W6NWRYEUW/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-07-03T11:06:35Z","links":{"resolver":"https://pith.science/pith/QLJ5IERELV76TNU33W6NWRYEUW","bundle":"https://pith.science/pith/QLJ5IERELV76TNU33W6NWRYEUW/bundle.json","state":"https://pith.science/pith/QLJ5IERELV76TNU33W6NWRYEUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLJ5IERELV76TNU33W6NWRYEUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QLJ5IERELV76TNU33W6NWRYEUW","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":"7692fe55d89c5b0c8d06bc27f2ec81f34994707ec82d718ddb9f357712822607","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-17T10:59:26Z","title_canon_sha256":"1128a703a4b2d49108fd7cab407c8baf0717a71f6a1a72922324833bfd6596f7"},"schema_version":"1.0","source":{"id":"1905.08021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08021","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08021v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08021","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"QLJ5IERELV76","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QLJ5IERELV76TNU3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QLJ5IERE","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:fd42fac67efe808eb4adab3628e046141e95d734a2d0ca4fcbb9a8091553b275","target":"graph","created_at":"2026-05-17T23:45:47Z","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":"Graph pattern matching (e.g., finding all cycles and cliques) has become an important component in many critical domains such as social networks, biology, and cyber-security. This development motivated research to develop faster algorithms that target graph pattern matching. In recent years, the database community has shown that mapping graph pattern matching problems to a new class of relational join algorithms provides an efficient framework for computing these problems.\n  In this paper, we argue that this new class of relational join algorithms is highly amenable to specialized hardware acc","authors_text":"Benny Kimelfeld, Oren Kalinsky, Yoav Etsion","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-17T10:59:26Z","title":"The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08021","kind":"arxiv","version":1},"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:57649d5fac35202f708e1e13540d080e8d5f283788ea75054645ae4e51ca6f77","target":"record","created_at":"2026-05-17T23:45:47Z","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":"7692fe55d89c5b0c8d06bc27f2ec81f34994707ec82d718ddb9f357712822607","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-17T10:59:26Z","title_canon_sha256":"1128a703a4b2d49108fd7cab407c8baf0717a71f6a1a72922324833bfd6596f7"},"schema_version":"1.0","source":{"id":"1905.08021","kind":"arxiv","version":1}},"canonical_sha256":"82d3d412245d7fe9b69bddbcdb4704a5a021c03450ecf8c980578c2b2c708343","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82d3d412245d7fe9b69bddbcdb4704a5a021c03450ecf8c980578c2b2c708343","first_computed_at":"2026-05-17T23:45:47.849927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:47.849927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MW21Yi9Gwf0ffUzFF7hIuAVzlSjEk5hdfDlWpyMoKM89tEus6y6zI6zWz3HLUu00UBCwceJn8kY3VDnz4biMCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:47.850505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57649d5fac35202f708e1e13540d080e8d5f283788ea75054645ae4e51ca6f77","sha256:fd42fac67efe808eb4adab3628e046141e95d734a2d0ca4fcbb9a8091553b275"],"state_sha256":"cbb4f8513e586b2b0798854284f83e7294f01629d5749aa342fe70bfa5631063"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCG+rM31iVRWszRRl1VOFel5EFeNlNW+2OM6OEmloy4H4oHNuilEuDTqq/55s19SwMEj/yvmOokSowmFonVQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T11:06:35.656544Z","bundle_sha256":"97d4faf5f46ee1ceb4c949dcc2288144fb20d150d3450c9f9cf130508d61f620"}}