{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LKT62JP6TJHHAAE7ASDZF67AWQ","short_pith_number":"pith:LKT62JP6","schema_version":"1.0","canonical_sha256":"5aa7ed25fe9a4e70009f048792fbe0b4102beb4abb31a95b082edb252cefc6f9","source":{"kind":"arxiv","id":"2204.04322","version":3},"attestation_state":"computed","paper":{"title":"Iterative Depth-First Search for Fully Observable Non-Deterministic Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andr\\'e G. Pereira, Frederico Messa, Giuseppe De Giacomo, Ramon Fraga Pereira","submitted_at":"2022-04-08T23:10:30Z","abstract_excerpt":"Fully Observable Non-Deterministic (FOND) planning models uncertainty through actions with non-deterministic effects. Existing FOND planning algorithms are effective and employ a wide range of techniques. However, most of the existing algorithms are not robust for dealing with both non-determinism and task size. In this paper, we develop a novel iterative depth-first search algorithm that solves FOND planning tasks and produces strong cyclic policies. Our algorithm is explicitly designed for FOND planning, addressing more directly the non-deterministic aspect of FOND planning, and it also expl"},"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":"2204.04322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-04-08T23:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"639176101550bac43689953dac3ed82c2eace618cb81e5b8c7f548bf561f1f49","abstract_canon_sha256":"f5eee4430fccceb5b926ba38114336560907c7da511ae9d43950847c2f9525b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:34.545281Z","signature_b64":"mAX2gIlREeoifEFww828w7Y8ZxXbZbR7LAsm5Q6qNcxBCOtjJC5wFHSq5d3E5QjygQBk9T8YpW9FZtQfJyUABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa7ed25fe9a4e70009f048792fbe0b4102beb4abb31a95b082edb252cefc6f9","last_reissued_at":"2026-07-05T04:33:34.544877Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:34.544877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Depth-First Search for Fully Observable Non-Deterministic Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andr\\'e G. Pereira, Frederico Messa, Giuseppe De Giacomo, Ramon Fraga Pereira","submitted_at":"2022-04-08T23:10:30Z","abstract_excerpt":"Fully Observable Non-Deterministic (FOND) planning models uncertainty through actions with non-deterministic effects. Existing FOND planning algorithms are effective and employ a wide range of techniques. However, most of the existing algorithms are not robust for dealing with both non-determinism and task size. In this paper, we develop a novel iterative depth-first search algorithm that solves FOND planning tasks and produces strong cyclic policies. Our algorithm is explicitly designed for FOND planning, addressing more directly the non-deterministic aspect of FOND planning, and it also expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04322","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/2204.04322/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":"2204.04322","created_at":"2026-07-05T04:33:34.544933+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.04322v3","created_at":"2026-07-05T04:33:34.544933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04322","created_at":"2026-07-05T04:33:34.544933+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKT62JP6TJHH","created_at":"2026-07-05T04:33:34.544933+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKT62JP6TJHHAAE7","created_at":"2026-07-05T04:33:34.544933+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKT62JP6","created_at":"2026-07-05T04:33:34.544933+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ","json":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ.json","graph_json":"https://pith.science/api/pith-number/LKT62JP6TJHHAAE7ASDZF67AWQ/graph.json","events_json":"https://pith.science/api/pith-number/LKT62JP6TJHHAAE7ASDZF67AWQ/events.json","paper":"https://pith.science/paper/LKT62JP6"},"agent_actions":{"view_html":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ","download_json":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ.json","view_paper":"https://pith.science/paper/LKT62JP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.04322&json=true","fetch_graph":"https://pith.science/api/pith-number/LKT62JP6TJHHAAE7ASDZF67AWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LKT62JP6TJHHAAE7ASDZF67AWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ/action/storage_attestation","attest_author":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ/action/author_attestation","sign_citation":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ/action/citation_signature","submit_replication":"https://pith.science/pith/LKT62JP6TJHHAAE7ASDZF67AWQ/action/replication_record"}},"created_at":"2026-07-05T04:33:34.544933+00:00","updated_at":"2026-07-05T04:33:34.544933+00:00"}