{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HPH3H6UHPK5ZEZNADTSWUDPKQ2","short_pith_number":"pith:HPH3H6UH","canonical_record":{"source":{"id":"2108.02290","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-08-04T21:23:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"29f912b0230fa7fe7291797d5d6311846dcf9dd8b8cd4aae6d781ac922d9c904","abstract_canon_sha256":"95bf1a8108c59c83a4a93015d4ae25ce2a3ca14dc5348179d3e80b484d032bb4"},"schema_version":"1.0"},"canonical_sha256":"3bcfb3fa877abb9265a01ce56a0dea869176be63dd3a501f3cb67ef0c96e64ce","source":{"kind":"arxiv","id":"2108.02290","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.02290","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"2108.02290v2","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02290","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"HPH3H6UHPK5Z","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"pith_short_16","alias_value":"HPH3H6UHPK5ZEZNA","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"pith_short_8","alias_value":"HPH3H6UH","created_at":"2026-07-05T03:46:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HPH3H6UHPK5ZEZNADTSWUDPKQ2","target":"record","payload":{"canonical_record":{"source":{"id":"2108.02290","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-08-04T21:23:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"29f912b0230fa7fe7291797d5d6311846dcf9dd8b8cd4aae6d781ac922d9c904","abstract_canon_sha256":"95bf1a8108c59c83a4a93015d4ae25ce2a3ca14dc5348179d3e80b484d032bb4"},"schema_version":"1.0"},"canonical_sha256":"3bcfb3fa877abb9265a01ce56a0dea869176be63dd3a501f3cb67ef0c96e64ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:21.181744Z","signature_b64":"txjH+jrRNRTD8+vRqZHkUg10T6kLJXALHx+PGuIY51UUxWN4ifn32s+wYDvs2AS/ZjGJipc4SZXRz3CylM3mDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bcfb3fa877abb9265a01ce56a0dea869176be63dd3a501f3cb67ef0c96e64ce","last_reissued_at":"2026-07-05T03:46:21.181216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:21.181216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.02290","source_version":2,"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-07-05T03:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmmHZSZcOYzoec4w7iyS5LcwEaQy4GisWoGBubwrCPVlb3N1yFXxzH8FvnEK9XabIyMCeZydoKsAblDJnqCNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:28:24.296284Z"},"content_sha256":"416585b02acbeea580d04965e1bf8d7d80f298a38740b5a525610543cb118512","schema_version":"1.0","event_id":"sha256:416585b02acbeea580d04965e1bf8d7d80f298a38740b5a525610543cb118512"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HPH3H6UHPK5ZEZNADTSWUDPKQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational E-Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Max Willsey, Yihong Zhang, Yisu Remy Wang, Zachary Tatlock","submitted_at":"2021-08-04T21:23:28Z","abstract_excerpt":"We present a new approach to e-matching based on relational join; in particular, we apply recent database query execution techniques to guarantee worst-case optimal run time. Compared to the conventional backtracking approach that always searches the e-graph \"top down\", our new relational e-matching approach can better exploit pattern structure by searching the e-graph according to an optimized query plan. We also establish the first data complexity result for e-matching, bounding run time as a function of the e-graph size and output size. We prototyped and evaluated our technique in the state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02290","kind":"arxiv","version":2},"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/2108.02290/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"},"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-07-05T03:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXpnWiP0BVc6+iQksij4pseV5x/2ANUQz3NZ1f2CwWIU41zo6n4m9bBy/9KzF8+NaVMVon5ViJFyOanE5CthDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:28:24.296788Z"},"content_sha256":"5400d9a5ede661a017621b0eee2300d3ad70c94db2c980cc387e1c1527e369b6","schema_version":"1.0","event_id":"sha256:5400d9a5ede661a017621b0eee2300d3ad70c94db2c980cc387e1c1527e369b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPH3H6UHPK5ZEZNADTSWUDPKQ2/bundle.json","state_url":"https://pith.science/pith/HPH3H6UHPK5ZEZNADTSWUDPKQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPH3H6UHPK5ZEZNADTSWUDPKQ2/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-08-03T17:28:24Z","links":{"resolver":"https://pith.science/pith/HPH3H6UHPK5ZEZNADTSWUDPKQ2","bundle":"https://pith.science/pith/HPH3H6UHPK5ZEZNADTSWUDPKQ2/bundle.json","state":"https://pith.science/pith/HPH3H6UHPK5ZEZNADTSWUDPKQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPH3H6UHPK5ZEZNADTSWUDPKQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HPH3H6UHPK5ZEZNADTSWUDPKQ2","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":"95bf1a8108c59c83a4a93015d4ae25ce2a3ca14dc5348179d3e80b484d032bb4","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-08-04T21:23:28Z","title_canon_sha256":"29f912b0230fa7fe7291797d5d6311846dcf9dd8b8cd4aae6d781ac922d9c904"},"schema_version":"1.0","source":{"id":"2108.02290","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.02290","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"2108.02290v2","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02290","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"HPH3H6UHPK5Z","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"pith_short_16","alias_value":"HPH3H6UHPK5ZEZNA","created_at":"2026-07-05T03:46:21Z"},{"alias_kind":"pith_short_8","alias_value":"HPH3H6UH","created_at":"2026-07-05T03:46:21Z"}],"graph_snapshots":[{"event_id":"sha256:5400d9a5ede661a017621b0eee2300d3ad70c94db2c980cc387e1c1527e369b6","target":"graph","created_at":"2026-07-05T03:46: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.02290/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new approach to e-matching based on relational join; in particular, we apply recent database query execution techniques to guarantee worst-case optimal run time. Compared to the conventional backtracking approach that always searches the e-graph \"top down\", our new relational e-matching approach can better exploit pattern structure by searching the e-graph according to an optimized query plan. We also establish the first data complexity result for e-matching, bounding run time as a function of the e-graph size and output size. We prototyped and evaluated our technique in the state","authors_text":"Max Willsey, Yihong Zhang, Yisu Remy Wang, Zachary Tatlock","cross_cats":["cs.PL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-08-04T21:23:28Z","title":"Relational E-Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02290","kind":"arxiv","version":2},"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:416585b02acbeea580d04965e1bf8d7d80f298a38740b5a525610543cb118512","target":"record","created_at":"2026-07-05T03:46: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":"95bf1a8108c59c83a4a93015d4ae25ce2a3ca14dc5348179d3e80b484d032bb4","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-08-04T21:23:28Z","title_canon_sha256":"29f912b0230fa7fe7291797d5d6311846dcf9dd8b8cd4aae6d781ac922d9c904"},"schema_version":"1.0","source":{"id":"2108.02290","kind":"arxiv","version":2}},"canonical_sha256":"3bcfb3fa877abb9265a01ce56a0dea869176be63dd3a501f3cb67ef0c96e64ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bcfb3fa877abb9265a01ce56a0dea869176be63dd3a501f3cb67ef0c96e64ce","first_computed_at":"2026-07-05T03:46:21.181216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:46:21.181216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"txjH+jrRNRTD8+vRqZHkUg10T6kLJXALHx+PGuIY51UUxWN4ifn32s+wYDvs2AS/ZjGJipc4SZXRz3CylM3mDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:46:21.181744Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.02290","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:416585b02acbeea580d04965e1bf8d7d80f298a38740b5a525610543cb118512","sha256:5400d9a5ede661a017621b0eee2300d3ad70c94db2c980cc387e1c1527e369b6"],"state_sha256":"25db40d61fefc1bc3bb6232afe6dc95b4de6c1847fc5f8ae66a40d604c41be58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ue9zxE1/OuoQyYkN34QsyTYJ3zw6xFINBOo4c2voLpI26HDNU63YXioK69W69XRxSaHxwjdeJ7ENza9S64FDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:28:24.301395Z","bundle_sha256":"ca99a14738d99351847a660415b106ecc90d5ba67e1be95d8e4d9ca4ae20a8a0"}}