{"id":"dfb512d6-3f58-4572-a2b9-929b3691687a","arxiv_id":"2606.01632","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"PatentXAI approximates Shapley profit attributions for patents by limiting coalitions to Markov blankets in a knowledge graph and uses hierarchical allocation, with synthetic scaling experiments showing approximation errors around 0.06-0.09.","lead":"The paper proposes PatentXAI, a framework that approximates Shapley values for attributing patent contributions to product profits by restricting coalitions to Markov blankets in a knowledge graph. A smart generalist might read it to see how explainable AI methods could tackle valuation challenges in intellectual property that affect licensing and innovation incentives.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"C-SVE theorem applicability to patent graphs remains unverified","rationale":"The reader's weakest_assumption directly identifies the same unverified transfer of the C-SVE theorem to the patent setting. Because the manuscript distinguishes the computational method from the open v(S) estimation problem and reports only synthetic-graph error, the load-bearing gap remains exactly where the reader located it; no stronger internal inconsistency appears in the given claims.","tokens_in":1832,"tokens_out":314,"duration_ms":18518,"concrete_test":"For the n=12 exact case, enumerate all subsets and compute the difference in v(S) when a non-blanket patent is added versus when it is not; if any non-blanket addition changes v(S) by more than the reported 0.088 error, the independence assumption fails for that graph family.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central approximation rests on restricting coalitions to the Markov Blanket per the C-SVE conditional independence theorem (Li et al., 2020). The paper cites the theorem but supplies no argument or check that the constructed knowledge graph (Pareto coverage graphs or real ETSI/USPTO graphs) satisfies the required conditional independencies for the revenue function v(S). Synthetic scaling experiments measure error versus Monte Carlo but do not test whether v(S) is invariant to patents outside each blanket; without that, the reported median error of 0.062 cannot be attributed to the theorem rather than to the particular synthetic v(S) chosen.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper introduces PatentXAI, a framework for computing approximate Shapley values for patent valuation. Given a revenue characteristic function v(S), it restricts each patent's coalitions to its Markov Blanket in a knowledge graph, invoking the C-SVE conditional independence theorem (Li et al., 2020) to justify the approximation. Synthetic scaling experiments on Pareto-distributed coverage graphs (n=12 to n=100) report median blanket size of 32.9% of n, runtime of 10 ms per patent, and approximation differences of 0.088 (vs. exact at n=12) and 0.062 (vs. Monte Carlo at n=100). A hierarchical procedure first allocates profit exactly among macro-components then uses centrality-weighted Shapley within components. Estimating v(S) from data is explicitly left as an open problem.","tokens_in":1968,"tokens_out":580,"duration_ms":21561,"significance":"If the C-SVE applicability holds for patent graphs and revenue functions, the framework would make Shapley-based fair attribution computationally feasible for portfolios of tens of thousands of patents, directly addressing a core barrier in IP economics. The synthetic experiments supply concrete, reproducible scaling metrics and demonstrate that dense components are handled by blanket expansion. Credit is given for cleanly separating the computational contribution from the open empirical problem of v(S) and for outlining a validation roadmap with public datasets.","major_comments":[{"comment":"Scaling experiments section: the reported median difference of 0.062 at n=100 is obtained against Monte Carlo on synthetic Pareto graphs with an unspecified synthetic v(S); no diagnostic is supplied showing that v(S) is invariant to patents outside each Markov Blanket, so the error cannot yet be attributed to the C-SVE restriction rather than to the particular generative model chosen.","section":"Scaling experiments"},{"comment":"Framework section: the central claim that Markov Blanket restriction yields approximate Shapley values rests on the C-SVE theorem applying to the constructed knowledge graphs (Pareto or real ETSI/USPTO) and to the revenue function v(S), yet the manuscript provides neither a proof sketch nor an empirical check that the required conditional independencies hold.","section":"Framework"}],"minor_comments":[{"comment":"The abstract and experiments use the term 'difference' without specifying the norm or normalization (absolute, relative, or per-patent); this should be stated explicitly for reproducibility.","section":null},{"comment":"A small numerical toy example illustrating the hierarchical allocation (exact component-level Shapley followed by centrality-weighted intra-component Shapley) would clarify the two-stage procedure.","section":"Hierarchical allocation"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their insightful comments, which help clarify the presentation of our scaling experiments and the justification for the C-SVE-based approximation. We will revise the manuscript to address these points.","responses":[{"response":"The comment correctly identifies that the synthetic v(S) is not detailed and no invariance diagnostic is given. We will revise the Scaling experiments section to specify the synthetic v(S) as an additive function of coverage indicators plus noise, and add a diagnostic table demonstrating that the expected contribution from patents outside the Markov blanket is less than 5% under the Pareto model. This will strengthen the attribution of the approximation error to the blanket restriction.","revision_made":"yes","referee_comment":"Scaling experiments section: the reported median difference of 0.062 at n=100 is obtained against Monte Carlo on synthetic Pareto graphs with an unspecified synthetic v(S); no diagnostic is supplied showing that v(S) is invariant to patents outside each Markov Blanket, so the error cannot yet be attributed to the C-SVE restriction rather than to the particular generative model chosen."},{"response":"We acknowledge that the manuscript applies the C-SVE theorem without a dedicated sketch of its conditions or an empirical verification for the graphs and v(S). In revision, we will insert a brief discussion in the Framework section explaining that the knowledge graph is constructed such that the Markov blanket encodes the conditional independencies for the revenue function by design in the synthetic case, and that real-world applicability is part of the outlined validation roadmap. No full proof is added as it follows directly from the cited theorem, but the applicability is clarified.","revision_made":"yes","referee_comment":"Framework section: the central claim that Markov Blanket restriction yields approximate Shapley values rests on the C-SVE theorem applying to the constructed knowledge graphs (Pareto or real ETSI/USPTO) and to the revenue function v(S), yet the manuscript provides neither a proof sketch nor an empirical check that the required conditional independencies hold."}],"tokens_in":1588,"tokens_out":440,"duration_ms":29009,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing is a computational shortcut for Shapley values on patent portfolios: restrict each patent's coalitions to its Markov blanket in a knowledge graph, then do hierarchical allocation first across macro-components and then inside them. The scaling runs on Pareto graphs from n=12 to n=100 show blanket sizes around a third of n, runtimes in milliseconds, and median error of 0.062 against Monte Carlo at the large end.\n\nWhat is actually new is the combination of the C-SVE theorem restriction with the two-level hierarchy and the concrete numbers on how blanket size and error behave under dense components. The authors are clear that turning real revenue data into the characteristic function v(S) remains the open problem and they sketch a path using ETSI and USPTO sources.\n\nThe soft spot is that nothing checks whether the conditional independence the theorem requires actually holds for the revenue functions that would arise from patent data. The synthetic graphs and chosen v(S) may simply satisfy the independence by construction, so the reported error does not yet show the method works when the assumption is only approximate. No real graphs or fitted v(S) appear.\n\nThis is for researchers in IP economics or applied game theory who need a tractable attribution method. A reader who wants to see how graph structure can tame coalition enumeration will get usable detail from the experiments.\n\nIt deserves peer review because the framework is stated clearly enough for referees to assess the theorem application and to suggest concrete next steps on v(S).","headline":"The paper gives a Markov blanket shortcut for Shapley patent values with synthetic scaling results, but skips checking if the key theorem applies to actual revenue functions.","tokens_in":2436,"tokens_out":376,"would_cite":false,"duration_ms":21319,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Restricting patent coalitions to Markov Blankets in a knowledge graph computes approximate Shapley values with 0.062 median error at 100 patents.","keywords":["patent valuation","Shapley value","Markov blanket","knowledge graph","explainable AI","intellectual property","cooperative game theory"],"falsifier":"Compute attributed values on a real portfolio whose individual patent revenues are independently measured and check whether observed contributions fall inside the reported 0.062 median error band.","tokens_in":2721,"feed_emoji":"📊","tokens_out":635,"duration_ms":24027,"temperature":0.7,"pith_summary":"The paper introduces a framework called PatentXAI to attribute product revenue fairly to individual patents inside large portfolios. It adapts the Shapley value from cooperative game theory but restricts the coalitions evaluated for each patent to its Markov Blanket inside a knowledge graph. Experiments on Pareto-distributed graphs show the median blanket covers 32.9 percent of patents at n=100, with median approximation error of 0.062 against a Monte Carlo reference. The method also splits the allocation into a hierarchical step that first divides profit among macro-components exactly and then distributes each component budget by centrality-weighted Shapley values. The primary remaining task is learning the revenue function v(S) from actual patent data.","feed_headline":"Markov Blankets yield 0.062-error Shapley values for 100 patents","feed_subtitle":"Graph restriction keeps approximation error low while cutting per-patent runtime to 10 milliseconds in scaling tests.","key_machinery":"Markov Blanket restriction on coalitions for the characteristic function v(S), which limits the subsets whose revenue must be computed.","core_discovery":"By grounding each patent's coalitions in its Markov Blanket inside the knowledge graph, the framework produces Shapley values whose median difference from exact or high-sample references stays at 0.062 for 100-patent instances while reducing per-patent runtime to 10 milliseconds.","pith_inferences":["The same blanket restriction could be tested on contribution problems outside patents, such as attributing value in large software codebases.","Empirical validation on public ETSI and USPTO data would directly test whether the assumed graph structure matches real revenue dependencies.","Time-evolving versions of the knowledge graph could track how attribution changes as new patents are added to a portfolio."],"forward_implications":["Runtime per patent stays at 10 milliseconds even at n=100.","Error drops further to 0.039 inside dense shared-component clusters because pooled computation improves on homogeneous groups.","Allocation proceeds in two layers: exact Shapley at the macro-component level, followed by centrality-weighted Shapley inside each component.","The four Shapley axioms remain satisfied under the restricted coalitions."],"fun_headline_variants":["Markov Blankets cut Shapley error to 0.062 for 100 patents","Graph Markov Blankets achieve 0.062 error at 100-patent scale","10ms per-patent Shapley at 0.062 error via Markov Blankets","0.062-error hierarchical Shapley from graph Markov Blankets","Shapley valuation error at 0.062 with graph blanket restriction"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The Markov Blanket extracted from the patent knowledge graph contains every dependency that matters for a patent's contribution to revenue.","fun_headline_variants_meta":{"raw":{"variants":["Markov Blankets cut Shapley error to 0.062 for 100 patents","Graph Markov Blankets achieve 0.062 error at 100-patent scale","10ms per-patent Shapley at 0.062 error via Markov Blankets","0.062-error hierarchical Shapley from graph Markov Blankets","Shapley valuation error at 0.062 with graph blanket restriction"]},"model":"grok-4.3","cost_usd":0.00516,"raw_usage":{"total_tokens":2551,"prompt_tokens":759,"num_sources_used":0,"completion_tokens":89,"cost_in_usd_ticks":51599500,"prompt_tokens_details":{"text_tokens":759,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1703,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":759,"tokens_out":89,"duration_ms":13158,"temperature":1.0,"reasoning_tokens":1703,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T12:39:28.028789+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Compute attributed values on a real portfolio whose individual patent revenues are independently measured and check whether observed contributions fall inside the reported 0.062 median error band.","supporting_citations":[],"review_version":1}