{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_965366c45b3326da771cc19e5c493623ab0ce69d7f59d61eed77ec3558f0894e","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_965366c45b3326da771cc19e5c493623ab0ce69d7f59d61eed77ec3558f0894e","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"170eac660ebd94542f724ee2c4ae953dac96916e6369420684c371de7ea87e4d","published":"Mon, 11 May 2026 00:00:00 -0400","receipt_hash":"170eac660ebd94542f724ee2c4ae953dac96916e6369420684c371de7ea87e4d","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"170eac660ebd94542f724ee2c4ae953dac96916e6369420684c371de7ea87e4d","observed_at":"2026-05-11T04:43:50.688999Z","parent_run_hash":"8244cc3d66edb4604be5ded19e92c0b47893b228a258432a9c53a5796a870982","published":"Mon, 11 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2605.07707v1 Announce Type: new \nAbstract: HTN planning is a variation of classical planning where, instead of searching for a linear sequence of actions, an algorithm decomposes higher-level tasks using a method library until only executable actions remain. On one hand, this allows one to introduce domain knowledge that can speed up the search for a solution through the method library. On the other hand, it creates challenges that go beyond those of classical state-space search. While recent research produced a number of heuristics and novel algorithms that speed up HTN planning, these heuristics are not yet as informative as those available in classical planning algorithms. We investigate whether large language models (LLMs) can generate effective search heuristics for HTN planning, extending the methodology of Corr\\^ea, Pereira, and Seipp (2025) from classical to hierarchical planning. Using the Pytrich planner on six standard total-order HTN benchmark domains, we evaluate heu","title":"Hierarchical Task Network Planning with LLM-Generated Heuristics","url":"https://arxiv.org/abs/2605.07707","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.07707v1 Announce Type: new \nAbstract: HTN planning is a variation of classical planning where, instead of searching for a linear sequence of actions, an algorithm decomposes higher-level tasks using a method library until only executable actions remain. On one hand, this allows one to introduce domain knowledge that can speed up the search for a solution through the method library. On the other hand, it creates challenges that go beyond those of classical state-space search. While recent research produced a number of heuristics and novel algorithms that speed up HTN planning, these heuristics are not yet as informative as those available in classical planning algorithms. We investigate whether large language models (LLMs) can generate effective search heuristics for HTN planning, extending the methodology of Corr\\^ea, Pereira, and Seipp (2025) from classical to hierarchical planning. Using the Pytrich planner on six standard total-order HTN benchmark domains, we evaluate heu","title":"Hierarchical Task Network Planning with LLM-Generated Heuristics","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-11T04:43:50Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.07707"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:327f8e2d10fab65b794e72d5c3001faf48d98a7c08bfe812b465ad6b81405e67d78f3942b5bca27a82defe6f481f9defe6e2c1f8bc7dd21422564675b3014009","signer":"crovia.substrate","subject":{"observed_at":"2026-05-11T04:43:50Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.07707"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"c8bfa8af24fd38f6ecbc689b5103ceea83f6820b0d5ec3d778e4fb9782000e2b","leaf_index":126328,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"e0b46d2b32dc9d425fbbe8a8aae9a7285e7c306a9cf661aac59d21d9cec36a09","side":"right"},{"sibling":"ecb8fe101773d81e7ce8200a63952f8d54ae0e1918b27e4066124cb8b726b0b1","side":"right"},{"sibling":"ed94dc8a67115f7033d89ad822154d472106e208f99147c953612066381b95cb","side":"right"},{"sibling":"bfaef19d1f09d187f2ae7539e93d3a765d7add6700b4690fdbe1839d9db5bd5a","side":"left"},{"sibling":"df22f2bab10ef9e5eea1b0add96216dca921e670c4d65cc8356ebd8fa0b91418","side":"left"},{"sibling":"9a0f1732ae695b3983075ff21363cfb9692cc59162a9faa7ebeab31276b748cf","side":"left"},{"sibling":"04569d59306be014888bbb09868ab1d810d758344e57c06e8192441d524059d1","side":"left"},{"sibling":"fd62d742789ec2a4ad0baaf30412885f0f707ff8c8186d2dd2d66fddc87a651a","side":"right"},{"sibling":"d2135da61742c6387f57e5dbeb0f84ba6602653b50838e32a22e26e69c963d0c","side":"left"},{"sibling":"fe7cf0b54f5bf9492865fdc338944ef352cdca1a4f9f377e2991ace599a3bb58","side":"right"},{"sibling":"1a581be91236d1f25e8d47fe5efa0e2b51b7f0f6d706ef76a9093067688e5d56","side":"left"},{"sibling":"878cc30108509c9fa1fc52705a216f519d73b647916fcbdfc30a389934d3364b","side":"left"},{"sibling":"ae7dfff36ba07d9f48c36c28a341482ef244ee13cd0efd49aee2bbef2fd65f87","side":"right"},{"sibling":"62ac6554017807bd83187f5a3e5f4f72d6c482616429c2780e9fff1f4845fa04","side":"left"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_965366c45b3326da771cc19e5c493623ab0ce69d7f59d61eed77ec3558f0894e"}}