{"id":"c5085328-2d7f-4433-b1ef-ab8674f5552f","arxiv_id":"2501.00612","paper_version":1,"verdict":"REJECT","confidence":"LOW","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The authors state a Shannon-style rate bound for communication with deductive reasoning, governed by a function they call logical semantic entropy, but provide no proof in this text.","lead":"This paper claims that a receiver who can perform logical deduction needs far fewer bits than Shannon's classical bound, and introduces a new rate formula called logical semantic entropy. It is a short announcement whose proofs are deferred to a same-author companion paper.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1 is asserted without proof or precise definitions; all load-bearing mathematical content is deferred to companion [24], so the central claim is unverifiable from this manuscript.","rationale":"The reader's formal 'weakest_assumption' identified strong soundness/completeness as the fragile premise. That is a real limitation for practical reasoners, but it is not the most load-bearing concern: Theorem 1 is explicitly conditional on such a logic, and propositional logic does enjoy strong completeness. The more fundamental problem is that the proof of Theorem 1, the precise i.i.d. kernel model, and the implementation details of the empirical codes are all deferred to companion reference [24]. This is not a minor presentation issue: the central mathematical claim is an assertion in this manuscript, so correctness cannot be checked without external material. The reader's overall rationale did mention the missing proof, which is why my agreement is partial rather than full. I do not claim Theorem 1 is false; the evidence is insufficient to reach either acceptance or rejection. The appropriate status is unverified pending inspection of the companion paper. If the companion proof is complete and correct, the present paper still needs major revisions to be self-contained, but the mathematical claim could stand. If the companion proof is absent or flawed, the headline semantic gains are unsupported.","tokens_in":8797,"tokens_out":9427,"duration_ms":92026,"concrete_test":"Retrieve arXiv:2301.10414 and locate the theorem matching the present Theorem 1. Verify (i) the achievability proof gives expected normalized cost at most Lambda(p_s, p_r - p_q) + O(m/2^m) under exactly the entailment conditions S_m entails Q_m and Q_m entails R_m, with no unstated restrictions; (ii) the lower bound is proved for the stated i.i.d. kernel model and applies to every algorithm; (iii) the definitions of p_s, p_q, p_r and the O(m/2^m) term match this paper's notation and Figure 2 parameters. If any of these elements is missing, only weaker, or inconsistent, the central claim is unsupported.","verdict_should_be":"UNVERDICTED","load_bearing_attack":"The paper's central result, Theorem 1, is stated and then immediately followed by 'This results holds more generally beyond Propositional Logic - see (24).' No derivation is given in the text; the authors explicitly write that 'Arguing why and how these techniques result in such an optimal systems is beyond the scope of this paper and fully addressed in (24),' and the probabilistic 'i.i.d.' model used for the lower bound also has 'Precise definitions ... in (24).' Thus the advertised upper and lower bounds, the O(m/2^m) term, and the integer-multiple gains in Figure 2 all rest on an external companion paper that is not examined in this submission. The stated assumption of a strongly sound and strongly complete logic is not the weakest point: propositional logic is strongly complete, and the theorem is conditional on that property. The genuinely load-bearing risk is that Theorem 1 is only an assertion here, so any hidden condition, gap, or mismatch between the companion's definitions and the present statement would invalidate the headline claims. In addition, Figure 2's practical codes are 'fully described in (24)' with no code or data included, so the empirical evidence cannot be audited independently.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes a framework for semantic communication in which Alice and Bob are equipped with a logic-based deductive engine. Alice's knowledge S_m, the query Q_m, and Bob's knowledge R_m are modeled as random logic statements over m propositional variables, with expected normalized kernel sizes p_s, p_q, p_r. Theorem 1 claims that, under entailment conditions S_m ⊢ Q_m and Q_m ⊢ R_m, an algorithm exists whose normalized expected communication cost is at most Λ(p_s, p_r - p_q) + O(m/2^m) when Alice knows R_m, with a matching lower bound under an additional 'i.i.d.' constraint, and that the same limit holds when Alice does not know R_m in the case Q_m = S_m. The paper also reports practical codes in Figure 2, discusses a 'less is more' phenomenon, and compares the cost of correcting misinformation with ignorance. The central theorem is stated without proof, and all definitions, derivations, and empirical code details are deferred to the companion paper [24].","tokens_in":8963,"tokens_out":6070,"duration_ms":60368,"significance":"If the claimed results are correct, they would provide a rigorous Shannon-style account of the communication advantage of deductive inference, with a nontrivial formula Λ and a Slepian-Wolf-like 'no need to know' phenomenon. The conceptual contribution is interesting and the paper is well positioned relative to Carnap-Bar-Hillel, rate-distortion theory, and Slepian-Wolf/Wyner-Ziv coding. However, the submission as it stands is a research announcement: Theorem 1 is not proved in this manuscript, the 'i.i.d.' model is not defined, and the practical codes are described only by reference to [24]. No code, data, or error analysis is provided, so the central mathematical and empirical claims cannot be independently verified.","major_comments":[{"comment":"Theorem 1 is the paper's central result, yet it is stated with no proof or derivation. The text immediately defers the upper-bound architecture to [24], states that 'Precise definitions' of the lower-bound model are in [24], and later says the argument for optimality is 'fully addressed in (24)'. Because the hypotheses, the O(m/2^m) term, and the lower-bound model are not defined or established in this manuscript, the claimed communication limits are unverifiable from the submission.","section":"Overview of results (Theorem 1)"},{"comment":"The 'empirical validation' in Figure 2 cannot be audited: the practical semantic codes are 'fully described in (24)', the competing classic-compression baseline relies on a decision-tree representation 'explained in (24)', and no code, data, or error analysis is included. The claimed integer-multiple gains over classical compression therefore rest entirely on external material that is not part of this submission.","section":"Empirical validation (Figure 2)"},{"comment":"The claimed misinformation limit Λ(p_s, 1-p_r-p_s) is stated without derivation and is not covered by Theorem 1, which assumes S_m ⊢ Q_m and Q_m ⊢ R_m. The subsequent 'price of misinformation' ratio and its divergence as p_r → p_s depend on this unproved limit, so the conclusion is not supported by the material in this paper.","section":"The price of misinformation"}],"minor_comments":[{"comment":"The symbol ⊢ is used both for semantic entailment and for provability ('can be inferred from'), but no formal consequence relation or proof system is defined; the paper should clarify whether it is using semantic entailment, syntactic provability, or both.","section":"Mathematical setup"},{"comment":"The phrase 'normalized average cost in total bits exchanged' is ambiguous: if the cost is normalized by m, the formula for Λ in Eq. (1) gives a quantity in bits and the meaning of the O(m/2^m) correction term needs further explanation.","section":"Overview of results (Theorem 1)"},{"comment":"The phrase 'strongly sound and exhibits a type of strong completeness' is never defined; for propositional logic the authors could simply state that the logic is sound and complete, which would make the assumption precise.","section":"Mathematical setup"},{"comment":"There is a typo: 'This results holds more generally beyond Propositional Logic' should read 'This result holds more generally beyond Propositional Logic'.","section":"Overview of results"},{"comment":"The caption of Figure 2(a) does not specify the units of the reported gains; the text refers to a 'Shannon bound' only in the context of Figure 2(b), so the reader cannot tell whether the two panels are measured on the same scale.","section":"Figure 2"},{"comment":"Reference [24] is load-bearing for the proof, the definitions, and the empirical results, but the manuscript does not state whether [24] is published, under review, or available as a preprint; this status is essential for a referee to evaluate the dependency.","section":"References"}],"recommendation":"reject","confidential_remarks":"This submission is essentially a summary of arXiv:2301.10414, with the central theorem and all supporting details external to the manuscript. Even if the companion paper is correct, accepting this manuscript as a standalone research paper would be inappropriate because the main claims cannot be checked from the submitted text. I would be willing to reconsider if the authors integrate the necessary proofs and empirical details, or if the companion paper is formally published and the present manuscript is reframed as a survey or research announcement."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this one with the companion [24] open; the arXiv text is essentially an extended abstract for it. The thing worth knowing: the model itself is new — a communication setting where Bob has a deductive engine, and the sender can exploit entailment to compress. The Lambda function and the \"Less is More\" scenario are the genuinely interesting bits. The writing is clear, and the kernel-as-subset reformulation of entailment is a nice didactic device.\n\nWhat the paper does well: it frames the problem cleanly, identifies the right quantities (expected normalized kernel sizes), and states a plausible rate function. The observation that the same cost applies whether or not Alice knows Rm, and the misinformation ratio tending to infinity as Bob becomes more opinionated, are both illuminating. The authors are also honest: they repeatedly point to [24] for proofs, precision, and the empirical codes.\n\nThe soft spots are exactly what the stress-test note says. Theorem 1 is an assertion in this manuscript. The 'i.i.d.' model for the lower bound has 'precise definitions in (24)'; the upper-bound algorithm is 'fully addressed in (24)'; the practical codes are 'fully described in (24)'. No code or data appears. So on its own, the paper does not substantiate its headline claim. The title is also a bit much: the model adds a deductive capability and side information, so calling it a 'break through the classical Shannon entropy limit' overstates what is being claimed. The strong-soundness/strong-completeness assumption is not the weak point; propositional logic is strongly complete, and the theorem is conditional on that. The genuine risk is that the proof and definitions live elsewhere, and if the companion has a hidden condition or a mismatch with this statement, the whole edifice shifts.\n\nWho is this for: people working on semantic communication and goal-oriented coding who want a new way to think about reasoning as a communication resource. A serious referee should read this together with [24]. If the companion delivers the proof and the figures, the pair is a real contribution. As a standalone submission, it needs major revision — at minimum, proof sketches and precise definitions — or it should be framed as a short summary of the longer paper.\n\nMy recommendation: don't desk-reject; send it to review with a clear instruction that the referee must read [24] and evaluate the pair. That's the only way to give the ideas a fair hearing.","headline":"A well-written extended abstract for a companion paper: the model and the Lambda function are genuinely interesting, but the central theorem and all details live in [24], so the claim is unverifiable from this text alone.","tokens_in":9540,"tokens_out":3170,"would_cite":false,"duration_ms":29006,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94A15","94A17","03B05"],"pacs":[],"model":"deepseek-v4-flash","headline":"A new theorem shows that when the receiver can perform logical deduction, the fundamental communication cost is controlled by a two-variable 'logical semantic entropy' rather than by classical symbol entropy.","keywords":["semantic information theory","logical semantic entropy","deductive reasoning","kernel of a logic statement","source coding with side information","Shannon entropy","lossy compression","communication complexity"],"falsifier":"To falsify Theorem 1, fix a small $m$ (say $m = 4$) and an i.i.d. kernel model with specified $p_s, p_q, p_r$, enumerate all possible protocols between Alice and Bob, and compare the minimal expected cost to $\\Lambda(p_s, p_r - p_q)$; a gap larger than the stated $O(m/2^m)$ term in either direction would refute the matching bounds. A protocol that beats the lower bound for even one such distribution would also refute the theorem.","tokens_in":1826,"feed_emoji":"🧩","tokens_out":1946,"duration_ms":83166,"temperature":0.7,"pith_summary":"The paper tries to show that if a receiver can perform deductive reasoning, the communication cost needed to convey a logical statement is no longer governed by the classical entropy of the symbols, but by a new two-variable quantity called the logical semantic entropy. For a sender statement, a query, and receiver knowledge with normalized expected kernel sizes $p_s$, $p_q$, and $p_r$, the paper proves matching upper and lower bounds: the least possible average communication is $\\Lambda(p_s, p_r - p_q)$, up to a small term that vanishes as the number of propositions grows. This matters because it gives a precise information-theoretic account of how semantics and deduction add value to transmitted bits, with practical codes showing savings that are integer multiples of classical compression. The same bound holds whether or not the sender knows the receiver's knowledge, a striking 'no need to know' property.","feed_headline":"With deduction, communication beats the classical entropy limit","feed_subtitle":"The exact cost is a two-variable 'logical semantic entropy,' and savings can be integer multiples of classic compression.","key_machinery":"The load-bearing object is the logical semantic entropy $\\Lambda(a,b) = a\\log_2\\left(\\frac{a+b}{a}\\right) + b\\log_2\\left(\\frac{a+b}{b}\\right)$, a two-variable entropy-like function defined on normalized kernel sizes. It is paired with the kernel $\\kappa(s)$, the set of truth assignments that satisfy a logic statement $s$; one statement entails another exactly when the first kernel is a subset of the second. The function $\\Lambda$ plays the role that Shannon entropy plays in symbol compression: it serves as both the achievability rate and the converse bound, with the argument $p_r - p_q$ measuring the gap between receiver knowledge and query that the message must bridge.","core_discovery":"On its own terms, the paper's central claim is Theorem 1: for any distribution over $(S_m, Q_m, R_m)$ satisfying $S_m \\vdash Q_m$ and $Q_m \\vdash R_m$, with normalized expected kernel sizes $p_s, p_q, p_r$, when Alice knows $R_m$ there is a protocol whose normalized average communication cost is at most $\\Lambda(p_s, p_r - p_q) + O(m/2^m)$, and under an i.i.d. model for how kernels are generated every protocol costs at least $\\Lambda(p_s, p_r - p_q)$. When Alice does not know $R_m$, the same two-sided characterization holds in the case $Q_m = S_m$. The paper interprets this as showing that logical semantic entropy, not symbol entropy, is the right measure of communication for semantically equipped receivers.","pith_inferences":["If deductive completeness is weakened to resource-bounded proof search, the predicted $\\Lambda$ rate will undershoot actual cost; quantifying that gap is a natural next step.","The 'less is more' effect suggests a privacy trade-off: the most efficient way to let the receiver prove a target query may also let the receiver prove unintended consequences, something security protocols should account for.","The hashing-based scheme for the case where the sender does not know the receiver's knowledge can be read as a distributed reasoning protocol, and may extend to multi-party settings where several receivers hold different background facts.","A direct empirical test would compare measured communication cost of the proposed protocol against $\\Lambda$ for small $m$ across random distributions, checking that the gap matches the stated $O(m/2^m)$ term."],"forward_implications":["If the theorem holds, the minimum communication cost in a deductive setting is exactly $\\Lambda(p_s, p_r - p_q)$ for a wide class of distributions, so the classical entropy lower bound is not fundamental once deduction is available.","The same limit applies whether or not the sender knows the receiver's knowledge, mirroring side-information coding but now in a lossy, semantics-based setting.","Sending the query can cost less than sending either the query or the sender's full knowledge, while still enabling the receiver to prove more than the query asks for.","When sender and receiver disagree, the ultimate cost becomes $\\Lambda(p_s, 1 - p_r - p_s)$; as the receiver's belief approaches the sender's knowledge, correcting misinformation becomes arbitrarily more expensive than informing ignorance.","The result extends beyond propositional logic to first-order logic over finite models, so the framework applies to richer deductive systems."],"supporting_citations":[{"why":"Supplies the semantic notion that a statement's content is its range (here, its kernel) and that deducible statements carry no new information, the conceptual basis for the logical semantic entropy.","marker":"[4]"},{"why":"Supplies the rate-distortion template for treating communication with a fidelity criterion, which the paper extends to semantic fidelity.","marker":"[19]"},{"why":"Provides the model-theoretic logic setting that lets the main theorem hold beyond propositional logic.","marker":"[21]"},{"why":"Establishes the correlated-source side-information model that underlies the 'no need to know' result.","marker":"[22]"},{"why":"Establishes decoder-side-information coding, the framework used when the sender does not know the receiver's knowledge.","marker":"[23]"},{"why":"The companion paper containing the full proofs, the i.i.d. model for the lower bound, and the detailed practical code descriptions.","marker":"[24]"},{"why":"Supplies an enumerative source-coding technique used inside the practical semantic codes.","marker":"[26]"},{"why":"Supplies the universal integer coding technique used inside the practical semantic codes.","marker":"[27]"}],"fun_headline_variants":["Sub-Shannon communication via logical inference","Logical semantic entropy lowers the bit cost","Semantics plus deduction: fewer bits than Shannon","Deduction proves Shannon limit is beatable","Logical semantics break Shannon's bit limit"],"cache_read_input_tokens":11648,"weakest_assumption_plain":"The whole bound rests on the assumption that the receiver's deductive engine is strongly sound and strongly complete, meaning Bob can in principle prove every logical consequence of what he knows; if real proof systems are incomplete or bounded in computation, the predicted communication savings can shrink or disappear.","fun_headline_variants_meta":{"raw":{"variants":["Sub-Shannon communication via logical inference","Logical semantic entropy lowers the bit cost","Semantics plus deduction: fewer bits than Shannon","Deduction proves Shannon limit is beatable","Logical semantics break Shannon's bit limit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000515,"raw_usage":{"total_tokens":2492,"prompt_tokens":926,"completion_tokens":1566,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":542,"completion_tokens_details":{"reasoning_tokens":1501}},"tokens_in":542,"tokens_out":1566,"duration_ms":11720,"temperature":1.0,"reasoning_tokens":1501,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T22:46:06.466130+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"To falsify Theorem 1, fix a small $m$ (say $m = 4$) and an i.i.d. kernel model with specified $p_s, p_q, p_r$, enumerate all possible protocols between Alice and Bob, and compare the minimal expected cost to $\\Lambda(p_s, p_r - p_q)$; a gap larger than the stated $O(m/2^m)$ term in either direction would refute the matching bounds. A protocol that beats the lower bound for even one such distribution would also refute the theorem.","supporting_citations":[{"cited_title":"Bar-Hillel, R","cited_arxiv_id":null,"evidence_quote":"Supplies the semantic notion that a statement's content is its range (here, its kernel) and that deducible statements carry no new information, the conceptual basis for the logical semantic entropy."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the rate-distortion template for treating communication with a fidelity criterion, which the paper extends to semantic fidelity."},{"cited_title":"Barwise, Model Theoretic Logics: Concepts and Aims, inModel Theoretic Logics, J","cited_arxiv_id":null,"evidence_quote":"Provides the model-theoretic logic setting that lets the main theorem hold beyond propositional logic."},{"cited_title":"Towards a Unification of Logic and Information Theory","cited_arxiv_id":"2301.10414","evidence_quote":"The companion paper containing the full proofs, the i.i.d. model for the lower bound, and the detailed practical code descriptions."},{"cited_title":"Cover, Enumerative source encoding","cited_arxiv_id":null,"evidence_quote":"Supplies an enumerative source-coding technique used inside the practical semantic codes."}],"review_version":1}