{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JO5ZIRWUH6DGWBPWZKSIGSP3F6","short_pith_number":"pith:JO5ZIRWU","canonical_record":{"source":{"id":"2504.08690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-04-11T16:57:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4fdb849495b270ae945bd5a94eb5e04cecd3559a13663fd5751cb014e9ca707d","abstract_canon_sha256":"f5bcf4e4addfc497ec32492779eec8d95d0544c39fb75a661ccf1abb1adb3083"},"schema_version":"1.0"},"canonical_sha256":"4bbb9446d43f866b05f6caa48349fb2f8c8a716d1fc6b0a1b2e70c81b3fe027d","source":{"kind":"arxiv","id":"2504.08690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08690","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08690v1","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08690","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"JO5ZIRWUH6DG","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"pith_short_16","alias_value":"JO5ZIRWUH6DGWBPW","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"pith_short_8","alias_value":"JO5ZIRWU","created_at":"2026-07-05T10:47:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JO5ZIRWUH6DGWBPWZKSIGSP3F6","target":"record","payload":{"canonical_record":{"source":{"id":"2504.08690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-04-11T16:57:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4fdb849495b270ae945bd5a94eb5e04cecd3559a13663fd5751cb014e9ca707d","abstract_canon_sha256":"f5bcf4e4addfc497ec32492779eec8d95d0544c39fb75a661ccf1abb1adb3083"},"schema_version":"1.0"},"canonical_sha256":"4bbb9446d43f866b05f6caa48349fb2f8c8a716d1fc6b0a1b2e70c81b3fe027d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:52.908088Z","signature_b64":"AhV/SQuGJGmQgdainOlycHnrKQxOCZ1r97Ll2XZHa9Frw9ge7lI0QcV1jJyhSxKaQ7s0f8ek2Eyvz4x8Av7uCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bbb9446d43f866b05f6caa48349fb2f8c8a716d1fc6b0a1b2e70c81b3fe027d","last_reissued_at":"2026-07-05T10:47:52.907628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:52.907628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.08690","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-05T10:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlWPqnTU1cx0OVeTJ2Xvn9j1dhaEOGG92ENDssgGl9KWxs2QCsLbiLhyxSPQjSSLocKzLpJX232bKVoglswQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:31:05.637110Z"},"content_sha256":"92241b57279c9f6916196ec4690c273f4d3ac2a8640c42feb46d6620cae3d58f","schema_version":"1.0","event_id":"sha256:92241b57279c9f6916196ec4690c273f4d3ac2a8640c42feb46d6620cae3d58f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JO5ZIRWUH6DGWBPWZKSIGSP3F6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast-Slow-Thinking: Complex Task Solving with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chen Gong, Dacheng Tao, Sheng Wan, Yanfang Zhang, Yiliu Sun, Zicheng Zhao","submitted_at":"2025-04-11T16:57:36Z","abstract_excerpt":"Nowadays, Large Language Models (LLMs) have been gradually employed to solve complex tasks. To face the challenge, task decomposition has become an effective way, which proposes to divide a complex task into multiple simpler subtasks and then solve them separately so that the difficulty of the original task can be reduced. However, the performance of existing task decomposition methods can be suboptimal when the task contains overly complex logic and constraints. In this situation, the solution generated by LLMs may deviate from the original purpose of the task, or contain redundant or even er"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08690","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/2504.08690/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-05T10:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnQbCGhCxIbmo8aflCjQauVxWqByzuM23d1f3sSv0byzWEFzCRrUm9poA1vjlqJ6dWR89gmP1O+a3yij6nlSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:31:05.637695Z"},"content_sha256":"9aa320e71248b8cd8f7ddeaa4ff1a31298a78f392eb91b04b04b5aa54a1b00bc","schema_version":"1.0","event_id":"sha256:9aa320e71248b8cd8f7ddeaa4ff1a31298a78f392eb91b04b04b5aa54a1b00bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JO5ZIRWUH6DGWBPWZKSIGSP3F6/bundle.json","state_url":"https://pith.science/pith/JO5ZIRWUH6DGWBPWZKSIGSP3F6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JO5ZIRWUH6DGWBPWZKSIGSP3F6/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-09T15:31:05Z","links":{"resolver":"https://pith.science/pith/JO5ZIRWUH6DGWBPWZKSIGSP3F6","bundle":"https://pith.science/pith/JO5ZIRWUH6DGWBPWZKSIGSP3F6/bundle.json","state":"https://pith.science/pith/JO5ZIRWUH6DGWBPWZKSIGSP3F6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JO5ZIRWUH6DGWBPWZKSIGSP3F6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JO5ZIRWUH6DGWBPWZKSIGSP3F6","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":"f5bcf4e4addfc497ec32492779eec8d95d0544c39fb75a661ccf1abb1adb3083","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-04-11T16:57:36Z","title_canon_sha256":"4fdb849495b270ae945bd5a94eb5e04cecd3559a13663fd5751cb014e9ca707d"},"schema_version":"1.0","source":{"id":"2504.08690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08690","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08690v1","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08690","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"JO5ZIRWUH6DG","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"pith_short_16","alias_value":"JO5ZIRWUH6DGWBPW","created_at":"2026-07-05T10:47:52Z"},{"alias_kind":"pith_short_8","alias_value":"JO5ZIRWU","created_at":"2026-07-05T10:47:52Z"}],"graph_snapshots":[{"event_id":"sha256:9aa320e71248b8cd8f7ddeaa4ff1a31298a78f392eb91b04b04b5aa54a1b00bc","target":"graph","created_at":"2026-07-05T10:47:52Z","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/2504.08690/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nowadays, Large Language Models (LLMs) have been gradually employed to solve complex tasks. To face the challenge, task decomposition has become an effective way, which proposes to divide a complex task into multiple simpler subtasks and then solve them separately so that the difficulty of the original task can be reduced. However, the performance of existing task decomposition methods can be suboptimal when the task contains overly complex logic and constraints. In this situation, the solution generated by LLMs may deviate from the original purpose of the task, or contain redundant or even er","authors_text":"Chen Gong, Dacheng Tao, Sheng Wan, Yanfang Zhang, Yiliu Sun, Zicheng Zhao","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-04-11T16:57:36Z","title":"Fast-Slow-Thinking: Complex Task Solving with Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08690","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:92241b57279c9f6916196ec4690c273f4d3ac2a8640c42feb46d6620cae3d58f","target":"record","created_at":"2026-07-05T10:47:52Z","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":"f5bcf4e4addfc497ec32492779eec8d95d0544c39fb75a661ccf1abb1adb3083","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-04-11T16:57:36Z","title_canon_sha256":"4fdb849495b270ae945bd5a94eb5e04cecd3559a13663fd5751cb014e9ca707d"},"schema_version":"1.0","source":{"id":"2504.08690","kind":"arxiv","version":1}},"canonical_sha256":"4bbb9446d43f866b05f6caa48349fb2f8c8a716d1fc6b0a1b2e70c81b3fe027d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bbb9446d43f866b05f6caa48349fb2f8c8a716d1fc6b0a1b2e70c81b3fe027d","first_computed_at":"2026-07-05T10:47:52.907628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:47:52.907628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AhV/SQuGJGmQgdainOlycHnrKQxOCZ1r97Ll2XZHa9Frw9ge7lI0QcV1jJyhSxKaQ7s0f8ek2Eyvz4x8Av7uCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:47:52.908088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.08690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92241b57279c9f6916196ec4690c273f4d3ac2a8640c42feb46d6620cae3d58f","sha256:9aa320e71248b8cd8f7ddeaa4ff1a31298a78f392eb91b04b04b5aa54a1b00bc"],"state_sha256":"f11fe4ca534379a811dc7e740aa25668206afe28f269f4132012b50694c8423a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9f6HC9zhMDOjui89tfIhKCmRGDTkBwr8+8sw1Rc5IEdhn+Fu35MS3UQXn0qrl890SKjo0jmWrmZCiBGrdXwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:31:05.641656Z","bundle_sha256":"1a12f72ef28cf2f07dc4d32d932b2b7768d0f8a021acbf7a2416753e4774ef8b"}}