{"schema_version":1,"experiment_id":"eoa_inverse_innovation_exp04_retrieval_first_paired20_20260802","cell_id":"invariant_mode_decomposition_design__library_information_science","hypothesis_id":"H4","search_queries":["interlibrary loan routing algorithm centrality lender selection network resilience","interlibrary loan lender string routing load balancing capacity turnaround time","library resource sharing network eigenvector centrality node removal robustness","patent interlibrary loan routing lender selection algorithm","\"interlibrary loan\" \"queue depth\" lender routing","resource sharing request routing load balancing libraries smart lender string","\"Application of social network analysis in interlibrary loan services\" PDF","\"A library network model\" interlibrary loan queueing network PDF"],"sources":[{"source_id":"C1","title":"Smart lender strings through the Automated Request Manager","publisher":"OCLC Support","url":"https://help.oclc.org/Resource_Sharing/WorldShare_Interlibrary_Loan/Smart_fulfillment/040Smart_lender_strings_through_the_Automated_Request_Manager","source_class":"COMMERCIAL_FIRST_PARTY","claims_supported":["WorldShare automatically filters eligible ILL lenders and orders lender strings using turnaround time.","The operational routing calculation incorporates each lender's current queue depth specifically to avoid overwhelming individual lenders.","Historical turnaround is recalculated daily and queue depth hourly, establishing dynamic load-aware ILL routing as deployed practice."]},{"source_id":"C2","title":"How does DOCLINE routing work?","publisher":"U.S. National Library of Medicine","url":"https://www.nlm.nih.gov/docline/context_help/context_help_routing_choices.html","source_class":"OFFICIAL_GUIDANCE","claims_supported":["DOCLINE generates lender candidates using holdings, participation status, delivery method, service level, embargo, payment, and exclusion constraints.","Within routing-table cells and broader eligible groups, DOCLINE randomly routes requests, providing an existing diversification mechanism rather than always selecting the highest-volume lender.","Routing proceeds across prioritized cells and prevents repeat routing of the same request to a previously tried institution."]},{"source_id":"C3","title":"Resource Sharing Settings","publisher":"Open Library Foundation ReShare","url":"https://openlibraryfoundation.atlassian.net/wiki/spaces/PR/pages/1077706753/Resource%2BSharing%2BSettings","source_class":"OFFICIAL_PRODUCT_DOCUMENTATION","claims_supported":["ReShare constructs supplier rotas from libraries with lendable holdings.","Its shared-inventory routing adapter orders eligible suppliers using a ratio-based load-balancing process.","Supplier selection and ordering are configurable routing functions within an operational resource-sharing platform."]},{"source_id":"C4","title":"Distributed Location of the Critical Nodes to Network Robustness based on Spectral Analysis","publisher":"arXiv","url":"https://arxiv.org/abs/1101.5019","source_class":"PRIMARY_RESEARCH","claims_supported":["The paper ranks network nodes for robustness using localized spectral-gap analysis and validates criticality through node-removal effects.","It reports cases where the node causing the greatest connectivity damage is not the highest-degree node.","The work establishes spectral critical-node identification and removal-based robustness testing in a neighboring network-routing domain, but not in interlibrary loan."]}],"proximity":"SUBSTANTIAL_COLLISION","closest_analogues":[{"name":"OCLC WorldShare smart lender strings","similarity":"A deployed ILL router dynamically orders eligible lenders using service time and current queue depth to distribute requests and avoid lender overload, closely matching the workflow boundary, load objective, and fulfillment-time constraint.","remaining_difference":"It does not disclose a rolling request-flow spectral dependency score, dominant eigenvector ranking, or simulated node-loss sensitivity as the diversification trigger.","source_ids":["C1"]},{"name":"ReShare ratio-based supplier load balancing","similarity":"An operational resource-sharing system selects eligible suppliers and orders them through explicit load balancing.","remaining_difference":"The documented policy is ratio-based rather than topology-aware and does not test whether removal of a structurally pivotal lender disrupts consortium fulfillment.","source_ids":["C3"]},{"name":"DOCLINE randomized eligible-lender routing","similarity":"DOCLINE already diversifies eligible requests across lenders within policy-defined routing cells instead of deterministically concentrating every request on one institution.","remaining_difference":"Its documented randomization and preference cells do not use network centrality, dominant modes, or counterfactual node-removal sensitivity.","source_ids":["C2"]},{"name":"Spectral critical-node localization with removal testing","similarity":"The research uses spectral graph structure to identify nodes whose removal most harms connectivity and shows that degree can miss the critical node.","remaining_difference":"It analyzes generic undirected-network connectivity using localized Laplacian spectral gaps, not directed weighted ILL request flows, dominant-eigenvector dependency, lender assignment, load share, or fulfillment latency.","source_ids":["C4"]}],"overlapping_components":["Eligible-lender candidate filtering","Automated lender ordering","Dynamic queue-aware load balancing","Randomized or ratio-based routing diversification","Turnaround-time-aware routing","Network-node criticality ranking","Spectral robustness analysis","Node-removal sensitivity testing","Comparison against degree-based importance"],"remaining_contrastive_claim":"Within the reviewed sources, the remaining distinction is an ILL routing policy that derives lender dependency from a rolling request-flow spectrum, confirms it through fulfillment-specific node-loss replay, and diversifies eligible assignments when that sensitivity crosses a threshold while constraining median fulfillment time.","claim_falsifier":"The contrastive claim would be falsified by product documentation, source code, a patent, or an empirical ILL study showing that an operational or replayed lender router already combines rolling spectral dependency scores, node-loss fulfillment sensitivity, threshold-triggered diversification, and a fulfillment-time constraint.","problem_support":"STRONG","recommendation":"RESEARCH","world_novelty_boundary":"This eight-query, four-source ordinary-web review is a bounded prior-art screen, not a world-novelty conclusion; it found substantial component-level collision and deployed non-spectral ILL load balancing, but no opened source implementing the complete contrastive combination, and unindexed patents, proprietary routing logic, local consortium systems, and terminology-mismatched research could still contain it."}