{"_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_15ebf1577a8246ebe1b8a5b422b24cf070fd888133200c9a3a683eb7b54a0367","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_15ebf1577a8246ebe1b8a5b422b24cf070fd888133200c9a3a683eb7b54a0367","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"6669a295977e32b7f0d8c4786ca50ea7a744681c216e32985f6e0f23395de14e","published":"Wed, 22 Jul 2026 00:00:00 -0400","receipt_hash":"6669a295977e32b7f0d8c4786ca50ea7a744681c216e32985f6e0f23395de14e","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":"6669a295977e32b7f0d8c4786ca50ea7a744681c216e32985f6e0f23395de14e","observed_at":"2026-07-22T04:43:18.261256Z","parent_run_hash":"4765c85b8b4b27ff9a690c1ae11c3b009baa2c60297295f395ad422f5afed68c","published":"Wed, 22 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.19270v1 Announce Type: cross \nAbstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap. Standard models rely on transductive feature initializations that tie travel demand to fixed network topologies, preventing seamless transfer to new urban environments. To overcome this structural limitation, this research proposes a network-agnostic initialization layer, termed Geometrically Unconstrained Inductive Demand EmbeDding (GUIDED). By injecting travel demand as a scalar attribute on auxiliary virtual links rather than as specific node features, this modular framework standardizes the input space regardless of network scale. Extensive experimental evaluation across multiple urban topologies demonstrates that a Heterogeneous Graph Attention Network (HetGAT) ","title":"GUIDED Network-Agnostic Feature Initialization for Spatial Transferability in GNN-based Models","url":"https://arxiv.org/abs/2607.19270","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.19270v1 Announce Type: cross \nAbstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap. Standard models rely on transductive feature initializations that tie travel demand to fixed network topologies, preventing seamless transfer to new urban environments. To overcome this structural limitation, this research proposes a network-agnostic initialization layer, termed Geometrically Unconstrained Inductive Demand EmbeDding (GUIDED). By injecting travel demand as a scalar attribute on auxiliary virtual links rather than as specific node features, this modular framework standardizes the input space regardless of network scale. Extensive experimental evaluation across multiple urban topologies demonstrates that a Heterogeneous Graph Attention Network (HetGAT) ","title":"GUIDED Network-Agnostic Feature Initialization for Spatial Transferability in GNN-based Models","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-22T04:43:18Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.19270"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:f53f2332b8ece32f91433cf67cb5c0bac4b54a95afbe9843174a163d5946dfc18121a94c2cce956c23cad91ca18366c6c250b895e36aec3f8386ce8cb437f00f","signer":"crovia.substrate","subject":{"observed_at":"2026-07-22T04:43:18Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.19270"},"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":"291708f0a6991af6eaa9d824f70a6aee70badf1991fbc8bb04ae4e9e2b12828a","leaf_index":340320,"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":"d1627dccd0d8bda328e016dfbccf859a89de45ad19ddb0677922401e3e9f5eb2","side":"right"},{"sibling":"f6041940340c006e325400031cae2367138a4e635b192886fa3c15143571cdb0","side":"right"},{"sibling":"4b98533449589736e3574e77a1da21afe7efcfd695a92b79dc327d7ef0e99819","side":"right"},{"sibling":"aee12f7a9507c013b59adc65ca4537edca1980e3aa88b85ee1104e573b3a1939","side":"right"},{"sibling":"677553313e7792eaf4e264cd17b20bf5684c4b302bc7d2ae9b2875542372a5d7","side":"right"},{"sibling":"cb0ed9dbc614040ae574d9ceb6bce8dc8e1c6fb07bcc920e0ca7015465e607a5","side":"left"},{"sibling":"8802f296fb33ebb1f95ce56604f2c35b5365467e892c99b8d3e26d404adfa3df","side":"left"},{"sibling":"617d94b8a1da646ac45b4d986747eccb1604c294cb2a78b6cf4c70df505a76f4","side":"right"},{"sibling":"99d4b7aea5e7c917c580af0f1a9556bbd4d44f3f36cf9391892e7ef0340a8258","side":"left"},{"sibling":"c7fc9d4187cdc36f4c03b4b13daf4b880ea65536b051f71a5cc2543839d02697","side":"right"},{"sibling":"1758ec6ac206ce40e8368cb702195322fe3737d0fb03d8bd9e3b30acc4fa7d81","side":"right"},{"sibling":"0c407f0d553cf3fab8f9bd79205b8180e090cbf29fa0490ebb55155041ad5c86","side":"right"},{"sibling":"2dd9cb2521044ee7c6b74f2315e0a0253b8df0d04a7b810bbbbe7da5a9788769","side":"left"},{"sibling":"21d66dd41003813f710b7617944f1bfba3258658a5d3370c21cad8f9e945bc99","side":"left"},{"sibling":"787ee3744642ff909d610b0514cb100784f0ef1ba0ef4c70a0dc91f0ab2bb192","side":"right"},{"sibling":"9fc8a8ebbc1bff7e62b9f1e1c681c91e7196092ce9551573df6e23096df13e4d","side":"right"},{"sibling":"77025bcb374a7ad74f520643e20a8ae1205a7ee78507b0beb93117760f1c29d3","side":"left"},{"sibling":"ee6f33920899d9bdef2eb706dfff29e26eea61e29ea9824c6c8e6bcd48275d76","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":340557,"merkle_root":"7d45d94f20b5bf82263df45b87749e19e06161972f25141dd573cc138d566338","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260722T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-22T05:38:39Z","sig_algorithm":"ed25519","signature":"812cb61e90d3582ba508db8515c4168bbf8ee1c6762885609049d012f680f8068f15c98b9accf2042047dcfc6a6fc3885820ee34b0be350846386f64f2591309","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_15ebf1577a8246ebe1b8a5b422b24cf070fd888133200c9a3a683eb7b54a0367"}}