{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Z7AHPVV2Q6OOGH2Y5JVW7FGHJY","short_pith_number":"pith:Z7AHPVV2","canonical_record":{"source":{"id":"2605.07707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T13:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"d116e693dff9a3401c383fca415f9e6dc45acdb902d7ef06a7a40c2750d1c8ba","abstract_canon_sha256":"ea393f469c92498ebe0dc93acab004a9d894c61e4e626189f6424807aafaf3d3"},"schema_version":"1.0"},"canonical_sha256":"cfc077d6ba879ce31f58ea6b6f94c74e3d04de092122e5bb12cea038da64fce0","source":{"kind":"arxiv","id":"2605.07707","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07707","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07707v2","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07707","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"Z7AHPVV2Q6OO","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"Z7AHPVV2Q6OOGH2Y","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"Z7AHPVV2","created_at":"2026-05-29T01:05:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Z7AHPVV2Q6OOGH2Y5JVW7FGHJY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.07707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T13:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"d116e693dff9a3401c383fca415f9e6dc45acdb902d7ef06a7a40c2750d1c8ba","abstract_canon_sha256":"ea393f469c92498ebe0dc93acab004a9d894c61e4e626189f6424807aafaf3d3"},"schema_version":"1.0"},"canonical_sha256":"cfc077d6ba879ce31f58ea6b6f94c74e3d04de092122e5bb12cea038da64fce0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:12.092247Z","signature_b64":"YglQ+ohJAP04fOTbZjokYbWm1IrUO5tD9fiFMoII2GcN7S86rj+t/jqIRI0p6Pa+GcZ+r3a8lAOg6YUfy7h6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfc077d6ba879ce31f58ea6b6f94c74e3d04de092122e5bb12cea038da64fce0","last_reissued_at":"2026-05-29T01:05:12.091477Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:12.091477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.07707","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-29T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8Hzqx3dO5HZ9QV/+obP+ag4TPK/1OFliqkPZIqnuW+s15iy/Ckcdd4fKDKwDYiKMkum8puZL2pGFHoWKYOpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:23:59.806189Z"},"content_sha256":"5eb29bc985b6132aa143d71417af629ed56cb5097c27cebb53c87c28e9113627","schema_version":"1.0","event_id":"sha256:5eb29bc985b6132aa143d71417af629ed56cb5097c27cebb53c87c28e9113627"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Z7AHPVV2Q6OOGH2Y5JVW7FGHJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Task Network Planning with LLM-Generated Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"LLM-generated heuristics for HTN planning nearly match the coverage of the top specialized planner while cutting search effort on 83 percent of problems.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexandre Buchweitz, Andr\\'e Grahl Pereira, Augusto B. Corr\\^ea, Felipe Meneguzzi, Victor Scherer Putrich","submitted_at":"2026-05-08T13:14:31Z","abstract_excerpt":"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 av"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our results show that LLM-generated heuristics nearly match the coverage of the best available HTN planner, while substantially reducing search effort on 83% of shared problems.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That LLM prompting with domain information produces genuinely useful and generalizable heuristics without relying on benchmark-specific leakage or overfitting to the six tested domains.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"LLM-generated heuristics for HTN planning nearly match PANDA planner coverage while reducing search effort on 83% of shared problems across six benchmark domains.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"LLM-generated heuristics for HTN planning nearly match the coverage of the top specialized planner while cutting search effort on 83 percent of problems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"84f4286f30df8452287683e7e5fe90733cae1d876b5cc7e1789bbe505ca70401"},"source":{"id":"2605.07707","kind":"arxiv","version":2},"verdict":{"id":"86012f7c-17a2-4c0a-804e-c092a7bdf1f6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T01:49:41.166014Z","strongest_claim":"Our results show that LLM-generated heuristics nearly match the coverage of the best available HTN planner, while substantially reducing search effort on 83% of shared problems.","one_line_summary":"LLM-generated heuristics for HTN planning nearly match PANDA planner coverage while reducing search effort on 83% of shared problems across six benchmark domains.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That LLM prompting with domain information produces genuinely useful and generalizable heuristics without relying on benchmark-specific leakage or overfitting to the six tested domains.","pith_extraction_headline":"LLM-generated heuristics for HTN planning nearly match the coverage of the top specialized planner while cutting search effort on 83 percent of problems."},"integrity":{"clean":false,"summary":{"advisory":1,"critical":0,"by_detector":{"doi_compliance":{"total":1,"advisory":1,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.07707/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arxiv.2305) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":24,"audited_at":"2026-05-19T11:36:02.408617Z","detected_doi":"10.48550/arxiv.2305","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T10:22:02.837008Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T05:36:08.563499Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.543340Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T11:36:02.408617Z","status":"completed","version":"1.0.0","findings_count":1}],"snapshot_sha256":"0330cf4bf18d238c5f1d83625a7360a64e45282e5c3f5fa65cf5c4c5abba9f6b"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f9c1b8dd29e5e9966b85208911f9a29746c67e86fbda8e52eb4d5897228d3a71"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"86012f7c-17a2-4c0a-804e-c092a7bdf1f6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-29T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeOmh9c5+aZza8i0RfOc3eYr5ThmTWgvi4HVdu2CQAb38bHvLs0et7JR/paLVkKjNmga/+GCWsS0f1l6IVHxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:23:59.807262Z"},"content_sha256":"5c57ec28cf1f94e7a19c746838e6788e624a43b374254db801717add2c45b6d3","schema_version":"1.0","event_id":"sha256:5c57ec28cf1f94e7a19c746838e6788e624a43b374254db801717add2c45b6d3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:Z7AHPVV2Q6OOGH2Y5JVW7FGHJY","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arxiv.2305) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"K. Valmeekam, M. Marquez, S. Sreedharan, and S. Kambhampati. On the planning abilities of large language models – a critical investigation.arXiv, May 2023. doi: 10.48550/ARXIV .2305. 15771","arxiv_id":"2605.07707","detector":"doi_compliance","evidence":{"ref_index":24,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"K. Valmeekam, M. Marquez, S. Sreedharan, and S. Kambhampati. On the planning abilities of large language models – a critical investigation.arXiv, May 2023. doi: 10.48550/ARXIV .2305. 15771","reconstructed_doi":"10.48550/arxiv.2305"},"severity":"advisory","ref_index":24,"audited_at":"2026-05-19T11:36:02.408617Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arxiv.2305","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"37c74b80b623b1a7329bd520c98c0e257c8df491c5ff53dc8269cef5bac5726f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1136,"payload_sha256":"64c49554cb9b10daa2801a04324777aa7aaf54b52af1fad12540749ce6df5cd2","signature_b64":"pHjxy45vnlF9Pu5VaAu74R19o04o38ivlOIxXBWoFYe60hVTYCT1AjQZbNzKP1q6MdrHYpMoCousnJ18DgItBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T11:37:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAZgOkGIbz2hBud7pw7IjdIdvLzksuLIk5TYMUO7T+BLHwtuzJ2FJIZK2kZbBpqde2fldwNshNKGF6WkeQyQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:23:59.808988Z"},"content_sha256":"554efbc31fb394ec9f640b999faa64e7ca2dc12397d5adcf3555a89721dc0e52","schema_version":"1.0","event_id":"sha256:554efbc31fb394ec9f640b999faa64e7ca2dc12397d5adcf3555a89721dc0e52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7AHPVV2Q6OOGH2Y5JVW7FGHJY/bundle.json","state_url":"https://pith.science/pith/Z7AHPVV2Q6OOGH2Y5JVW7FGHJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7AHPVV2Q6OOGH2Y5JVW7FGHJY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T06:23:59Z","links":{"resolver":"https://pith.science/pith/Z7AHPVV2Q6OOGH2Y5JVW7FGHJY","bundle":"https://pith.science/pith/Z7AHPVV2Q6OOGH2Y5JVW7FGHJY/bundle.json","state":"https://pith.science/pith/Z7AHPVV2Q6OOGH2Y5JVW7FGHJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7AHPVV2Q6OOGH2Y5JVW7FGHJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z7AHPVV2Q6OOGH2Y5JVW7FGHJY","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ea393f469c92498ebe0dc93acab004a9d894c61e4e626189f6424807aafaf3d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T13:14:31Z","title_canon_sha256":"d116e693dff9a3401c383fca415f9e6dc45acdb902d7ef06a7a40c2750d1c8ba"},"schema_version":"1.0","source":{"id":"2605.07707","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07707","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07707v2","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07707","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"Z7AHPVV2Q6OO","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"Z7AHPVV2Q6OOGH2Y","created_at":"2026-05-29T01:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"Z7AHPVV2","created_at":"2026-05-29T01:05:12Z"}],"graph_snapshots":[{"event_id":"sha256:5c57ec28cf1f94e7a19c746838e6788e624a43b374254db801717add2c45b6d3","target":"graph","created_at":"2026-05-29T01:05:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our results show that LLM-generated heuristics nearly match the coverage of the best available HTN planner, while substantially reducing search effort on 83% of shared problems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That LLM prompting with domain information produces genuinely useful and generalizable heuristics without relying on benchmark-specific leakage or overfitting to the six tested domains."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"LLM-generated heuristics for HTN planning nearly match PANDA planner coverage while reducing search effort on 83% of shared problems across six benchmark domains."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LLM-generated heuristics for HTN planning nearly match the coverage of the top specialized planner while cutting search effort on 83 percent of problems."}],"snapshot_sha256":"84f4286f30df8452287683e7e5fe90733cae1d876b5cc7e1789bbe505ca70401"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f9c1b8dd29e5e9966b85208911f9a29746c67e86fbda8e52eb4d5897228d3a71"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T10:22:02.837008Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T05:36:08.563499Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.543340Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T11:36:02.408617Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.07707/integrity.json","findings":[{"audited_at":"2026-05-19T11:36:02.408617Z","detected_arxiv_id":null,"detected_doi":"10.48550/arxiv.2305","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arxiv.2305) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":24,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"0330cf4bf18d238c5f1d83625a7360a64e45282e5c3f5fa65cf5c4c5abba9f6b","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":0,"informational":0,"total":1}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"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 av","authors_text":"Alexandre Buchweitz, Andr\\'e Grahl Pereira, Augusto B. Corr\\^ea, Felipe Meneguzzi, Victor Scherer Putrich","cross_cats":[],"headline":"LLM-generated heuristics for HTN planning nearly match the coverage of the top specialized planner while cutting search effort on 83 percent of problems.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T13:14:31Z","title":"Hierarchical Task Network Planning with LLM-Generated Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.07707","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-11T01:49:41.166014Z","id":"86012f7c-17a2-4c0a-804e-c092a7bdf1f6","model_set":{"reader":"grok-4.3"},"one_line_summary":"LLM-generated heuristics for HTN planning nearly match PANDA planner coverage while reducing search effort on 83% of shared problems across six benchmark domains.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"LLM-generated heuristics for HTN planning nearly match the coverage of the top specialized planner while cutting search effort on 83 percent of problems.","strongest_claim":"Our results show that LLM-generated heuristics nearly match the coverage of the best available HTN planner, while substantially reducing search effort on 83% of shared problems.","weakest_assumption":"That LLM prompting with domain information produces genuinely useful and generalizable heuristics without relying on benchmark-specific leakage or overfitting to the six tested domains."}},"verdict_id":"86012f7c-17a2-4c0a-804e-c092a7bdf1f6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5eb29bc985b6132aa143d71417af629ed56cb5097c27cebb53c87c28e9113627","target":"record","created_at":"2026-05-29T01:05:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ea393f469c92498ebe0dc93acab004a9d894c61e4e626189f6424807aafaf3d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T13:14:31Z","title_canon_sha256":"d116e693dff9a3401c383fca415f9e6dc45acdb902d7ef06a7a40c2750d1c8ba"},"schema_version":"1.0","source":{"id":"2605.07707","kind":"arxiv","version":2}},"canonical_sha256":"cfc077d6ba879ce31f58ea6b6f94c74e3d04de092122e5bb12cea038da64fce0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfc077d6ba879ce31f58ea6b6f94c74e3d04de092122e5bb12cea038da64fce0","first_computed_at":"2026-05-29T01:05:12.091477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:12.091477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YglQ+ohJAP04fOTbZjokYbWm1IrUO5tD9fiFMoII2GcN7S86rj+t/jqIRI0p6Pa+GcZ+r3a8lAOg6YUfy7h6CA==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:12.092247Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.07707","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:554efbc31fb394ec9f640b999faa64e7ca2dc12397d5adcf3555a89721dc0e52","sha256:5eb29bc985b6132aa143d71417af629ed56cb5097c27cebb53c87c28e9113627","sha256:5c57ec28cf1f94e7a19c746838e6788e624a43b374254db801717add2c45b6d3"],"state_sha256":"6cc7041543078614c2e2a20badbdc926beaf6bc9cd97cb5f64406d56cca36f09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P51RiCXStKYCfwNtca9PZhy7HXqDxYKE/7gi9r0ARvJNrfPe0bblpC4SldzeartCfi+8Y9luUaoSnuFOHYlEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:23:59.813604Z","bundle_sha256":"ddc1bfbfc086639c03e79d976654381ad30ae1b824910aa18eb6f1941bfe6b09"}}