{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2E3D3GJWBSDWRF53YLXSPNVSOF","short_pith_number":"pith:2E3D3GJW","schema_version":"1.0","canonical_sha256":"d1363d99360c876897bbc2ef27b6b271725283dc82995769aec6cd51ea0ff51b","source":{"kind":"arxiv","id":"2301.12868","version":3},"attestation_state":"computed","paper":{"title":"On Robustness of Prompt-based Semantic Parsing with Large Pre-trained Language Model: An Empirical Study on Codex","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fatemeh Shiri, Gholamreza Haffari, Terry Yue Zhuo, Weiqing Wang, Yuan-Fang Li, Yujin Huang, Zhuang Li","submitted_at":"2023-01-30T13:21:00Z","abstract_excerpt":"Semantic parsing is a technique aimed at constructing a structured representation of the meaning of a natural-language question. Recent advancements in few-shot language models trained on code have demonstrated superior performance in generating these representations compared to traditional unimodal language models, which are trained on downstream tasks. Despite these advancements, existing fine-tuned neural semantic parsers are susceptible to adversarial attacks on natural-language inputs. While it has been established that the robustness of smaller semantic parsers can be enhanced through ad"},"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":"2301.12868","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-30T13:21:00Z","cross_cats_sorted":[],"title_canon_sha256":"de6ac92fb3695a2f08392bf327df5644351a667e5b33a2ace58230c7b949ba07","abstract_canon_sha256":"346bf8281b89f4290dd9c9d188c46a0a945bdd0d564f5170aa0f06311ba29489"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:32.669028Z","signature_b64":"xWtK8j5yv9+jkY3TV5iLiLG+sRCfsAQddDNSFmiwr8+/P5HtwqmT7pvVnJk3sxg4dyXkpnsvHwLPlRzN3ay9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1363d99360c876897bbc2ef27b6b271725283dc82995769aec6cd51ea0ff51b","last_reissued_at":"2026-07-05T05:49:32.668661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:32.668661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Robustness of Prompt-based Semantic Parsing with Large Pre-trained Language Model: An Empirical Study on Codex","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fatemeh Shiri, Gholamreza Haffari, Terry Yue Zhuo, Weiqing Wang, Yuan-Fang Li, Yujin Huang, Zhuang Li","submitted_at":"2023-01-30T13:21:00Z","abstract_excerpt":"Semantic parsing is a technique aimed at constructing a structured representation of the meaning of a natural-language question. Recent advancements in few-shot language models trained on code have demonstrated superior performance in generating these representations compared to traditional unimodal language models, which are trained on downstream tasks. Despite these advancements, existing fine-tuned neural semantic parsers are susceptible to adversarial attacks on natural-language inputs. While it has been established that the robustness of smaller semantic parsers can be enhanced through ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12868","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/2301.12868/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":"2301.12868","created_at":"2026-07-05T05:49:32.668717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.12868v3","created_at":"2026-07-05T05:49:32.668717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12868","created_at":"2026-07-05T05:49:32.668717+00:00"},{"alias_kind":"pith_short_12","alias_value":"2E3D3GJWBSDW","created_at":"2026-07-05T05:49:32.668717+00:00"},{"alias_kind":"pith_short_16","alias_value":"2E3D3GJWBSDWRF53","created_at":"2026-07-05T05:49:32.668717+00:00"},{"alias_kind":"pith_short_8","alias_value":"2E3D3GJW","created_at":"2026-07-05T05:49:32.668717+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2308.11432","citing_title":"A Survey on Large Language Model based Autonomous Agents","ref_index":183,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14415","citing_title":"SWE-Chain: Benchmarking Coding Agents on Chained Release-Level Package Upgrades","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07307","citing_title":"Rethinking Dense Sequential Chains: Reasoning Language Models Can Extract Answers from Sparse, Order-Shuffling Chain-of-Thoughts","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF","json":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF.json","graph_json":"https://pith.science/api/pith-number/2E3D3GJWBSDWRF53YLXSPNVSOF/graph.json","events_json":"https://pith.science/api/pith-number/2E3D3GJWBSDWRF53YLXSPNVSOF/events.json","paper":"https://pith.science/paper/2E3D3GJW"},"agent_actions":{"view_html":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF","download_json":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF.json","view_paper":"https://pith.science/paper/2E3D3GJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.12868&json=true","fetch_graph":"https://pith.science/api/pith-number/2E3D3GJWBSDWRF53YLXSPNVSOF/graph.json","fetch_events":"https://pith.science/api/pith-number/2E3D3GJWBSDWRF53YLXSPNVSOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF/action/storage_attestation","attest_author":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF/action/author_attestation","sign_citation":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF/action/citation_signature","submit_replication":"https://pith.science/pith/2E3D3GJWBSDWRF53YLXSPNVSOF/action/replication_record"}},"created_at":"2026-07-05T05:49:32.668717+00:00","updated_at":"2026-07-05T05:49:32.668717+00:00"}