{"_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_4d1c7647a664fb7d012eaa00b45b8c6017b58a81e04189a7fbbe0656f21dff84","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_4d1c7647a664fb7d012eaa00b45b8c6017b58a81e04189a7fbbe0656f21dff84","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"62ac4af11679bde2829102bd79cc2d69623a25dc4ba2b363cdd982dfad2c3b9b","published":"Fri, 08 May 2026 00:00:00 -0400","receipt_hash":"62ac4af11679bde2829102bd79cc2d69623a25dc4ba2b363cdd982dfad2c3b9b","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":"62ac4af11679bde2829102bd79cc2d69623a25dc4ba2b363cdd982dfad2c3b9b","observed_at":"2026-05-08T04:43:40.537619Z","parent_run_hash":"9837a17a0d4866b3bef2929e933ca29d96f4bd9656766df36f8260d720835b95","published":"Fri, 08 May 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:2512.18034v3 Announce Type: replace \nAbstract: Discrete facility layout design involves placing physical entities to minimize handling costs while adhering to strict safety and spatial constraints. This combinatorial problem is typically addressed using Mixed Integer Linear Programming (MILP) or Constraint Programming (CP), though these methods often face scalability challenges as constraint density increases. This study systematically evaluates the potential of Conflict-Driven Clause Learning (CDCL) with VSIDS heuristics as an alternative computational engine for discrete layout problems. Using a unified benchmarking harness, we conducted a controlled comparison of CDCL, CP-SAT, and MILP across varying grid sizes and constraint densities. Experimental results reveal a distinct performance dichotomy: while CDCL struggles with optimization objectives due to cost-blind branching, it demonstrates unrivaled dominance in feasibility detection, solving highly constrained instances orde","title":"Accelerating Discrete Facility Layout Optimization: A Hybrid CDCL and CP-SAT Architecture","url":"https://arxiv.org/abs/2512.18034","vendor":"arxiv_cs_ai"},"summary":"arXiv:2512.18034v3 Announce Type: replace \nAbstract: Discrete facility layout design involves placing physical entities to minimize handling costs while adhering to strict safety and spatial constraints. This combinatorial problem is typically addressed using Mixed Integer Linear Programming (MILP) or Constraint Programming (CP), though these methods often face scalability challenges as constraint density increases. This study systematically evaluates the potential of Conflict-Driven Clause Learning (CDCL) with VSIDS heuristics as an alternative computational engine for discrete layout problems. Using a unified benchmarking harness, we conducted a controlled comparison of CDCL, CP-SAT, and MILP across varying grid sizes and constraint densities. Experimental results reveal a distinct performance dichotomy: while CDCL struggles with optimization objectives due to cost-blind branching, it demonstrates unrivaled dominance in feasibility detection, solving highly constrained instances orde","title":"Accelerating Discrete Facility Layout Optimization: A Hybrid CDCL and CP-SAT Architecture","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-08T04:43:40Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2512.18034"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:48a2311bed2d36b2dc134f6e0aa4801c1a4f30fb365fbce9faa8deb12b2896fa9c8cddaf055f3a6d467e762c8559da83e7357a19d25b688f6a513b2deb35d607","signer":"crovia.substrate","subject":{"observed_at":"2026-05-08T04:43:40Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2512.18034"},"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":"a487ca1c8e696ef72953e6545a90ff2c899c35c0bf228ee4d7d1e99ad2646819","leaf_index":120372,"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":"790cf0652bccfe1c7cb47fe989cde4bb734d5db42ca21174400bd08d753e7b16","side":"right"},{"sibling":"aedaa8f2980b9489c174757a20683fa0781cab5645e243f7ac01ffbeb2d58b89","side":"right"},{"sibling":"b0a6998cf8627bcf2806611c876631ea4745a548d0899d28896347db56b512ba","side":"left"},{"sibling":"ff2043110e5cf90555f8f6cf67506747cc222954ed1f00d9ef4000868c2a658b","side":"right"},{"sibling":"1603bf82e8b8a8d9efbaee62b58f1f09eaf1c84c32789531567d48356f190626","side":"left"},{"sibling":"c98bcc19060c2c055828ad547492d7b86f77bd9652fb744d30cf86867fdbaa06","side":"left"},{"sibling":"ff6dfc3e3819926f225fca4697d75146861a953457867e78f1a01b86559feac7","side":"right"},{"sibling":"621ce3a316503da6017cc9f955ea0dca3f50bbc1e8fc10ed72f522e60e814e3f","side":"right"},{"sibling":"7cb9b06d4f6372fac19d788263daadfaf6def57cc0a73d46bed8b284ec0fe014","side":"right"},{"sibling":"42ade783b0aede9d0209c5be94ac7979e635da84dd65ecb4d383719029bbe8f4","side":"left"},{"sibling":"143f33d3924b3840fd6dd8ba12566fc35bf86189e663ef0ad4884d676f295e3a","side":"left"},{"sibling":"b1ed99341c327c7c9ab2489f40af2547ab3b3b4b6a74fb684210164fb891a413","side":"right"},{"sibling":"6ee3be9bdfc9bee55d32f7dbb0075f02fe87d20887d563d3e300caf36b1b88c7","side":"left"},{"sibling":"8ccd9937a2c0d5c04044d07d1557791b7d07bb31eac41a39a675608d44b38f23","side":"right"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"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":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","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_4d1c7647a664fb7d012eaa00b45b8c6017b58a81e04189a7fbbe0656f21dff84"}}