{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HDL3P5FCRCKJLUU2SRFQCGPOXS","short_pith_number":"pith:HDL3P5FC","canonical_record":{"source":{"id":"2511.02200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-11-04T02:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"213f82076d064b0a4763c8a7c2f12e641faa0d3fc30a238c8d67468fd5bc4f29","abstract_canon_sha256":"f737bc274372e3d086a187c75ece02176fd928e91bfffd82ff6fb2890833e760"},"schema_version":"1.0"},"canonical_sha256":"38d7b7f4a2889495d29a944b0119eebc96dd55a848dbb25cc21bac12136e821e","source":{"kind":"arxiv","id":"2511.02200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.02200","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"2511.02200v2","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.02200","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"HDL3P5FCRCKJ","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"pith_short_16","alias_value":"HDL3P5FCRCKJLUU2","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"pith_short_8","alias_value":"HDL3P5FC","created_at":"2026-07-07T02:19:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HDL3P5FCRCKJLUU2SRFQCGPOXS","target":"record","payload":{"canonical_record":{"source":{"id":"2511.02200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-11-04T02:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"213f82076d064b0a4763c8a7c2f12e641faa0d3fc30a238c8d67468fd5bc4f29","abstract_canon_sha256":"f737bc274372e3d086a187c75ece02176fd928e91bfffd82ff6fb2890833e760"},"schema_version":"1.0"},"canonical_sha256":"38d7b7f4a2889495d29a944b0119eebc96dd55a848dbb25cc21bac12136e821e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:41.968778Z","signature_b64":"kn30INnTQqLEOveBijxSgrH7JP/jAJQbGJDh1aphqF84u+xW1T3I50UEAjZ32+/BA0TgWLs48ybVbGxUSQ9UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38d7b7f4a2889495d29a944b0119eebc96dd55a848dbb25cc21bac12136e821e","last_reissued_at":"2026-07-07T02:19:41.967882Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:41.967882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.02200","source_version":2,"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-07T02:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDQbt3I/gr05Muw1+rv/lUcCDRMA6Rwaqb0DqJ4QeUvrNxdZiGzVSXorlaKo+P0SQN56zo+ocY3sFUuYiUowDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:30:37.169043Z"},"content_sha256":"521b6c03f191f3352d2b34ab19d36694083143afc88c89cffff168b93fcaa974","schema_version":"1.0","event_id":"sha256:521b6c03f191f3352d2b34ab19d36694083143afc88c89cffff168b93fcaa974"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HDL3P5FCRCKJLUU2SRFQCGPOXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal-Agent-Selection: State-Aware Routing Framework for Efficient Multi-Agent Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haochun Wang, Jingbo Wang, Sendong Zhao, Ting Liu, Yuzheng Fan","submitted_at":"2025-11-04T02:41:14Z","abstract_excerpt":"The emergence of multi-agent systems powered by large language models (LLMs) has unlocked new frontiers in complex task-solving, enabling diverse agents to integrate unique expertise, collaborate flexibly, and address challenges unattainable for individual models. However, the full potential of such systems is hindered by rigid agent scheduling and inefficient coordination strategies that fail to adapt to evolving task requirements. In this paper, we propose STRMAC, a state-aware routing framework designed for efficient collaboration in multi-agent systems. Our method separately encodes intera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.02200","kind":"arxiv","version":2},"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/2511.02200/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-07T02:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EoBjUDARw7a7N5Oqqy0XoAhXrokX0ZeW4fT2PqUgUe3L4yCPz/ldgQRMWOcwHbk+YnqWFgs61Zh97KF1WSckBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:30:37.169556Z"},"content_sha256":"c94b06ce7551d615f4ef096f673cdb911f69012434cdce8a105aae7d61b1412a","schema_version":"1.0","event_id":"sha256:c94b06ce7551d615f4ef096f673cdb911f69012434cdce8a105aae7d61b1412a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDL3P5FCRCKJLUU2SRFQCGPOXS/bundle.json","state_url":"https://pith.science/pith/HDL3P5FCRCKJLUU2SRFQCGPOXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDL3P5FCRCKJLUU2SRFQCGPOXS/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-04T23:30:37Z","links":{"resolver":"https://pith.science/pith/HDL3P5FCRCKJLUU2SRFQCGPOXS","bundle":"https://pith.science/pith/HDL3P5FCRCKJLUU2SRFQCGPOXS/bundle.json","state":"https://pith.science/pith/HDL3P5FCRCKJLUU2SRFQCGPOXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDL3P5FCRCKJLUU2SRFQCGPOXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HDL3P5FCRCKJLUU2SRFQCGPOXS","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":"f737bc274372e3d086a187c75ece02176fd928e91bfffd82ff6fb2890833e760","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-11-04T02:41:14Z","title_canon_sha256":"213f82076d064b0a4763c8a7c2f12e641faa0d3fc30a238c8d67468fd5bc4f29"},"schema_version":"1.0","source":{"id":"2511.02200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.02200","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"2511.02200v2","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.02200","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"HDL3P5FCRCKJ","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"pith_short_16","alias_value":"HDL3P5FCRCKJLUU2","created_at":"2026-07-07T02:19:41Z"},{"alias_kind":"pith_short_8","alias_value":"HDL3P5FC","created_at":"2026-07-07T02:19:41Z"}],"graph_snapshots":[{"event_id":"sha256:c94b06ce7551d615f4ef096f673cdb911f69012434cdce8a105aae7d61b1412a","target":"graph","created_at":"2026-07-07T02:19:41Z","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/2511.02200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The emergence of multi-agent systems powered by large language models (LLMs) has unlocked new frontiers in complex task-solving, enabling diverse agents to integrate unique expertise, collaborate flexibly, and address challenges unattainable for individual models. However, the full potential of such systems is hindered by rigid agent scheduling and inefficient coordination strategies that fail to adapt to evolving task requirements. In this paper, we propose STRMAC, a state-aware routing framework designed for efficient collaboration in multi-agent systems. Our method separately encodes intera","authors_text":"Haochun Wang, Jingbo Wang, Sendong Zhao, Ting Liu, Yuzheng Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-11-04T02:41:14Z","title":"Optimal-Agent-Selection: State-Aware Routing Framework for Efficient Multi-Agent Collaboration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.02200","kind":"arxiv","version":2},"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:521b6c03f191f3352d2b34ab19d36694083143afc88c89cffff168b93fcaa974","target":"record","created_at":"2026-07-07T02:19:41Z","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":"f737bc274372e3d086a187c75ece02176fd928e91bfffd82ff6fb2890833e760","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-11-04T02:41:14Z","title_canon_sha256":"213f82076d064b0a4763c8a7c2f12e641faa0d3fc30a238c8d67468fd5bc4f29"},"schema_version":"1.0","source":{"id":"2511.02200","kind":"arxiv","version":2}},"canonical_sha256":"38d7b7f4a2889495d29a944b0119eebc96dd55a848dbb25cc21bac12136e821e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38d7b7f4a2889495d29a944b0119eebc96dd55a848dbb25cc21bac12136e821e","first_computed_at":"2026-07-07T02:19:41.967882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:41.967882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kn30INnTQqLEOveBijxSgrH7JP/jAJQbGJDh1aphqF84u+xW1T3I50UEAjZ32+/BA0TgWLs48ybVbGxUSQ9UBw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:41.968778Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.02200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:521b6c03f191f3352d2b34ab19d36694083143afc88c89cffff168b93fcaa974","sha256:c94b06ce7551d615f4ef096f673cdb911f69012434cdce8a105aae7d61b1412a"],"state_sha256":"95bc3e98a2ff780f8ea0bf6c8918defb54a2e967ca8109121181fdc4d0f07bf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUFmhK5krmUaVVIDIJqKxZVS8h5CpsDvWOcIH5442yBqVlbMaKfiLdB6Re3dV3jX8PB3kt/EhUVVasyqKUIyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T23:30:37.178674Z","bundle_sha256":"4777097c2b5dad915d0d33bd1c7e92d4679190abc98412f6e33a2c530508feeb"}}