{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZGD4XOE7JXBXKKB3HZ65GZ76HT","short_pith_number":"pith:ZGD4XOE7","canonical_record":{"source":{"id":"2605.13456","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T12:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"ee67eeb12014e7798d56356b3f7e0621a205025f5442f9d0a56ce429201ccae4","abstract_canon_sha256":"a08bd09589793e59e7b014b6aefa79868d5fa71ee0023384c9d482a6a59e08a1"},"schema_version":"1.0"},"canonical_sha256":"c987cbb89f4dc375283b3e7dd367fe3cc1c0ff64bc0c1fdf3f572d57b0fe9d77","source":{"kind":"arxiv","id":"2605.13456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13456","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13456v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13456","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZGD4XOE7JXBX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZGD4XOE7JXBXKKB3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZGD4XOE7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZGD4XOE7JXBXKKB3HZ65GZ76HT","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13456","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T12:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"ee67eeb12014e7798d56356b3f7e0621a205025f5442f9d0a56ce429201ccae4","abstract_canon_sha256":"a08bd09589793e59e7b014b6aefa79868d5fa71ee0023384c9d482a6a59e08a1"},"schema_version":"1.0"},"canonical_sha256":"c987cbb89f4dc375283b3e7dd367fe3cc1c0ff64bc0c1fdf3f572d57b0fe9d77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:41.802391Z","signature_b64":"FDeytMvw+jL7TPbfs2pZ6YckxdQDWF6Pny8x0S1eRxnompmqr2eP0ar7qBYjeQLM8gKVJJIfOrHRueo/1zyIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c987cbb89f4dc375283b3e7dd367fe3cc1c0ff64bc0c1fdf3f572d57b0fe9d77","last_reissued_at":"2026-05-18T02:44:41.801967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:41.801967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13456","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-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pjm9Pa2pekgIBfljsk1u/lrc2OW9LatYNz7WAwmjBVkjfO0KFCQjbgDANFlFEOAEl0XnlyjlqxnB5FFsPUbqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:21:29.021932Z"},"content_sha256":"691bde82a1f3f2462c84640a3d76edd255713e99cc512fdc660d0c99956d7b0a","schema_version":"1.0","event_id":"sha256:691bde82a1f3f2462c84640a3d76edd255713e99cc512fdc660d0c99956d7b0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZGD4XOE7JXBXKKB3HZ65GZ76HT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Liquid Tree Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Liquid Tree Automata merge semantically similar states using subtyping from refinement types to speed up component-based synthesis.","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ashish Mishra, Suresh Jagannathan","submitted_at":"2026-05-13T12:49:32Z","abstract_excerpt":"Component-based synthesis (CBS) generates loop-free programs from library components to satisfy logical queries. While expressive specifications and precise queries simplify the solution space, they make finding feasible execution paths significantly more difficult for traditional CBS procedures. As constraints become more exact, the search must navigate an increasingly sparse space of valid paths. We address this challenge by reasoning about \\emph{logical similarities} between exploration paths. We consider library methods equipped with refinement-type specifications, which enrich base types "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"LTAs leverage subtyping constraints to identify and eagerly merge semantically similar states during search. This merging avoids redundant exploration of equivalent paths, significantly improving synthesis efficiency.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That subtyping constraints derived from refinement types accurately capture semantic equivalence of exploration paths without either missing valid solutions or incorrectly merging distinct paths.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Liquid Tree Automata merge similar states during synthesis search via refinement subtyping to avoid redundant exploration and handle complex queries more efficiently.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Liquid Tree Automata merge semantically similar states using subtyping from refinement types to speed up component-based synthesis.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"518e695806dd5189c5825d870354c8bc976de6e0b0e29a0220fcea9d688249e7"},"source":{"id":"2605.13456","kind":"arxiv","version":1},"verdict":{"id":"1e171742-9956-4a3b-8f9f-68d223c30ca4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:26:33.226018Z","strongest_claim":"LTAs leverage subtyping constraints to identify and eagerly merge semantically similar states during search. This merging avoids redundant exploration of equivalent paths, significantly improving synthesis efficiency.","one_line_summary":"Liquid Tree Automata merge similar states during synthesis search via refinement subtyping to avoid redundant exploration and handle complex queries more efficiently.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That subtyping constraints derived from refinement types accurately capture semantic equivalence of exploration paths without either missing valid solutions or incorrectly merging distinct paths.","pith_extraction_headline":"Liquid Tree Automata merge semantically similar states using subtyping from refinement types to speed up component-based synthesis."},"references":{"count":38,"sample":[{"doi":"","year":2013,"title":"Recursive Program Syn- thesis","work_id":"f941f09e-93d7-499d-bab2-073bbb032790","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Olausson, Lionel Wong, Gabriel Grand, Joshua B","work_id":"c3cbe06e-b5f8-4864-b059-2bd4e43fabdb","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Babble: Learning Better Abstractions with E-Graphs and Anti- Unification","work_id":"e0f5a04e-eda7-42eb-a1ce-459fd8f9c2a4","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"VOCAL – A Verified OCaml Library","work_id":"55769266-00d5-4251-b3f5-45d040cd6066","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"Tree Automata Techniques and Applications","work_id":"d645f24b-64ff-4294-b863-f3a7f770a786","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"5ab89e61bc46db1fbc6fb249f39a6bfc8d985ebdda4827cc8752d0d84b27418b","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":"1e171742-9956-4a3b-8f9f-68d223c30ca4"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2qGutIL848H1koHLKyV7WPwEaMra7u203a5TM8oV3vwnLbDBnodfVTn3D3Yv0dvHcLH3mksCzHnNl5YPGW/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:21:29.023027Z"},"content_sha256":"bad62b7bce75c2a4637f92a2f639a8ab84c2b57df8003c65f4c70b2a1f49123f","schema_version":"1.0","event_id":"sha256:bad62b7bce75c2a4637f92a2f639a8ab84c2b57df8003c65f4c70b2a1f49123f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGD4XOE7JXBXKKB3HZ65GZ76HT/bundle.json","state_url":"https://pith.science/pith/ZGD4XOE7JXBXKKB3HZ65GZ76HT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGD4XOE7JXBXKKB3HZ65GZ76HT/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-05-21T22:21:29Z","links":{"resolver":"https://pith.science/pith/ZGD4XOE7JXBXKKB3HZ65GZ76HT","bundle":"https://pith.science/pith/ZGD4XOE7JXBXKKB3HZ65GZ76HT/bundle.json","state":"https://pith.science/pith/ZGD4XOE7JXBXKKB3HZ65GZ76HT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGD4XOE7JXBXKKB3HZ65GZ76HT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZGD4XOE7JXBXKKB3HZ65GZ76HT","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":"a08bd09589793e59e7b014b6aefa79868d5fa71ee0023384c9d482a6a59e08a1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T12:49:32Z","title_canon_sha256":"ee67eeb12014e7798d56356b3f7e0621a205025f5442f9d0a56ce429201ccae4"},"schema_version":"1.0","source":{"id":"2605.13456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13456","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13456v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13456","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZGD4XOE7JXBX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZGD4XOE7JXBXKKB3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZGD4XOE7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bad62b7bce75c2a4637f92a2f639a8ab84c2b57df8003c65f4c70b2a1f49123f","target":"graph","created_at":"2026-05-18T02:44: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"LTAs leverage subtyping constraints to identify and eagerly merge semantically similar states during search. This merging avoids redundant exploration of equivalent paths, significantly improving synthesis efficiency."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That subtyping constraints derived from refinement types accurately capture semantic equivalence of exploration paths without either missing valid solutions or incorrectly merging distinct paths."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Liquid Tree Automata merge similar states during synthesis search via refinement subtyping to avoid redundant exploration and handle complex queries more efficiently."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Liquid Tree Automata merge semantically similar states using subtyping from refinement types to speed up component-based synthesis."}],"snapshot_sha256":"518e695806dd5189c5825d870354c8bc976de6e0b0e29a0220fcea9d688249e7"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Component-based synthesis (CBS) generates loop-free programs from library components to satisfy logical queries. While expressive specifications and precise queries simplify the solution space, they make finding feasible execution paths significantly more difficult for traditional CBS procedures. As constraints become more exact, the search must navigate an increasingly sparse space of valid paths. We address this challenge by reasoning about \\emph{logical similarities} between exploration paths. We consider library methods equipped with refinement-type specifications, which enrich base types ","authors_text":"Ashish Mishra, Suresh Jagannathan","cross_cats":[],"headline":"Liquid Tree Automata merge semantically similar states using subtyping from refinement types to speed up component-based synthesis.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T12:49:32Z","title":"Liquid Tree Automata"},"references":{"count":38,"internal_anchors":0,"resolved_work":38,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Recursive Program Syn- thesis","work_id":"f941f09e-93d7-499d-bab2-073bbb032790","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Olausson, Lionel Wong, Gabriel Grand, Joshua B","work_id":"c3cbe06e-b5f8-4864-b059-2bd4e43fabdb","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Babble: Learning Better Abstractions with E-Graphs and Anti- Unification","work_id":"e0f5a04e-eda7-42eb-a1ce-459fd8f9c2a4","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"VOCAL – A Verified OCaml Library","work_id":"55769266-00d5-4251-b3f5-45d040cd6066","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Tree Automata Techniques and Applications","work_id":"d645f24b-64ff-4294-b863-f3a7f770a786","year":1997}],"snapshot_sha256":"5ab89e61bc46db1fbc6fb249f39a6bfc8d985ebdda4827cc8752d0d84b27418b"},"source":{"id":"2605.13456","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:26:33.226018Z","id":"1e171742-9956-4a3b-8f9f-68d223c30ca4","model_set":{"reader":"grok-4.3"},"one_line_summary":"Liquid Tree Automata merge similar states during synthesis search via refinement subtyping to avoid redundant exploration and handle complex queries more efficiently.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Liquid Tree Automata merge semantically similar states using subtyping from refinement types to speed up component-based synthesis.","strongest_claim":"LTAs leverage subtyping constraints to identify and eagerly merge semantically similar states during search. This merging avoids redundant exploration of equivalent paths, significantly improving synthesis efficiency.","weakest_assumption":"That subtyping constraints derived from refinement types accurately capture semantic equivalence of exploration paths without either missing valid solutions or incorrectly merging distinct paths."}},"verdict_id":"1e171742-9956-4a3b-8f9f-68d223c30ca4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:691bde82a1f3f2462c84640a3d76edd255713e99cc512fdc660d0c99956d7b0a","target":"record","created_at":"2026-05-18T02:44: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":"a08bd09589793e59e7b014b6aefa79868d5fa71ee0023384c9d482a6a59e08a1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T12:49:32Z","title_canon_sha256":"ee67eeb12014e7798d56356b3f7e0621a205025f5442f9d0a56ce429201ccae4"},"schema_version":"1.0","source":{"id":"2605.13456","kind":"arxiv","version":1}},"canonical_sha256":"c987cbb89f4dc375283b3e7dd367fe3cc1c0ff64bc0c1fdf3f572d57b0fe9d77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c987cbb89f4dc375283b3e7dd367fe3cc1c0ff64bc0c1fdf3f572d57b0fe9d77","first_computed_at":"2026-05-18T02:44:41.801967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:41.801967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FDeytMvw+jL7TPbfs2pZ6YckxdQDWF6Pny8x0S1eRxnompmqr2eP0ar7qBYjeQLM8gKVJJIfOrHRueo/1zyIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:41.802391Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:691bde82a1f3f2462c84640a3d76edd255713e99cc512fdc660d0c99956d7b0a","sha256:bad62b7bce75c2a4637f92a2f639a8ab84c2b57df8003c65f4c70b2a1f49123f"],"state_sha256":"ba0f59d4ca8172bf7aa2e096b218d0d85c462c2b4c56ecffdbd47bc94ad655f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"174fJ4QnZT31iHTf3TZWU88QbIAN81WM21Z+8uATOpB8EtOmtS1TGBGBUNl268E8PDesmN36euiD7sEJPseqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T22:21:29.027496Z","bundle_sha256":"ff356934b011690ae4994cd2d5fc111553d664246eddac089ef16e1254abc849"}}