{
  "$schema": "https://themachinepress.com/schemas/edition-v1.schema.json",
  "schema_version": "1.0.0",
  "document_type": "machine_press_edition",
  "edition_id": "mp-2026-09-27-morning-0080",
  "source_edition_id": "mp-2026-09-27-morning-0080",
  "edition_number": 80,
  "edition_label": "Morning edition",
  "status": "published",
  "revision": 1,
  "published_at": "2026-09-27T09:00:00.000-04:00",
  "modified_at": "2026-09-27T09:00:00.000-04:00",
  "timezone": "America/Detroit",
  "canonical_url": "https://themachinepress.com/edition/2026-09-27",
  "html_url": "https://themachinepress.com/edition/2026-09-27",
  "json_url": "https://themachinepress.com/edition/2026-09-27.json",
  "markdown_url": "https://themachinepress.com/edition/2026-09-27.md",
  "lead_story_id": "mp-2026-09-27-001",
  "lead_summary": "In multi-agent deliberation, defection rose with the proportion of deceptive agents—not the size of the group.",
  "coverage_window": {
    "start": "2026-09-24T08:37:21.000-04:00",
    "end": "2026-09-27T08:26:41.000-04:00"
  },
  "story_count": 27,
  "stories": [
    {
      "story_id": "mp-2026-09-27-001",
      "source_story_id": "tmp-lead-adversarial-influence-scaling",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 1,
      "story_type": "lead",
      "section": "safety-security",
      "editorial_classification": "editorial",
      "headline": "A Minority of Deceivers Could Turn the Group",
      "slug": "a-minority-of-deceivers-could-turn-the-group",
      "dek": "In multi-agent deliberation, defection rose with the proportion of deceptive agents—not the size of the group.",
      "summary": "In multi-agent deliberation, defection rose with the proportion of deceptive agents—not the size of the group.",
      "body_text": "A new preprint tested how deceptive participants alter collective decisions by varying both group size and the share of adversarial agents. Across the reported setups, defection rose roughly linearly with the proportion of deceivers, while simply adding more agents did not produce the same scaling effect. Language-model agents could be swayed even when deceivers remained a minority, although private coordination sometimes made the attackers less effective by preventing public reinforcement. The result is a benchmark finding about controlled deliberation, not evidence that every deployed agent team will behave the same way. It points system designers toward adversarial composition and communication structure as separate risks to measure.",
      "why_it_matters": "In multi-agent deliberation, defection rose with the proportion of deceptive agents—not the size of the group.",
      "limitations": [
        "Across the reported setups, defection rose roughly linearly with the proportion of deceivers, while simply adding more agents did not produce the same scaling effect.",
        "The result is a benchmark finding about controlled deliberation, not evidence that every deployed agent team will behave the same way."
      ],
      "importance": 10,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-001/a-minority-of-deceivers-could-turn-the-group",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-001.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-001-001",
          "text": "In multi-agent deliberation, defection rose with the proportion of deceptive agents—not the size of the group.",
          "source_ids": [
            "source-2026-09-27-001"
          ],
          "qualification": "Across the reported setups, defection rose roughly linearly with the proportion of deceivers, while simply adding more agents did not produce the same scaling effect."
        }
      ],
      "source_ids": [
        "source-2026-09-27-001"
      ],
      "tags": [
        "multi-agent systems",
        "adversarial influence",
        "collective decision-making"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/lead-adversarial-influence.png",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-002",
      "source_story_id": "tmp-feature-enigmaforge-hidden-question",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 2,
      "story_type": "secondary",
      "section": "benchmarks-evals",
      "editorial_classification": "editorial",
      "headline": "The Benchmark Hid the Question",
      "slug": "the-benchmark-hid-the-question",
      "dek": "EnigmaForge asked models to infer both the puzzle and its answer from documents, producing a 22-fold spread in intuition.",
      "summary": "EnigmaForge asked models to infer both the puzzle and its answer from documents, producing a 22-fold spread in intuition.",
      "body_text": "EnigmaForge replaces the usual explicit question with a packet of documents whose facts imply both what must be solved and the one admissible answer. Its generator uses satisfiability checks to create puzzles with a unique solution and to verify that every clue is load-bearing. Across 25 frontier models, 600 instances and 17,400 evaluation records, the authors report a 22-fold spread in reconstructing the hidden problem, compared with a 1.6-fold spread in recovering stated facts. They also filter refusals separately so a model that declines the task is not confused with one that reasons incorrectly. This is a synthetic benchmark preprint, but it isolates a practical failure mode: gathering facts can be much easier than discovering the question those facts were meant to answer.",
      "why_it_matters": "EnigmaForge asked models to infer both the puzzle and its answer from documents, producing a 22-fold spread in intuition.",
      "limitations": [
        "They also filter refusals separately so a model that declines the task is not confused with one that reasons incorrectly."
      ],
      "importance": 10,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-002/the-benchmark-hid-the-question",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-002.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-002-001",
          "text": "EnigmaForge asked models to infer both the puzzle and its answer from documents, producing a 22-fold spread in intuition.",
          "source_ids": [
            "source-2026-09-27-002"
          ],
          "qualification": "They also filter refusals separately so a model that declines the task is not confused with one that reasons incorrectly."
        }
      ],
      "source_ids": [
        "source-2026-09-27-002"
      ],
      "tags": [
        "reasoning benchmarks",
        "latent questions",
        "document understanding"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/feature-enigmaforge-hidden-question.png",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-003",
      "source_story_id": "tmp-story-agent-reasoning-context-compression",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 3,
      "story_type": "dispatch",
      "section": "benchmarks-evals",
      "editorial_classification": "editorial",
      "headline": "An Agent Forgot Its Reasoning After the State Was Saved",
      "slug": "an-agent-forgot-its-reasoning-after-the-state-was-saved",
      "dek": "A training-free compressor cut input, output and cache tokens while raising reported reward on WorkBuddyBench.",
      "summary": "A training-free compressor cut input, output and cache tokens while raising reported reward on WorkBuddyBench.",
      "body_text": "The ICLR method ranks completed reasoning blocks by whether they still matter after an agent has externalized useful state into files, tools or the environment. On 260 WorkBuddyBench tasks, the authors report reward rising from 0.699 to 0.718 while input, output and cache tokens fell by 25.5%, 14.4% and 33.3%, respectively. The study argues that internal reasoning can become replaceable once its consequences are safely recorded, though the result is benchmark-specific and does not license deleting audit evidence.",
      "why_it_matters": "A training-free compressor cut input, output and cache tokens while raising reported reward on WorkBuddyBench.",
      "limitations": [
        "The study argues that internal reasoning can become replaceable once its consequences are safely recorded, though the result is benchmark-specific and does not license deleting audit evidence."
      ],
      "importance": 9,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-003/an-agent-forgot-its-reasoning-after-the-state-was-saved",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-003.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-003-001",
          "text": "A training-free compressor cut input, output and cache tokens while raising reported reward on WorkBuddyBench.",
          "source_ids": [
            "source-2026-09-27-003"
          ],
          "qualification": "The study argues that internal reasoning can become replaceable once its consequences are safely recorded, though the result is benchmark-specific and does not license deleting audit evidence."
        }
      ],
      "source_ids": [
        "source-2026-09-27-003"
      ],
      "tags": [
        "agent memory",
        "context compression",
        "tool use"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/agent-context-compression-brain.webp",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-004",
      "source_story_id": "tmp-story-ontology-multistakeholder-constraints",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 4,
      "story_type": "dispatch",
      "section": "infrastructure",
      "editorial_classification": "editorial",
      "headline": "The Planner Put Stakeholder Rules Into an Ontology",
      "slug": "the-planner-put-stakeholder-rules-into-an-ontology",
      "dek": "Hard and soft constraints became explainable objects that could be checked, ranked and renegotiated.",
      "summary": "Hard and soft constraints became explainable objects that could be checked, ranked and renegotiated.",
      "body_text": "The proposed framework encodes multi-stakeholder requirements in an OWL ontology, separating hard limits from preferences before a planner acts. It can identify unsatisfiable combinations, explain which constraints conflict and support structured renegotiation rather than silently relaxing a rule. A FLEXI microgrid case study illustrates the approach; the preprint is an architecture and demonstration, not a broad operational deployment.",
      "why_it_matters": "Hard and soft constraints became explainable objects that could be checked, ranked and renegotiated.",
      "limitations": [
        "A FLEXI microgrid case study illustrates the approach; the preprint is an architecture and demonstration, not a broad operational deployment."
      ],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-004/the-planner-put-stakeholder-rules-into-an-ontology",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-004.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-004-001",
          "text": "Hard and soft constraints became explainable objects that could be checked, ranked and renegotiated.",
          "source_ids": [
            "source-2026-09-27-004"
          ],
          "qualification": "A FLEXI microgrid case study illustrates the approach; the preprint is an architecture and demonstration, not a broad operational deployment."
        }
      ],
      "source_ids": [
        "source-2026-09-27-004"
      ],
      "tags": [
        "ontologies",
        "constraint planning",
        "multi-stakeholder systems"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-005",
      "source_story_id": "tmp-story-qwen-planner-mobile-agent",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 5,
      "story_type": "dispatch",
      "section": "benchmarks-evals",
      "editorial_classification": "editorial",
      "headline": "A Mobile Agent Trained the Planner Around One Shared Contract",
      "slug": "a-mobile-agent-trained-the-planner-around-one-shared-contract",
      "dek": "Qwen-Planner-Agent aligned data, training and deployment through a common action representation.",
      "summary": "Qwen-Planner-Agent aligned data, training and deployment through a common action representation.",
      "body_text": "Qwen-Planner-Agent uses the same contract for collecting trajectories, training a planner and executing actions on devices. Its CARE process is designed to correct action representations before errors propagate across that pipeline. The authors report the best overall result in their MobilePA-Bench evaluation while preserving general capabilities, but the claim belongs to the paper's chosen tasks, baselines and device conditions.",
      "why_it_matters": "Qwen-Planner-Agent aligned data, training and deployment through a common action representation.",
      "limitations": [],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-005/a-mobile-agent-trained-the-planner-around-one-shared-contract",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-005.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-005-001",
          "text": "Qwen-Planner-Agent aligned data, training and deployment through a common action representation.",
          "source_ids": [
            "source-2026-09-27-005"
          ],
          "qualification": null
        }
      ],
      "source_ids": [
        "source-2026-09-27-005"
      ],
      "tags": [
        "mobile agents",
        "action planning",
        "benchmark evaluation"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-006",
      "source_story_id": "tmp-story-neurosymbolic-industrial-configuration",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 6,
      "story_type": "dispatch",
      "section": "business-enterprise",
      "editorial_classification": "editorial",
      "headline": "Industrial Configuration Needs More Than a Language Model",
      "slug": "industrial-configuration-needs-more-than-a-language-model",
      "dek": "A survey organized neuro-symbolic copilot designs around inference, fine-tuning and training-time integration.",
      "summary": "A survey organized neuro-symbolic copilot designs around inference, fine-tuning and training-time integration.",
      "body_text": "The preprint argues that unconstrained language generation is too unreliable for configuration work governed by compatibility rules, catalogs and engineering limits. It classifies hybrid systems by where symbolic knowledge enters: at inference, during fine-tuning or inside training objectives. An industrial configuration copilot grounds the discussion, while the paper also flags scaling, maintenance and evaluation problems that remain unresolved.",
      "why_it_matters": "A survey organized neuro-symbolic copilot designs around inference, fine-tuning and training-time integration.",
      "limitations": [
        "An industrial configuration copilot grounds the discussion, while the paper also flags scaling, maintenance and evaluation problems that remain unresolved."
      ],
      "importance": 7,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-006/industrial-configuration-needs-more-than-a-language-model",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-006.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-006-001",
          "text": "A survey organized neuro-symbolic copilot designs around inference, fine-tuning and training-time integration.",
          "source_ids": [
            "source-2026-09-27-006"
          ],
          "qualification": "An industrial configuration copilot grounds the discussion, while the paper also flags scaling, maintenance and evaluation problems that remain unresolved."
        }
      ],
      "source_ids": [
        "source-2026-09-27-006"
      ],
      "tags": [
        "neuro-symbolic AI",
        "industrial configuration",
        "knowledge representation"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-007",
      "source_story_id": "tmp-story-endoprompt-utility-degradation",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 7,
      "story_type": "dispatch",
      "section": "safety-security",
      "editorial_classification": "editorial",
      "headline": "A Learned Prefix Cut Model Utility by 26.8 Points",
      "slug": "a-learned-prefix-cut-model-utility-by-26-8-points",
      "dek": "ENDOPROMPT optimized harmful prefixes from unlabeled instructions and produced losses across almost every tested split.",
      "summary": "ENDOPROMPT optimized harmful prefixes from unlabeled instructions and produced losses across almost every tested split.",
      "body_text": "ENDOPROMPT uses white-box optimization to derive input prefixes without requiring labeled attack examples. Across four models, seven benign benchmarks and 28 model-benchmark combinations, the authors report a mean utility loss of 26.8 percentage points and negative effects in 27 of 28 cases. Their controls did not establish a compensating request-matching benefit; the preprint promises code upon acceptance, so independent reproduction remains a next step.",
      "why_it_matters": "ENDOPROMPT optimized harmful prefixes from unlabeled instructions and produced losses across almost every tested split.",
      "limitations": [
        "Their controls did not establish a compensating request-matching benefit; the preprint promises code upon acceptance, so independent reproduction remains a next step."
      ],
      "importance": 9,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-007/a-learned-prefix-cut-model-utility-by-26-8-points",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-007.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-007-001",
          "text": "ENDOPROMPT optimized harmful prefixes from unlabeled instructions and produced losses across almost every tested split.",
          "source_ids": [
            "source-2026-09-27-007"
          ],
          "qualification": "Their controls did not establish a compensating request-matching benefit; the preprint promises code upon acceptance, so independent reproduction remains a next step."
        }
      ],
      "source_ids": [
        "source-2026-09-27-007"
      ],
      "tags": [
        "prompt attacks",
        "model utility",
        "adversarial optimization"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-008",
      "source_story_id": "tmp-story-code-attribution-style-not-self",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 8,
      "story_type": "dispatch",
      "section": "benchmarks-evals",
      "editorial_classification": "editorial",
      "headline": "Code Attribution Mostly Found Length, Not Identity",
      "slug": "code-attribution-mostly-found-length-not-identity",
      "dek": "Across 15 model-benchmark combinations, balanced accuracy stayed near chance and tracked solution length.",
      "summary": "Across 15 model-benchmark combinations, balanced accuracy stayed near chance and tracked solution length.",
      "body_text": "A study of model self-attribution found balanced accuracy between 49% and 58% across 15 model-benchmark combinations. Pairwise attribution scores correlated at r=0.93 with longer solutions, suggesting that style and verbosity were doing much of the work. After normalization, 10 of 12 tested conditions fell to chance and the remaining two continued to follow length, erasing the apparent self-preference in this setup.",
      "why_it_matters": "Across 15 model-benchmark combinations, balanced accuracy stayed near chance and tracked solution length.",
      "limitations": [],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-008/code-attribution-mostly-found-length-not-identity",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-008.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-008-001",
          "text": "Across 15 model-benchmark combinations, balanced accuracy stayed near chance and tracked solution length.",
          "source_ids": [
            "source-2026-09-27-008"
          ],
          "qualification": null
        }
      ],
      "source_ids": [
        "source-2026-09-27-008"
      ],
      "tags": [
        "code generation",
        "authorship attribution",
        "evaluation bias"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/code-attribution-blue-screen.webp",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-009",
      "source_story_id": "tmp-story-nnv3-neural-verification",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 9,
      "story_type": "dispatch",
      "section": "benchmarks-evals",
      "editorial_classification": "editorial",
      "headline": "A Verification Toolkit Added Probabilistic Reachability",
      "slug": "a-verification-toolkit-added-probabilistic-reachability",
      "dek": "NNV3 joined new star-set abstractions with fairness checks for modern neural architectures.",
      "summary": "NNV3 joined new star-set abstractions with fairness checks for modern neural architectures.",
      "body_text": "NNV3 introduces ModelStar, VolumeStar and GraphStar abstractions for neural-network reachability, including probabilistic analysis and a FairNNV module. The authors benchmark the toolkit on malware, power, medical, time-series and action-recognition models. Those experiments show breadth across architectures, but the preprint does not make every network or safety property automatically tractable.",
      "why_it_matters": "NNV3 joined new star-set abstractions with fairness checks for modern neural architectures.",
      "limitations": [
        "Those experiments show breadth across architectures, but the preprint does not make every network or safety property automatically tractable."
      ],
      "importance": 7,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-009/a-verification-toolkit-added-probabilistic-reachability",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-009.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-009-001",
          "text": "NNV3 joined new star-set abstractions with fairness checks for modern neural architectures.",
          "source_ids": [
            "source-2026-09-27-009"
          ],
          "qualification": "Those experiments show breadth across architectures, but the preprint does not make every network or safety property automatically tractable."
        }
      ],
      "source_ids": [
        "source-2026-09-27-009"
      ],
      "tags": [
        "formal verification",
        "neural networks",
        "fairness"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-010",
      "source_story_id": "tmp-story-sciwalker-scientific-coding",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 10,
      "story_type": "dispatch",
      "section": "developer-tools",
      "editorial_classification": "editorial",
      "headline": "Execution Feedback Raised Scientific Coding Accuracy 9.9 Points",
      "slug": "execution-feedback-raised-scientific-coding-accuracy-9-9-points",
      "dek": "SciWalker organized 8,178 problems across five domains into operator graphs that could be tested while solving.",
      "summary": "SciWalker organized 8,178 problems across five domains into operator graphs that could be tested while solving.",
      "body_text": "SciWalker contains 8,178 scientific coding problems spanning five domains and 32 subdomains, with solutions represented as operator graphs. The framework uses execution feedback to revise intermediate programs rather than grading only a final answer. In the reported experiment, Qwen3.5-9B accuracy rose from 29.3% to 39.2%; that gain applies to this benchmark and training recipe, not scientific software in general.",
      "why_it_matters": "SciWalker organized 8,178 problems across five domains into operator graphs that could be tested while solving.",
      "limitations": [
        "The framework uses execution feedback to revise intermediate programs rather than grading only a final answer.",
        "In the reported experiment, Qwen3.5-9B accuracy rose from 29.3% to 39.2%; that gain applies to this benchmark and training recipe, not scientific software in general."
      ],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-010/execution-feedback-raised-scientific-coding-accuracy-9-9-points",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-010.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-010-001",
          "text": "SciWalker organized 8,178 problems across five domains into operator graphs that could be tested while solving.",
          "source_ids": [
            "source-2026-09-27-010"
          ],
          "qualification": "The framework uses execution feedback to revise intermediate programs rather than grading only a final answer."
        }
      ],
      "source_ids": [
        "source-2026-09-27-010"
      ],
      "tags": [
        "scientific coding",
        "execution feedback",
        "program synthesis"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-011",
      "source_story_id": "tmp-story-zero-data-selfplay-pretraining",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 11,
      "story_type": "dispatch",
      "section": "benchmarks-evals",
      "editorial_classification": "editorial",
      "headline": "A Model Practiced Prediction Without Natural Data",
      "slug": "a-model-practiced-prediction-without-natural-data",
      "dek": "Generator programs supplied an open-ended self-play curriculum built from a universal Turing machine.",
      "summary": "Generator programs supplied an open-ended self-play curriculum built from a universal Turing machine.",
      "body_text": "The proposed pretraining scheme pits a generator program against a learner that predicts the generator's output, using reinforcement learning to keep the curriculum challenging. The authors report that zero-shot loss on natural data scales with compute even though natural examples never enter pretraining. They also observe in-context learning and mathematical-sequence behavior, but this remains a controlled preprint result rather than a replacement recipe for production language-model training.",
      "why_it_matters": "Generator programs supplied an open-ended self-play curriculum built from a universal Turing machine.",
      "limitations": [],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-011/a-model-practiced-prediction-without-natural-data",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-011.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-011-001",
          "text": "Generator programs supplied an open-ended self-play curriculum built from a universal Turing machine.",
          "source_ids": [
            "source-2026-09-27-011"
          ],
          "qualification": null
        }
      ],
      "source_ids": [
        "source-2026-09-27-011"
      ],
      "tags": [
        "self-play",
        "pretraining",
        "synthetic curricula"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-012",
      "source_story_id": "tmp-story-hexis-compiled-agent-skills",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 12,
      "story_type": "dispatch",
      "section": "developer-tools",
      "editorial_classification": "editorial",
      "headline": "Compiled Skills Cut Agent Tokens by as Much as 88.9%",
      "slug": "compiled-skills-cut-agent-tokens-by-as-much-as-88-9",
      "dek": "HEXIS turned reusable procedures into extended state machines with static checks and replay.",
      "summary": "HEXIS turned reusable procedures into extended state machines with static checks and replay.",
      "body_text": "HEXIS compiles agent skills into extended finite-state machines whose transitions, guards and tool calls can be inspected before execution. Across four benchmarks and four executors, the authors report a 16.1-point gain over Skill+ReAct. For Qwen3.8-27B, token use fell between 38.4% and 88.9%, while accepted traces could be replayed; the results depend on the tasks and skill library tested.",
      "why_it_matters": "HEXIS turned reusable procedures into extended state machines with static checks and replay.",
      "limitations": [],
      "importance": 9,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-012/compiled-skills-cut-agent-tokens-by-as-much-as-88-9",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-012.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-012-001",
          "text": "HEXIS turned reusable procedures into extended state machines with static checks and replay.",
          "source_ids": [
            "source-2026-09-27-012"
          ],
          "qualification": null
        }
      ],
      "source_ids": [
        "source-2026-09-27-012"
      ],
      "tags": [
        "agent skills",
        "state machines",
        "token efficiency"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-013",
      "source_story_id": "tmp-story-markerless-space-structure-inspection",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 13,
      "story_type": "dispatch",
      "section": "robotics",
      "editorial_classification": "editorial",
      "headline": "A Robot Mapped Space Structures Without Markers",
      "slug": "a-robot-mapped-space-structures-without-markers",
      "dek": "The inspection stack combined RGB-D, thermal and lidar sensing on a Kinova arm for large-structure reconstruction.",
      "summary": "The inspection stack combined RGB-D, thermal and lidar sensing on a Kinova arm for large-structure reconstruction.",
      "body_text": "Researchers built a markerless multimodal inspection stack around a Kinova Gen2 arm, an RGB-D camera, a thermal camera and 2D lidar. The system plans viewpoints and motion while synchronizing the sensor streams into geometric and thermal reconstructions. Gazebo studies and preliminary laboratory work produced usable models in the reported setup; this iSpaRo-accepted paper is an early inspection result, not an on-orbit demonstration.",
      "why_it_matters": "The inspection stack combined RGB-D, thermal and lidar sensing on a Kinova arm for large-structure reconstruction.",
      "limitations": [
        "Gazebo studies and preliminary laboratory work produced usable models in the reported setup; this iSpaRo-accepted paper is an early inspection result, not an on-orbit demonstration."
      ],
      "importance": 9,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-013/a-robot-mapped-space-structures-without-markers",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-013.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-013-001",
          "text": "The inspection stack combined RGB-D, thermal and lidar sensing on a Kinova arm for large-structure reconstruction.",
          "source_ids": [
            "source-2026-09-27-013"
          ],
          "qualification": "Gazebo studies and preliminary laboratory work produced usable models in the reported setup; this iSpaRo-accepted paper is an early inspection result, not an on-orbit demonstration."
        }
      ],
      "source_ids": [
        "source-2026-09-27-013"
      ],
      "tags": [
        "robot inspection",
        "multimodal sensing",
        "space structures"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/space-inspection-robot-arm.webp",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-014",
      "source_story_id": "tmp-story-polyumi-multimodal-demonstrations",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 14,
      "story_type": "dispatch",
      "section": "robotics",
      "editorial_classification": "editorial",
      "headline": "A Robot Gripper Recorded Touch, Sound and Motion Together",
      "slug": "a-robot-gripper-recorded-touch-sound-and-motion-together",
      "dek": "PolyUMI packages vision, tactile, audio and proprioception into a transferable wireless demonstration tool.",
      "summary": "PolyUMI packages vision, tactile, audio and proprioception into a transferable wireless demonstration tool.",
      "body_text": "PolyUMI combines a wrist camera, optical tactile finger, microphone and proprioceptive sensing in a wireless gripper for collecting demonstrations. Its transferable sensing finger and VisTA dataset are meant to preserve more contact information than vision alone. In the paper's experiments, touch and audio added useful signals and matched or exceeded existing policies on selected tasks; the evidence remains bounded to those demonstrations and hardware.",
      "why_it_matters": "PolyUMI packages vision, tactile, audio and proprioception into a transferable wireless demonstration tool.",
      "limitations": [],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-014/a-robot-gripper-recorded-touch-sound-and-motion-together",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-014.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-014-001",
          "text": "PolyUMI packages vision, tactile, audio and proprioception into a transferable wireless demonstration tool.",
          "source_ids": [
            "source-2026-09-27-014"
          ],
          "qualification": null
        }
      ],
      "source_ids": [
        "source-2026-09-27-014"
      ],
      "tags": [
        "robot learning",
        "tactile sensing",
        "demonstration data"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-026",
      "source_story_id": "tmp-story-training-free-behavior-cloning",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 15,
      "story_type": "dispatch",
      "section": "robotics",
      "editorial_classification": "editorial",
      "headline": "Behavior Cloning Dropped Training for Retrieval",
      "slug": "behavior-cloning-dropped-training-for-retrieval",
      "dek": "BPC used demonstration windows, Hankel structure and action correction to fit in seconds and run above 75 hertz.",
      "summary": "BPC used demonstration windows, Hankel structure and action correction to fit in seconds and run above 75 hertz.",
      "body_text": "Behavioral Predictive Control retrieves relevant windows from demonstrations, organizes them through Hankel structure and corrects the proposed action online. The authors report competitive performance with learned policies and better results on some tested tasks while cutting fitting time from hours to seconds on consumer GPUs. They also report control above 75 hertz on a Jetson Orin Nano, with each action traceable to demonstration windows; wider robustness is not yet established.",
      "why_it_matters": "BPC used demonstration windows, Hankel structure and action correction to fit in seconds and run above 75 hertz.",
      "limitations": [
        "They also report control above 75 hertz on a Jetson Orin Nano, with each action traceable to demonstration windows; wider robustness is not yet established."
      ],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-026/behavior-cloning-dropped-training-for-retrieval",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-026.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-026-001",
          "text": "BPC used demonstration windows, Hankel structure and action correction to fit in seconds and run above 75 hertz.",
          "source_ids": [
            "source-2026-09-27-015"
          ],
          "qualification": "They also report control above 75 hertz on a Jetson Orin Nano, with each action traceable to demonstration windows; wider robustness is not yet established."
        }
      ],
      "source_ids": [
        "source-2026-09-27-015"
      ],
      "tags": [
        "behavior cloning",
        "robot control",
        "retrieval"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-027",
      "source_story_id": "tmp-story-morphik-unseen-robot-chains",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 16,
      "story_type": "dispatch",
      "section": "robotics",
      "editorial_classification": "editorial",
      "headline": "One Inverse-Kinematics Model Crossed Unseen Robot Chains",
      "slug": "one-inverse-kinematics-model-crossed-unseen-robot-chains",
      "dek": "MorphIK reached roughly five-centimeter error before refinement and sub-centimeter error after one DLS step.",
      "summary": "MorphIK reached roughly five-centimeter error before refinement and sub-centimeter error after one DLS step.",
      "body_text": "MorphIK is trained entirely on synthetic kinematic chains so one model can propose solutions for previously unseen robots with six to nine degrees of freedom. The authors report about five-centimeter error on real platforms before refinement, below one centimeter after one damped-least-squares step and below one millimeter after three steps in most tested cases. Its samples also cover diverse null-space solutions, but the results remain tied to the evaluated chains, targets and refinement procedure.",
      "why_it_matters": "MorphIK reached roughly five-centimeter error before refinement and sub-centimeter error after one DLS step.",
      "limitations": [
        "Its samples also cover diverse null-space solutions, but the results remain tied to the evaluated chains, targets and refinement procedure."
      ],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-027/one-inverse-kinematics-model-crossed-unseen-robot-chains",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-027.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-027-001",
          "text": "MorphIK reached roughly five-centimeter error before refinement and sub-centimeter error after one DLS step.",
          "source_ids": [
            "source-2026-09-27-016"
          ],
          "qualification": "Its samples also cover diverse null-space solutions, but the results remain tied to the evaluated chains, targets and refinement procedure."
        }
      ],
      "source_ids": [
        "source-2026-09-27-016"
      ],
      "tags": [
        "inverse kinematics",
        "robot morphology",
        "synthetic training"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-015",
      "source_story_id": "tmp-sidebar-pseudoentanglement-efi-pairs",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 17,
      "story_type": "ticker",
      "section": "research",
      "editorial_classification": "editorial",
      "headline": "Pseudoentanglement Matched EFI Pairs",
      "slug": "pseudoentanglement-matched-efi-pairs",
      "dek": "Under one operational definition, the two cryptographic resources became equivalent.",
      "summary": "Under one operational definition, the two cryptographic resources became equivalent.",
      "body_text": "The theoretical preprint connects pseudoentangled states with efficiently samplable far-but-indistinguishable pairs. Its equivalence result is definition-specific and does not describe a hardware protocol.",
      "why_it_matters": "Under one operational definition, the two cryptographic resources became equivalent.",
      "limitations": [
        "Its equivalence result is definition-specific and does not describe a hardware protocol."
      ],
      "importance": 7,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-015/pseudoentanglement-matched-efi-pairs",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-015.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-015-001",
          "text": "Under one operational definition, the two cryptographic resources became equivalent.",
          "source_ids": [
            "source-2026-09-27-017"
          ],
          "qualification": "Its equivalence result is definition-specific and does not describe a hardware protocol."
        }
      ],
      "source_ids": [
        "source-2026-09-27-017"
      ],
      "tags": [
        "quantum cryptography",
        "pseudoentanglement",
        "EFI pairs"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-016",
      "source_story_id": "tmp-sidebar-universal-correlation-detector",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 18,
      "story_type": "ticker",
      "section": "research",
      "editorial_classification": "editorial",
      "headline": "A Universal Detector Reached First-Order Capacity",
      "slug": "a-universal-detector-reached-first-order-capacity",
      "dek": "State-independent and channel-independent schemes approached the optimal correlation rate.",
      "summary": "State-independent and channel-independent schemes approached the optimal correlation rate.",
      "body_text": "The authors construct a universal correlation detector and capacity-achieving schemes that do not require exact source or channel knowledge. The result is asymptotic and theoretical, not a deployed communications system.",
      "why_it_matters": "State-independent and channel-independent schemes approached the optimal correlation rate.",
      "limitations": [
        "The authors construct a universal correlation detector and capacity-achieving schemes that do not require exact source or channel knowledge.",
        "The result is asymptotic and theoretical, not a deployed communications system."
      ],
      "importance": 7,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-016/a-universal-detector-reached-first-order-capacity",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-016.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-016-001",
          "text": "State-independent and channel-independent schemes approached the optimal correlation rate.",
          "source_ids": [
            "source-2026-09-27-018"
          ],
          "qualification": "The authors construct a universal correlation detector and capacity-achieving schemes that do not require exact source or channel knowledge."
        }
      ],
      "source_ids": [
        "source-2026-09-27-018"
      ],
      "tags": [
        "information theory",
        "correlation detection",
        "universal coding"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-017",
      "source_story_id": "tmp-sidebar-ultrahigh-rate-quantum-codes",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 19,
      "story_type": "ticker",
      "section": "research",
      "editorial_classification": "editorial",
      "headline": "High-Rate Quantum Codes Kept Checks at Weight Ten",
      "slug": "high-rate-quantum-codes-kept-checks-at-weight-ten",
      "dek": "New constructions include [[90,21,11]], [[140,31,15]] and [[200,43,20]] parameter sets.",
      "summary": "New constructions include [[90,21,11]], [[140,31,15]] and [[200,43,20]] parameter sets.",
      "body_text": "The preprint presents ultra-high-rate quantum LDPC code families and analyzes their logical performance at a 0.1% physical error rate. Those figures are code and noise-model results, not measurements from a fabricated quantum processor.",
      "why_it_matters": "New constructions include [[90,21,11]], [[140,31,15]] and [[200,43,20]] parameter sets.",
      "limitations": [
        "Those figures are code and noise-model results, not measurements from a fabricated quantum processor."
      ],
      "importance": 8,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-017/high-rate-quantum-codes-kept-checks-at-weight-ten",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-017.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-017-001",
          "text": "New constructions include [[90,21,11]], [[140,31,15]] and [[200,43,20]] parameter sets.",
          "source_ids": [
            "source-2026-09-27-019"
          ],
          "qualification": "Those figures are code and noise-model results, not measurements from a fabricated quantum processor."
        }
      ],
      "source_ids": [
        "source-2026-09-27-019"
      ],
      "tags": [
        "quantum error correction",
        "LDPC codes",
        "code construction"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-018",
      "source_story_id": "tmp-sidebar-letta-tensor-networks",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 20,
      "story_type": "ticker",
      "section": "research",
      "editorial_classification": "editorial",
      "headline": "A Tensor Network Kept Long-Range Ties With Fewer Parameters",
      "slug": "a-tensor-network-kept-long-range-ties-with-fewer-parameters",
      "dek": "LETTA used about an order of magnitude fewer parameters than much larger matrix-product states in tested models.",
      "summary": "LETTA used about an order of magnitude fewer parameters than much larger matrix-product states in tested models.",
      "body_text": "LETTA augments a tensor-network ansatz to represent long-range physical correlations more directly. The reported parameter advantage comes from selected theoretical models and does not yet establish a universal simulation speedup.",
      "why_it_matters": "LETTA used about an order of magnitude fewer parameters than much larger matrix-product states in tested models.",
      "limitations": [
        "The reported parameter advantage comes from selected theoretical models and does not yet establish a universal simulation speedup."
      ],
      "importance": 7,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-018/a-tensor-network-kept-long-range-ties-with-fewer-parameters",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-018.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-018-001",
          "text": "LETTA used about an order of magnitude fewer parameters than much larger matrix-product states in tested models.",
          "source_ids": [
            "source-2026-09-27-020"
          ],
          "qualification": "The reported parameter advantage comes from selected theoretical models and does not yet establish a universal simulation speedup."
        }
      ],
      "source_ids": [
        "source-2026-09-27-020"
      ],
      "tags": [
        "tensor networks",
        "quantum simulation",
        "long-range correlations"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-019",
      "source_story_id": "tmp-sidebar-optimal-spectrum-estimation",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 21,
      "story_type": "ticker",
      "section": "research",
      "editorial_classification": "editorial",
      "headline": "Entanglement Closed the Spectrum-Estimation Bound",
      "slug": "entanglement-closed-the-spectrum-estimation-bound",
      "dek": "An estimator matched the lower bound while unentangled strategies paid an extra factor in dimension.",
      "summary": "An estimator matched the lower bound while unentangled strategies paid an extra factor in dimension.",
      "body_text": "The paper gives an optimal quantum spectrum-estimation procedure and separates it from unentangled measurements by a factor tied to system dimension. The authors conjecture the unentangled bound is itself optimal; this is a complexity result, not an experimental measurement.",
      "why_it_matters": "An estimator matched the lower bound while unentangled strategies paid an extra factor in dimension.",
      "limitations": [
        "The authors conjecture the unentangled bound is itself optimal; this is a complexity result, not an experimental measurement."
      ],
      "importance": 7,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-019/entanglement-closed-the-spectrum-estimation-bound",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-019.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [
        {
          "claim_id": "claim-mp-2026-09-27-019-001",
          "text": "An estimator matched the lower bound while unentangled strategies paid an extra factor in dimension.",
          "source_ids": [
            "source-2026-09-27-021"
          ],
          "qualification": "The authors conjecture the unentangled bound is itself optimal; this is a complexity result, not an experimental measurement."
        }
      ],
      "source_ids": [
        "source-2026-09-27-021"
      ],
      "tags": [
        "quantum estimation",
        "spectrum learning",
        "measurement complexity"
      ],
      "image_url": null,
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-020",
      "source_story_id": "invention-space-drums-2",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 22,
      "story_type": "invention_desk",
      "section": "invention-desk",
      "editorial_classification": "editorial",
      "headline": "Space Drums 2.0",
      "slug": "space-drums-2-0",
      "dek": "Moves motion tracking onto two ESP32-S3 drumsticks, adds haptic hits and a two-pedal hub, and sends velocity-sensitive drum events to open PC or Android playback software.",
      "summary": "Moves motion tracking onto two ESP32-S3 drumsticks, adds haptic hits and a two-pedal hub, and sends velocity-sensitive drum events to open PC or Android playback software.",
      "body_text": "Moves motion tracking onto two ESP32-S3 drumsticks, adds haptic hits and a two-pedal hub, and sends velocity-sensitive drum events to open PC or Android playback software.",
      "why_it_matters": "An independent builder is turning an improbable idea into a working project.",
      "limitations": [
        "A Desk Pick is an editorial selection, not a product endorsement."
      ],
      "importance": null,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-020/space-drums-2-0",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-020.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [],
      "source_ids": [],
      "tags": [
        "independent-builders",
        "desk-pick",
        "released"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/invention-desk/space-drums-2.png",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-021",
      "source_story_id": "invention-3ric",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 23,
      "story_type": "invention_desk",
      "section": "invention-desk",
      "editorial_classification": "editorial",
      "headline": "3RIC",
      "slug": "3ric",
      "dek": "Pairs a chip-level 65C02 computer with custom hardware, video, sound, floppy, and microSD support with a cycle-honest emulator and browser assembler built around the same machine.",
      "summary": "Pairs a chip-level 65C02 computer with custom hardware, video, sound, floppy, and microSD support with a cycle-honest emulator and browser assembler built around the same machine.",
      "body_text": "Pairs a chip-level 65C02 computer with custom hardware, video, sound, floppy, and microSD support with a cycle-honest emulator and browser assembler built around the same machine.",
      "why_it_matters": "An independent builder is turning an improbable idea into a working project.",
      "limitations": [
        "A Desk Pick is an editorial selection, not a product endorsement."
      ],
      "importance": null,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-021/3ric",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-021.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [],
      "source_ids": [],
      "tags": [
        "independent-builders",
        "desk-pick",
        "released"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/invention-desk/3ric.png",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-022",
      "source_story_id": "invention-m3-crete",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 24,
      "story_type": "invention_desk",
      "section": "invention-desk",
      "editorial_classification": "editorial",
      "headline": "M3-CRETE",
      "slug": "m3-crete",
      "dek": "Publishes a pallet-scale cartesian motion reference, CAD, BOM, and low-voltage controls for supervised cementitious-extrusion research while explicitly excluding certified structural use.",
      "summary": "Publishes a pallet-scale cartesian motion reference, CAD, BOM, and low-voltage controls for supervised cementitious-extrusion research while explicitly excluding certified structural use.",
      "body_text": "Publishes a pallet-scale cartesian motion reference, CAD, BOM, and low-voltage controls for supervised cementitious-extrusion research while explicitly excluding certified structural use.",
      "why_it_matters": "An independent builder is turning an improbable idea into a working project.",
      "limitations": [
        "A Desk Pick is an editorial selection, not a product endorsement."
      ],
      "importance": null,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-022/m3-crete",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-022.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [],
      "source_ids": [],
      "tags": [
        "independent-builders",
        "desk-pick",
        "prototype"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/invention-desk/m3-crete.png",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-023",
      "source_story_id": "invention-desknode",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 25,
      "story_type": "invention_desk",
      "section": "invention-desk",
      "editorial_classification": "editorial",
      "headline": "DeskNode",
      "slug": "desknode",
      "dek": "Turns a bare ESP32-S3 touchscreen into a USB-connected desk instrument for PC activity and optional room temperature, humidity, and light measurements.",
      "summary": "Turns a bare ESP32-S3 touchscreen into a USB-connected desk instrument for PC activity and optional room temperature, humidity, and light measurements.",
      "body_text": "Turns a bare ESP32-S3 touchscreen into a USB-connected desk instrument for PC activity and optional room temperature, humidity, and light measurements.",
      "why_it_matters": "An independent builder is turning an improbable idea into a working project.",
      "limitations": [
        "A Desk Pick is an editorial selection, not a product endorsement."
      ],
      "importance": null,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-023/desknode",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-023.json",
      "first_published_at": "2026-09-27T09:00:00.000-04:00",
      "modified_at": "2026-09-27T09:00:00.000-04:00",
      "content_status": "new",
      "is_carryover": false,
      "carryover_reason": null,
      "key_claims": [],
      "source_ids": [],
      "tags": [
        "independent-builders",
        "desk-pick",
        "prototype"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/invention-desk/desknode.png",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-024",
      "source_story_id": "invention-sponsored-house-example",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 26,
      "story_type": "invention_desk",
      "section": "invention-desk",
      "editorial_classification": "house_example",
      "headline": "The First Paid Slot",
      "slug": "the-first-paid-slot",
      "dek": "A transparent preview of paid placement with one verified link and no claim of endorsement.",
      "summary": "A transparent preview of paid placement with one verified link and no claim of endorsement.",
      "body_text": "A transparent preview of paid placement with one verified link and no claim of endorsement.\n\nHouse example - no advertiser paid. Payment will buy placement, never endorsement.",
      "why_it_matters": "This placement explains how builders can appear in The Invention Desk without purchasing editorial endorsement.",
      "limitations": [
        "House example - no advertiser paid. Payment will buy placement, never endorsement."
      ],
      "importance": null,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-024/the-first-paid-slot",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-024.json",
      "first_published_at": "2026-07-10T09:00:00.000-04:00",
      "modified_at": "2026-07-10T09:00:00.000-04:00",
      "content_status": "carried_over",
      "is_carryover": true,
      "carryover_reason": "invention_desk_seven_day_placement",
      "key_claims": [],
      "source_ids": [],
      "tags": [
        "independent-builders",
        "sponsored-project",
        "open"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/invention-desk/sponsored-project.webp",
      "corrections": []
    },
    {
      "story_id": "mp-2026-09-27-025",
      "source_story_id": "invention-placement-cta",
      "edition_id": "mp-2026-09-27-morning-0080",
      "edition_url": "https://themachinepress.com/edition/2026-09-27",
      "position": 27,
      "story_type": "invention_desk",
      "section": "invention-desk",
      "editorial_classification": "house_example",
      "headline": "Put Your Project on the Desk",
      "slug": "put-your-project-on-the-desk",
      "dek": "One manually reviewed placement stays active for seven days and remains separate from Desk Picks.",
      "summary": "One manually reviewed placement stays active for seven days and remains separate from Desk Picks.",
      "body_text": "One manually reviewed placement stays active for seven days and remains separate from Desk Picks.\n\nManual intake only. Payment buys placement, never endorsement, and every submission is reviewed.",
      "why_it_matters": "This placement explains how builders can appear in The Invention Desk without purchasing editorial endorsement.",
      "limitations": [
        "Manual intake only. Payment buys placement, never endorsement, and every submission is reviewed."
      ],
      "importance": null,
      "canonical_url": "https://themachinepress.com/story/mp-2026-09-27-025/put-your-project-on-the-desk",
      "json_url": "https://themachinepress.com/story/mp-2026-09-27-025.json",
      "first_published_at": "2026-07-10T09:00:00.000-04:00",
      "modified_at": "2026-07-10T09:00:00.000-04:00",
      "content_status": "carried_over",
      "is_carryover": true,
      "carryover_reason": "invention_desk_seven_day_placement",
      "key_claims": [],
      "source_ids": [],
      "tags": [
        "independent-builders",
        "cta",
        "open"
      ],
      "image_url": "https://themachinepress.com/issues/2026-09-27/invention-desk/put-your-project-on-the-desk.webp",
      "corrections": []
    }
  ],
  "sources": [
    {
      "source_id": "source-2026-09-27-001",
      "title": "arXiv preprint 2609.30028",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30028",
      "canonical_url": "https://arxiv.org/abs/2609.30028",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:02:40.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-001-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-002",
      "title": "arXiv preprint 2609.30144",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30144",
      "canonical_url": "https://arxiv.org/abs/2609.30144",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T13:10:03.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-002-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-003",
      "title": "arXiv preprint 2609.29875",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29875",
      "canonical_url": "https://arxiv.org/abs/2609.29875",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T10:28:43.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-003-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-004",
      "title": "arXiv preprint 2609.29876",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29876",
      "canonical_url": "https://arxiv.org/abs/2609.29876",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T10:28:55.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-004-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-005",
      "title": "arXiv preprint 2609.29892",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29892",
      "canonical_url": "https://arxiv.org/abs/2609.29892",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T10:38:08.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-005-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-006",
      "title": "arXiv preprint 2609.29947",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29947",
      "canonical_url": "https://arxiv.org/abs/2609.29947",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T11:08:09.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-006-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-007",
      "title": "arXiv preprint 2609.29948",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29948",
      "canonical_url": "https://arxiv.org/abs/2609.29948",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T11:08:13.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-007-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-008",
      "title": "arXiv preprint 2609.30048",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30048",
      "canonical_url": "https://arxiv.org/abs/2609.30048",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:11:21.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-008-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-009",
      "title": "arXiv preprint 2609.30050",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30050",
      "canonical_url": "https://arxiv.org/abs/2609.30050",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:11:25.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-009-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-010",
      "title": "arXiv preprint 2609.30054",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30054",
      "canonical_url": "https://arxiv.org/abs/2609.30054",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:12:14.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-010-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-011",
      "title": "arXiv preprint 2609.30063",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30063",
      "canonical_url": "https://arxiv.org/abs/2609.30063",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:23:01.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-011-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-012",
      "title": "arXiv preprint 2609.30123",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30123",
      "canonical_url": "https://arxiv.org/abs/2609.30123",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:58:18.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-012-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-013",
      "title": "arXiv preprint 2609.29644",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29644",
      "canonical_url": "https://arxiv.org/abs/2609.29644",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T08:37:21.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-013-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-014",
      "title": "arXiv preprint 2609.29760",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29760",
      "canonical_url": "https://arxiv.org/abs/2609.29760",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T09:09:50.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-014-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-015",
      "title": "arXiv preprint 2609.30134",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30134",
      "canonical_url": "https://arxiv.org/abs/2609.30134",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T13:05:58.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-026-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-016",
      "title": "arXiv preprint 2609.29908",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29908",
      "canonical_url": "https://arxiv.org/abs/2609.29908",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T10:48:33.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-027-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-017",
      "title": "arXiv preprint 2609.29917",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29917",
      "canonical_url": "https://arxiv.org/abs/2609.29917",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T10:53:41.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-015-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-018",
      "title": "arXiv preprint 2609.29954",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.29954",
      "canonical_url": "https://arxiv.org/abs/2609.29954",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T11:11:47.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-016-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-019",
      "title": "arXiv preprint 2609.30069",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30069",
      "canonical_url": "https://arxiv.org/abs/2609.30069",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:26:34.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-017-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-020",
      "title": "arXiv preprint 2609.30101",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30101",
      "canonical_url": "https://arxiv.org/abs/2609.30101",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T12:44:29.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-018-001"
      ]
    },
    {
      "source_id": "source-2026-09-27-021",
      "title": "arXiv preprint 2609.30171",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30171",
      "canonical_url": "https://arxiv.org/abs/2609.30171",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T13:22:42.000-04:00",
      "accessed_at": "2026-09-27T08:26:41.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-27-019-001"
      ]
    }
  ],
  "corrections": [],
  "publisher": {
    "name": "The Machine Press",
    "url": "https://themachinepress.com",
    "description": "A daily newspaper for the age of artificial intelligence."
  }
}