{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MCRPEOWHTVDR7O5CSDV7IYWGF6","short_pith_number":"pith:MCRPEOWH","canonical_record":{"source":{"id":"2503.10613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-03-13T17:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"7bd34591737602324e011868729e46fd87afa7e092f393b73ff31fce07f3b87b","abstract_canon_sha256":"2edcbb50482b5fcc78c1f6e9bc6d0cf602440a513cea04493b0583afe9004435"},"schema_version":"1.0"},"canonical_sha256":"60a2f23ac79d471fbba290ebf462c62f9313fdc66bc0d349aa93abdde0009db1","source":{"kind":"arxiv","id":"2503.10613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10613","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10613v1","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10613","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"MCRPEOWHTVDR","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"MCRPEOWHTVDR7O5C","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"MCRPEOWH","created_at":"2026-07-05T10:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MCRPEOWHTVDR7O5CSDV7IYWGF6","target":"record","payload":{"canonical_record":{"source":{"id":"2503.10613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-03-13T17:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"7bd34591737602324e011868729e46fd87afa7e092f393b73ff31fce07f3b87b","abstract_canon_sha256":"2edcbb50482b5fcc78c1f6e9bc6d0cf602440a513cea04493b0583afe9004435"},"schema_version":"1.0"},"canonical_sha256":"60a2f23ac79d471fbba290ebf462c62f9313fdc66bc0d349aa93abdde0009db1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:48.777164Z","signature_b64":"YHo3v2G/ec/iRolurvsiGzlbtuMgU7v+omHYIdw4/ZU4QZRlcqjhNDyNJ4C5ASAn9TyF8JtJw0R2ZO2I2cYZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60a2f23ac79d471fbba290ebf462c62f9313fdc66bc0d349aa93abdde0009db1","last_reissued_at":"2026-07-05T10:30:48.776615Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:48.776615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.10613","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:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFAqZFs+C88M0kSARq/muQ0cnTtYizC6ZKvuFNHzdeqNOW7kzGnPNlfYsP9LKdaO9+vHg5O4qECdpyj/DQYCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T10:58:52.364969Z"},"content_sha256":"498a1c31a406c4439d3eadc2fbd19982e26a8c2034f96279c2a12a3b385e7376","schema_version":"1.0","event_id":"sha256:498a1c31a406c4439d3eadc2fbd19982e26a8c2034f96279c2a12a3b385e7376"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MCRPEOWHTVDR7O5CSDV7IYWGF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CoSTA$\\ast$: Cost-Sensitive Toolpath Agent for Multi-turn Image Editing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Advait Gupta, Dang Nguyen, NandaKiran Velaga, Tianyi Zhou","submitted_at":"2025-03-13T17:55:45Z","abstract_excerpt":"Text-to-image models like stable diffusion and DALLE-3 still struggle with multi-turn image editing. We decompose such a task as an agentic workflow (path) of tool use that addresses a sequence of subtasks by AI tools of varying costs. Conventional search algorithms require expensive exploration to find tool paths. While large language models (LLMs) possess prior knowledge of subtask planning, they may lack accurate estimations of capabilities and costs of tools to determine which to apply in each subtask. Can we combine the strengths of both LLMs and graph search to find cost-efficient tool p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10613","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/2503.10613/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:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEl7xamgSxiaKxZV61RmaM1XGZIVQop5cFeyiyXan2USH1fad/qep7YHAMIWrImXcL43L/E4OlPAg4k+nyCpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T10:58:52.365357Z"},"content_sha256":"5ca12d1fdcfddfd13a2618bfa4b59dc24cdee9196716b13d1bb3e7b0f21e8110","schema_version":"1.0","event_id":"sha256:5ca12d1fdcfddfd13a2618bfa4b59dc24cdee9196716b13d1bb3e7b0f21e8110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCRPEOWHTVDR7O5CSDV7IYWGF6/bundle.json","state_url":"https://pith.science/pith/MCRPEOWHTVDR7O5CSDV7IYWGF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCRPEOWHTVDR7O5CSDV7IYWGF6/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-27T10:58:52Z","links":{"resolver":"https://pith.science/pith/MCRPEOWHTVDR7O5CSDV7IYWGF6","bundle":"https://pith.science/pith/MCRPEOWHTVDR7O5CSDV7IYWGF6/bundle.json","state":"https://pith.science/pith/MCRPEOWHTVDR7O5CSDV7IYWGF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCRPEOWHTVDR7O5CSDV7IYWGF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MCRPEOWHTVDR7O5CSDV7IYWGF6","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":"2edcbb50482b5fcc78c1f6e9bc6d0cf602440a513cea04493b0583afe9004435","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-03-13T17:55:45Z","title_canon_sha256":"7bd34591737602324e011868729e46fd87afa7e092f393b73ff31fce07f3b87b"},"schema_version":"1.0","source":{"id":"2503.10613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10613","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10613v1","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10613","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"MCRPEOWHTVDR","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"MCRPEOWHTVDR7O5C","created_at":"2026-07-05T10:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"MCRPEOWH","created_at":"2026-07-05T10:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:5ca12d1fdcfddfd13a2618bfa4b59dc24cdee9196716b13d1bb3e7b0f21e8110","target":"graph","created_at":"2026-07-05T10:30:48Z","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/2503.10613/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Text-to-image models like stable diffusion and DALLE-3 still struggle with multi-turn image editing. We decompose such a task as an agentic workflow (path) of tool use that addresses a sequence of subtasks by AI tools of varying costs. Conventional search algorithms require expensive exploration to find tool paths. While large language models (LLMs) possess prior knowledge of subtask planning, they may lack accurate estimations of capabilities and costs of tools to determine which to apply in each subtask. Can we combine the strengths of both LLMs and graph search to find cost-efficient tool p","authors_text":"Advait Gupta, Dang Nguyen, NandaKiran Velaga, Tianyi Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-03-13T17:55:45Z","title":"CoSTA$\\ast$: Cost-Sensitive Toolpath Agent for Multi-turn Image Editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10613","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:498a1c31a406c4439d3eadc2fbd19982e26a8c2034f96279c2a12a3b385e7376","target":"record","created_at":"2026-07-05T10:30:48Z","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":"2edcbb50482b5fcc78c1f6e9bc6d0cf602440a513cea04493b0583afe9004435","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-03-13T17:55:45Z","title_canon_sha256":"7bd34591737602324e011868729e46fd87afa7e092f393b73ff31fce07f3b87b"},"schema_version":"1.0","source":{"id":"2503.10613","kind":"arxiv","version":1}},"canonical_sha256":"60a2f23ac79d471fbba290ebf462c62f9313fdc66bc0d349aa93abdde0009db1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60a2f23ac79d471fbba290ebf462c62f9313fdc66bc0d349aa93abdde0009db1","first_computed_at":"2026-07-05T10:30:48.776615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:30:48.776615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YHo3v2G/ec/iRolurvsiGzlbtuMgU7v+omHYIdw4/ZU4QZRlcqjhNDyNJ4C5ASAn9TyF8JtJw0R2ZO2I2cYZCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:30:48.777164Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.10613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:498a1c31a406c4439d3eadc2fbd19982e26a8c2034f96279c2a12a3b385e7376","sha256:5ca12d1fdcfddfd13a2618bfa4b59dc24cdee9196716b13d1bb3e7b0f21e8110"],"state_sha256":"2b2426609d1c8e1e6470135ce6310143dcc4e3a5d00636d98e5e1fc41e5e7d62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfUbwx4xJbN20t7W2bC5vtziF9iavQtArtsu042UCidux2OAqqOCS6bZggWiPfpZ40wCdqB3JhPbcANAO5x5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-27T10:58:52.367535Z","bundle_sha256":"7e72ee7213eceb99dc41217829e77720fe48f26444eb14720f3282685dc00052"}}