{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VEZLXQ6VUTBWQGHFUKLLLNYHXP","short_pith_number":"pith:VEZLXQ6V","schema_version":"1.0","canonical_sha256":"a932bbc3d5a4c36818e5a296b5b707bbc7814a8521d0b1caa989b03a787f91a7","source":{"kind":"arxiv","id":"2305.14257","version":3},"attestation_state":"computed","paper":{"title":"Hierarchical Prompting Assists Large Language Model on Web Navigation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Abishek Sridhar, Frank F. Xu, Hao Zhu, Robert Lo, Shuyan Zhou","submitted_at":"2023-05-23T17:10:39Z","abstract_excerpt":"Large language models (LLMs) struggle on processing complicated observations in interactive decision making tasks. To alleviate this issue, we propose a simple hierarchical prompting approach. Diverging from previous prompting approaches that always put the full observation (e.g. a web page) to the prompt, we propose to first construct an action-aware observation which is more condensed and relevant with a dedicated SUMMARIZER prompt. The ACTOR prompt then predicts the next action based on the summarized observation. While our method has broad applicability, we particularly demonstrate its eff"},"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.14257","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-23T17:10:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1742c8d7d9f2c11a69ae65514e0f304740e38a9fa8bfc3a6fc76721631a29e54","abstract_canon_sha256":"4841a3a9a7b48c9e0f97e3032f07e1f57010ccd536dfdd2efe5025a8d53bde2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:27.595411Z","signature_b64":"rqIYZaVtQbybJ/X2/p+wis31q1ScxqPCaW+h9Rua3CeDp/3UL8CTqWxwsp4J6RQLMVMs80beJx1/6VMThqI1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a932bbc3d5a4c36818e5a296b5b707bbc7814a8521d0b1caa989b03a787f91a7","last_reissued_at":"2026-07-05T07:06:27.594919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:27.594919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Prompting Assists Large Language Model on Web Navigation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Abishek Sridhar, Frank F. Xu, Hao Zhu, Robert Lo, Shuyan Zhou","submitted_at":"2023-05-23T17:10:39Z","abstract_excerpt":"Large language models (LLMs) struggle on processing complicated observations in interactive decision making tasks. To alleviate this issue, we propose a simple hierarchical prompting approach. Diverging from previous prompting approaches that always put the full observation (e.g. a web page) to the prompt, we propose to first construct an action-aware observation which is more condensed and relevant with a dedicated SUMMARIZER prompt. The ACTOR prompt then predicts the next action based on the summarized observation. While our method has broad applicability, we particularly demonstrate its eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14257","kind":"arxiv","version":3},"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.14257/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.14257","created_at":"2026-07-05T07:06:27.594975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.14257v3","created_at":"2026-07-05T07:06:27.594975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14257","created_at":"2026-07-05T07:06:27.594975+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEZLXQ6VUTBW","created_at":"2026-07-05T07:06:27.594975+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEZLXQ6VUTBWQGHF","created_at":"2026-07-05T07:06:27.594975+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEZLXQ6V","created_at":"2026-07-05T07:06:27.594975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.09572","citing_title":"Plan-and-Act: Improving Planning of Agents for Long-Horizon Tasks","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2401.01614","citing_title":"GPT-4V(ision) is a Generalist Web Agent, if Grounded","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2511.20857","citing_title":"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory","ref_index":207,"is_internal_anchor":false},{"citing_arxiv_id":"2404.07972","citing_title":"OSWorld: Benchmarking Multimodal Agents for Open-Ended Tasks in Real Computer Environments","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP","json":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP.json","graph_json":"https://pith.science/api/pith-number/VEZLXQ6VUTBWQGHFUKLLLNYHXP/graph.json","events_json":"https://pith.science/api/pith-number/VEZLXQ6VUTBWQGHFUKLLLNYHXP/events.json","paper":"https://pith.science/paper/VEZLXQ6V"},"agent_actions":{"view_html":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP","download_json":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP.json","view_paper":"https://pith.science/paper/VEZLXQ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.14257&json=true","fetch_graph":"https://pith.science/api/pith-number/VEZLXQ6VUTBWQGHFUKLLLNYHXP/graph.json","fetch_events":"https://pith.science/api/pith-number/VEZLXQ6VUTBWQGHFUKLLLNYHXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP/action/storage_attestation","attest_author":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP/action/author_attestation","sign_citation":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP/action/citation_signature","submit_replication":"https://pith.science/pith/VEZLXQ6VUTBWQGHFUKLLLNYHXP/action/replication_record"}},"created_at":"2026-07-05T07:06:27.594975+00:00","updated_at":"2026-07-05T07:06:27.594975+00:00"}