{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZQBCDUSFNXT4LPEMK7IHLGFU7Y","short_pith_number":"pith:ZQBCDUSF","schema_version":"1.0","canonical_sha256":"cc0221d2456de7c5bc8c57d07598b4fe27c34b30ebb48a9d2f1a8f4290bd4641","source":{"kind":"arxiv","id":"2406.10196","version":1},"attestation_state":"computed","paper":{"title":"TRIP-PAL: Travel Planning with Guarantees by Combining Large Language Models and Automated Planners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alberto Pozanco, Daniel Borrajo, Sriram Gopalakrishnan, Tomas De la Rosa, Zhen Zeng","submitted_at":"2024-06-14T17:31:16Z","abstract_excerpt":"Travel planning is a complex task that involves generating a sequence of actions related to visiting places subject to constraints and maximizing some user satisfaction criteria. Traditional approaches rely on problem formulation in a given formal language, extracting relevant travel information from web sources, and use an adequate problem solver to generate a valid solution. As an alternative, recent Large Language Model (LLM) based approaches directly output plans from user requests using language. Although LLMs possess extensive travel domain knowledge and provide high-level information li"},"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":"2406.10196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-06-14T17:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"1c3cccbaaed31cd2903251e24c1d4e66ce7ed2a10ec2c254552c27870f4dc7a9","abstract_canon_sha256":"fbd1dd6fceb4882368a638667cc1c701ba293846b5b9ec951fbc147375948b06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:06.613703Z","signature_b64":"FngU+MRMiXRux4nje+/evnE+l1+6CjX1FMFcjUz8YlHee6afi0xWTzZqaPobQHXZjhQhT6gSZ5rxeYtbheRGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc0221d2456de7c5bc8c57d07598b4fe27c34b30ebb48a9d2f1a8f4290bd4641","last_reissued_at":"2026-07-05T08:32:06.613111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:06.613111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TRIP-PAL: Travel Planning with Guarantees by Combining Large Language Models and Automated Planners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alberto Pozanco, Daniel Borrajo, Sriram Gopalakrishnan, Tomas De la Rosa, Zhen Zeng","submitted_at":"2024-06-14T17:31:16Z","abstract_excerpt":"Travel planning is a complex task that involves generating a sequence of actions related to visiting places subject to constraints and maximizing some user satisfaction criteria. Traditional approaches rely on problem formulation in a given formal language, extracting relevant travel information from web sources, and use an adequate problem solver to generate a valid solution. As an alternative, recent Large Language Model (LLM) based approaches directly output plans from user requests using language. Although LLMs possess extensive travel domain knowledge and provide high-level information li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10196","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/2406.10196/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":"2406.10196","created_at":"2026-07-05T08:32:06.613173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.10196v1","created_at":"2026-07-05T08:32:06.613173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10196","created_at":"2026-07-05T08:32:06.613173+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQBCDUSFNXT4","created_at":"2026-07-05T08:32:06.613173+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQBCDUSFNXT4LPEM","created_at":"2026-07-05T08:32:06.613173+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQBCDUSF","created_at":"2026-07-05T08:32:06.613173+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21740","citing_title":"Training the Orchestrator: A Supervised Approach to End-to-End PDDL Planning with LLM Agents","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y","json":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y.json","graph_json":"https://pith.science/api/pith-number/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/graph.json","events_json":"https://pith.science/api/pith-number/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/events.json","paper":"https://pith.science/paper/ZQBCDUSF"},"agent_actions":{"view_html":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y","download_json":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y.json","view_paper":"https://pith.science/paper/ZQBCDUSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.10196&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/action/storage_attestation","attest_author":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/action/author_attestation","sign_citation":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/action/citation_signature","submit_replication":"https://pith.science/pith/ZQBCDUSFNXT4LPEMK7IHLGFU7Y/action/replication_record"}},"created_at":"2026-07-05T08:32:06.613173+00:00","updated_at":"2026-07-05T08:32:06.613173+00:00"}