{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LNBORONHOAFJYDIGNOAVUXFNKO","short_pith_number":"pith:LNBORONH","canonical_record":{"source":{"id":"2606.07940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-06T02:00:36Z","cross_cats_sorted":[],"title_canon_sha256":"d86037358523a869ff90339d43693f868bd99c30caa3b84dc350fbd725a6d6fd","abstract_canon_sha256":"1595bb6849f02752dbcc0f0bf8203f028646c06ddd0ad92eb2666c0e3aee71b8"},"schema_version":"1.0"},"canonical_sha256":"5b42e8b9a7700a9c0d066b815a5cad53b5648e2dcf95ffc8fa149aece8d9b91a","source":{"kind":"arxiv","id":"2606.07940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.07940","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.07940v1","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07940","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"LNBORONHOAFJ","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"LNBORONHOAFJYDIG","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"LNBORONH","created_at":"2026-06-09T01:04:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LNBORONHOAFJYDIGNOAVUXFNKO","target":"record","payload":{"canonical_record":{"source":{"id":"2606.07940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-06T02:00:36Z","cross_cats_sorted":[],"title_canon_sha256":"d86037358523a869ff90339d43693f868bd99c30caa3b84dc350fbd725a6d6fd","abstract_canon_sha256":"1595bb6849f02752dbcc0f0bf8203f028646c06ddd0ad92eb2666c0e3aee71b8"},"schema_version":"1.0"},"canonical_sha256":"5b42e8b9a7700a9c0d066b815a5cad53b5648e2dcf95ffc8fa149aece8d9b91a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:56.016107Z","signature_b64":"EC5COxHx/bwlOu2LTPmp5GDrCg/QsChNUgO77aMkY+KVX71LUwv8P0HyXl0Pq/TUmsWafvDhrtwJ0ZZdyFZnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b42e8b9a7700a9c0d066b815a5cad53b5648e2dcf95ffc8fa149aece8d9b91a","last_reissued_at":"2026-06-09T01:04:56.015734Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:56.015734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.07940","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-06-09T01:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQJIs7Ck1JDgyH4xgEkXQ6NaGRhyUNhvvQ0DEL5/l2Ed9RbeIyRjAJNDI7dQojIVgL+10zPaqZtlg9wKB4U8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:11:19.656802Z"},"content_sha256":"069bdf67589742c63292d7a848c71bc8962aea9ef27896d1cdb55ef6dfe8f527","schema_version":"1.0","event_id":"sha256:069bdf67589742c63292d7a848c71bc8962aea9ef27896d1cdb55ef6dfe8f527"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LNBORONHOAFJYDIGNOAVUXFNKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SGTO-MAS: Secure Gorilla Troops Optimization for Multi-Agent LLM Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Saeid Jamshidi","submitted_at":"2026-06-06T02:00:36Z","abstract_excerpt":"Multi-agent large language model (LLM) systems offer strong capabilities for complex reasoning and decision-making, yet coordination across agents introduces error propagation, security risks, and inefficient use of resources. Existing methods often rely on heuristic, static strategies and lack a principled mechanism for balancing performance, security, and computational cost. This paper formulates multi-agent LLM coordination as a constrained optimization problem and proposes a security-aware method for adaptive agent selection. The method integrates trust modeling, risk-aware evaluation, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07940","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/2606.07940/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-06-09T01:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzYWf0A01+ND/mm/tCeQeQx1zSZWYp/uUafHNnlsJAwYz5XN9GnI2W6Jhr2ORFXpDYCwgyafcrmAyPtYzGn4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:11:19.657177Z"},"content_sha256":"960ba3f22daa85afee1ac9ad2ed252a1d82e1438c83300ff102bfd4a931b7447","schema_version":"1.0","event_id":"sha256:960ba3f22daa85afee1ac9ad2ed252a1d82e1438c83300ff102bfd4a931b7447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNBORONHOAFJYDIGNOAVUXFNKO/bundle.json","state_url":"https://pith.science/pith/LNBORONHOAFJYDIGNOAVUXFNKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNBORONHOAFJYDIGNOAVUXFNKO/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-04T18:11:19Z","links":{"resolver":"https://pith.science/pith/LNBORONHOAFJYDIGNOAVUXFNKO","bundle":"https://pith.science/pith/LNBORONHOAFJYDIGNOAVUXFNKO/bundle.json","state":"https://pith.science/pith/LNBORONHOAFJYDIGNOAVUXFNKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNBORONHOAFJYDIGNOAVUXFNKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LNBORONHOAFJYDIGNOAVUXFNKO","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":"1595bb6849f02752dbcc0f0bf8203f028646c06ddd0ad92eb2666c0e3aee71b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-06T02:00:36Z","title_canon_sha256":"d86037358523a869ff90339d43693f868bd99c30caa3b84dc350fbd725a6d6fd"},"schema_version":"1.0","source":{"id":"2606.07940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.07940","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.07940v1","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07940","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"LNBORONHOAFJ","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"LNBORONHOAFJYDIG","created_at":"2026-06-09T01:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"LNBORONH","created_at":"2026-06-09T01:04:56Z"}],"graph_snapshots":[{"event_id":"sha256:960ba3f22daa85afee1ac9ad2ed252a1d82e1438c83300ff102bfd4a931b7447","target":"graph","created_at":"2026-06-09T01:04:56Z","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/2606.07940/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-agent large language model (LLM) systems offer strong capabilities for complex reasoning and decision-making, yet coordination across agents introduces error propagation, security risks, and inefficient use of resources. Existing methods often rely on heuristic, static strategies and lack a principled mechanism for balancing performance, security, and computational cost. This paper formulates multi-agent LLM coordination as a constrained optimization problem and proposes a security-aware method for adaptive agent selection. The method integrates trust modeling, risk-aware evaluation, and","authors_text":"Saeid Jamshidi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-06T02:00:36Z","title":"SGTO-MAS: Secure Gorilla Troops Optimization for Multi-Agent LLM Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07940","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:069bdf67589742c63292d7a848c71bc8962aea9ef27896d1cdb55ef6dfe8f527","target":"record","created_at":"2026-06-09T01:04:56Z","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":"1595bb6849f02752dbcc0f0bf8203f028646c06ddd0ad92eb2666c0e3aee71b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-06T02:00:36Z","title_canon_sha256":"d86037358523a869ff90339d43693f868bd99c30caa3b84dc350fbd725a6d6fd"},"schema_version":"1.0","source":{"id":"2606.07940","kind":"arxiv","version":1}},"canonical_sha256":"5b42e8b9a7700a9c0d066b815a5cad53b5648e2dcf95ffc8fa149aece8d9b91a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b42e8b9a7700a9c0d066b815a5cad53b5648e2dcf95ffc8fa149aece8d9b91a","first_computed_at":"2026-06-09T01:04:56.015734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:04:56.015734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EC5COxHx/bwlOu2LTPmp5GDrCg/QsChNUgO77aMkY+KVX71LUwv8P0HyXl0Pq/TUmsWafvDhrtwJ0ZZdyFZnDQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:04:56.016107Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.07940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:069bdf67589742c63292d7a848c71bc8962aea9ef27896d1cdb55ef6dfe8f527","sha256:960ba3f22daa85afee1ac9ad2ed252a1d82e1438c83300ff102bfd4a931b7447"],"state_sha256":"5db5fb01f6d3b97862661ce5fb7a691e84499a4f288178afd5fa615afc787a9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTvloXppDz8ZKvjTUllNzcuofiCO72dwOXBvVJtEG+nrrcySZgwbzIKRk8NXJ9DHTBUR6/1tImFIhNrsW9dqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:11:19.659305Z","bundle_sha256":"33065fa5854a0f0ad6842c4aa5b690173dc755826f94fc11ffd01961bda3328c"}}