{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PSELAT7UZ47O3HCKEO6K4FY7QS","short_pith_number":"pith:PSELAT7U","schema_version":"1.0","canonical_sha256":"7c88b04ff4cf3eed9c4a23bcae171f84b88138bbeff7d03c6161ff210ea08a44","source":{"kind":"arxiv","id":"2305.08677","version":2},"attestation_state":"computed","paper":{"title":"Natural Language Decomposition and Interpretation of Complex Utterances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ben Van Durme, Eran Levy, Hao Fang, Harsh Jhamtani, Jacob Andreas, Patrick Xia","submitted_at":"2023-05-15T14:35:00Z","abstract_excerpt":"Designing natural language interfaces has historically required collecting supervised data to translate user requests into carefully designed intent representations. This requires enumerating and labeling a long tail of user requests, which is challenging. At the same time, large language models (LLMs) encode knowledge about goals and plans that can help conversational assistants interpret user requests requiring numerous steps to complete. We introduce an approach to handle complex-intent-bearing utterances from a user via a process of hierarchical natural language decomposition and interpret"},"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":"2305.08677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-15T14:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"52a220e42f5cfb0b9a84dcabd623ac133a11541bd245f8bf963f0538b486719f","abstract_canon_sha256":"7dbc97a75a33e528baf6413c6aacac533a30c7d99a66ad778d75e02bd9657a25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:49.031215Z","signature_b64":"dhO0/sT/MJRd1dK9PrzCQ5g74UPIRBRMxMqnI4UQaPTg8ceW/F8HhlktIr87/OhhIJSIgdhBmfvEPq5HlmztCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c88b04ff4cf3eed9c4a23bcae171f84b88138bbeff7d03c6161ff210ea08a44","last_reissued_at":"2026-07-05T07:30:49.030797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:49.030797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Natural Language Decomposition and Interpretation of Complex Utterances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ben Van Durme, Eran Levy, Hao Fang, Harsh Jhamtani, Jacob Andreas, Patrick Xia","submitted_at":"2023-05-15T14:35:00Z","abstract_excerpt":"Designing natural language interfaces has historically required collecting supervised data to translate user requests into carefully designed intent representations. This requires enumerating and labeling a long tail of user requests, which is challenging. At the same time, large language models (LLMs) encode knowledge about goals and plans that can help conversational assistants interpret user requests requiring numerous steps to complete. We introduce an approach to handle complex-intent-bearing utterances from a user via a process of hierarchical natural language decomposition and interpret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08677","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/2305.08677/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":"2305.08677","created_at":"2026-07-05T07:30:49.030860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.08677v2","created_at":"2026-07-05T07:30:49.030860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08677","created_at":"2026-07-05T07:30:49.030860+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSELAT7UZ47O","created_at":"2026-07-05T07:30:49.030860+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSELAT7UZ47O3HCK","created_at":"2026-07-05T07:30:49.030860+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSELAT7U","created_at":"2026-07-05T07:30:49.030860+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18539","citing_title":"Can we Retrieve Everything All at Once? ARM: An Alignment-Oriented LLM-based Retrieval Method","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS","json":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS.json","graph_json":"https://pith.science/api/pith-number/PSELAT7UZ47O3HCKEO6K4FY7QS/graph.json","events_json":"https://pith.science/api/pith-number/PSELAT7UZ47O3HCKEO6K4FY7QS/events.json","paper":"https://pith.science/paper/PSELAT7U"},"agent_actions":{"view_html":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS","download_json":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS.json","view_paper":"https://pith.science/paper/PSELAT7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.08677&json=true","fetch_graph":"https://pith.science/api/pith-number/PSELAT7UZ47O3HCKEO6K4FY7QS/graph.json","fetch_events":"https://pith.science/api/pith-number/PSELAT7UZ47O3HCKEO6K4FY7QS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS/action/storage_attestation","attest_author":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS/action/author_attestation","sign_citation":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS/action/citation_signature","submit_replication":"https://pith.science/pith/PSELAT7UZ47O3HCKEO6K4FY7QS/action/replication_record"}},"created_at":"2026-07-05T07:30:49.030860+00:00","updated_at":"2026-07-05T07:30:49.030860+00:00"}