{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DEWBSPK537VTD6AE3KSJVPPSGA","short_pith_number":"pith:DEWBSPK5","schema_version":"1.0","canonical_sha256":"192c193d5ddfeb31f804daa49abdf23022a8c781647581cbdbcece4a29392734","source":{"kind":"arxiv","id":"2305.17390","version":2},"attestation_state":"computed","paper":{"title":"SwiftSage: A Generative Agent with Fast and Slow Thinking for Complex Interactive Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","cs.RO"],"primary_cat":"cs.CL","authors_text":"Bill Yuchen Lin, Chandra Bhagavatula, Faeze Brahman, Karina Yang, Prithviraj Ammanabrolu, Shiyu Huang, Xiang Ren, Yejin Choi, Yicheng Fu","submitted_at":"2023-05-27T07:04:15Z","abstract_excerpt":"We introduce SwiftSage, a novel agent framework inspired by the dual-process theory of human cognition, designed to excel in action planning for complex interactive reasoning tasks. SwiftSage integrates the strengths of behavior cloning and prompting large language models (LLMs) to enhance task completion performance. The framework comprises two primary modules: the Swift module, representing fast and intuitive thinking, and the Sage module, emulating deliberate thought processes. The Swift module is a small encoder-decoder LM fine-tuned on the oracle agent's action trajectories, while the Sag"},"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.17390","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-27T07:04:15Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA","cs.RO"],"title_canon_sha256":"36d55c1b06ba6fadde954f9cce170613ac3a7c224061e4f1a4efeb66a34c2af3","abstract_canon_sha256":"78c648c04dca4c311702eacca597080799cc3fdb1a5a3d27e9f2d02b60c58978"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:20:51.412759Z","signature_b64":"0ETKsACFBzUT3ccmcxVFqSyR6thfsPgZdUxYrt+ttPCD5tcBdJkVF6vyymzuL8NQ/HQ7JYQ/BWi4GLOcs7O3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"192c193d5ddfeb31f804daa49abdf23022a8c781647581cbdbcece4a29392734","last_reissued_at":"2026-07-05T07:20:51.412331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:20:51.412331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SwiftSage: A Generative Agent with Fast and Slow Thinking for Complex Interactive Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","cs.RO"],"primary_cat":"cs.CL","authors_text":"Bill Yuchen Lin, Chandra Bhagavatula, Faeze Brahman, Karina Yang, Prithviraj Ammanabrolu, Shiyu Huang, Xiang Ren, Yejin Choi, Yicheng Fu","submitted_at":"2023-05-27T07:04:15Z","abstract_excerpt":"We introduce SwiftSage, a novel agent framework inspired by the dual-process theory of human cognition, designed to excel in action planning for complex interactive reasoning tasks. SwiftSage integrates the strengths of behavior cloning and prompting large language models (LLMs) to enhance task completion performance. The framework comprises two primary modules: the Swift module, representing fast and intuitive thinking, and the Sage module, emulating deliberate thought processes. The Swift module is a small encoder-decoder LM fine-tuned on the oracle agent's action trajectories, while the Sag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17390","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.17390/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.17390","created_at":"2026-07-05T07:20:51.412390+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.17390v2","created_at":"2026-07-05T07:20:51.412390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17390","created_at":"2026-07-05T07:20:51.412390+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEWBSPK537VT","created_at":"2026-07-05T07:20:51.412390+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEWBSPK537VTD6AE","created_at":"2026-07-05T07:20:51.412390+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEWBSPK5","created_at":"2026-07-05T07:20:51.412390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.03578","citing_title":"LLM Multi-Agent Systems: Challenges and Open Problems","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2309.02427","citing_title":"Cognitive Architectures for Language Agents","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2402.02716","citing_title":"Understanding the planning of LLM agents: A survey","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11376","citing_title":"LLM-X: A Scalable Negotiation-Oriented Exchange for Communication Among Personal LLM Agents","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2309.07864","citing_title":"The Rise and Potential of Large Language Model Based Agents: A Survey","ref_index":186,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06716","citing_title":"From Storage to Experience: A Survey on the Evolution of LLM Agent Memory Mechanisms","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA","json":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA.json","graph_json":"https://pith.science/api/pith-number/DEWBSPK537VTD6AE3KSJVPPSGA/graph.json","events_json":"https://pith.science/api/pith-number/DEWBSPK537VTD6AE3KSJVPPSGA/events.json","paper":"https://pith.science/paper/DEWBSPK5"},"agent_actions":{"view_html":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA","download_json":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA.json","view_paper":"https://pith.science/paper/DEWBSPK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.17390&json=true","fetch_graph":"https://pith.science/api/pith-number/DEWBSPK537VTD6AE3KSJVPPSGA/graph.json","fetch_events":"https://pith.science/api/pith-number/DEWBSPK537VTD6AE3KSJVPPSGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA/action/storage_attestation","attest_author":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA/action/author_attestation","sign_citation":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA/action/citation_signature","submit_replication":"https://pith.science/pith/DEWBSPK537VTD6AE3KSJVPPSGA/action/replication_record"}},"created_at":"2026-07-05T07:20:51.412390+00:00","updated_at":"2026-07-05T07:20:51.412390+00:00"}