{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WDJKIJBYP3JRFVFMTM7OODH5WO","short_pith_number":"pith:WDJKIJBY","canonical_record":{"source":{"id":"2605.16790","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:47:26Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"37384d239678b03f3437dc69881db8e2462b06b1f7655e907515ab99fd0089fe","abstract_canon_sha256":"9d807c834812c3f883301705a8601c6529e184687a16cdd975d545bdec2e9f58"},"schema_version":"1.0"},"canonical_sha256":"b0d2a424387ed312d4ac9b3ee70cfdb3abc00e6a9dca29e30b79700db47885c0","source":{"kind":"arxiv","id":"2605.16790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16790","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16790v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16790","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"WDJKIJBYP3JR","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"WDJKIJBYP3JRFVFM","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"WDJKIJBY","created_at":"2026-05-20T00:03:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WDJKIJBYP3JRFVFMTM7OODH5WO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16790","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:47:26Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"37384d239678b03f3437dc69881db8e2462b06b1f7655e907515ab99fd0089fe","abstract_canon_sha256":"9d807c834812c3f883301705a8601c6529e184687a16cdd975d545bdec2e9f58"},"schema_version":"1.0"},"canonical_sha256":"b0d2a424387ed312d4ac9b3ee70cfdb3abc00e6a9dca29e30b79700db47885c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:22.181625Z","signature_b64":"oNl4dstarU8TqdoW+OHmGK5W3EGeOHSDpNypi/xaN0oJBPDQv952TYDZuA6ACRbxly9fC8C0+vyqP36m3H9CAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0d2a424387ed312d4ac9b3ee70cfdb3abc00e6a9dca29e30b79700db47885c0","last_reissued_at":"2026-05-20T00:03:22.180674Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:22.180674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16790","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-05-20T00:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCcOOylaMwmkECSGwwVyNL8ZLNMjGIRmmZtwBWUHP2TY/sqkVRP+jWTVafJUwmKaJtlgclA/JHDX0uEB07EsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:25:31.989774Z"},"content_sha256":"da39196da2103e7acea2144c4b847cc0dec129aef822a0e38e043b31e9464f43","schema_version":"1.0","event_id":"sha256:da39196da2103e7acea2144c4b847cc0dec129aef822a0e38e043b31e9464f43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WDJKIJBYP3JRFVFMTM7OODH5WO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TIER: Trajectory-Invariant Execution Rewards for Multi-Step Tool Composition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Rewards derived from tool execution and schemas let models maintain high accuracy on tasks requiring up to six sequential tool calls.","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Anay Kulkarni, ChiaEn Lu, Dheeraj Mekala, Gaowen Liu, Jayanth Srinivasa, Jingbo Shang","submitted_at":"2026-05-16T03:47:26Z","abstract_excerpt":"Tool use enables large language models to solve complex tasks through sequences of API calls, yet existing reinforcement learning approaches fail to scale to multi-step composition settings. Outcome-based rewards provide only sparse feedback, while trajectory-supervised rewards depend on annotated reference solutions, penalizing valid alternatives and limiting scalability. We propose TIER: Trajectory-Invariant Execution Rewards, a reward framework that derives supervision directly from function schemas and runtime execution, rather than from reference trajectories. The reward decomposes into f"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On DepthBench, a compositional benchmark stratified by depth (1 to 6 steps), TIER achieves >90% accuracy across steps, where trajectory-supervised rewards collapse beyond step-4.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The paper assumes that runtime execution feedback and schema verification can be obtained reliably and at low cost for every candidate step without introducing new errors or requiring additional human annotation, and that this feedback is sufficient to guide learning across all valid alternative paths.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"TIER creates trajectory-invariant rewards from tool schemas and execution results for multi-step LLM tool use, reaching over 90 percent accuracy on DepthBench up to six steps where reference-trajectory methods fail after four.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Rewards derived from tool execution and schemas let models maintain high accuracy on tasks requiring up to six sequential tool calls.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"95529a2bd537b55d0047cf8589eaedebf4fa6c3547070da5e21ea0c6b33af444"},"source":{"id":"2605.16790","kind":"arxiv","version":1},"verdict":{"id":"908d0fbf-5171-4cab-b2b8-dc524e6cb507","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:29:52.177163Z","strongest_claim":"On DepthBench, a compositional benchmark stratified by depth (1 to 6 steps), TIER achieves >90% accuracy across steps, where trajectory-supervised rewards collapse beyond step-4.","one_line_summary":"TIER creates trajectory-invariant rewards from tool schemas and execution results for multi-step LLM tool use, reaching over 90 percent accuracy on DepthBench up to six steps where reference-trajectory methods fail after four.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The paper assumes that runtime execution feedback and schema verification can be obtained reliably and at low cost for every candidate step without introducing new errors or requiring additional human annotation, and that this feedback is sufficient to guide learning across all valid alternative paths.","pith_extraction_headline":"Rewards derived from tool execution and schemas let models maintain high accuracy on tasks requiring up to six sequential tool calls."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16790/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.603289Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:40:53.211114Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.295576Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.431268Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2bd1b3854c655e01bae028691acae205e99b785dbf034c85e92fbc14fd7cc247"},"references":{"count":29,"sample":[{"doi":"","year":null,"title":"(one output)","work_id":"c9290267-0dfe-4c47-ae2d-a19a6e86b639","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"(all outputs) 18","work_id":"157a32b9-50d3-44cc-aaa1-0ce8b06732f1","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"(one output)","work_id":"955e98d5-b53d-4128-9126-7ac841245962","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"You respond with ONE API call at a time and wait for the environment to execute it and provide you with the tool response","work_id":"05506985-5375-4ba8-a32d-90180e978aca","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Each turn may require multi-step API calls (as described in scenario 4)","work_id":"ed486a90-ed72-40bb-8869-2ad02b7e0106","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":29,"snapshot_sha256":"a7f132403be68269e5a2c1b3b561af2bc61c83dbd74543ee22e671477cfbe5d9","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"7dfa315bd3dbc9054db13ba0b625989419f6df23c5ab42e65b52c2f1cb01dad5"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"908d0fbf-5171-4cab-b2b8-dc524e6cb507"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HM5hjNcq4DIbtqWQolXVsLTN9K7YhyiZt2jVCs1udEyBM+2xlBpXzF2DMPCYfAxbqCiSdqX8Dtu6+haUbspoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:25:31.990389Z"},"content_sha256":"5f266d28e24fce7421f54fd944499467aa367330d301600c9d114d7ad4805b45","schema_version":"1.0","event_id":"sha256:5f266d28e24fce7421f54fd944499467aa367330d301600c9d114d7ad4805b45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDJKIJBYP3JRFVFMTM7OODH5WO/bundle.json","state_url":"https://pith.science/pith/WDJKIJBYP3JRFVFMTM7OODH5WO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDJKIJBYP3JRFVFMTM7OODH5WO/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-05T08:25:31Z","links":{"resolver":"https://pith.science/pith/WDJKIJBYP3JRFVFMTM7OODH5WO","bundle":"https://pith.science/pith/WDJKIJBYP3JRFVFMTM7OODH5WO/bundle.json","state":"https://pith.science/pith/WDJKIJBYP3JRFVFMTM7OODH5WO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDJKIJBYP3JRFVFMTM7OODH5WO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WDJKIJBYP3JRFVFMTM7OODH5WO","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":"9d807c834812c3f883301705a8601c6529e184687a16cdd975d545bdec2e9f58","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:47:26Z","title_canon_sha256":"37384d239678b03f3437dc69881db8e2462b06b1f7655e907515ab99fd0089fe"},"schema_version":"1.0","source":{"id":"2605.16790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16790","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16790v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16790","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"WDJKIJBYP3JR","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"WDJKIJBYP3JRFVFM","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"WDJKIJBY","created_at":"2026-05-20T00:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:5f266d28e24fce7421f54fd944499467aa367330d301600c9d114d7ad4805b45","target":"graph","created_at":"2026-05-20T00:03:22Z","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":"On DepthBench, a compositional benchmark stratified by depth (1 to 6 steps), TIER achieves >90% accuracy across steps, where trajectory-supervised rewards collapse beyond step-4."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The paper assumes that runtime execution feedback and schema verification can be obtained reliably and at low cost for every candidate step without introducing new errors or requiring additional human annotation, and that this feedback is sufficient to guide learning across all valid alternative paths."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"TIER creates trajectory-invariant rewards from tool schemas and execution results for multi-step LLM tool use, reaching over 90 percent accuracy on DepthBench up to six steps where reference-trajectory methods fail after four."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Rewards derived from tool execution and schemas let models maintain high accuracy on tasks requiring up to six sequential tool calls."}],"snapshot_sha256":"95529a2bd537b55d0047cf8589eaedebf4fa6c3547070da5e21ea0c6b33af444"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"7dfa315bd3dbc9054db13ba0b625989419f6df23c5ab42e65b52c2f1cb01dad5"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.603289Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:40:53.211114Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.295576Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.431268Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16790/integrity.json","findings":[],"snapshot_sha256":"2bd1b3854c655e01bae028691acae205e99b785dbf034c85e92fbc14fd7cc247","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Tool use enables large language models to solve complex tasks through sequences of API calls, yet existing reinforcement learning approaches fail to scale to multi-step composition settings. Outcome-based rewards provide only sparse feedback, while trajectory-supervised rewards depend on annotated reference solutions, penalizing valid alternatives and limiting scalability. We propose TIER: Trajectory-Invariant Execution Rewards, a reward framework that derives supervision directly from function schemas and runtime execution, rather than from reference trajectories. The reward decomposes into f","authors_text":"Anay Kulkarni, ChiaEn Lu, Dheeraj Mekala, Gaowen Liu, Jayanth Srinivasa, Jingbo Shang","cross_cats":["cs.AI","cs.CL"],"headline":"Rewards derived from tool execution and schemas let models maintain high accuracy on tasks requiring up to six sequential tool calls.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:47:26Z","title":"TIER: Trajectory-Invariant Execution Rewards for Multi-Step Tool Composition"},"references":{"count":29,"internal_anchors":0,"resolved_work":29,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"(one output)","work_id":"c9290267-0dfe-4c47-ae2d-a19a6e86b639","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"(all outputs) 18","work_id":"157a32b9-50d3-44cc-aaa1-0ce8b06732f1","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"(one output)","work_id":"955e98d5-b53d-4128-9126-7ac841245962","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"You respond with ONE API call at a time and wait for the environment to execute it and provide you with the tool response","work_id":"05506985-5375-4ba8-a32d-90180e978aca","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Each turn may require multi-step API calls (as described in scenario 4)","work_id":"ed486a90-ed72-40bb-8869-2ad02b7e0106","year":null}],"snapshot_sha256":"a7f132403be68269e5a2c1b3b561af2bc61c83dbd74543ee22e671477cfbe5d9"},"source":{"id":"2605.16790","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:29:52.177163Z","id":"908d0fbf-5171-4cab-b2b8-dc524e6cb507","model_set":{"reader":"grok-4.3"},"one_line_summary":"TIER creates trajectory-invariant rewards from tool schemas and execution results for multi-step LLM tool use, reaching over 90 percent accuracy on DepthBench up to six steps where reference-trajectory methods fail after four.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Rewards derived from tool execution and schemas let models maintain high accuracy on tasks requiring up to six sequential tool calls.","strongest_claim":"On DepthBench, a compositional benchmark stratified by depth (1 to 6 steps), TIER achieves >90% accuracy across steps, where trajectory-supervised rewards collapse beyond step-4.","weakest_assumption":"The paper assumes that runtime execution feedback and schema verification can be obtained reliably and at low cost for every candidate step without introducing new errors or requiring additional human annotation, and that this feedback is sufficient to guide learning across all valid alternative paths."}},"verdict_id":"908d0fbf-5171-4cab-b2b8-dc524e6cb507"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:da39196da2103e7acea2144c4b847cc0dec129aef822a0e38e043b31e9464f43","target":"record","created_at":"2026-05-20T00:03:22Z","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":"9d807c834812c3f883301705a8601c6529e184687a16cdd975d545bdec2e9f58","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:47:26Z","title_canon_sha256":"37384d239678b03f3437dc69881db8e2462b06b1f7655e907515ab99fd0089fe"},"schema_version":"1.0","source":{"id":"2605.16790","kind":"arxiv","version":1}},"canonical_sha256":"b0d2a424387ed312d4ac9b3ee70cfdb3abc00e6a9dca29e30b79700db47885c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0d2a424387ed312d4ac9b3ee70cfdb3abc00e6a9dca29e30b79700db47885c0","first_computed_at":"2026-05-20T00:03:22.180674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:22.180674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oNl4dstarU8TqdoW+OHmGK5W3EGeOHSDpNypi/xaN0oJBPDQv952TYDZuA6ACRbxly9fC8C0+vyqP36m3H9CAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:22.181625Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da39196da2103e7acea2144c4b847cc0dec129aef822a0e38e043b31e9464f43","sha256:5f266d28e24fce7421f54fd944499467aa367330d301600c9d114d7ad4805b45"],"state_sha256":"b08cb2a3154ab39eafd751645689ecdb930de0f917f3131197996f4061ad83cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TlMIfvU2vtFKObvVhonScvu8V9DMsDaFmfuZSGZIKpfmHJbnEIYz7xAbLHwgwonQa3Kd5VaLqx8GKGqAr/jJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:25:31.993087Z","bundle_sha256":"cd7985546c7914259348be8be953fc1664ca8dcd6059ea67c94bea01ed1246f9"}}