{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Q6NTPAWT44IKCBOPLRJCNMSW2L","short_pith_number":"pith:Q6NTPAWT","canonical_record":{"source":{"id":"2505.11893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-17T08:06:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9afa8d1781ef32abe33465e9fead8c6d78d6ec121e79f67e743fdbd4f1fa4d7e","abstract_canon_sha256":"8ea1331a5042031a98f7d61488b8de138a6f7ec5dc94a68cf93b8b06b7c1e01b"},"schema_version":"1.0"},"canonical_sha256":"879b3782d3e710a105cf5c5226b256d2d63bb4e801c83b22a8c2a4e05b4db51b","source":{"kind":"arxiv","id":"2505.11893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11893","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11893v1","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11893","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"Q6NTPAWT44IK","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"Q6NTPAWT44IKCBOP","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"Q6NTPAWT","created_at":"2026-07-05T11:04:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Q6NTPAWT44IKCBOPLRJCNMSW2L","target":"record","payload":{"canonical_record":{"source":{"id":"2505.11893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-17T08:06:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9afa8d1781ef32abe33465e9fead8c6d78d6ec121e79f67e743fdbd4f1fa4d7e","abstract_canon_sha256":"8ea1331a5042031a98f7d61488b8de138a6f7ec5dc94a68cf93b8b06b7c1e01b"},"schema_version":"1.0"},"canonical_sha256":"879b3782d3e710a105cf5c5226b256d2d63bb4e801c83b22a8c2a4e05b4db51b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:54.042984Z","signature_b64":"yr+vkoA3nO+idorKQvfpASLwQWUjsNRjLuckOi/olcnHDeK17mZQc/2D+l98KSydDP/f98b65ObCbVGaC0+dAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"879b3782d3e710a105cf5c5226b256d2d63bb4e801c83b22a8c2a4e05b4db51b","last_reissued_at":"2026-07-05T11:04:54.042448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:54.042448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.11893","source_version":1,"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-07-05T11:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+pfjdPBON3CCs+f4xysEEeh3SRHiA8p1DvcZLSdrnudQyttNAvxAJkv0LLeL6Aw082MDaKZhlE/cfqaxRVHlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:53:45.674297Z"},"content_sha256":"ba7e3beb7af4d61ec9a5fc26305c1c68222d10604588c09bc694f228c5875920","schema_version":"1.0","event_id":"sha256:ba7e3beb7af4d61ec9a5fc26305c1c68222d10604588c09bc694f228c5875920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Q6NTPAWT44IKCBOPLRJCNMSW2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RLAP: A Reinforcement Learning Enhanced Adaptive Planning Framework for Multi-step NLP Task Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Deqing Yang, Dixuan Wang, Guochao Jiang, Jiaqing Liang, Zepeng Ding, Ziqin Luo","submitted_at":"2025-05-17T08:06:14Z","abstract_excerpt":"Multi-step planning has been widely employed to enhance the performance of large language models (LLMs) on downstream natural language processing (NLP) tasks, which decomposes the original task into multiple subtasks and guide LLMs to solve them sequentially without additional training. When addressing task instances, existing methods either preset the order of steps or attempt multiple paths at each step. However, these methods overlook instances' linguistic features and rely on the intrinsic planning capabilities of LLMs to evaluate intermediate feedback and then select subtasks, resulting i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11893","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/2505.11893/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Oxo6GGqXR+iZKdUXkCUkfLuN7G9mJTYy8zdEd+wE14+8QmXAWkGivVfLBFjYx/HBvrT9UUG7+tN7Ubu9Q9tAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:53:45.674938Z"},"content_sha256":"f2a7550d2f34bca88226a1600f6742fb4af126648215350e338a0240515ba8c9","schema_version":"1.0","event_id":"sha256:f2a7550d2f34bca88226a1600f6742fb4af126648215350e338a0240515ba8c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6NTPAWT44IKCBOPLRJCNMSW2L/bundle.json","state_url":"https://pith.science/pith/Q6NTPAWT44IKCBOPLRJCNMSW2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6NTPAWT44IKCBOPLRJCNMSW2L/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-08-17T05:53:45Z","links":{"resolver":"https://pith.science/pith/Q6NTPAWT44IKCBOPLRJCNMSW2L","bundle":"https://pith.science/pith/Q6NTPAWT44IKCBOPLRJCNMSW2L/bundle.json","state":"https://pith.science/pith/Q6NTPAWT44IKCBOPLRJCNMSW2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6NTPAWT44IKCBOPLRJCNMSW2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Q6NTPAWT44IKCBOPLRJCNMSW2L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8ea1331a5042031a98f7d61488b8de138a6f7ec5dc94a68cf93b8b06b7c1e01b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-17T08:06:14Z","title_canon_sha256":"9afa8d1781ef32abe33465e9fead8c6d78d6ec121e79f67e743fdbd4f1fa4d7e"},"schema_version":"1.0","source":{"id":"2505.11893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11893","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11893v1","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11893","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"Q6NTPAWT44IK","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"Q6NTPAWT44IKCBOP","created_at":"2026-07-05T11:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"Q6NTPAWT","created_at":"2026-07-05T11:04:54Z"}],"graph_snapshots":[{"event_id":"sha256:f2a7550d2f34bca88226a1600f6742fb4af126648215350e338a0240515ba8c9","target":"graph","created_at":"2026-07-05T11:04:54Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.11893/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-step planning has been widely employed to enhance the performance of large language models (LLMs) on downstream natural language processing (NLP) tasks, which decomposes the original task into multiple subtasks and guide LLMs to solve them sequentially without additional training. When addressing task instances, existing methods either preset the order of steps or attempt multiple paths at each step. However, these methods overlook instances' linguistic features and rely on the intrinsic planning capabilities of LLMs to evaluate intermediate feedback and then select subtasks, resulting i","authors_text":"Deqing Yang, Dixuan Wang, Guochao Jiang, Jiaqing Liang, Zepeng Ding, Ziqin Luo","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-17T08:06:14Z","title":"RLAP: A Reinforcement Learning Enhanced Adaptive Planning Framework for Multi-step NLP Task Solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11893","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ba7e3beb7af4d61ec9a5fc26305c1c68222d10604588c09bc694f228c5875920","target":"record","created_at":"2026-07-05T11:04:54Z","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":"8ea1331a5042031a98f7d61488b8de138a6f7ec5dc94a68cf93b8b06b7c1e01b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-17T08:06:14Z","title_canon_sha256":"9afa8d1781ef32abe33465e9fead8c6d78d6ec121e79f67e743fdbd4f1fa4d7e"},"schema_version":"1.0","source":{"id":"2505.11893","kind":"arxiv","version":1}},"canonical_sha256":"879b3782d3e710a105cf5c5226b256d2d63bb4e801c83b22a8c2a4e05b4db51b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"879b3782d3e710a105cf5c5226b256d2d63bb4e801c83b22a8c2a4e05b4db51b","first_computed_at":"2026-07-05T11:04:54.042448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:54.042448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yr+vkoA3nO+idorKQvfpASLwQWUjsNRjLuckOi/olcnHDeK17mZQc/2D+l98KSydDP/f98b65ObCbVGaC0+dAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:54.042984Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.11893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba7e3beb7af4d61ec9a5fc26305c1c68222d10604588c09bc694f228c5875920","sha256:f2a7550d2f34bca88226a1600f6742fb4af126648215350e338a0240515ba8c9"],"state_sha256":"5aa3951cb671bafd0bc63ce423d503224553df131261670e1fb6bfc1d276f95d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOY3GwuvljCSNALEzHWYFpN4sZ7uQzpFihfDf/KcFFJRdklIfPLcuhAw3qmRWsAptJrOdzNbYb/mx8JU8ZRGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:53:45.680369Z","bundle_sha256":"3ed0312aa3e773c13185cdef9da6bc9fb139826c30227a96bafab0f227e13585"}}