{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:536FPNXMXFI6RJHQXOB7VHMUQU","short_pith_number":"pith:536FPNXM","schema_version":"1.0","canonical_sha256":"eefc57b6ecb951e8a4f0bb83fa9d9485023a3ce5f2d2de652484952ae6e7e0e5","source":{"kind":"arxiv","id":"2606.00618","version":1},"attestation_state":"computed","paper":{"title":"Efficient Test-time Inference for Generative Planning Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Federico Pecora, Jeremy L. Wyatt, Mihai Samson, Robert Gieselmann","submitted_at":"2026-05-30T08:46:44Z","abstract_excerpt":"Generative models have emerged as a powerful paradigm for AI planning, yet their performance remains constrained by the training data distribution. One approach is to improve generated solutions during inference by scaling test-time compute. A more efficient alternative is to optimize the inference process itself. In this paper, we show that a modified version of a classical Open-Closed List (OCL) search provides just such an efficient inference procedure. Our algorithm synergizes two learned components: a generative model that performs fast rollouts from intermediate states and a heuristic mo"},"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":"2606.00618","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-30T08:46:44Z","cross_cats_sorted":[],"title_canon_sha256":"d3a11ace5072f480b7d315feb59162ff0db7685837a17b0eed22216495332417","abstract_canon_sha256":"b30b2d1c9f0da7872047b23d25bf690f62d41fa9420207a9365fe965afe22c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:59.846124Z","signature_b64":"lNyUxWdnBw4GGIds6xNN8cJGCEVauzHLB7JqR4+Jpsb59DlYdVakGigJ3oDnN9ru3rXEjIolgDPlgLiUmqgGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eefc57b6ecb951e8a4f0bb83fa9d9485023a3ce5f2d2de652484952ae6e7e0e5","last_reissued_at":"2026-06-02T01:03:59.845704Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:59.845704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Test-time Inference for Generative Planning Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Federico Pecora, Jeremy L. Wyatt, Mihai Samson, Robert Gieselmann","submitted_at":"2026-05-30T08:46:44Z","abstract_excerpt":"Generative models have emerged as a powerful paradigm for AI planning, yet their performance remains constrained by the training data distribution. One approach is to improve generated solutions during inference by scaling test-time compute. A more efficient alternative is to optimize the inference process itself. In this paper, we show that a modified version of a classical Open-Closed List (OCL) search provides just such an efficient inference procedure. Our algorithm synergizes two learned components: a generative model that performs fast rollouts from intermediate states and a heuristic mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00618","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/2606.00618/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":"2606.00618","created_at":"2026-06-02T01:03:59.845764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00618v1","created_at":"2026-06-02T01:03:59.845764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00618","created_at":"2026-06-02T01:03:59.845764+00:00"},{"alias_kind":"pith_short_12","alias_value":"536FPNXMXFI6","created_at":"2026-06-02T01:03:59.845764+00:00"},{"alias_kind":"pith_short_16","alias_value":"536FPNXMXFI6RJHQ","created_at":"2026-06-02T01:03:59.845764+00:00"},{"alias_kind":"pith_short_8","alias_value":"536FPNXM","created_at":"2026-06-02T01:03:59.845764+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/536FPNXMXFI6RJHQXOB7VHMUQU","json":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU.json","graph_json":"https://pith.science/api/pith-number/536FPNXMXFI6RJHQXOB7VHMUQU/graph.json","events_json":"https://pith.science/api/pith-number/536FPNXMXFI6RJHQXOB7VHMUQU/events.json","paper":"https://pith.science/paper/536FPNXM"},"agent_actions":{"view_html":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU","download_json":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU.json","view_paper":"https://pith.science/paper/536FPNXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00618&json=true","fetch_graph":"https://pith.science/api/pith-number/536FPNXMXFI6RJHQXOB7VHMUQU/graph.json","fetch_events":"https://pith.science/api/pith-number/536FPNXMXFI6RJHQXOB7VHMUQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU/action/storage_attestation","attest_author":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU/action/author_attestation","sign_citation":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU/action/citation_signature","submit_replication":"https://pith.science/pith/536FPNXMXFI6RJHQXOB7VHMUQU/action/replication_record"}},"created_at":"2026-06-02T01:03:59.845764+00:00","updated_at":"2026-06-02T01:03:59.845764+00:00"}