{"_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_810fdaa0bb80724f228ebfc09c705a1ec99dfea026a8ae38f2b1138dc501ef7f","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_810fdaa0bb80724f228ebfc09c705a1ec99dfea026a8ae38f2b1138dc501ef7f","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"3d2c191ab6bffac24d82074235b0105be2e8a6abb71c7fa48933cbbb88b9a859","published":"Fri, 24 Jul 2026 00:00:00 -0400","receipt_hash":"3d2c191ab6bffac24d82074235b0105be2e8a6abb71c7fa48933cbbb88b9a859","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":"3d2c191ab6bffac24d82074235b0105be2e8a6abb71c7fa48933cbbb88b9a859","observed_at":"2026-07-24T04:43:08.456021Z","parent_run_hash":"b018378f86139a28e6209ec008b31c1282cd1b5c1632dbd43b054c17aa88ab96","published":"Fri, 24 Jul 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:2607.21354v1 Announce Type: new \nAbstract: For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects. Each planning task from static network planning to dynamic warehouse assortment planning requires analysts to spend weeks building models from scratch, calibrating and persuading executives to act on outputs they cannot verify. Three barriers drive this: bespoke models proliferate because standardization is difficult (operational fragmentation); once unified, the combinatorial scale of millions of SKUs, thousands of nodes, and intricate routing logic exceeds what solvers can handle within a tight window (computational intractability); and a mathematically optimal solution still fails to be implemented if the executives do not trust it (implementation hurdle). To bridge this gap, we propose and implement the Simulation-Propose-then-OR-Dispose method, deployed as JD.com's NetSim platform. The central insight is decoupling: simulation pro","title":"SPORD: A Simulation-Propose-then-OR-Dispose Approach for Supply Chain Planning","url":"https://arxiv.org/abs/2607.21354","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.21354v1 Announce Type: new \nAbstract: For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects. Each planning task from static network planning to dynamic warehouse assortment planning requires analysts to spend weeks building models from scratch, calibrating and persuading executives to act on outputs they cannot verify. Three barriers drive this: bespoke models proliferate because standardization is difficult (operational fragmentation); once unified, the combinatorial scale of millions of SKUs, thousands of nodes, and intricate routing logic exceeds what solvers can handle within a tight window (computational intractability); and a mathematically optimal solution still fails to be implemented if the executives do not trust it (implementation hurdle). To bridge this gap, we propose and implement the Simulation-Propose-then-OR-Dispose method, deployed as JD.com's NetSim platform. The central insight is decoupling: simulation pro","title":"SPORD: A Simulation-Propose-then-OR-Dispose Approach for Supply Chain Planning","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-24T04:43:08Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.21354"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:73e969cd0d11edc449987d3e37dcfb9979fcbd8611c4287c34dec8a2b55c3639edb2f4c70a887fb8e79ea2031c9a5717affdb4e3b2ec3ea08a07f846cc158302","signer":"crovia.substrate","subject":{"observed_at":"2026-07-24T04:43:08Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.21354"},"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":"464ccd8941d69e364e2edc421db4fff8e9204f07dffbfa386d5a63afe31b3241","leaf_index":347048,"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":"38b56fc68510320bcec9d1e883b049f10e494b2e7eed05c973f1f4b6eaf9d5cf","side":"right"},{"sibling":"609f2eb99af9a8a67047e2e107393041984a2dee3d327eaaf0eea174cbefebce","side":"right"},{"sibling":"3c064ea62d5c71b55961d6057dea3c2f85a1d8badebb40a272a2bcc418dc85b3","side":"right"},{"sibling":"c0ac469fdaa4eeb152b8327845eb68bb72b97851490564aadd88e825394daf1e","side":"left"},{"sibling":"9bc1243164793a5595fdf94a9704736aedef1110100e57802bd8272a119b8c37","side":"right"},{"sibling":"35324677b23e55f1ffa43dd5b4dd9dc3c11e5ce4d8e088d669a002edfb294b27","side":"left"},{"sibling":"09a4759d227421c77e1462a3c333b1907095af488295f5ae40a2926b1ac32eed","side":"right"},{"sibling":"735b40cd86add2eb12982a84f45647b35267af61e771b38192432357dac71eb1","side":"left"},{"sibling":"c212fcc83c532c0321804b72fe72b546946bb055d3d482aab19c43f5bebfbf3f","side":"left"},{"sibling":"da189c159d0789c2229cf3731890cc753832dab1aa83e4bbf0fac01955c22cd8","side":"left"},{"sibling":"3a02ed8ea41a09957282e4e27db74ed88cd675156461abb02acb28e2cd257e63","side":"right"},{"sibling":"d3139af8c5ce235438e1c69e4b7afa44ba09129fd86674968434f23e546f423e","side":"left"},{"sibling":"cb89775a838ee16d10fc8da3213420c2012b4d96e8d55cd49939b0887a4b92d3","side":"right"},{"sibling":"252d30ea8052c3bb6b40bc5cc29fc9b9725343d212f84c08fbbae4215a125b00","side":"right"},{"sibling":"f3e45bceed774d2402fa45d41ff5190f295823bd2f216eb90157884150034693","side":"left"},{"sibling":"3cfa2102c0224815c6f3bf73e6710e24103f43f7bf5da1ca2abad1416d9c0890","side":"right"},{"sibling":"77025bcb374a7ad74f520643e20a8ae1205a7ee78507b0beb93117760f1c29d3","side":"left"},{"sibling":"e871fd7edf9b2ad89bce1609a028f5225eea4d14372169bac242420830f86530","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","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":347413,"merkle_root":"9efe042c5dd6583dfd3b6a58fbfc289807f60bcf2bd2927f10488a54a8ba11fc","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260724T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-24T05:38:42Z","sig_algorithm":"ed25519","signature":"8633c55f558d42994850505218b2862c6134bad2b1c80d4b80736c2fd3ea7a19690ca3498727a8adbdc47791176128a8d64bef0883b888db809f0477355bd00c","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_810fdaa0bb80724f228ebfc09c705a1ec99dfea026a8ae38f2b1138dc501ef7f"}}