{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AJM4KNW5VTRJXO6O2AFB2K2NTX","short_pith_number":"pith:AJM4KNW5","schema_version":"1.0","canonical_sha256":"0259c536ddace29bbbced00a1d2b4d9dd0c9174330421ea9e67cbcd88e007fe3","source":{"kind":"arxiv","id":"2605.19197","version":1},"attestation_state":"computed","paper":{"title":"Feasible Plan Generation with Ambiguity-Boundedness in Cross-Model Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amarnath Gupta, Subhasis Dasgupta","submitted_at":"2026-05-18T23:56:14Z","abstract_excerpt":"Natural language (NL) interfaces to databases broaden access to heterogeneous data but often yield many ambiguous intermediate logical plans (ILPs) due to uncertain operator scope and predicate semantics. Many candidates are infeasible because of type mismatches, missing bindings, or engine-specific constraints. We address this challenge with \\emph{feasibility constraints} for detecting local inconsistencies and introduce the Packed Plan Forest (PPF) a polynomially bounded structure that compactly encodes all feasible ILPs while pruning infeasible ones early. Extending packed parse forest idea"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.19197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-18T23:56:14Z","cross_cats_sorted":[],"title_canon_sha256":"5f484cac186bb7af79761c6ca7fe2b05b40d60f06d2e5f1d2b0833463cc4481b","abstract_canon_sha256":"5f2972da641c0cf7ee3fbdf3b4a14aecd7651e9cc2bda8537d7483e3e4a14347"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:33.076606Z","signature_b64":"CJpnWOpi27443+nNNsd6xHEkE+Rb/Hlu09VByba5NbYb+cAd6GTd1x4Kr9zO9xVQdwKP9U12JPveqhFpUtS6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0259c536ddace29bbbced00a1d2b4d9dd0c9174330421ea9e67cbcd88e007fe3","last_reissued_at":"2026-05-20T01:05:33.075809Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:33.075809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feasible Plan Generation with Ambiguity-Boundedness in Cross-Model Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amarnath Gupta, Subhasis Dasgupta","submitted_at":"2026-05-18T23:56:14Z","abstract_excerpt":"Natural language (NL) interfaces to databases broaden access to heterogeneous data but often yield many ambiguous intermediate logical plans (ILPs) due to uncertain operator scope and predicate semantics. Many candidates are infeasible because of type mismatches, missing bindings, or engine-specific constraints. We address this challenge with \\emph{feasibility constraints} for detecting local inconsistencies and introduce the Packed Plan Forest (PPF) a polynomially bounded structure that compactly encodes all feasible ILPs while pruning infeasible ones early. Extending packed parse forest idea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19197","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/2605.19197/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.19197","created_at":"2026-05-20T01:05:33.075951+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19197v1","created_at":"2026-05-20T01:05:33.075951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19197","created_at":"2026-05-20T01:05:33.075951+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJM4KNW5VTRJ","created_at":"2026-05-20T01:05:33.075951+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJM4KNW5VTRJXO6O","created_at":"2026-05-20T01:05:33.075951+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJM4KNW5","created_at":"2026-05-20T01:05:33.075951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX","json":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX.json","graph_json":"https://pith.science/api/pith-number/AJM4KNW5VTRJXO6O2AFB2K2NTX/graph.json","events_json":"https://pith.science/api/pith-number/AJM4KNW5VTRJXO6O2AFB2K2NTX/events.json","paper":"https://pith.science/paper/AJM4KNW5"},"agent_actions":{"view_html":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX","download_json":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX.json","view_paper":"https://pith.science/paper/AJM4KNW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19197&json=true","fetch_graph":"https://pith.science/api/pith-number/AJM4KNW5VTRJXO6O2AFB2K2NTX/graph.json","fetch_events":"https://pith.science/api/pith-number/AJM4KNW5VTRJXO6O2AFB2K2NTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX/action/storage_attestation","attest_author":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX/action/author_attestation","sign_citation":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX/action/citation_signature","submit_replication":"https://pith.science/pith/AJM4KNW5VTRJXO6O2AFB2K2NTX/action/replication_record"}},"created_at":"2026-05-20T01:05:33.075951+00:00","updated_at":"2026-05-20T01:05:33.075951+00:00"}