{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NR6N5R5ZZVNHOBPFIUTHASU4MC","short_pith_number":"pith:NR6N5R5Z","schema_version":"1.0","canonical_sha256":"6c7cdec7b9cd5a7705e54526704a9c608485003835ffe9dd6f7bb8a3f09a183f","source":{"kind":"arxiv","id":"2306.14077","version":1},"attestation_state":"computed","paper":{"title":"Full Automation of Goal-driven LLM Dialog Threads with And-Or Recursors and Refiner Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Paul Tarau","submitted_at":"2023-06-24T23:33:00Z","abstract_excerpt":"We automate deep step-by step reasoning in an LLM dialog thread by recursively exploring alternatives (OR-nodes) and expanding details (AND-nodes) up to a given depth. Starting from a single succinct task-specific initiator we steer the automated dialog thread to stay focussed on the task by synthesizing a prompt that summarizes the depth-first steps taken so far.\n  Our algorithm is derived from a simple recursive descent implementation of a Horn Clause interpreter, except that we accommodate our logic engine to fit the natural language reasoning patterns LLMs have been trained on. Semantic si"},"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":"2306.14077","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-06-24T23:33:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4db31c90e90ba7cf1c280c19410d3b3319b930648b75ab2476d1df64a682fda8","abstract_canon_sha256":"350809be2951a8355c1eaf240a197f0bed4929e9e610ef0dd1f39f79f8e2597e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:19.476992Z","signature_b64":"/j+hERuiY9w+xl5Wo+83Ns1OearnBcA+uZFjOr0Z9oKLiu31X65CcJwlUkbTJOvaAY4xV8mEhuBgjyx55qILCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c7cdec7b9cd5a7705e54526704a9c608485003835ffe9dd6f7bb8a3f09a183f","last_reissued_at":"2026-07-05T06:24:19.476627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:19.476627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Full Automation of Goal-driven LLM Dialog Threads with And-Or Recursors and Refiner Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Paul Tarau","submitted_at":"2023-06-24T23:33:00Z","abstract_excerpt":"We automate deep step-by step reasoning in an LLM dialog thread by recursively exploring alternatives (OR-nodes) and expanding details (AND-nodes) up to a given depth. Starting from a single succinct task-specific initiator we steer the automated dialog thread to stay focussed on the task by synthesizing a prompt that summarizes the depth-first steps taken so far.\n  Our algorithm is derived from a simple recursive descent implementation of a Horn Clause interpreter, except that we accommodate our logic engine to fit the natural language reasoning patterns LLMs have been trained on. Semantic si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14077","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/2306.14077/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":"2306.14077","created_at":"2026-07-05T06:24:19.476680+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.14077v1","created_at":"2026-07-05T06:24:19.476680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14077","created_at":"2026-07-05T06:24:19.476680+00:00"},{"alias_kind":"pith_short_12","alias_value":"NR6N5R5ZZVNH","created_at":"2026-07-05T06:24:19.476680+00:00"},{"alias_kind":"pith_short_16","alias_value":"NR6N5R5ZZVNHOBPF","created_at":"2026-07-05T06:24:19.476680+00:00"},{"alias_kind":"pith_short_8","alias_value":"NR6N5R5Z","created_at":"2026-07-05T06:24:19.476680+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.04937","citing_title":"Pramana: Fine-Tuning Large Language Models for Epistemic Reasoning through Navya-Nyaya","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC","json":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC.json","graph_json":"https://pith.science/api/pith-number/NR6N5R5ZZVNHOBPFIUTHASU4MC/graph.json","events_json":"https://pith.science/api/pith-number/NR6N5R5ZZVNHOBPFIUTHASU4MC/events.json","paper":"https://pith.science/paper/NR6N5R5Z"},"agent_actions":{"view_html":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC","download_json":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC.json","view_paper":"https://pith.science/paper/NR6N5R5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.14077&json=true","fetch_graph":"https://pith.science/api/pith-number/NR6N5R5ZZVNHOBPFIUTHASU4MC/graph.json","fetch_events":"https://pith.science/api/pith-number/NR6N5R5ZZVNHOBPFIUTHASU4MC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC/action/storage_attestation","attest_author":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC/action/author_attestation","sign_citation":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC/action/citation_signature","submit_replication":"https://pith.science/pith/NR6N5R5ZZVNHOBPFIUTHASU4MC/action/replication_record"}},"created_at":"2026-07-05T06:24:19.476680+00:00","updated_at":"2026-07-05T06:24:19.476680+00:00"}