{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XYDFSQFRKPGFQAPRPZBU6FY5RF","short_pith_number":"pith:XYDFSQFR","canonical_record":{"source":{"id":"2607.01942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-02T09:34:20Z","cross_cats_sorted":[],"title_canon_sha256":"01e7b6cf61ad1a2af321d3fe55a63dc610123fafcb0eb4e0f4da3afc0a441cff","abstract_canon_sha256":"9f5b3a85ed2f59608cc197d1f42846cc94fb9a53134935b9149f3b506a26004c"},"schema_version":"1.0"},"canonical_sha256":"be065940b153cc5801f17e434f171d895bc7c42a52f5766b5a19647c291d78fd","source":{"kind":"arxiv","id":"2607.01942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01942","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01942v1","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01942","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"XYDFSQFRKPGF","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"XYDFSQFRKPGFQAPR","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"XYDFSQFR","created_at":"2026-07-03T01:17:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XYDFSQFRKPGFQAPRPZBU6FY5RF","target":"record","payload":{"canonical_record":{"source":{"id":"2607.01942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-02T09:34:20Z","cross_cats_sorted":[],"title_canon_sha256":"01e7b6cf61ad1a2af321d3fe55a63dc610123fafcb0eb4e0f4da3afc0a441cff","abstract_canon_sha256":"9f5b3a85ed2f59608cc197d1f42846cc94fb9a53134935b9149f3b506a26004c"},"schema_version":"1.0"},"canonical_sha256":"be065940b153cc5801f17e434f171d895bc7c42a52f5766b5a19647c291d78fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:34.485374Z","signature_b64":"0b2rRzdN//LMt/qo4kzKVGs8TnEns74A3pGEyAxMvGGSUSKRAf3tTufhBF3I46JUZP2SrFVTq+JqqDNqz4uABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be065940b153cc5801f17e434f171d895bc7c42a52f5766b5a19647c291d78fd","last_reissued_at":"2026-07-03T01:17:34.484718Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:34.484718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.01942","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-03T01:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biymPBNjIEitIBHf4QZVyIhOgN4RFjD499Yyn6Legs01czdRGEY5B0FHhR+Z6Rv9Aj23mAGhI0wcfte2BRbgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:57:55.637750Z"},"content_sha256":"7d8ddc513e174977124b9f785f4fca92f46b472fe6db61c31e35bae9e53215ba","schema_version":"1.0","event_id":"sha256:7d8ddc513e174977124b9f785f4fca92f46b472fe6db61c31e35bae9e53215ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XYDFSQFRKPGFQAPRPZBU6FY5RF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Atomic Task Graph: A Unified Framework for Agentic Planning and Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hanyun Cui, Kangye Ji, Sihan Chen, Yue Zhang, Zhi Wang, Ziwen Huang","submitted_at":"2026-07-02T09:34:20Z","abstract_excerpt":"LLM-based agents have shown strong potential for solving complex multi-step tasks, yet existing performance improvements often rely on either scaling to larger backbone models or task-specific fine-tuning. The former incurs substantial computational costs, while the latter typically generalizes poorly across different tasks. Although prompt-based control is training-free and broadly applicable, existing methods still leave input-output dependencies between subtasks implicit in textual trajectories, making verified intermediate results difficult to reuse. To address these limitations, we propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01942","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/2607.01942/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-03T01:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ie72X70atcQDcD125zIAmGcE68gETVHCkuK0RRYlDyU6G6Mdho7a6mYjjKXEt5es6CPL6pDtNtxogwKcCP1aCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:57:55.638125Z"},"content_sha256":"ddcf562ae59e77217de0375fa19c7177e945dc8e9618d6e55ed6f8f0b4620351","schema_version":"1.0","event_id":"sha256:ddcf562ae59e77217de0375fa19c7177e945dc8e9618d6e55ed6f8f0b4620351"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYDFSQFRKPGFQAPRPZBU6FY5RF/bundle.json","state_url":"https://pith.science/pith/XYDFSQFRKPGFQAPRPZBU6FY5RF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYDFSQFRKPGFQAPRPZBU6FY5RF/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-07-04T10:57:55Z","links":{"resolver":"https://pith.science/pith/XYDFSQFRKPGFQAPRPZBU6FY5RF","bundle":"https://pith.science/pith/XYDFSQFRKPGFQAPRPZBU6FY5RF/bundle.json","state":"https://pith.science/pith/XYDFSQFRKPGFQAPRPZBU6FY5RF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYDFSQFRKPGFQAPRPZBU6FY5RF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XYDFSQFRKPGFQAPRPZBU6FY5RF","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":"9f5b3a85ed2f59608cc197d1f42846cc94fb9a53134935b9149f3b506a26004c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-02T09:34:20Z","title_canon_sha256":"01e7b6cf61ad1a2af321d3fe55a63dc610123fafcb0eb4e0f4da3afc0a441cff"},"schema_version":"1.0","source":{"id":"2607.01942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01942","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01942v1","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01942","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"XYDFSQFRKPGF","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"XYDFSQFRKPGFQAPR","created_at":"2026-07-03T01:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"XYDFSQFR","created_at":"2026-07-03T01:17:34Z"}],"graph_snapshots":[{"event_id":"sha256:ddcf562ae59e77217de0375fa19c7177e945dc8e9618d6e55ed6f8f0b4620351","target":"graph","created_at":"2026-07-03T01:17:34Z","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/2607.01942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"LLM-based agents have shown strong potential for solving complex multi-step tasks, yet existing performance improvements often rely on either scaling to larger backbone models or task-specific fine-tuning. The former incurs substantial computational costs, while the latter typically generalizes poorly across different tasks. Although prompt-based control is training-free and broadly applicable, existing methods still leave input-output dependencies between subtasks implicit in textual trajectories, making verified intermediate results difficult to reuse. To address these limitations, we propos","authors_text":"Hanyun Cui, Kangye Ji, Sihan Chen, Yue Zhang, Zhi Wang, Ziwen Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-02T09:34:20Z","title":"Atomic Task Graph: A Unified Framework for Agentic Planning and Execution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01942","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:7d8ddc513e174977124b9f785f4fca92f46b472fe6db61c31e35bae9e53215ba","target":"record","created_at":"2026-07-03T01:17:34Z","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":"9f5b3a85ed2f59608cc197d1f42846cc94fb9a53134935b9149f3b506a26004c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-02T09:34:20Z","title_canon_sha256":"01e7b6cf61ad1a2af321d3fe55a63dc610123fafcb0eb4e0f4da3afc0a441cff"},"schema_version":"1.0","source":{"id":"2607.01942","kind":"arxiv","version":1}},"canonical_sha256":"be065940b153cc5801f17e434f171d895bc7c42a52f5766b5a19647c291d78fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be065940b153cc5801f17e434f171d895bc7c42a52f5766b5a19647c291d78fd","first_computed_at":"2026-07-03T01:17:34.484718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:34.484718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0b2rRzdN//LMt/qo4kzKVGs8TnEns74A3pGEyAxMvGGSUSKRAf3tTufhBF3I46JUZP2SrFVTq+JqqDNqz4uABA==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:34.485374Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d8ddc513e174977124b9f785f4fca92f46b472fe6db61c31e35bae9e53215ba","sha256:ddcf562ae59e77217de0375fa19c7177e945dc8e9618d6e55ed6f8f0b4620351"],"state_sha256":"d481175fe905709913a7b89fd66cf24a392771de716d801d7543fe7db9ce9f13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JoCG5qFdZ8RfI68eIqrOVCKE7KpCn0pufxX+Dd7/7e8osEgbrgeq46Ch3nvgcp2vA4lc31EFJ/qaH+YcotUrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:57:55.640037Z","bundle_sha256":"a5308c7f92058f1c7e61f64bac7935de66c8b27845d8a4d5ac35ef1933e31772"}}