{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ITSXRHVYDGC3OSYC4BBMV2EUKT","short_pith_number":"pith:ITSXRHVY","canonical_record":{"source":{"id":"2202.10390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-21T17:40:10Z","cross_cats_sorted":[],"title_canon_sha256":"57a88135066c22aef2d51092a37a6902591e09514c46f9bac53a8c4cda0de582","abstract_canon_sha256":"d46e463a63afb3184bfab1324deb7d06d2fcd2f53fd189bda5ded1991649dba0"},"schema_version":"1.0"},"canonical_sha256":"44e5789eb81985b74b02e042cae89454e0e8e19e7fc388ece4c06ce9b9bd6c41","source":{"kind":"arxiv","id":"2202.10390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.10390","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"2202.10390v1","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10390","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"ITSXRHVYDGC3","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"ITSXRHVYDGC3OSYC","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"ITSXRHVY","created_at":"2026-07-05T03:58:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ITSXRHVYDGC3OSYC4BBMV2EUKT","target":"record","payload":{"canonical_record":{"source":{"id":"2202.10390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-21T17:40:10Z","cross_cats_sorted":[],"title_canon_sha256":"57a88135066c22aef2d51092a37a6902591e09514c46f9bac53a8c4cda0de582","abstract_canon_sha256":"d46e463a63afb3184bfab1324deb7d06d2fcd2f53fd189bda5ded1991649dba0"},"schema_version":"1.0"},"canonical_sha256":"44e5789eb81985b74b02e042cae89454e0e8e19e7fc388ece4c06ce9b9bd6c41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:41.996582Z","signature_b64":"rprY+0Jf+CaNl5hUxV/8/Yj5dP3Egg4/P2hgWsA2mR91URly8JTjLb3FokQqyJwY3TG9GjXlEaqCBHqNCaKxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44e5789eb81985b74b02e042cae89454e0e8e19e7fc388ece4c06ce9b9bd6c41","last_reissued_at":"2026-07-05T03:58:41.996171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:41.996171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.10390","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-07-05T03:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJg3zRV73XrHW4M3C1YVSWhX6uM9hxIxdD4+uMyydatU2dsiJMU1O02v9925BES7AnQiBVbBgEDcc31EbTQHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:10:22.680216Z"},"content_sha256":"00d892ee7423ed8f49eb66eb8bb6cbe82d7e9788674c91e4701e5d4aa5459797","schema_version":"1.0","event_id":"sha256:00d892ee7423ed8f49eb66eb8bb6cbe82d7e9788674c91e4701e5d4aa5459797"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ITSXRHVYDGC3OSYC4BBMV2EUKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Recursive Queries with Program Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis, Reinhard Pichler, Yisu Remy Wang","submitted_at":"2022-02-21T17:40:10Z","abstract_excerpt":"Most work on query optimization has concentrated on loop-free queries. However, data science and machine learning workloads today typically involve recursive or iterative computation. In this work, we propose a novel framework for optimizing recursive queries using methods from program synthesis. In particular, we introduce a simple yet powerful optimization rule called the \"FGH-rule\" which aims to find a faster way to evaluate a recursive program. The solution is found by making use of powerful tools, such as a program synthesizer, an SMT-solver, and an equality saturation system. We demonstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10390","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.10390/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:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+hVdYhnK6q9/99foyIIsW4v6jdXnWQxIzZGwo7uPp5FfQZ6d0bqmtMwLKy6K9WxVoGNi8IeA3GrY4TPQj77BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:10:22.680601Z"},"content_sha256":"9786fbc194c624e8df77a43b6ec5dfc1c3c0336861486b0d0aecad7c2e3cbee9","schema_version":"1.0","event_id":"sha256:9786fbc194c624e8df77a43b6ec5dfc1c3c0336861486b0d0aecad7c2e3cbee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITSXRHVYDGC3OSYC4BBMV2EUKT/bundle.json","state_url":"https://pith.science/pith/ITSXRHVYDGC3OSYC4BBMV2EUKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITSXRHVYDGC3OSYC4BBMV2EUKT/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-07T15:10:22Z","links":{"resolver":"https://pith.science/pith/ITSXRHVYDGC3OSYC4BBMV2EUKT","bundle":"https://pith.science/pith/ITSXRHVYDGC3OSYC4BBMV2EUKT/bundle.json","state":"https://pith.science/pith/ITSXRHVYDGC3OSYC4BBMV2EUKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITSXRHVYDGC3OSYC4BBMV2EUKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ITSXRHVYDGC3OSYC4BBMV2EUKT","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":"d46e463a63afb3184bfab1324deb7d06d2fcd2f53fd189bda5ded1991649dba0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-21T17:40:10Z","title_canon_sha256":"57a88135066c22aef2d51092a37a6902591e09514c46f9bac53a8c4cda0de582"},"schema_version":"1.0","source":{"id":"2202.10390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.10390","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"2202.10390v1","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10390","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"ITSXRHVYDGC3","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"ITSXRHVYDGC3OSYC","created_at":"2026-07-05T03:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"ITSXRHVY","created_at":"2026-07-05T03:58:41Z"}],"graph_snapshots":[{"event_id":"sha256:9786fbc194c624e8df77a43b6ec5dfc1c3c0336861486b0d0aecad7c2e3cbee9","target":"graph","created_at":"2026-07-05T03:58:41Z","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/2202.10390/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most work on query optimization has concentrated on loop-free queries. However, data science and machine learning workloads today typically involve recursive or iterative computation. In this work, we propose a novel framework for optimizing recursive queries using methods from program synthesis. In particular, we introduce a simple yet powerful optimization rule called the \"FGH-rule\" which aims to find a faster way to evaluate a recursive program. The solution is found by making use of powerful tools, such as a program synthesizer, an SMT-solver, and an equality saturation system. We demonstr","authors_text":"Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis, Reinhard Pichler, Yisu Remy Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-21T17:40:10Z","title":"Optimizing Recursive Queries with Program Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10390","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:00d892ee7423ed8f49eb66eb8bb6cbe82d7e9788674c91e4701e5d4aa5459797","target":"record","created_at":"2026-07-05T03:58:41Z","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":"d46e463a63afb3184bfab1324deb7d06d2fcd2f53fd189bda5ded1991649dba0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-02-21T17:40:10Z","title_canon_sha256":"57a88135066c22aef2d51092a37a6902591e09514c46f9bac53a8c4cda0de582"},"schema_version":"1.0","source":{"id":"2202.10390","kind":"arxiv","version":1}},"canonical_sha256":"44e5789eb81985b74b02e042cae89454e0e8e19e7fc388ece4c06ce9b9bd6c41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44e5789eb81985b74b02e042cae89454e0e8e19e7fc388ece4c06ce9b9bd6c41","first_computed_at":"2026-07-05T03:58:41.996171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:58:41.996171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rprY+0Jf+CaNl5hUxV/8/Yj5dP3Egg4/P2hgWsA2mR91URly8JTjLb3FokQqyJwY3TG9GjXlEaqCBHqNCaKxCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:58:41.996582Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.10390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00d892ee7423ed8f49eb66eb8bb6cbe82d7e9788674c91e4701e5d4aa5459797","sha256:9786fbc194c624e8df77a43b6ec5dfc1c3c0336861486b0d0aecad7c2e3cbee9"],"state_sha256":"f6a44cafda4451d15ad51591b9a4249064d3644f8f6f8c194eb1ac7ff80cff8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K0Z9qRpkor6AVondoMqu0qQvoU5hLVnG2QOUl+lOnFpjiYBzD/IM5uAo+GHGUcD1+gQL+1FzeZjtYEc0HFH8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:10:22.682609Z","bundle_sha256":"a25042e05c0f6647f86e5ebf6dff3c82ad37571f6899334d1716d2923b99ad44"}}