{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_148c95ca015a4c93d33333999373609b5fd6edd2dc1749b31d28d1cc851753db","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_148c95ca015a4c93d33333999373609b5fd6edd2dc1749b31d28d1cc851753db","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"25ebe674ee2184fda837ae0c675ed0fa62f4e95af15a5650e679e810e9c635db","published":"Mon, 15 Jun 2026 00:00:00 -0400","receipt_hash":"25ebe674ee2184fda837ae0c675ed0fa62f4e95af15a5650e679e810e9c635db","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"25ebe674ee2184fda837ae0c675ed0fa62f4e95af15a5650e679e810e9c635db","observed_at":"2026-06-15T04:43:09.998079Z","parent_run_hash":"ded7a5fa7968821af82d6d8d24b2c1f7e7d776433180609016edbdee95e78c1a","published":"Mon, 15 Jun 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2604.24117v2 Announce Type: replace \nAbstract: Efficient job-shop scheduling with transportation resources is critical for high-performance manufacturing. With the rise of \"decentralized factories\", multi-agent reinforcement learning has emerged as a promising approach for the combined scheduling of production and transportation tasks. Prior work has largely focused on developing novel cooperative architectures while overlooking the question of when joint training is necessary. Joint training denotes the simultaneous training of job and automatic guided vehicle scheduling agents, whereas modular training involves independently training each agent followed by post-hoc integration. In this study, we systematically investigate the conditions under which joint training is essential for optimal performance in the job-shop scheduling problem with transportation resources. Through a rigorous sensitivity analysis of resource scarcity and temporal dominance, we quantify the coordination g","title":"An Analysis of the Coordination Gap between Joint and Modular Learning for Job Shop Scheduling with Transportation Resources","url":"https://arxiv.org/abs/2604.24117","vendor":"arxiv_cs_ai"},"summary":"arXiv:2604.24117v2 Announce Type: replace \nAbstract: Efficient job-shop scheduling with transportation resources is critical for high-performance manufacturing. With the rise of \"decentralized factories\", multi-agent reinforcement learning has emerged as a promising approach for the combined scheduling of production and transportation tasks. Prior work has largely focused on developing novel cooperative architectures while overlooking the question of when joint training is necessary. Joint training denotes the simultaneous training of job and automatic guided vehicle scheduling agents, whereas modular training involves independently training each agent followed by post-hoc integration. In this study, we systematically investigate the conditions under which joint training is essential for optimal performance in the job-shop scheduling problem with transportation resources. Through a rigorous sensitivity analysis of resource scarcity and temporal dominance, we quantify the coordination g","title":"An Analysis of the Coordination Gap between Joint and Modular Learning for Job Shop Scheduling with Transportation Resources","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-15T04:43:09Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2604.24117"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:2d9bd66d923fb0e3dcb50cb77d086e27933815fdc6540b0b323057277885dc9ba2ead5390bc0385b1d357423cc8d87a8ef1a2302ded216581ae5b22f8df2d003","signer":"crovia.substrate","subject":{"observed_at":"2026-06-15T04:43:09Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2604.24117"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"94e8d1d4ba3fe7cf336a59389b6f34ac1a4995491e2125b330ede29a84e68adc","leaf_index":230083,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"fb3d7ad8373fba4aaa243c173b15569defd8d8293c2bf5d339c2071871bdcdeb","side":"left"},{"sibling":"1654cea49e5e09c0a442e704ef4b5902bc699e16b17cbb51890a62ae526d57b6","side":"left"},{"sibling":"3ea7e9da1c2ed21e14f4460998f2fbfedcde305c7e857f38c5972cc10790fd41","side":"right"},{"sibling":"be767ff01fbe9498ab3dcad2ceddfb1e4d66205a6b9d7b97f1a892e636bd34b9","side":"right"},{"sibling":"cc9e8de7acae62a1dd2dd9e91ff6a55164c59f5f22945d265ba7f02b101b3eb0","side":"right"},{"sibling":"b3d02861b16814ea42b250dc8a1f0b97072719b6189b27c0040dd88f33f7ae62","side":"right"},{"sibling":"777fc65e1d77be32b2c8951245c948dfc18781d8f5bfe13e83f1975313bc571c","side":"left"},{"sibling":"4facde6857295772880043256429f729859e11968ea6221d9fa688e71b3a2184","side":"left"},{"sibling":"14c50c43949e1ad41f149ffea691627d3f715c5861766c693b9fbac9d03b0d90","side":"right"},{"sibling":"74897e850164dddc689c3c65b33f9bae0268ab0bf429867a4e193d9b9b685040","side":"left"},{"sibling":"bde25d7e94e64717e426a97f6fcb4907e92b5c61fc89d92d7e0947a2249c3f6b","side":"right"},{"sibling":"d10d772a4984cae00e65ab24af21d1d260e475bbaae3f17871859eb705bd3999","side":"right"},{"sibling":"e79159853f2f35ddae8e3247d515e433c534277b287d65bbd77ae989aa4992fa","side":"right"},{"sibling":"3054319f1840cce0eaaf0bc4b1ae38e5bf8b6210927d924a750775cc7d77cca6","side":"right"},{"sibling":"0fd8b5059f279c4a4a6688de2472fdbc25543fee183df19b21dacca880354cff","side":"right"},{"sibling":"a04392fb9f2a3a620840e3b3fecd93d12e6d224e481c162389d8ae64e7194599","side":"left"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":232015,"merkle_root":"62bfb7809bb55667ad7eeebdb48267b9b2c1ee89bb808ea1e6d3a814a15aa402","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260617T133701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-17T13:39:59Z","sig_algorithm":"ed25519","signature":"930a3563c643cc7518d048b12a1f5392a96a5edce49533ba0a56f11b6cc69319bb1c800aacc46b52a6941c4d05dae255a45cac757d6093c971b96852c24f140e","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_148c95ca015a4c93d33333999373609b5fd6edd2dc1749b31d28d1cc851753db"}}