{"_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_6d1d049a6defeff82cd6e6dacf59d38929a2d08433ff7ef401d26157e438bd9a","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_6d1d049a6defeff82cd6e6dacf59d38929a2d08433ff7ef401d26157e438bd9a","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"211a11075e3b4208f8517d6acd51c15ff3efd6e84cf02b863c42ef9a9fc3947f","published":"Fri, 12 Jun 2026 00:00:00 -0400","receipt_hash":"211a11075e3b4208f8517d6acd51c15ff3efd6e84cf02b863c42ef9a9fc3947f","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":"211a11075e3b4208f8517d6acd51c15ff3efd6e84cf02b863c42ef9a9fc3947f","observed_at":"2026-06-12T04:43:44.933383Z","parent_run_hash":"a8b304a31db3809a528f5a45e58597f7bb9f23028e53b4f9ed2f5599dd731b5e","published":"Fri, 12 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:2606.12581v1 Announce Type: cross \nAbstract: Real-world networks are inherently incomplete, noisy, and dynamically evolving, making it difficult to capture all actors and their relationships. Their scale often renders direct analysis computationally demanding. While influence maximisation (IM) has been widely studied, the role of graph reduction as a preprocessing step, and its impact on IM accuracy, remains underexplored. In this work, we introduce the Spreading-Oriented Reduction Benchmark (SORB), an open-source, standardised framework for systematically evaluating IM models across diverse task settings. SORB provides an extensible pipeline operating on a representative collection of real-world networks, including single- and multilayer structures, and accounts for graph reduction directly into the evaluation process. This design shifts the focus from analysing IM algorithms in isolation to quantifying how graph reduction alters predictive performance. Using SORB, we study the ","title":"Graph Reduction in Multirelational Networks: A Spreading-Oriented Reduction Benchmark","url":"https://arxiv.org/abs/2606.12581","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.12581v1 Announce Type: cross \nAbstract: Real-world networks are inherently incomplete, noisy, and dynamically evolving, making it difficult to capture all actors and their relationships. Their scale often renders direct analysis computationally demanding. While influence maximisation (IM) has been widely studied, the role of graph reduction as a preprocessing step, and its impact on IM accuracy, remains underexplored. In this work, we introduce the Spreading-Oriented Reduction Benchmark (SORB), an open-source, standardised framework for systematically evaluating IM models across diverse task settings. SORB provides an extensible pipeline operating on a representative collection of real-world networks, including single- and multilayer structures, and accounts for graph reduction directly into the evaluation process. This design shifts the focus from analysing IM algorithms in isolation to quantifying how graph reduction alters predictive performance. Using SORB, we study the ","title":"Graph Reduction in Multirelational Networks: A Spreading-Oriented Reduction Benchmark","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-12T04:43:44Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.12581"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:e86fb82d1613d33f2c32cf19705c0e4e8964b6530a4da75cfbf49cb9cf8615b4f1a1f2e5ee3e7983419c434ece6742f18609ca4a71ca698c9f6ebf8a4e562707","signer":"crovia.substrate","subject":{"observed_at":"2026-06-12T04:43:44Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.12581"},"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":"ce086068392d0b0b83ad581df297a5684b149a2999c2e7a7b3969ab6467b6641","leaf_index":229698,"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":"ae84403bc26e7f4d02369e7b3cc62cf787ef8ecdb6f5187e483341b1f209cd30","side":"right"},{"sibling":"0fc20a55f055e0cb65d5bac9eaa46532f84c5c73b9d9361b11ec954c52ef26b9","side":"left"},{"sibling":"0cd65f2fd3a3ac943221ef4c26c2f7a0eeff1932fd7cc68e85853a1019e36367","side":"right"},{"sibling":"74f312b63b6865e3aeb55d2449c6b019d411a7f941d40e64095fb8c59b73ce03","side":"right"},{"sibling":"54e41c28fda635a406f5785cf26a87e92ce908de37d6b5d4f6cab57ac791d823","side":"right"},{"sibling":"5380a936d74d0adc66b40a3e3394b9eb31a88fb0fff9238f8608693ed1af2a66","side":"right"},{"sibling":"0ca5d90d5f62d6d9de0ef1d339c845218f95e05c41fdf78f0b9091a094387002","side":"left"},{"sibling":"2654c48172d365d1cff889fbe9c8f8e481d6ccd161a53a1f187cd0415e9830c1","side":"right"},{"sibling":"99d288e6cd43a807fba958865176bb1c08b82471afe942f6e4989eaeeb7275aa","side":"left"},{"sibling":"d385017d38a86f6abc492026a7cd60ceb3b3ff2486142dc49e5acb179f4b7d11","side":"right"},{"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_6d1d049a6defeff82cd6e6dacf59d38929a2d08433ff7ef401d26157e438bd9a"}}