{
  "schema_version": 1,
  "requested_window": {
    "start": "2026-10-01",
    "end": "2026-10-07"
  },
  "review_finalized_on": "2026-10-10",
  "unique_papers": 1022,
  "counts": {
    "rejected_or_out_of_scope": 367,
    "accepted": 494,
    "reviewed_deferred": 113,
    "known": 48
  },
  "candidate_review_complete": true,
  "full_source_coverage_complete": false,
  "full_review_watermark": "2026-10-02",
  "watermark_advanced": false,
  "retrieval_receipts": [
    {
      "track": "recommendation",
      "mode": "submission-window",
      "candidate_count": 35,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 22,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "recommender system",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "6a188c6d36fab92579072a8df0d7d0e334f76d4c52bfc5311195ce505d0b31d4",
            "next_offset": 18,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "recommendation ranker",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "81c1e34e8c1622e462ff1327259bebe1e11c49e4601ad7e29105c1bb8d952d25",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "generative recommendation",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "b1559fcdbafe1cc409d476a047c8204203095514b886d22f6022141963427035",
            "next_offset": 25,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "LLM recommendation",
            "categories": [
              "cs.IR",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "93361f5ca669662c809e26eb8bc273f67f6a5030cb6ceae94d96cfcbc8491e65",
            "next_offset": 8,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "industrial ranking recommendation",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "a3bc57cfc5207d2c3de93e4923412c05081f1b55c7d3c4d3c12b4efeadc2f66e",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "recommendation online A/B",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "09724183f5fd9ecb5ca5338e9bf1809592c60d45b493feb45e9047f9b33e8fa1",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "recommendation deployed production",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "897f6e9e077c85ca2f190cf924e86694da9980ab04de1680c7f2cfa269e1e532",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "search ranking online A/B",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "c0cd774997fef851e44e0f24c0e18cb0180598533ca068d3adf2269b00d8042d",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "advertising ranking online A/B",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "6dd4adf1a80d77d9f29d13badebf33ea368a951e6a757533b03d0329c1f247d4",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Google recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "01fb7ac189d2006ff75df5cc57e795de2946094491096e946cf012f3e833452a",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Google DeepMind recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "b3388157e2554226e78a7335bfeaa8f9cc513dd8a171f3f4482fe1b0d3da872c",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Meta recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "22d79b2b96bb8916a71794cbab738cd7ad21f32777962bf23cdd5d0b8da682d7",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Netflix recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "d53e9bcf90aaab30ef00bb566c5ae40bd33503f61d7ca80d5a3536e2561356fa",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "ByteDance recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "4fbac943940a0eec81727cfd32d80ee1bd8ee2e09b8411289537a2f5585af7f3",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "TikTok recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "996c880f9e080732f0ff93ad125d3d4f4927ca1b72cd065b7b7c329a7090c11c",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Alibaba recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "dd3aefb7a0c451ebd8cd4da7dd7c9247e0b26c7dc692c9054365672f6555c8ce",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Taobao recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "ece5dbf58af664e2b97f66aad2a042ccbdf715e75861b4eb2d481d9eb88a7dee",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Kuaishou recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "55822f391fb05184b505bd5661ed200852f05333378be72a27981ce0b8d6dbc1",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Pinterest recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "f9e22262c53b01f8b481048cbbc45c21fff8dc49f74350ae7915d8b4b93af6ad",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Amazon recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "1fc3fb909c2a0e66cff2ba41b75a927fa6907cb6109300af605b85e9c45a1a21",
            "next_offset": 4,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Microsoft recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "87d2c21fadf739eefdcf7f5b1d2035e778d370aa74cb80f5d219ee37804c59ce",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Tencent recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "f2099115a15d4ca2bbf21c1fd818de8f",
            "fingerprint": "0f07e8e67c3302df2cab6814103216d0332af7495e2ab9a65fb96d88c3ca8277",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    },
    {
      "track": "recommendation",
      "mode": "-month",
      "candidate_count": 39,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 22,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "recommender system",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "8a100ea9d85db7535548e915b51729a5c70823629b4d136f61962570547a427b",
            "next_offset": 19,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "recommendation ranker",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "696b74b1e7f71001181fba9e0502a58a37e2bffff56a85538b915b98a12f170a",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "generative recommendation",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "f606491d1ad9cf3efd82e5912c852a4d42c43738f85fe44f713dce54fb2fccf9",
            "next_offset": 27,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "LLM recommendation",
            "categories": [
              "cs.IR",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "22ea4bd5d5c0e662c80d1ac531dc87d6e3def88225b4f358d9d55a8da33f1c57",
            "next_offset": 10,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "industrial ranking recommendation",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "e1b1a4e4289b0dae72894f327efa9ce2c53ce93c69792b261982b71dbdb4021e",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "recommendation online A/B",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "7130644679af861f316bf60447d4ff42b64d28c927e1b6dcff308c63f5bcd767",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "recommendation deployed production",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "296abd92f43a860299dfb23a7407250561f3b1b336c335c54455b413460bfc2d",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "search ranking online A/B",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "771276aa89e0256c2cca8f6998351ebac9a3ccd5b014c9a8195d325e4020cd43",
            "next_offset": 1,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "advertising ranking online A/B",
            "categories": [
              "cs.IR",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "287a7c7ac5b55c33648e4add9bdb2a53ce7e1f8710d1a37f7b3c9194c151a5dc",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Google recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "71c5e84d013c307d1071a0f4cf09e3b8eb5934a764adfa50df7f0e671f1efbd5",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Google DeepMind recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "572110fac31ffa6d4271bb430a866892d28d048d3e4c090f283c8f2c51b8aab9",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Meta recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "974f0f14db4469d0b6f98e00298ba17606fbdc3c03aec1bdd0eeefa238b0ff25",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Netflix recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "a09ff3983330b67fcab7793337ef597c8620959a58a47f05efd6dc452b7825aa",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "ByteDance recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "4638389ed45845f32c4461923563ce800788af99619f536e8884f13df9fb08b5",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "TikTok recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "6e025a645efadc128fa0b77071d3641064b81ecd664247bf0b862fca07690770",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Alibaba recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "0fd6f7b5a0f4e7a0895ffc36e9de53bd37df7c837265fa948e571ed1e197c830",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Taobao recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "a99a6a415b14ce9b8996456c6edace79ecb31be134c85f04fedad24238289ba0",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Kuaishou recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "7b690b48f35a167eba34b4b6f445c987bc5623ddbfd241422504c3684ae08cf6",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Pinterest recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "efdbed911fb74ab4440ee7ad544ca4a4783b82e1718bc1cbe51e1ab4f5db335d",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Amazon recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "abf4c8e9a6daac43742643614964de424276d6906122d1dc59cdfcf96594288e",
            "next_offset": 4,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Microsoft recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "5625efe1219f8e712faf98fca8fc74e2870528f93c227f9dc0591e7390513f30",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "Tencent recommendation",
            "categories": [
              "cs.IR",
              "cs.LG",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "e0a8928dc7574f9986add0c547e86a0f",
            "fingerprint": "86dff282b45857b540f2e66c57af178e77391e3c5a078bba82e23e3431915aab",
            "next_offset": 0,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    },
    {
      "track": "foundation-model",
      "mode": "submission-window",
      "candidate_count": 411,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 8,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "language model architecture",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "7a2a1250b6ee4b08f6d48df06222ddd84b77278dd0d178d4541adf172c97b466",
            "next_offset": 69,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "transformer architecture",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "4d975faa2614791d2549108f617cacf6baa78f6f94366fce858294bf729b06c5",
            "next_offset": 54,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "efficient LLM inference",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "151d0f6586cb7279ccda074d8b1c7ca9be582017c0650c2e488e1a065a9ec725",
            "next_offset": 21,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model long context",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "cca98f1620dfca36c749274d4c30f22085bf79b3ce473e3a7691dbcd76c9a3c9",
            "next_offset": 38,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model pretraining data",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "e4a15d751c72e375c89b7a4408af6d8822c8550021ad349b5774c7aba11d747b",
            "next_offset": 29,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "multimodal language model",
            "categories": [
              "cs.CV",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "0ec5800932d852de76bb826a3c97807cabecc10f0c746121cdcb27265c2daa17",
            "next_offset": 67,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "vision language model",
            "categories": [
              "cs.CV",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "16a25f1c418641e05455fae956535b421f5bc0e3d2bb9fb3899376bdd593ad06",
            "next_offset": 198,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 2,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model compression",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "e7220e8756a1499493aa8bf48752ca17",
            "fingerprint": "818564fefd154664c01ba359fd4729d3e5fa68c106ef3d960b14c02bde9a86af",
            "next_offset": 45,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    },
    {
      "track": "foundation-model",
      "mode": "-month",
      "candidate_count": 459,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 8,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "language model architecture",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "87d55f5aee9ec473bb7391537cfda62caf98bbf5bbbb22971d018719835081ee",
            "next_offset": 79,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "transformer architecture",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "9914353c120a10921c884ba1b440f5db7bee123875e1bd4c4e1281ef065f83dc",
            "next_offset": 62,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "efficient LLM inference",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "65e118e262e13a01c9c81a83407adfb776cef6dbd30ee1d0b9e67cf27f1e9cab",
            "next_offset": 27,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model long context",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "79d664a3ac7e666056d2aecc38a0dc74f5643f8f2d0860ca7a06a6491494955c",
            "next_offset": 41,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model pretraining data",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "3ee9c43b152998b1f91e44aa4d2930eaf35f566a9d628f7f8403361acc5164c3",
            "next_offset": 32,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "multimodal language model",
            "categories": [
              "cs.CV",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "bf7be4c59fa6cfc1e206f385af788c97837546f97f23db4df7b94bae851e3aae",
            "next_offset": 77,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "vision language model",
            "categories": [
              "cs.CV",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "4732160e858b3e2f7a14b5ec261aed56681f8d29be0b55966769bdfb392e72c4",
            "next_offset": 219,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 3,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model compression",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "b9bb5356604b4ee59b69bab3aea69427",
            "fingerprint": "519e5c15144ed2dfdbb2cb46ddbd9f637512b43e3be11b023c6b78aa7c547283",
            "next_offset": 50,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    },
    {
      "track": "post-training",
      "mode": "submission-window",
      "candidate_count": 177,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 8,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "language model post training",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "35bf12348d3ea785e1a7f335f284310edfde9d20d5b70c9a947e40abd898d861",
            "next_offset": 74,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model preference optimization",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "2784207c6676e9da36bd43f586f5a29954c516a82568ba887c3965c24129694d",
            "next_offset": 9,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "reinforcement learning language model",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "c045c5e27bba1d2234504b194144adc727aa94d36829dd6c63e904b36914a0b8",
            "next_offset": 86,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "on policy distillation language model",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "33e318e801d3aae44387e314f3455f1ea1c5ca9defbadb7d9ba5835c3fc7fa10",
            "next_offset": 25,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model reward model",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "769b497279081dbe51fd1afa7f3a5bd93e8efe33581555f1caa17f3ddacdb390",
            "next_offset": 74,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model process reward",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "a7d2fd799a9393888719e5bf3951fc00472eeb8c0661f92871497cedd9bbe9ca",
            "next_offset": 3,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "test time reinforcement learning",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "ef584d2c32d9ad7ea4850750569533bc16293ce15e79dfbd7deedafe50abab40",
            "next_offset": 19,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "online policy distillation",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "8b577b9b125f4bb6a72381a34bc675a2",
            "fingerprint": "89a78e59d1e5f7c19c027d06a0982c37ec2ed0a9d091cfec16f83c0568661013",
            "next_offset": 3,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    },
    {
      "track": "post-training",
      "mode": "-month",
      "candidate_count": 201,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 8,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "language model post training",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "fcae38dcd0473d87145e9683f3fdf712ab98c8637d1e63d62684c53a1f80fa12",
            "next_offset": 84,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model preference optimization",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "aeca04c783ff7f7ff6dc7843f7922de6a5b9ddcfdc5e1ffc8a7cf7a60e4dbd42",
            "next_offset": 11,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "reinforcement learning language model",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "f7bdec5a5526b2df13b3a282abbab7fb3d0621722216f49ff174deb12aadf6ae",
            "next_offset": 96,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "on policy distillation language model",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "b91efae1ca44b48b70f48ba2ef54e68e55c0ba5d5987c38931f2837be65d1394",
            "next_offset": 29,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model reward model",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "7296516545d92694c859985bf4f32049a8e44094023f3c9ec529f4ce86db4bff",
            "next_offset": 83,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model process reward",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "24b9e60582b955e3c40dfa2e9d066b7bc06a55466de009ad17de9615198dd582",
            "next_offset": 4,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "test time reinforcement learning",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "1d861c71b14ee471d72ad78bcc2bbefd2737aaf974ce8f8da6eabf215bce6d80",
            "next_offset": 20,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "online policy distillation",
            "categories": [
              "cs.CL",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "9c0838b1e33f49c4867899ea0f0c50eb",
            "fingerprint": "afd3bb0cf2057e408c6ccd3cadf1b0eca35833c846d9832ceac2bb0e446efbd9",
            "next_offset": 4,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    },
    {
      "track": "agent",
      "mode": "submission-window",
      "candidate_count": 396,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 8,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "LLM agent",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "cf9ef62a8a8ae20064821cf1b94b73b8fb8a3a114e5e04f2b4dea4f0fa043faf",
            "next_offset": 234,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 3,
            "resumed": false,
            "error": null
          },
          {
            "query": "agentic reinforcement learning",
            "categories": [
              "cs.AI",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "75f558331c73e0c3d6d79df50fbffdcbbc91acb8760e118856ffbbc6d282b72b",
            "next_offset": 80,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model tool use agent",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "6c5367420698aad35dd5eef05d00ecd63290ceabcde3da6c360fe738bbc19618",
            "next_offset": 57,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "web agent language model",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "f2cd15f19fb196e77c837e477376e639f2c990edcde8c3f1a1de776928ab0c50",
            "next_offset": 16,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "software engineering agent",
            "categories": [
              "cs.SE",
              "cs.AI"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "fe95274c2db5bafb0d51dbd1da2698f5c233728d567976d2c0dcb7a188edb417",
            "next_offset": 71,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model agent memory",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "1150d855a4cd711f07c7563fa861fe12f98f1e20a8f592a4c45e50424c042601",
            "next_offset": 42,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model agent planning",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "88649bde17dbde6da31f1cd80084d246ed3bf9c696ebe6486804659f122fb338",
            "next_offset": 27,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "large language model multi agent",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "2026-10-01",
            "date_to": "2026-10-07",
            "scan_id": "3adcb53d958c4324ad39a8cabca119fc",
            "fingerprint": "e82769c76a1c8bfc845f269d6b5e9085eba151c73e523c13f099b3ceedd7b24b",
            "next_offset": 50,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    },
    {
      "track": "agent",
      "mode": "-month",
      "candidate_count": 437,
      "transport": {
        "coverage_complete": true,
        "transport_complete": true,
        "query_count": 8,
        "capped_queries": 0,
        "failed_queries": 0,
        "cache_fallback_pages": 0,
        "queries": [
          {
            "query": "LLM agent",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "a3a183a8eab40f2c4d6c1409e14e7e1ea0ddaedb5dcabde0aa61332cae2079e1",
            "next_offset": 260,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 3,
            "resumed": false,
            "error": null
          },
          {
            "query": "agentic reinforcement learning",
            "categories": [
              "cs.AI",
              "cs.LG"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "590f48d0af09d834044cbc8facefea392f9d5dbc8bdd5b1c3754e1bdf3119917",
            "next_offset": 91,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model tool use agent",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "7232b49947b02d20d3371b6f433a46b59c92cf252a4f9161f545470b7586a41b",
            "next_offset": 62,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "web agent language model",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "14f92e0f7ae271931e3e830de5c1a06f6c01aadc0b1988322e4dc4c6495660af",
            "next_offset": 17,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "software engineering agent",
            "categories": [
              "cs.SE",
              "cs.AI"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "6c234e59e22fdef9bf667c478c544267dd495e32d9599d18ced55948bd87ca56",
            "next_offset": 77,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model agent memory",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "ef49d1cf983e7cf38fc6498aafc0d910af170f2d25db70bded71c26505d9b7b4",
            "next_offset": 46,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "language model agent planning",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "8b29a834fa61cb5baf8f40ad11c4812afc6a9dbad275627dec569a180fd566e1",
            "next_offset": 31,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          },
          {
            "query": "large language model multi agent",
            "categories": [
              "cs.AI",
              "cs.CL"
            ],
            "match": "all",
            "page_size": 100,
            "maximum_results": 2000,
            "date_from": "None",
            "date_to": "None",
            "identifier_months": [
              "2610"
            ],
            "scan_id": "bcb6885e3ca44365b3104b897585472e",
            "fingerprint": "9d9bba905a040c3edd4ccbd9383fb6e38ce40eed10e0d5bd268f47aac3398d81",
            "next_offset": 54,
            "state": "exhausted",
            "coverage_complete": true,
            "transport_complete": true,
            "cache_fallback_pages": 0,
            "pages": 1,
            "resumed": false,
            "error": null
          }
        ],
        "scope": "configured arXiv API query matrix only; candidate date/identifier-month filtering is separate",
        "review_complete": false,
        "watermark_eligible": false,
        "note": "API retrieval coverage does not certify full-text review or all-source coverage; no review watermark is advanced automatically",
        "cache_dir": ".cache/paper-discovery/arxiv"
      }
    }
  ],
  "papers": [
    {
      "id": "2610.08791",
      "title": "World Models' Last Exam in Physics",
      "published": "2026-10-06T17:59:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08791",
          "title": "World Models' Last Exam in Physics",
          "published": "2026-10-06T17:59:56Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "40项物理关系测量任务覆盖九类现象，官方公开任务图像/提示/评估器及外部视频批评估入口，可纳入evolve公共评测候选；不是新世界模型算法，也不是已接入。",
          "review_level": "fulltext",
          "kind": "evaluation_infrastructure",
          "official_url": "https://arxiv.org/html/2610.08791v1",
          "code_url": "https://github.com/Einsia/phys-last-exam",
          "locations": [
            "§2.1–2.4/Eq1–7",
            "§3.1–3.3/Table2",
            "official README",
            "docs/evaluation.md",
            "easy/P21/evaluator/_shared/unified_evaluators/runtime.py:339–355",
            "evaluate.py:summarize"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08791",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08791v1",
              "location": "§2.1–2.4/Eq1–7; §3.1–3.3/Table2; official README; docs/evaluation.md; easy/P21/evaluator/_shared/unified_evaluators/runtime.py:339–355; evaluate.py:summarize"
            },
            {
              "url": "https://arxiv.org/html/2610.08791v1",
              "location": "§2.1–2.4/Eq1–7; §3.1–3.3/Table2; official README; docs/evaluation.md; easy/P21/evaluator/_shared/unified_evaluators/runtime.py:339–355; evaluate.py:summarize",
              "notes": "预设物理残差评分，VLM仅负责可观测性门；40task×8model×4sample，human排名51.58%对43.40% VLM，pairwise53.12%对45.62%。"
            }
          ],
          "limitations": "官方网页404但GitHub可访问。已确认论文与代码差异：论文门失败仍尝试物理测量，公开runtime gate失败直接return/physics_attempted=False；接入须保留原论文测量协议并分别报告coverage，不可把现有脚本直接宣称保真实现。难度标签基于被评模型均分事后划分；human一致性仅约53%，不是物理真值oracle。",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "预设物理残差评分，VLM仅负责可观测性门；40task×8model×4sample，human排名51.58%对43.40% VLM，pairwise53.12%对45.62%。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08781",
      "title": "IdeaAnchor: Teaching LLMs to Turn Literature into Research Ideas",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08781",
          "title": "IdeaAnchor: Teaching LLMs to Turn Literature into Research Ideas",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "正文为anchor数据/特权监督范式，优化器仍标准SFT、self-training和GRPO；可作为Agent科研数据方法，不纳入核心优化器实现。 该决定仅限后训练核心track，Agent方法/数据公共入口由Agent track独立判断，不能据此全局拒绝。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.08781v1",
              "location": "§3.1式1–3；§4.1–4.2"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08779",
      "title": "ALIVE: Interaction-Aligned Object Insertion for First-Frame-Guided Video Editing",
      "published": "2026-10-06T17:58:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08779",
          "title": "ALIVE: Interaction-Aligned Object Insertion for First-Frame-Guided Video Editing",
          "published": "2026-10-06T17:58:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ALIVE以source+noisy target通道拼接、干净首帧和按时间overlap/描述长度归一的cross-attention；Qwen VLM从同输入预测P4而不是读target。35,800对训练与两benchmark；部分基线额外P2提示不完全同条件。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08779",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08779v1",
              "location": "§3；§4.2式2–4、§4.3式5；§5.1"
            },
            {
              "url": "https://arxiv.org/html/2610.08779v1",
              "location": "§3；§4.2式2–4、§4.3式5；§5.1",
              "notes": "ALIVE以source+noisy target通道拼接、干净首帧和按时间overlap/描述长度归一的cross-attention；Qwen VLM从同输入预测P4而不是读target。35,800对训练与两benchmark；部分基线额外P2提示不完全同条件。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08779v1",
          "locations": [
            "§3；§4.2式2–4、§4.3式5；§5.1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "ALIVE以source+noisy target通道拼接、干净首帧和按时间overlap/描述长度归一的cross-attention；Qwen VLM从同输入预测P4而不是读target。35,800对训练与两benchmark；部分基线额外P2提示不完全同条件。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08778",
      "title": "Sherpa: Teaching LLMs to Teach Adaptively",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08778",
          "title": "Sherpa: Teaching LLMs to Teach Adaptively",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "逐回合gate掩码return并按到达同回合的轨迹leave-one-out归一，训练teacher适应学生偏好；有MATH分离训练/评测及教学benchmark。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.08778v1",
              "location": "§2.3式3；§3.1、§3.4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08775",
      "title": "Agent in a Bottle: Can LLM Agents Turn Their Capabilities Into Cheap, Scalable Artifacts?",
      "published": "2026-10-06T17:57:19Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08775",
          "title": "Agent in a Bottle: Can LLM Agents Turn Their Capabilities Into Cheap, Scalable Artifacts?",
          "published": "2026-10-06T17:57:19Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08775v1",
          "location": "§3.1–3.5 Eq1–6；§4.1；Ethics/Reproducibility；官方README与src/bottled/datasets/esci.py",
          "decision": "accepted",
          "reason": "BOTTLED作为evolve可执行评测基础设施接受：Agent在预算内生成可复用artifact并完成大批无标签任务，明确隐藏gold与预算约束，兼容模型/脚本/路由器候选。",
          "reviewer": "agent_review",
          "evidence": "MAVE/ESCI/RAID三任务；5M加权tokens、10h、A10040G；官方代码存在agent_eval.py/预算MCP/proxy/数据与评分器；ESCI源码拆questions/gold并确定fallback后计算macroF1。",
          "limitations": "原实验每模型每任务两runs，零样本只抽1000；GPU成本未统一入token预算；MIT代码，MAVE CC-BY-NC4.0/ESCI Apache2.0/RAID MIT；contamination judge及Jev评测未公开，不能宣称完整污染审计复现。",
          "code": "https://github.com/aktsonthalia/bottled",
          "license": "MIT code; dataset-specific licenses",
          "candidate_kind": "evaluation_infrastructure",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08773",
      "title": "AdvSim2Real : Training Web Agents Against Adaptive Prompt Injection in a Web World Model",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08773",
          "title": "AdvSim2Real : Training Web Agents Against Adaptive Prompt Injection in a Web World Model",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "冻结world model与judge，分阶段课程—执行者、对手—执行者训练；三seed rollout与150任务对照，不等于真实生产A/B。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.08773v1",
              "location": "§4 Algorithm 1；§5 Table 1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.08773",
          "title": "AdvSim2Real : Training Web Agents Against Adaptive Prompt Injection in a Web World Model",
          "published": "2026-10-06",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08773v1",
          "location": "§3 Environment/Threat Model/Metrics；§4 Algorithm1/Eq2–5；§5 Tables1–3；§6 Limitations",
          "decision": "accepted",
          "reason": "AdvSim2Real的三策略/两阶段训练有明确算法：课程以p≈0.5任务奖励，adversary仅获clean-success到failure flip奖励，executor fresh-rollout训练且重用历史attack inputs；可作为Agent RL核心候选。",
          "reviewer": "agent_review",
          "evidence": "表1 base→Robust3 clean 74.89→81.33%、learned-adversary mean 48.07→57.48%；表3 unseen Kimi-K3 23.00→30.72%；表2 Stage1 clean Chromium strict 25.56→44.44%。",
          "limitations": "攻击结果只world-model+LLM judge；Stage2未在真实浏览器测试，不能声称可执行安全；150自建form任务，3 rollout seeds非3训练seeds；攻击后可行性未经核验；去Stage1实验不compute matched，鲁棒性收益仅0.44pp。",
          "institution": "MBZUAI; Amazon; MIT",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08720",
      "title": "WorldSolver: Can LLM Agents Simulate the Physical Dynamics via Solver Generation?",
      "published": "2026-10-06T17:26:26Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08720",
          "title": "WorldSolver: Can LLM Agents Simulate the Physical Dynamics via Solver Generation?",
          "published": "2026-10-06T17:26:26Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08720v1",
          "location": "§2.1–2.3 Eq1–10；§3.1–3.3/Table3；Limitations；官方仓库/API访问2026-10-07",
          "decision": "pending",
          "reason": "WorldSolver的168物理求解器任务/固定scaffold/执行+VLM视觉+物理规则评分适合evolve，但官方链接github.com/sirujiang/WorldSolver网页与API均404，暂不能确认公开任务/评分器/许可，等待可执行发布。",
          "reviewer": "agent_review",
          "evidence": "7物理域；生成1800秒/solver600秒；执行失败记0，成功取(V+P)/2；GPT5.6Sol48.7、ClaudeOpus546.7。",
          "limitations": "60分pass阈值仅演示非验证标准；评分规则对Agent隐藏；不同模型用不同harness；VLM judge也参与被测模型，需独立审核；代码不可达不是算法无价值。",
          "code": "https://github.com/sirujiang/WorldSolver",
          "pending_reason": "public_artifacts_unavailable",
          "candidate_kind": "evaluation_infrastructure",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08718",
      "title": "When Forgetting is not Catastrophic: On the Mechanics of Spurious Forgetting",
      "published": "2026-10-06T17:25:48Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08718",
          "title": "When Forgetting is not Catastrophic: On the Mechanics of Spurious Forgetting",
          "published": "2026-10-06T17:25:48Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "新事实微调造成共享表征偏移与逐事实侵蚀分离；对更新矩阵删首奇异分量的干预在OLMo2-1B有同范数随机rank1对照，可登记机制诊断候选，不能宣传为通用抗遗忘能力算法。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08718",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08718v1",
              "location": "§4.1–4.4; §5.1–5.2/Figure5; §6/Limitations; Appendix D.2"
            },
            {
              "url": "https://arxiv.org/html/2610.08718v1",
              "location": "§4.1–4.4; §5.1–5.2/Figure5; §6/Limitations; Appendix D.2",
              "notes": "三seed、CounterFact初始已知旧事实；合成新实体训练恢复但真实EntityQuestions制造商不恢复；删主方向可还原旧事实但损新事实，随机方向不能。"
            }
          ],
          "kind": "mechanism_diagnostic",
          "official_url": "https://arxiv.org/html/2610.08718v1",
          "locations": [
            "§4.1–4.4",
            "§5.1–5.2/Figure5",
            "§6/Limitations",
            "Appendix D.2"
          ],
          "limitations": "人为新旧答案首token不重叠，单预训练模型；诊断logit均值来自已知oldfact不能在线oracle使用。只采用权重干预时须独立validation选checkpoint和rank。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "三seed、CounterFact初始已知旧事实；合成新实体训练恢复但真实EntityQuestions制造商不恢复；删主方向可还原旧事实但损新事实，随机方向不能。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08713",
      "title": "SpaTime: Streaming Vision-Language Models for Spatio-temporal Reasoning",
      "published": "2026-10-06T17:22:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08713",
          "title": "SpaTime: Streaming Vision-Language Models for Spatio-temporal Reasoning",
          "published": "2026-10-06T17:22:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SpaTime冻结因果几何/视觉编码器，2×2 merge投影相加，训练LoRA/state/head并建模首个Response分布作时间损失；strict只计最早回答，charitable末帧强制回答须分开。StreamVSTI训练、StreamVSI任务OOD。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08713",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08713v1",
              "location": "§4.1式5；§4.2式6–8；§5；§6"
            },
            {
              "url": "https://arxiv.org/html/2610.08713v1",
              "location": "§4.1式5；§4.2式6–8；§5；§6",
              "notes": "SpaTime冻结因果几何/视觉编码器，2×2 merge投影相加，训练LoRA/state/head并建模首个Response分布作时间损失；strict只计最早回答，charitable末帧强制回答须分开。StreamVSTI训练、StreamVSI任务OOD。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08713v1",
          "locations": [
            "§4.1式5；§4.2式6–8；§5；§6"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "SpaTime冻结因果几何/视觉编码器，2×2 merge投影相加，训练LoRA/state/head并建模首个Response分布作时间损失；strict只计最早回答，charitable末帧强制回答须分开。StreamVSTI训练、StreamVSI任务OOD。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08691",
      "title": "ScienceClaw: Benchmarking Continual Self-Evolution of AI-for-Science Agents Across the Natural and Social Sciences",
      "published": "2026-10-06T17:08:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08691",
          "title": "ScienceClaw: Benchmarking Continual Self-Evolution of AI-for-Science Agents Across the Natural and Social Sciences",
          "published": "2026-10-06T17:08:03Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08691v1",
          "location": "§3 Eq1–3；§4.1–4.2；§5.1–5.2 Eq5–13；§6 Tables1–2/Fig6；§8",
          "decision": "accepted",
          "reason": "ScienceClaw冻结模型，以typed workflow执行修复提取linked Skill–Operator bundles，boundary/source reset replay必须实际使用新版本，只有独立validation严格提升且hard constraints/预算通过才原子晋级；符合真实evolve闭环候选。",
          "reviewer": "agent_review",
          "evidence": "23学科每学科64 IID+64 OOD；7轮MacroSR OOD77.72→91.30；70/161候选晋级；OOD不参与提案/选择；去链接/去replay/独立validator均有消融。",
          "limitations": "主要final snapshots，作者§8承认广泛结论需重复runs和学科intervals；domain evaluator可能漏科学错误；需实际科学工具/独立verifier，不能固定轨迹fixture作为能力复现。",
          "code": "https://github.com/beita6969/ScienceClaw",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08678",
      "title": "Secure Speculative Decoding for Large Language Models",
      "published": "2026-10-06T16:59:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08678",
          "title": "Secure Speculative Decoding for Large Language Models",
          "published": "2026-10-06T16:59:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SecureSD 按全局生成位置混合标准/宽松接受与拒绝恢复分布，早期严格验证，后续恢复快速验证；定义完整，可作为真实投机解码候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08678",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08678v1",
              "location": "§IV-B; §V Algorithm 2 / Eq7–14; §VII-A paired protocol; §VIII Tables XII–XIII"
            },
            {
              "url": "https://arxiv.org/html/2610.08678v1",
              "location": "§IV-B; §V Algorithm 2 / Eq7–14; §VII-A paired protocol; §VIII Tables XII–XIII",
              "notes": ""
            }
          ],
          "kind": "inference_algorithm",
          "locations": [
            "§IV-B",
            "§V Algorithm 2 / Eq7–14",
            "§VII-A paired protocol",
            "§VIII Tables XII–XIII"
          ],
          "limitations": "不是对任意攻击的安全保证；需目标/草稿模型、lossless/relaxed/corrected 三臂同参数对照，并把任务质量和真实延迟分开报告。原文主要 Blackwell 实测，不代表 A100 已验证。",
          "code_url": "https://github.com/YichiCS/Secure-Speculative-Decoding",
          "code_status": "official repository accessible; MIT; bench/securesd/scripts present; some judge/model checkpoints gated",
          "official_url": "https://arxiv.org/html/2610.08678v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08674",
      "title": "EC-RAG: Event Chain Retrieval-Augmented Generation for Long Video Understanding",
      "published": "2026-10-06T16:57:46Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08674",
          "title": "EC-RAG: Event Chain Retrieval-Augmented Generation for Long Video Understanding",
          "published": "2026-10-06T16:57:46Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "EC-RAG训练外query模态拆解、CLIP variance取帧、ASR/OCR/DET事件描述与按时间相邻链，Contriever相关事件/邻接上下文辅助回答；三长视频benchmark，不是学习因果事件图，额外工具/token预算须计。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08674",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08674v1",
              "location": "§3.1–3.4式12–16；§4.1–4.2"
            },
            {
              "url": "https://arxiv.org/html/2610.08674v1",
              "location": "§3.1–3.4式12–16；§4.1–4.2",
              "notes": "EC-RAG训练外query模态拆解、CLIP variance取帧、ASR/OCR/DET事件描述与按时间相邻链，Contriever相关事件/邻接上下文辅助回答；三长视频benchmark，不是学习因果事件图，额外工具/token预算须计。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08674v1",
          "locations": [
            "§3.1–3.4式12–16；§4.1–4.2"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "EC-RAG训练外query模态拆解、CLIP variance取帧、ASR/OCR/DET事件描述与按时间相邻链，Contriever相关事件/邻接上下文辅助回答；三长视频benchmark，不是学习因果事件图，额外工具/token预算须计。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08670",
      "title": "Principled Under Pressure: Post-Training Decides Whether LLMs Act on Their Own Moral Judgment",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08670",
          "title": "Principled Under Pressure: Post-Training Decides Whether LLMs Act on Their Own Moral Judgment",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公共评测：判断—行动差距的筛选、四级测量校准与压力对照独立于训练算法；Apache-2.0 DeepSteer仓库可访问。仅74/208主情境通过screen，报告条件分布不能外推总体。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.08670v1",
              "location": "§3.1–3.5；Appendix F"
            },
            {
              "url": "https://github.com/deepsteer/deepsteer/",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "预注册价值判断—行动差距评测，比较现有后训练配方；摘要未提出新的训练算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.08670",
          "title": "Principled Under Pressure: Post-Training Decides Whether LLMs Act on Their Own Moral Judgment",
          "published": "2026-10-06T16:52:23Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08670v1",
          "location": "§3.1–3.5；Appendix F；作者仓库README/文件列表已只读核查",
          "decision": "accepted",
          "reason": "公共评测：判断—行动差距的筛选、四级测量校准与压力对照独立于训练算法；Apache-2.0 DeepSteer仓库可访问。仅74/208主情境通过screen，报告条件分布不能外推总体。",
          "id": "2610.08670",
          "repository_status": "new",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.08670v1",
              "location": "§3.1–3.5；Appendix F"
            },
            {
              "url": "https://github.com/deepsteer/deepsteer/",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "预注册价值判断—行动差距评测，比较现有后训练配方；摘要未提出新的训练算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "reviewer": "post_training_review_reused",
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08668",
      "title": "Semantic Behavioral Watermarking: Paraphrase-Robust and Forgery-Resistant Provenance for LLM Agents",
      "published": "2026-10-06T16:50:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08668",
          "title": "Semantic Behavioral Watermarking: Paraphrase-Robust and Forgery-Resistant Provenance for LLM Agents",
          "published": "2026-10-06T16:50:42Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08668v1",
          "location": "§3 threat model；§4.1–4.3；§5；§6.1/6.3/6.4 Tables2/4/5；§7",
          "decision": "out_of_scope",
          "reason": "SBW的语义聚类/历史keyed PRF/弃权margin为Agent行为溯源水印算法，主要优化归因检测而非Agent规划、学习、工具使用或任务能力，排除本轮核心能力收录。",
          "reviewer": "agent_review",
          "evidence": "ToolBench paraphrase TPR 0.49–0.66；ALFWorld 0.92–0.97；训练无关encoder+kmeans+permutation detector。",
          "limitations": "§7明示ToolBench无环境执行反馈；复制/链式replay未解决；utility只是动作与argmax一致率，不是任务成功率；部分鲁棒审计artifacts未保留。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08662",
      "title": "ParanoiaEval: Benchmarking Unnecessary Defensive Work in Agentic Coding",
      "published": "2026-10-06T16:46:14Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08662",
          "title": "ParanoiaEval: Benchmarking Unnecessary Defensive Work in Agentic Coding",
          "published": "2026-10-06T16:46:14Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08662v1",
          "location": "§4.1–4.3；§5；§7 Code/Data；官方README、scripts/judge.py",
          "decision": "accepted",
          "reason": "ParanoiaEval作为evolve行为约束评测接受：200同任务E+/E−证据对，任务oracle和多余风险处置judge分离，可同时评测完成度与证据响应。",
          "reviewer": "agent_review",
          "evidence": "50固定repo、400variants；oracle检验baseline失败/reference成功（28read-only例外）；冻结64人标memory、跨task检索；heldout200判决accuracy.965/kappa.93；MIT任务/runner/judge公开。",
          "limitations": "公开包无结果/完整轨迹；answer cards/reference补丁只能独立scorer访问；模型native harness混杂不能声称模型净能力差异；developer study限成功runs且非部署A/B；默认same-task=none，不能打开other-arm泄漏gold。",
          "code": "https://github.com/ZhuoningXu/ParanoiaEval_release",
          "license": "MIT",
          "candidate_kind": "evaluation_infrastructure",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08659",
      "title": "Selective Transfer of RL Updates for Visual Reasoning",
      "published": "2026-10-06T16:43:55Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08659",
          "title": "Selective Transfer of RL Updates for Visual Reasoning",
          "published": "2026-10-06T16:43:55Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Selective-RL隔离R−B与B−V，逐矩阵rank1 SVD后恢复原Frobenius norm，分别重构donor插值和直接加RLdelta；3个8B VLM骨干，源验证选donor，H1验证选λ后冻结，需保留非视觉模块支持对齐。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08659",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08659v1",
              "location": "§3.1–3.3式1–3；§4.1；Appendix A Algorithm 1"
            },
            {
              "url": "https://arxiv.org/html/2610.08659v1",
              "location": "§3.1–3.3式1–3；§4.1；Appendix A Algorithm 1",
              "notes": "Selective-RL隔离R−B与B−V，逐矩阵rank1 SVD后恢复原Frobenius norm，分别重构donor插值和直接加RLdelta；3个8B VLM骨干，源验证选donor，H1验证选λ后冻结，需保留非视觉模块支持对齐。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08659v1",
          "locations": [
            "§3.1–3.3式1–3；§4.1；Appendix A Algorithm 1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Selective-RL隔离R−B与B−V，逐矩阵rank1 SVD后恢复原Frobenius norm，分别重构donor插值和直接加RLdelta；3个8B VLM骨干，源验证选donor，H1验证选λ后冻结，需保留非视觉模块支持对齐。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08651",
      "title": "A Case Study in Assuring AI-Written Software",
      "published": "2026-10-06T16:37:08Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08651",
          "title": "A Case Study in Assuring AI-Written Software",
          "published": "2026-10-06T16:37:08Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.08651",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "医疗软件治理案例研究，无独立Agent算法贡献。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08649",
      "title": "Stable Scores, Unstable Answers: Frame Phase and Option Order in Video Multiple-Choice Evaluation",
      "published": "2026-10-06T16:36:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08649",
          "title": "Stable Scores, Unstable Answers: Frame Phase and Option Order in Video Multiple-Choice Evaluation",
          "published": "2026-10-06T16:36:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "PhaseFusion把3×8帧相位后验映射到内容空间作算术平均，独立于option排序控制；n442与32帧准确率差0.45pp不显著，origin flip率下降但order flip未解决；串行3.18s高于24帧2.86s，不能用attention单位冒充实测提速。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08649",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08649v1",
              "location": "§3.2式2；§4 Table 1；§4.3"
            },
            {
              "url": "https://arxiv.org/html/2610.08649v1",
              "location": "§3.2式2；§4 Table 1；§4.3",
              "notes": "PhaseFusion把3×8帧相位后验映射到内容空间作算术平均，独立于option排序控制；n442与32帧准确率差0.45pp不显著，origin flip率下降但order flip未解决；串行3.18s高于24帧2.86s，不能用attention单位冒充实测提速。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08649v1",
          "locations": [
            "§3.2式2；§4 Table 1；§4.3"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "PhaseFusion把3×8帧相位后验映射到内容空间作算术平均，独立于option排序控制；n442与32帧准确率差0.45pp不显著，origin flip率下降但order flip未解决；串行3.18s高于24帧2.86s，不能用attention单位冒充实测提速。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08647",
      "title": "SquidAgent: Parallelize Wisely, Coordinate Efficiently",
      "published": "2026-10-06T16:35:28Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08647",
          "title": "SquidAgent: Parallelize Wisely, Coordinate Efficiently",
          "published": "2026-10-06T16:35:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08647v1",
          "location": "§3.1–3.3 Eq1–10/Algorithm1；§4.1–4.6；Tables1–4正文讨论",
          "decision": "accepted",
          "reason": "SquidAgent一次DAG规划同时估算输出token/层对齐成本，session fork继承上下文、预写约定，以sum(tokens)/(max(tokens)+alignment)>alpha决定并行；明确可执行Agent调度机制。",
          "reviewer": "agent_review",
          "evidence": "同Sonnet4.6九任务吞吐17.2→38.1词/秒，质量rubric 97.1→98.2%；4任务去调度吞吐42.93→29.14；59子任务token预测Spearman0.77、时间预测0.16。",
          "limitations": "主要自建九任务、LLM rubric；token代理适用于生成主导场景不捕获tool/API时延；alpha1.9基于MathRef sweep设置，独立validation选择未建立；本地复现需真实LLM调用/成本不能fixture代替。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08639",
      "title": "Forensic Reserve: Eliciting Latent Knowledge for Image Forgery Detection",
      "published": "2026-10-06T16:33:00Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08639",
          "title": "Forensic Reserve: Eliciting Latent Knowledge for Image Forgery Detection",
          "published": "2026-10-06T16:33:00Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "RGE用冻结DINOv3的site-wise ICA及real/fake discovery定位reserve、固定输出basis U，只训练零初始化A的残差UA h；classifier/backbone冻结，benchmark不参与discovery。可复用视觉adapter方法，当前证据仍image forensic专门任务。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08639",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08639v1",
              "location": "§3.1；§3.2式3；§4.1"
            },
            {
              "url": "https://arxiv.org/html/2610.08639v1",
              "location": "§3.1；§3.2式3；§4.1",
              "notes": "RGE用冻结DINOv3的site-wise ICA及real/fake discovery定位reserve、固定输出basis U，只训练零初始化A的残差UA h；classifier/backbone冻结，benchmark不参与discovery。可复用视觉adapter方法，当前证据仍image forensic专门任务。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08639v1",
          "locations": [
            "§3.1；§3.2式3；§4.1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "RGE用冻结DINOv3的site-wise ICA及real/fake discovery定位reserve、固定输出basis U，只训练零初始化A的残差UA h；classifier/backbone冻结，benchmark不参与discovery。可复用视觉adapter方法，当前证据仍image forensic专门任务。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08630",
      "title": "Towards In-Parameter Memory Augmentation for Large Language Models",
      "published": "2026-10-06T16:27:47Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08630",
          "title": "Towards In-Parameter Memory Augmentation for Large Language Models",
          "published": "2026-10-06T16:27:47Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.08630",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "参数记忆综述，无新核心算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08622",
      "title": "Agentic RCA for Internet-Scale Services Using Constrained Creativity",
      "published": "2026-10-06T16:21:57Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08622",
          "title": "Agentic RCA for Internet-Scale Services Using Constrained Creativity",
          "published": "2026-10-06T16:21:57Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08622v1",
          "location": "§3；§4.1–4.3；§6.1–6.5/Table3/Figs6–9；§8",
          "decision": "accepted",
          "reason": "E4以固定typed DAG语法约束RCA Agent，依次选playbook、组合已有operators、合成新operators；实际执行与admission形成可复现核心控制机制。",
          "reviewer": "agent_review",
          "evidence": "同Gemini3.1Pro对比LLM-only/RCA-Agent/Terminus2；DSB full0.91、starter-only0.72、无admission0.66；6生产incident pilot命中5例，其中2例需analyst hints。",
          "limitations": "§4.3用用户true-root-cause反馈admit，只能在训练/validation接收，不能test gold晋级；Accuracy@k,i允许多次尝试，不是单次accuracy；自建DSB有operator设计混杂；正文70 incident阶段统计与Table3总量不一致，图注≤56%与正文其他集0.80也不一致，headline不能无条件复用。",
          "institution": "Georgia Tech; Carnegie Mellon University; Conviva",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08621",
      "title": "Recursive Game Creator: An Agentic Product-Level Experience-Oriented Game Harness",
      "published": "2026-10-06T16:21:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08621",
          "title": "Recursive Game Creator: An Agentic Product-Level Experience-Oriented Game Harness",
          "published": "2026-10-06T16:21:44Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08621v1",
          "location": "§3.1–3.3；§4.1 Tables1–2；§4.2–4.4/Table3；§5",
          "decision": "accepted",
          "reason": "Recursive Game Creator包含designer/build、可执行多策略player rollout、盲化版本review及实际artifact retention，保留偏好证据到下一轮，属于固定模型Agent迭代闭环。",
          "reviewer": "agent_review",
          "evidence": "45 GameCraft任务同GPT6Astra baseline71.26→round3 77.89；47 GameASG任务success9/47→25/47，L2mean86.6→93.4。",
          "limitations": "非等预算基线，三轮与单轮混杂；用户study仅报告expert数值和playtime，未给强随机对照；97.1%coverage不是GUI速度提升；proxy player不代表人群偏好；能力复现必须实际运行游戏与policy不可gold固定轨迹。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08586",
      "title": "MINDSET: Energy-based Schema Evolution for Long Conversational Agent Memory",
      "published": "2026-10-06T15:55:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08586",
          "title": "MINDSET: Energy-based Schema Evolution for Long Conversational Agent Memory",
          "published": "2026-10-06T15:55:42Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08586v1",
          "location": "§3.1–3.7；§4.1–4.4；§5.1–5.5；Limitations",
          "decision": "accepted",
          "reason": "MINDSET以immutable episodes和versioned schemas，按distortion/contradiction/history/fragmentation/inconsistency加权能量选择reinforce/supersede/split/new，再展开原始证据检索；定义完整可复现记忆算法。",
          "reviewer": "agent_review",
          "evidence": "LoCoMo700按conversation10簇显著提升排名；较LightMem F1+0.0256不显著p=.24023；Gemma上LightMem微领先0.0002；MAB150绝对ICL仅.024。",
          "limitations": "参数为开发集手调非最优理论，dev仅question-disjoint未证conversation-disjoint；LongContext按20k字节截断；基线为复刻，部分upstream artifacts缺失；最终stay margin而非switch margin决定行动，复现需保留这一实现细节。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08561",
      "title": "Reinforcement Learning for Hierarchical Reasoning Rewards: Minimax-Optimal Rates with Transformers",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08561",
          "title": "Reinforcement Learning for Hierarchical Reasoning Rewards: Minimax-Optimal Rates with Transformers",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "定义depth curriculum/prefix自适应查询actor-critic并证明最小极大速率，但本文是形式化理论设置，未核实实际LLM训练benchmark；不列能力复现。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.08561v1",
              "location": "§3.2 Algorithm 1；Theorem 3及后续证明"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08560",
      "title": "Have I Seen Enough? Frozen Video-Language Models Encode Evidence Readiness",
      "published": "2026-10-06T15:43:04Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08560",
          "title": "Have I Seen Enough? Frozen Video-Language Models Encode Evidence Readiness",
          "published": "2026-10-06T15:43:04Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Readiness Gating以冻结Qwen残差的嵌套CV logistic probe预测证据就绪，按训练分位阈值joint readiness/confidence首次停止或deadline最高readiness选答；视频级留出、crossed-quad消除图像/问题独立捷径。固定窗口policy不读证据时间，growing-prefix诊断采样依赖标注不能当部署延迟；§4.4给matched-video-seconds增益。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08560",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08560v1",
              "location": "§3.1–3.3；§4.4；Appendix C/H/I"
            },
            {
              "url": "https://arxiv.org/html/2610.08560v1",
              "location": "§3.1–3.3；§4.4；Appendix C/H/I",
              "notes": "Readiness Gating以冻结Qwen残差的嵌套CV logistic probe预测证据就绪，按训练分位阈值joint readiness/confidence首次停止或deadline最高readiness选答；视频级留出、crossed-quad消除图像/问题独立捷径。固定窗口policy不读证据时间，growing-prefix诊断采样依赖标注不能当部署延迟；§4.4给matched-video-seconds增益。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08560v1",
          "locations": [
            "§3.1–3.3；§4.4；Appendix C/H/I"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Readiness Gating以冻结Qwen残差的嵌套CV logistic probe预测证据就绪，按训练分位阈值joint readiness/confidence首次停止或deadline最高readiness选答；视频级留出、crossed-quad消除图像/问题独立捷径。固定窗口policy不读证据时间，growing-prefix诊断采样依赖标注不能当部署延迟；§4.4给matched-video-seconds增益。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08539",
      "title": "RSJEV: Discriminative Remote Sensing Scene Classification with Multimodal Large Language Models",
      "published": "2026-10-06T15:28:36Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08539",
          "title": "RSJEV: Discriminative Remote Sensing Scene Classification with Multimodal Large Language Models",
          "published": "2026-10-06T15:28:36Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "rejected",
          "reason": "RSJEV把已有JEV/Mapika式候选条件化单token判别读出及CE+Brier目标用于遥感分类；正文核查未发现区别于已登记LLM2Jev/既有Decider的新核心训练机制，作为专门领域复用不另立基础模型算法。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08539",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08539v1",
              "location": "§I–III; §IV.A–E; TableII"
            },
            {
              "url": "https://arxiv.org/html/2610.08539v1",
              "location": "§I–III; §IV.A–E; TableII",
              "notes": "以候选选项token的LM-head行直接读出概率；UCM/AID/NWPU三个已有数据集。Qwen3.5-0.8B 10epoch8A40、batch128，单A40延迟102.18ms，未提供新通用公共评测设施。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.08539v1",
          "locations": [
            "§I–III",
            "§IV.A–E",
            "TableII"
          ],
          "code_url": "https://github.com/Dongtcs/RSJEV",
          "implementation_status": "not_implemented",
          "fulltext_notes": "以候选选项token的LM-head行直接读出概率；UCM/AID/NWPU三个已有数据集。Qwen3.5-0.8B 10epoch8A40、batch128，单A40延迟102.18ms，未提供新通用公共评测设施。",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08528",
      "title": "MedCORE: Criteria-Grounded Clinical Reasoning for Interpretable Medical Image Diagnosis",
      "published": "2026-10-06T15:23:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08528",
          "title": "MedCORE: Criteria-Grounded Clinical Reasoning for Interpretable Medical Image Diagnosis",
          "published": "2026-10-06T15:23:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MedCORE面向皮肤、超声、视网膜病理诊断的临床标准图网络；属于特定医疗应用而非通用基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08528",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08526",
      "title": "WareFly-VLA: A Vision-Language-Action Framework for UAV Navigation and Human Tracking in Smart Warehouses",
      "published": "2026-10-06T15:21:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08526",
          "title": "WareFly-VLA: A Vision-Language-Action Framework for UAV Navigation and Human Tracking in Smart Warehouses",
          "published": "2026-10-06T15:21:14Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "WareFly-VLA定义507飞行轨迹、4DoF连续动作及431/76 episode级固定split，有独立UAV评测价值；§6仅ground-truth帧上的open-loop MAE/correlation及轨迹积分，非闭环飞行成功率。§Data availability明确数据/runner仍access on request、acceptance后公开，故等待公开入口而非未读完。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08526",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08526v1",
              "location": "§3；§5.2；§6.1 Tables 5–6；§7 limitations；Data availability"
            },
            {
              "url": "https://arxiv.org/html/2610.08526v1",
              "location": "§3；§5.2；§6.1 Tables 5–6；§7 limitations；Data availability",
              "notes": "WareFly-VLA定义507飞行轨迹、4DoF连续动作及431/76 episode级固定split，有独立UAV评测价值；§6仅ground-truth帧上的open-loop MAE/correlation及轨迹积分，非闭环飞行成功率。§Data availability明确数据/runner仍access on request、acceptance后公开，故等待公开入口而非未读完。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.08526v1",
          "locations": [
            "§3；§5.2；§6.1 Tables 5–6；§7 limitations；Data availability"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "WareFly-VLA定义507飞行轨迹、4DoF连续动作及431/76 episode级固定split，有独立UAV评测价值；§6仅ground-truth帧上的open-loop MAE/correlation及轨迹积分，非闭环飞行成功率。§Data availability明确数据/runner仍access on request、acceptance后公开，故等待公开入口而非未读完。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08514",
      "title": "How Much Evidence Should a Coding Agent's Self-Correction Carry? Adaptive Dirichlet Evidence for Self-Distillation",
      "published": "2026-10-06T15:17:56Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08514",
          "title": "How Much Evidence Should a Coding Agent's Self-Correction Carry? Adaptive Dirichlet Evidence for Self-Distillation",
          "published": "2026-10-06T15:17:56Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08514v1",
          "location": "§3.1–3.3 Eq1–11；§4.1–4.4；§5",
          "decision": "accepted",
          "reason": "EESD将公开执行before/after四种转移和词法相关性转为有效样本量1/sum(p²)，Dirichlet utility lower score加权CE并保留未加权forward KL；可复现Agent自修正训练机制。",
          "reviewer": "agent_review",
          "evidence": "DeepSeek/CodeARC fresh Pass@1 15.0→20.4%，配对source CI[2.8,8.0]pp；12设置范围−6.8到+5.4pp。",
          "limitations": "只一轮同source适应，不是source-disjoint泛化；full update vs no-update不能归因有效质量或KL；bootstrap条件于单次训练；有效质量仅relevance集中度，不自动修复执行依赖。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08513",
      "title": "Wiki-Talkie: Multilingual Benchmarking of Persona-Based Agents on Real-World Discussions",
      "published": "2026-10-06T15:17:46Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08513",
          "title": "Wiki-Talkie: Multilingual Benchmarking of Persona-Based Agents on Real-World Discussions",
          "published": "2026-10-06T15:17:46Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08513v1",
          "location": "§3.1；§4；§5.2；Limitations/Ethics；official GitHub API2026-10-07",
          "decision": "pending",
          "reason": "Amazon Wiki-Talkie的五语人口行为分布评测有公共评测价值，但官方amazon-science/wikitalkie返回404，数据又明确申请访问非开放镜像；模型A–D及extractor匿名，现阶段审结待资源。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "Wiki2025-10dumps，文章取首评论前revision；next-turn使用真实历史，history5–20先前评论，dialogact annotatorF1.76，JSD/情绪WD衡量群体而非个体人格；CCBYSA4数据声明。",
          "limitations": "behavior从用户50随机threads提炼，接入需重新核严格时间/目标排除；history与profile非信息量配平，profile长度分层不能证明因果；模型匿名阻原数值复现；saltedhash不消除文本反识别，群体研究不得个体冒充。",
          "code": "https://github.com/amazon-science/wikitalkie",
          "pending_reason": "official_repository_404_access_request_data_anonymous_models",
          "candidate_kind": "evaluation_infrastructure",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08482",
      "title": "Knee3DVLM: Dual-Sequence Full-Volume Vision-Language Modeling for Comprehensive Knee MRI Assessment",
      "published": "2026-10-06T14:58:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08482",
          "title": "Knee3DVLM: Dual-Sequence Full-Volume Vision-Language Modeling for Comprehensive Knee MRI Assessment",
          "published": "2026-10-06T14:58:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Knee3DVLM为膝关节MRI双序列57诊断目标建模，属特定医疗模型应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08482",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08463",
      "title": "UNREAL: Unifying Retrieval and Long-Context with a Single Model",
      "published": "2026-10-06T14:48:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08463",
          "title": "UNREAL: Unifying Retrieval and Long-Context with a Single Model",
          "published": "2026-10-06T14:48:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "UNREAL用冻结decoder中层chunk表征、训练64检索token及跨层混合做MaxSim，再重编码所选文本生成；提供multi-positive InfoNCE、公开QA训练split与long-context独立验证协议。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08463",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08463v1",
              "location": "§2.1–2.3 Eq1–7; §3/Table1; §4.2/Figure7; §6; Appendix B.1–B.3"
            },
            {
              "url": "https://arxiv.org/html/2610.08463v1",
              "location": "§2.1–2.3 Eq1–7; §3/Table1; §4.2/Figure7; §6; Appendix B.1–B.3",
              "notes": "21Mchunk 3BtokenWiki2018，query初始top5 BM25，每chunk7vectors、query4groups、<500K训练参数；15K步batch256，500hardnegative从训练gold挖掘。H100约32K后测得TTFT优势。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.08463v1",
          "locations": [
            "§2.1–2.3 Eq1–7",
            "§3/Table1",
            "§4.2/Figure7",
            "§6",
            "Appendix B.1–B.3"
          ],
          "limitations": "测试不可注入oracle，只有训练hardnegative挖掘用gold；100M场景以稀疏证据为主，dashed延迟是FLOP外推非实测。索引离线编码存储和两次模型forward须计成本；不同baseline训练预算并非完全匹配。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "21Mchunk 3BtokenWiki2018，query初始top5 BM25，每chunk7vectors、query4groups、<500K训练参数；15K步batch256，500hardnegative从训练gold挖掘。H100约32K后测得TTFT优势。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08452",
      "title": "Agentic AutoRAG: RAG Pipeline Optimization through Reasoning-Driven Agents",
      "published": "2026-10-06T14:38:15Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08452",
          "title": "Agentic AutoRAG: RAG Pipeline Optimization through Reasoning-Driven Agents",
          "published": "2026-10-06T14:38:15Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08452v1",
          "location": "§3.1–3.3；§4；§5/Table2；Limitations",
          "decision": "accepted",
          "reason": "Agentic AutoRAG的检索/生成归因→Diagnoser→KB/成本引导Proposer构成明确搜索机制，可接入evolve候选；准确率实验有100验证/300独立heldout隔离。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "冻结exam+gold-span命中仅用于验证优化；30trial×10seed，heldout judge Hotpot/MuSiQue/MultiHop .825/.330/.790；生成exam的Pareto医疗场景77%vs71.5%，成本57.7%。",
          "limitations": "医疗Pareto只报告反复优化的同一exam，非heldout能力；成本轴只含生成/扩展API，不含本地embedding/rerank；noKB/diag合并消融不能归因单组件；warmTPE获免费30次同库先验，且不是完整syftr；judge无人类一致性验证。",
          "code": "https://github.com/Agentic-Systems-Lab/Agentic-AutoRAG",
          "code_status": "official GitHub contents lists source/configs/knowledge_base/scripts/tests/LICENSE; not executed",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08430",
      "title": "NeMo-DCR: Bit-Exact Delta-Compressed Refit for Scalable Agentic RL at Trillion-Parameter Scale",
      "published": "2026-10-06T14:30:06Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08430",
          "title": "NeMo-DCR: Bit-Exact Delta-Compressed Refit for Scalable Agentic RL at Trillion-Parameter Scale",
          "published": "2026-10-06T14:30:06Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.08430",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "NeMo-DCR权重同步/精确delta传输系统，归训练基础设施而非Agent策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08414",
      "title": "Image Bitstream Fine-grained Understanding for Privacy-Friendly AIoT",
      "published": "2026-10-06T14:18:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08414",
          "title": "Image Bitstream Fine-grained Understanding for Privacy-Friendly AIoT",
          "published": "2026-10-06T14:18:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "BFG将JPEG bytes经ByteFormer分层卷积/shifted-window编码为192维，projector到512维后全局上下文融合+局部cross-attention自回归描述，另120类head；CFU-D源ID/split隔离并测试替换/删除/重复腐坏。Dogs分类58.51%采用ImageNet初始化；不解码不等价正式隐私保证，不能包装为通用大规模foundation结论。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08414",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08414v1",
              "location": "§III-B式2–5；§III-C；§IV-A–D Tables I/IV/V"
            },
            {
              "url": "https://arxiv.org/html/2610.08414v1",
              "location": "§III-B式2–5；§III-C；§IV-A–D Tables I/IV/V",
              "notes": "BFG将JPEG bytes经ByteFormer分层卷积/shifted-window编码为192维，projector到512维后全局上下文融合+局部cross-attention自回归描述，另120类head；CFU-D源ID/split隔离并测试替换/删除/重复腐坏。Dogs分类58.51%采用ImageNet初始化；不解码不等价正式隐私保证，不能包装为通用大规模foundation结论。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08414v1",
          "locations": [
            "§III-B式2–5；§III-C；§IV-A–D Tables I/IV/V"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "BFG将JPEG bytes经ByteFormer分层卷积/shifted-window编码为192维，projector到512维后全局上下文融合+局部cross-attention自回归描述，另120类head；CFU-D源ID/split隔离并测试替换/删除/重复腐坏。Dogs分类58.51%采用ImageNet初始化；不解码不等价正式隐私保证，不能包装为通用大规模foundation结论。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08407",
      "title": "Seeing the Context: Enhancing Recommender Systems with Image-Derived Contextual Signals",
      "published": "2026-10-06T14:15:48Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.08407",
          "title": "Seeing the Context: Enhancing Recommender Systems with Image-Derived Contextual Signals",
          "published": "2026-10-06T14:15:48Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "ICE-Fuse 在 TripAdvisor 图文上下文上做 RMSE/消融；未提供线上分流或部署实验，不满足工业搜广推准入。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08407",
              "location": "§4.1–4.3 Tables 2–3; §5"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.08407",
            "url": "https://arxiv.org/html/2610.08407v1",
            "sha256": "2223d22274d906bfa43f36d184feed98ec023a0af2ebe0b83ce2c0f97262ed78",
            "status": "downloaded",
            "characters": 28755,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08403",
      "title": "SSR: Sparse Segment Reduction for Ternary GEMM Acceleration",
      "published": "2026-10-06T14:15:12Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08403",
          "title": "SSR: Sparse Segment Reduction for Ternary GEMM Acceleration",
          "published": "2026-10-06T14:15:12Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SSR 将三值矩阵分成正负二值矩阵，按列块模式排序并剔除全零模式，以分段求和与树规约代替乘法；公开 C++/AVX2 实现可核验。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08403",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08403v1",
              "location": "§III-A/B Algorithms1–2; §IV-A/B; §IV-C TableIII; §V"
            },
            {
              "url": "https://arxiv.org/html/2610.08403v1",
              "location": "§III-A/B Algorithms1–2; §IV-A/B; §IV-C TableIII; §V",
              "notes": ""
            }
          ],
          "kind": "cpu_inference_kernel",
          "locations": [
            "§III-A/B Algorithms1–2",
            "§IV-A/B",
            "§IV-C TableIII",
            "§V"
          ],
          "limitations": "报告的是 CPU，部分高稀疏设置慢于 CSC/Eigen；原文未验证 GPU，不能用仓库其他项目的 GPU 目录冒充 SSR。模型级主要是改造三值 MLP 的延迟，没有公开质量保真证据。作者 README 引用 DATE2026，应标记本次 arXiv 收录而非确认首次发表。",
          "code_url": "https://github.com/fpgasystems/ternaryLLM/tree/main/SSR",
          "code_status": "author-linked repository accessible; MIT; SSR is separate from ternaryLLM_GPU",
          "official_url": "https://arxiv.org/html/2610.08403v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08401",
      "title": "GeoPID: Decomposing and Steering Visual Information in Vision-Language Models",
      "published": "2026-10-06T14:14:25Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08401",
          "title": "GeoPID: Decomposing and Steering Visual Information in Vision-Language Models",
          "published": "2026-10-06T14:14:25Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "GeoPID从无标签校准表征估计模态共享/独占子空间，推理按I+αUUᵀ放大vision-unique；22×14组合每组100道独立校准题用标签选层/α后冻结，最终评测不读gold。任务Rényi信息分解为离线诊断，平均相对7.63%需保留308组异质/部分负收益。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08401",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08401v1",
              "location": "§2.1–2.3式11；§3.1；§3.2 Table 5"
            },
            {
              "url": "https://arxiv.org/html/2610.08401v1",
              "location": "§2.1–2.3式11；§3.1；§3.2 Table 5",
              "notes": "GeoPID从无标签校准表征估计模态共享/独占子空间，推理按I+αUUᵀ放大vision-unique；22×14组合每组100道独立校准题用标签选层/α后冻结，最终评测不读gold。任务Rényi信息分解为离线诊断，平均相对7.63%需保留308组异质/部分负收益。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08401v1",
          "locations": [
            "§2.1–2.3式11；§3.1；§3.2 Table 5"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "GeoPID从无标签校准表征估计模态共享/独占子空间，推理按I+αUUᵀ放大vision-unique；22×14组合每组100道独立校准题用标签选层/α后冻结，最终评测不读gold。任务Rényi信息分解为离线诊断，平均相对7.63%需保留308组异质/部分负收益。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08400",
      "title": "Atom-JEPA: Joint-Embedding Predictive Architecture for 3D Atomistic Systems",
      "published": "2026-10-06T14:13:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08400",
          "title": "Atom-JEPA: Joint-Embedding Predictive Architecture for 3D Atomistic Systems",
          "published": "2026-10-06T14:13:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "Atom-JEPA具备真实SE(3)等变原子/子结构预测算法与公开迁移结果，但严格等预算新目标归因尚未满足：§G.1同Uni-Mol atom-only与atom+pool的批量384/128、学习率2.42e-4/1.4e-4不同；§B未做同架构其他SSL比较。需明确可接受的匹配控制或补齐预算证据，不能把scratch对比当等预训练预算。",
          "review_level": "fulltext",
          "official_url": "https://arxiv.org/html/2610.08400v1",
          "locations": [
            "§3",
            "§4.2/Table4",
            "Appendix B",
            "Appendix G.1/Table26",
            "Appendix H.1.1"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08400",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08400v1",
              "location": "§3; §4.2/Table4; Appendix B; Appendix G.1/Table26; Appendix H.1.1"
            },
            {
              "url": "https://arxiv.org/html/2610.08400v1",
              "location": "§3; §4.2/Table4; Appendix B; Appendix G.1/Table26; Appendix H.1.1",
              "notes": "19M Uni-Mol与1.7M Alexandria预训练，双目标EMA EquiformerV3；Matbench40任务fold全部优于scratch，ChEMBL-MT仍有-0.5%负结果。Uni-Mol2475 GPU小时、Alexandria2147 GPU小时；主目标对照训练配置不相同。"
            }
          ],
          "code_url": "https://github.com/khelverskovp/atom-jepa",
          "institution": "Technical University of Denmark",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "19M Uni-Mol与1.7M Alexandria预训练，双目标EMA EquiformerV3；Matbench40任务fold全部优于scratch，ChEMBL-MT仍有-0.5%负结果。Uni-Mol2475 GPU小时、Alexandria2147 GPU小时；主目标对照训练配置不相同。",
          "review_status": "reviewed_deferred"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08364",
      "title": "Transect: Retaining Observability for Long-Horizon LLM Agent Evaluations",
      "published": "2026-10-06T13:52:15Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08364",
          "title": "Transect: Retaining Observability for Long-Horizon LLM Agent Evaluations",
          "published": "2026-10-06T13:52:15Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08364v1",
          "location": "§2.1–2.2；§3.1/3.3–3.5；§4；official README/API",
          "decision": "accepted",
          "reason": "Transect为公共可执行评测观测工具：family Spec固定词表，structural/judged scanners→provenance tables→源链接报告；可用于evolve审计但不是任务能力评分器。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "UK AISI/Meridian MIT公开repo，Python3.12+，structural worked example无judge调用；solo/kroll/cohort记录member votes/verifier修改。单CRUX案例580orchestrator outputs/131sessions922fileaccess，来源/覆盖明确。",
          "limitations": "仅单案例描述，agreement/repeatability不是正确率；读文件不证明采纳、sourceorder非walltime、compaction邻近非因果；Inspect machine-global缓存可能伪造重复稳定性，独立judge重复须freshcache；扩展扫描器可能自行调用模型。",
          "code": "https://github.com/AI-Safety-Institute/transect",
          "code_status": "MIT; executable structural example and judged entrypoints verified in README, not executed",
          "candidate_kind": "evaluation_observability_infrastructure",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08341",
      "title": "DIPrune: Task-Aware Token Pruning with Dual Importance for Efficient Multimodal Language Models",
      "published": "2026-10-06T13:38:27Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08341",
          "title": "DIPrune: Task-Aware Token Pruning with Dual Importance for Efficient Multimodal Language Models",
          "published": "2026-10-06T13:38:27Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DIPrune结合文本到视觉注意力倒置rank归一与跨层rank上升的截断归一，保留早层低但后层新出现语义token并移除对应KV；多VLM及视频骨干评测、层对齐消融。LLaVA64tokens平均保留97.7%，POPE TTFT73.23→32.50ms、额外0.24ms，需以实际TTFT而非FLOPs主张速度。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08341",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08341v1",
              "location": "§5.1式6–7；§5.2式8；§6.1；§6.5 Table 4"
            },
            {
              "url": "https://arxiv.org/html/2610.08341v1",
              "location": "§5.1式6–7；§5.2式8；§6.1；§6.5 Table 4",
              "notes": "DIPrune结合文本到视觉注意力倒置rank归一与跨层rank上升的截断归一，保留早层低但后层新出现语义token并移除对应KV；多VLM及视频骨干评测、层对齐消融。LLaVA64tokens平均保留97.7%，POPE TTFT73.23→32.50ms、额外0.24ms，需以实际TTFT而非FLOPs主张速度。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08341v1",
          "locations": [
            "§5.1式6–7；§5.2式8；§6.1；§6.5 Table 4"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "DIPrune结合文本到视觉注意力倒置rank归一与跨层rank上升的截断归一，保留早层低但后层新出现语义token并移除对应KV；多VLM及视频骨干评测、层对齐消融。LLaVA64tokens平均保留97.7%，POPE TTFT73.23→32.50ms、额外0.24ms，需以实际TTFT而非FLOPs主张速度。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08337",
      "title": "Machine Learning for German Redispatch Forecasting under Data Delays and Temporal Distribution Shift",
      "published": "2026-10-06T13:35:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08337",
          "title": "Machine Learning for German Redispatch Forecasting under Data Delays and Temporal Distribution Shift",
          "published": "2026-10-06T13:35:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "德国电网再调度概率预测比较，属于能源时序应用而非基础模型核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08337",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08331",
      "title": "Transferable Spatial Temporal Coherence Adversarial Attack on Black-Box Vision Language Models for Autonomous Driving",
      "published": "2026-10-06T13:30:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08331",
          "title": "Transferable Spatial Temporal Coherence Adversarial Attack on Black-Box Vision Language Models for Autonomous Driving",
          "published": "2026-10-06T13:30:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "自动驾驶视频VLM迁移攻击研究，主贡献为攻击构造而非基础模型能力训练/推理方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08331",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08327",
      "title": "MedZERO: Self-Evolving Agents for Open-Ended Medical Reasoning Through Controlled Knowledge Accumulation",
      "published": "2026-10-06T13:25:55Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08327",
          "title": "MedZERO: Self-Evolving Agents for Open-Ended Medical Reasoning Through Controlled Knowledge Accumulation",
          "published": "2026-10-06T13:25:55Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08327v1",
          "location": "§3 Eq1–21；§4.1–4.2；§5；AppendixB；Open access checklist",
          "decision": "pending",
          "reason": "MedZERO交替训练Examiner/Reasoner与临时→持久KG准入是合格Agent机制；正文明确投稿时不发布代码、计划出版后发布，grounding scorer/映射阈值等关键实现不足，记审结待发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "4响应option映射多数一致性作为弱frontier，curation保留[.3,.8]；临时triplet仅可读前批且最终丢弃，独立重生成去重持久化；8B六分项均值53.5vsAgent043.7。",
          "limitations": "多数一致性不是医学正确率；持久准入缺独立事实验证，仍可能自我强化错误；MCQ选项只给后置judge不应给被测Reasoner；临床效用未建立，KG/web/judge依赖明显，正文未充分规定grounding评分函数。",
          "pending_reason": "author_code_not_released_and_core_details_incomplete",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08300",
      "title": "Memory Depth and Reconstructed Context Width: A Controlled Evaluation of Hierarchical Retrieval",
      "published": "2026-10-06T13:04:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08300",
          "title": "Memory Depth and Reconstructed Context Width: A Controlled Evaluation of Hierarchical Retrieval",
          "published": "2026-10-06T13:04:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "分层会话检索深度/上下文宽度的控制实验，主要为系统诊断而非新的基础模型核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08300",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08250",
      "title": "MASC: A Multi-Agent Self-Calibration Framework with Latent Construct Alignment for Consistent Client Role-Playing in Psychological Counseling",
      "published": "2026-10-06T12:31:05Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08250",
          "title": "MASC: A Multi-Agent Self-Calibration Framework with Latent Construct Alignment for Consistent Client Role-Playing in Psychological Counseling",
          "published": "2026-10-06T12:31:05Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08250v1",
          "location": "Multi-Agent Self-Calibration §方法 Eq1–16/Alg1；Experiment Tables2–3；官方GitHub API",
          "decision": "pending",
          "reason": "MASC以预测情绪/状态/动作、三Agent五步辩论、投票一致性优先和两轮失败记忆重试维持角色；方法与CRPC评测有关联价值，但官方仓库description明确code and data coming soon且无license。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "38profiles；只读过去对话不读未来reference；最多3尝试、每次3×5generation；独立盲评而非复用内部投票标签；Hetero action/emotion/state KL .06/.27/.06。",
          "limitations": "38profiles及同套构念/提示限制外推；Hetero与Homo骨干不同不能隔离多样性原因；73.97%最终匹配，44.19%是以最终收敛为条件的重试占比非修复概率；KL仅群体标签频率不是治疗真实性。",
          "code": "https://github.com/DeSun99/MASC-CRPC",
          "pending_reason": "author_code_and_data_coming_soon",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08246",
      "title": "LeanPlan: Optimal Planning with LLM-Generated Heuristics and Admissibility Proofs",
      "published": "2026-10-06T12:27:34Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08246",
          "title": "LeanPlan: Optimal Planning with LLM-Generated Heuristics and Admissibility Proofs",
          "published": "2026-10-06T12:27:34Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08246v1",
          "location": "§3–5；§7 Limitations；Reproducibility",
          "decision": "pending",
          "reason": "LeanPlan生成Lean启发式+可采纳性证明，controller拒绝sorry/admit/native_decide/新公理且独立重编译与训练任务验收，符合可验证Agent/evolve机制；作者明确代码/benchmark/log接受后才发布，审结待发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "13domain1170test；sandbox隔离test，按domain单次搜索均69.8分钟17.30美元；595超训练对象规模test解53vsSCP13；每任务300CPU秒8GiB。",
          "limitations": "SCP预算曾用test suite调优，原对照非严格完整test隔离；每domain单次Agent生成，无多seed；证明仅对certificate通过且成本<B计划，不证明unsat，依赖未验证parser/compiler；3test certificate拒绝计未解。",
          "pending_reason": "code_benchmarks_logs_release_upon_acceptance",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08245",
      "title": "Aligning Performance with Contribution: Towards Contribution-Aware Fair Recommendation",
      "published": "2026-10-06T12:26:50Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.08245",
          "title": "Aligning Performance with Contribution: Towards Contribution-Aware Fair Recommendation",
          "published": "2026-10-06T12:26:50Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "CPFR 使用 MovieLens 100K/1M、Amazon Office 的贡献公平性离线实验；公平损失有效性与工业线上证据是两回事。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08245",
              "location": "§5.1.1; §5.2 Tables 2–4; Conclusion"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.08245",
            "url": "https://arxiv.org/html/2610.08245v1",
            "sha256": "7e335212b89a2d1f76a3f12acb7ff18ce83938de9ca5b47ee247241e87eb78db",
            "status": "downloaded",
            "characters": 62436,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08232",
      "title": "Behavior-Mining, Generative Conversations, and Collaborative Advisory: the Future of Travel and Tourism Recommender Systems",
      "published": "2026-10-06T12:18:15Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.08232",
          "title": "Behavior-Mining, Generative Conversations, and Collaborative Advisory: the Future of Travel and Tourism Recommender Systems",
          "published": "2026-10-06T12:18:15Z",
          "repository_status": "new",
          "decision": "out_of_scope",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "旅游推荐的研究展望/立场综述，提出未来 advisory 方向而非可复现的新算法与实验。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08232",
              "location": "Abstract"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08215",
      "title": "Learn2Play Bench: How Well Do LLM Agents Learn from Experience in Unfamiliar Environments?",
      "published": "2026-10-06T12:08:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08215",
          "title": "Learn2Play Bench: How Well Do LLM Agents Learn from Experience in Unfamiliar Environments?",
          "published": "2026-10-06T12:08:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08215v1",
          "location": "§3；§4.1–4.2/4.6；§5；official project GitHub link/API",
          "decision": "pending",
          "reason": "Learn2Play20隐藏规则游戏、deterministic terminal scoring、10fixed/10reshuffled与跨episode学习曲线适合evolve；官网指向Learn2Play-Bench但repo/API/rawREADME均404，未证公共执行/许可，审结待发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "每template单seed，3独立trial、5或10episode；黑盒命令不得读source/oracle；Max/Mean与early-lateLG/OLSslope分开。Naive/fullhistory/Reflexion/EvoTest/ReasoningBank/AWM控制同backbone。",
          "limitations": "单instance_seed不等跨seed泛化；max挑顶尖人类不代表普通人均值，游戏hardness由pilot选；rule-discovery证据可含评分窗后episode，不能代替窗内任务成绩；harness批动作/反馈去重与memory机制混合影响成本。",
          "code": "https://github.com/liushiliushi/Learn2Play-Bench",
          "pending_reason": "official_repository_404",
          "candidate_kind": "evaluation_infrastructure",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08208",
      "title": "STRUCTURALCOST: A controlled reading time dataset for modeling human sentence processing difficulty",
      "published": "2026-10-06T12:00:36Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08208",
          "title": "STRUCTURALCOST: A controlled reading time dataset for modeling human sentence processing difficulty",
          "published": "2026-10-06T12:00:36Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "STRUCTURALCOST人类句法阅读时长数据，暂无直接基础模型能力/evolve执行任务契约。",
          "review_level": "abstract",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08208",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08200",
      "title": "Finding the Heads and the Neurons Responsible for Network Information Retrieval in Language Models",
      "published": "2026-10-06T11:51:03Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08200",
          "title": "Finding the Heads and the Neurons Responsible for Network Information Retrieval in Language Models",
          "published": "2026-10-06T11:51:03Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "内部头/神经元实体检索定位为解释性分析，未定义独立可执行能力评测。",
          "review_level": "abstract",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08200",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08183",
      "title": "Compact Robot Policies Need Fine-Grained Visual Representations",
      "published": "2026-10-06T11:36:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08183",
          "title": "Compact Robot Policies Need Fine-Grained Visual Representations",
          "published": "2026-10-06T11:36:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CoRP用可训练DINOv2+48-query resampler/FiLM文本及小DiT flow动作，λ=.01是跨层task-classification辅助CE（不是信息瓶颈惩罚），训练后丢分类head，10步Euler输出动作chunk。LIBERO/RoboTwin为任务内分布；实机另用私有1万小时/5887任务预训练，不能当仅公开sim数据的sim2real。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08183",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08183v1",
              "location": "§3.1；§3.2式4–9；§4.1；§4.7；Appendix A.5"
            },
            {
              "url": "https://arxiv.org/html/2610.08183v1",
              "location": "§3.1；§3.2式4–9；§4.1；§4.7；Appendix A.5",
              "notes": "CoRP用可训练DINOv2+48-query resampler/FiLM文本及小DiT flow动作，λ=.01是跨层task-classification辅助CE（不是信息瓶颈惩罚），训练后丢分类head，10步Euler输出动作chunk。LIBERO/RoboTwin为任务内分布；实机另用私有1万小时/5887任务预训练，不能当仅公开sim数据的sim2real。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08183v1",
          "locations": [
            "§3.1；§3.2式4–9；§4.1；§4.7；Appendix A.5"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "CoRP用可训练DINOv2+48-query resampler/FiLM文本及小DiT flow动作，λ=.01是跨层task-classification辅助CE（不是信息瓶颈惩罚），训练后丢分类head，10步Euler输出动作chunk。LIBERO/RoboTwin为任务内分布；实机另用私有1万小时/5887任务预训练，不能当仅公开sim数据的sim2real。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08164",
      "title": "Align, Then Correct: Training-Free Two-Stage Low-Rank Compensation for Extremely Quantized Large Language Models",
      "published": "2026-10-06T11:16:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08164",
          "title": "Align, Then Correct: Training-Free Two-Stage Low-Rank Compensation for Extremely Quantized Large Language Models",
          "published": "2026-10-06T11:16:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "两阶段低秩补偿：非对称激活目标经全输出 Fisher 加权 SVD，再对现有适配器与 K-FAC 自然梯度之和做秩约束 SVD；第二阶段替换而非叠加 rank-r 适配器。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08164",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08164v1",
              "location": "§4 Eq5–13; §5 Tables1–5; §6"
            },
            {
              "url": "https://arxiv.org/html/2610.08164v1",
              "location": "§4 Eq5–13; §5 Tables1–5; §6",
              "notes": ""
            }
          ],
          "kind": "quantization_compensation",
          "locations": [
            "§4 Eq5–13",
            "§5 Tables1–5",
            "§6"
          ],
          "limitations": "基线同 rank64、同来源校准；本法 Stage2 额外用 8K token 和逐块反向统计，不等于零训练计算。应保留校准/验证/test 隔离，以 held-out C4 和任务指标评价；论文称 training-free 指无迭代优化，不是没有梯度。",
          "code_url": null,
          "code_status": "paper body links QuIP# baseline only; no author implementation located in reviewed body",
          "official_url": "https://arxiv.org/html/2610.08164v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08162",
      "title": "The Failure Is in the Readout: Fine-Grained Emotion Recognition Benchmarks Measure Elicitation, Not Perception",
      "published": "2026-10-06T11:14:23Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08162",
          "title": "The Failure Is in the Readout: Fine-Grained Emotion Recognition Benchmarks Measure Elicitation, Not Perception",
          "published": "2026-10-06T11:14:23Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "EmoNet读出审计以40类逐类yes/no首token概率对照自由JSON输出，包含answer-mass和单答案有效性门，可作多模态评价诊断。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08162",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.08162v1",
              "location": "§3 Protocol; §5–7; Appendix Q",
              "notes": "EmoNet读出审计以40类逐类yes/no首token概率对照自由JSON输出，包含answer-mass和单答案有效性门，可作多模态评价诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.08162v1",
          "locations": [
            "§3 Protocol",
            "§5–7",
            "Appendix Q"
          ],
          "limitations": "主κ校准使用测试gold边际，是oracle上界而非可部署评测；须独立heldout校准。生成解析失败被排除、两prompt择优和类别选择需分报。FACES是摆拍表情不是实际内心情绪，须申请研究许可；不支持现实个人情绪推断。",
          "code_url": "https://github.com/saveli/emonet-readout",
          "code_status": "paper links official CPU metrics and predictions; FACES not redistributed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08162v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "EmoNet读出审计以40类逐类yes/no首token概率对照自由JSON输出，包含answer-mass和单答案有效性门，可作多模态评价诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08159",
      "title": "Making COMET Comparable Across Scripts: Diagnosis and Correction of Tokeniser-Induced Script Bias in Indic MT Evaluation",
      "published": "2026-10-06T11:11:43Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.08159",
          "title": "Making COMET Comparable Across Scripts: Diagnosis and Correction of Tokeniser-Induced Script Bias in Indic MT Evaluation",
          "published": "2026-10-06T11:11:43Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "COMET-QN 是印度语言机器翻译评价与文字系统偏差，不是工业推荐；转基础模型审查，非丢弃。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08159",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "foundation-model",
          "id": "2610.08159",
          "title": "Making COMET Comparable Across Scripts",
          "decision": "accepted",
          "review_level": "fulltext",
          "kind": "evaluation_diagnostic",
          "reason": "公开COMET脚本偏差诊断与rank-safe quantile校准/LOLO纠偏统计脚本可作为评测审计基础设施候选；不是新LLM，也不是动态评估器已接入。",
          "official_url": "https://arxiv.org/html/2610.08159v1",
          "code_url": "https://github.com/John-salvin/script-bias-comet-normalisation",
          "locations": [
            "§6.1–6.4 Eq2–4",
            "Limitations",
            "official README Quickstart/three sample-size bases"
          ],
          "evidence": "7000全样本、6995人类分数、1258Marathi severity分别使用；monotone校准不改善组内排名，COMET-QN pooledSpearman.300→.399；代码含工作簿、reproduce_all、hashcheck与number验证。",
          "limitations": "仓库只从已提交COMET/TP/IP列重算统计，无GPU也不重新运行模型；要评估新candidate须另接真实metric。QN假设同真实质量分布否则抹平真实差异；只wmt22-comet-da五Indic脚本，未量测本语料转写准确性。",
          "implementation_status": "not_implemented",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08155",
      "title": "Token-Efficient Multi-Agent Collaboration via System One-Guided Computational Division of Labor",
      "published": "2026-10-06T11:11:05Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08155",
          "title": "Token-Efficient Multi-Agent Collaboration via System One-Guided Computational Division of Labor",
          "published": "2026-10-06T11:11:05Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08155v1",
          "location": "§4.1–4.4/Alg1；§5.1–5.4 Tables3–4；Laya model-card reference",
          "decision": "accepted",
          "reason": "S1-MAS用冻结Laya离散决策encoder+Qwen0.6B证据定位，把Solve/Decompose/Reverse/Review/Repair/Contrast及停止交给轻量控制器，真实机制适合协同计算预算候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "正反menu消序偏；保留完整授权source，定位只作attention cue；最多4worker且累积source2048tokens，原始存档多数/contrast或代码接口规则交付而非额外judge。3seed；消融84.17vsrandom82.34；WebSRC90.11EM/4847GPTtokens/9.47秒。",
          "limitations": "只记GPT输入输出token而非Laya/Qwen本地总算力，节约不是总能耗/总token全口径；代码parse仅接口不是隐藏测试正确率；未找到作者代码链接，Laya明确revision但不可用启发式替代。",
          "code_status": "author implementation link not found in full text; controller is convaiinnovations/laya revision 1c5edc17a7acd8701df6fc341c0d179f1c62c982",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08136",
      "title": "Adapting Generative Recommenders for Multi-Turn Interaction",
      "published": "2026-10-06T10:51:53Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.08136",
          "title": "Adapting Generative Recommenders for Multi-Turn Interaction",
          "published": "2026-10-06T10:51:53Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "INTEGER 用 Amazon Beauty/Toys 与 Tencent Hy3 生成多轮对话，报告离线命中/NDCG/对话质量；未提供生产线上对照。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08136",
              "location": "§4.1; §4 experimental results"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.08136",
            "url": "https://arxiv.org/html/2610.08136v1",
            "sha256": "b957e4e1120ef239f7d21382b0334dc6556a7e6617268a010f1bc279107c5e32",
            "status": "downloaded",
            "characters": 48142,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08133",
      "title": "VLA-ACL: Action-Consistent Visual Token Pruning for Efficient Vision-Language-Action Models",
      "published": "2026-10-06T10:47:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08133",
          "title": "VLA-ACL: Action-Consistent Visual Token Pruning for Efficient Vision-Language-Action Models",
          "published": "2026-10-06T10:47:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "VLA-ACL冻结VLA仅训练5层patch scorer，Laplace soft Top-K总质量K、黑图embedding平方根gate实现可微训练，L1 full-context teacher+GT动作一致性；推理hard topK保留RoPE位置。LIBERO及实机/A100实测，K64成功97.0对96.8、63.49→46.82ms；K32 Long退化须保留。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08133",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.08133v1",
              "location": "§III-A/B式6–12；§IV Tables I；Appendix B"
            },
            {
              "url": "https://arxiv.org/html/2610.08133v1",
              "location": "§III-A/B式6–12；§IV Tables I；Appendix B",
              "notes": "VLA-ACL冻结VLA仅训练5层patch scorer，Laplace soft Top-K总质量K、黑图embedding平方根gate实现可微训练，L1 full-context teacher+GT动作一致性；推理hard topK保留RoPE位置。LIBERO及实机/A100实测，K64成功97.0对96.8、63.49→46.82ms；K32 Long退化须保留。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.08133v1",
          "locations": [
            "§III-A/B式6–12；§IV Tables I；Appendix B"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "VLA-ACL冻结VLA仅训练5层patch scorer，Laplace soft Top-K总质量K、黑图embedding平方根gate实现可微训练，L1 full-context teacher+GT动作一致性；推理hard topK保留RoPE位置。LIBERO及实机/A100实测，K64成功97.0对96.8、63.49→46.82ms；K32 Long退化须保留。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08129",
      "title": "Do LLMs Act on What They Know? From Partner Representations to Cooperative Actions",
      "published": "2026-10-06T10:44:55Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.08129",
          "title": "Do LLMs Act on What They Know? From Partner Representations to Cooperative Actions",
          "published": "2026-10-06T10:44:55Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "Hanabi 合作约定是 Agent 协同研究，转 Agent 审查，不作为工业搜广推收录。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08129",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.08129",
          "title": "Do LLMs Act on What They Know? From Partner Representations to Cooperative Actions",
          "decision": "rejected",
          "review_level": "fulltext",
          "reviewer": "agent_review",
          "source": "https://arxiv.org/html/2610.08129v1",
          "location": "§3.1–3.3；§4.1–4.3；§5.1/5.7；AppendixI/Limitations",
          "reason": "Hanabi受控接收决策的knowing-doing机制诊断，非完整自主合作；本轮不作为能力实现接入，保留为oracle/表征泄漏负面参考。",
          "evidence": "scripted hint，probe从隐藏层预测partner规则；told/verb把真实规则/动作写NOTES属于诊断。4k随机规则LoRA把told intent .599→.998、score6.16→8.43，但原probe失配降至4.98，重训仅6.47。",
          "limitations": "不能把oracle规则/代码翻译动作当evaluated Agent能力；activation实验仅Qwen3-8B和recorded states，完整游戏增益未证；未发现可执行公共基准/代码发布链接。",
          "source_group": "cross_track",
          "fulltext_review_completed": true,
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08108",
      "title": "Enhancing Diffusion Language Models with Autoregressive Post-Training Weights",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08108",
          "title": "Enhancing Diffusion Language Models with Autoregressive Post-Training Weights",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "A2D task-vector transfer与AR/diffusion增量插值有真实checkpoint benchmark；系数用anchor benchmark选取，本地复现必须改为validation隔离。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.08108v1",
              "location": "§2.4式1–2；§3 Table 1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08106",
      "title": "ChartBmkAgent: Harness-Governed Multi-Agent Construction of Chart QA Benchmarks from Sparse Error-Taxonomy Specifications",
      "published": "2026-10-06T10:31:28Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08106",
          "title": "ChartBmkAgent: Harness-Governed Multi-Agent Construction of Chart QA Benchmarks from Sparse Error-Taxonomy Specifications",
          "published": "2026-10-06T10:31:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08106v1",
          "location": "Method Eq1–5 / Algorithm1；Experiments Tables2–6；Limitations",
          "decision": "accepted",
          "reason": "ChartBmkAgent 将错误分类/难度作为不可变根约束，由 harness 审批数据、图表、机制锚点与 QA，失败局部修复或回退；适合可审计的评测数据生成候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.08106",
          "fulltext_review_completed": true,
          "locations": [
            "Method Eq1–5 / Algorithm1",
            "Experiments Tables2–6",
            "Limitations"
          ],
          "limitations": "300条合成题；40配对seed比较31/40对21/40；每阶段初次提案外最多4次共享修复/回退。通用路径必经锚点只是模型审查估计而非形式证明；生成器亦被评估、judge重叠，非独立能力证据。原文正文未找到官方代码/数据链接，实施前需公开taxonomy/提示或明确独立实现边界。",
          "code_status": "not_found_in_paper",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08101",
      "title": "Beyond Corrected Memory: Execution Consistency in Multi-Agent Systems",
      "published": "2026-10-06T10:29:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08101",
          "title": "Beyond Corrected Memory: Execution Consistency in Multi-Agent Systems",
          "published": "2026-10-06T10:29:41Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08101v1",
          "location": "§3.1–3.2 Eq1；§4.1–4.3；§5.1–5.3；Reproducibility；AppendixE.5",
          "decision": "accepted",
          "reason": "CAVERT将义务激活/观察覆盖/有效履行分离，证据不足返回U而非无违规，LLM提取+deterministic规则+precommit read-refresh gate是明确执行一致性机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "450pairs93clusters，人类κ.842；删除关键证据使328/398异标签pair相同，恢复321/328；720matchedfaultblocks，AppWorld89→122/180同gate；480cleanblocks差−.7pp CI[-2.1,.7]在预设−2.5pp边界内。",
          "limitations": "MissingL2仍25/76referenceU误判N，18/52V误判N；gate只对未提交副作用，已提交需补偿；180trace改格式146稳定不等于完全鲁棒；+24.6%token/5秒overhead。正文称supplementary snapshot+432构造trace，但未核实可下载独立repo入口，不称公共基准已接入。",
          "code_status": "supplementary snapshot claimed; public executable repository not found in inspected full text",
          "candidate_kind": "execution_consistency_method",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08097",
      "title": "When Tools Lie: Reliability of Mathematical Agents Under Corrupted Tool Feedback",
      "published": "2026-10-06T10:28:19Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08097",
          "title": "When Tools Lie: Reliability of Mathematical Agents Under Corrupted Tool Feedback",
          "published": "2026-10-06T10:28:19Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.08097",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "31数学任务的工具损坏与验证频率对照，作者明确不能控制比较verifier质量。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08090",
      "title": "Explainable Rule Mining of IPv6 Extension-Header Presence Patterns from Paired-Vantage Captures",
      "published": "2026-10-06T10:21:12Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08090",
          "title": "Explainable Rule Mining of IPv6 Extension-Header Presence Patterns from Paired-Vantage Captures",
          "published": "2026-10-06T10:21:12Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "IPv6扩展头规则挖掘的网络测量负结果，不属于基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08090",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08082",
      "title": "POLAR: Ontology-Guided Risk Prevention for Tool-Calling LLM Agents",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08082",
          "title": "POLAR: Ontology-Guided Risk Prevention for Tool-Calling LLM Agents",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "通过可逆性本体和动作剪枝实现推理时护栏，不更新模型或RL/蒸馏目标；转Agent方向。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08082",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.08082",
          "title": "POLAR: Ontology-Guided Risk Prevention for Tool-Calling LLM Agents",
          "published": "2026-10-06T10:14:16Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08082v1",
          "location": "§3.2–3.6 Eq1；§4.1–4.6 Tables3–6；Limitations/Resource declaration",
          "decision": "rejected",
          "reason": "POLAR当前不进入能力/安全改进复现队列：人工Datalog可逆本体弱链min评分+veto机制明确，但收益不能区分结构反搜与blanket veto，关键实现/本体/日志私存且原配置不可追溯。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "18cells仅8增益，强模型/retail明显下降；qwenairlinefull+.080 vsT1only+.087，而该域无T1边故近全拒绝。逆路径未模拟完整poststate或执行验证；安全量仅task reward不是独立harm/授权标签。",
          "limitations": "Escalate/Advisory存档均值与表冲突而撤回比较；不同arm各自errorfilter，baseline adaptation不等算力；不能把可逆等同授权/安全；保留否定性对照价值，不据此claim运行通过。",
          "code_status": "private archive; public URL/license/scope unconfirmed per paper",
          "fulltext_review_completed": true
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08077",
      "title": "Self-Retrospection Distillation: Turning Post-hoc Experiences into Prior Foresight",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.08077",
          "title": "Self-Retrospection Distillation: Turning Post-hoc Experiences into Prior Foresight",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Salesforce SRD把成功/失败轨迹转成knowledge/pitfall前瞻输出，以带轨迹+gold答案的当前模型停梯度teacher监督不见该特权信息的foresight学生，JSD辅助loss；4/9B十基准。gold仅训练teacher可见，不能混入推理输入。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08077",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/pdf/2610.08077v1",
              "location": "§3.1–3.2 Eq.4–9；§4.1–4.2（PDF pp.3–6）"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.08077",
          "title": "Self-Retrospection Distillation: Turning Post-hoc Experiences into Prior Foresight",
          "published": "2026-10-06T10:06:47Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.08077v1",
          "location": "§3.1–3.2 Eq.4–9；§4.1–4.2（PDF pp.3–6）",
          "decision": "accepted",
          "reason": "Salesforce SRD把成功/失败轨迹转成knowledge/pitfall前瞻输出，以带轨迹+gold答案的当前模型停梯度teacher监督不见该特权信息的foresight学生，JSD辅助loss；4/9B十基准。gold仅训练teacher可见，不能混入推理输入。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08076",
      "title": "SpeedrunBench: Challenging LLM Agents with Video Game Speedrunning",
      "published": "2026-10-06T10:06:25Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08076",
          "title": "SpeedrunBench: Challenging LLM Agents with Video Game Speedrunning",
          "published": "2026-10-06T10:06:25Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08076v1",
          "location": "§3.1–3.3；§4.1–4.2；§5.1–5.3；Ethics；official README: Changes / isolation / seeds",
          "decision": "accepted",
          "reason": "SpeedrunBench 在固定轮次及计分调用预算下优化可回放动作轨迹；公开三款开源游戏、固定revision和独立计分容器，适合evolve公共评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.08076",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.3",
            "§4.1–4.2",
            "§5.1–5.3",
            "Ethics",
            "official README: Changes / isolation / seeds"
          ],
          "limitations": "只接公开SuperTux/Tuxemon/SuperTuxKart，不附商业ROM。原实验harness曾泄露SuperTux计分密钥和STK seed，官方说明当前版本已修正，必须重跑不能继承旧分数；200次每轮评分与无评分器不是同预算。Repo根页未列LICENSE，复用前核许可；代码可读不等于已运行。",
          "code_url": "https://github.com/patronus-ai/speedrun_bench",
          "code_status": "official accessible; pinned games.lock, scorer isolation and preflight; license not established",
          "reviewer": "root",
          "code": "https://github.com/patronus-ai/speedrun_bench"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08068",
      "title": "PhysTacGen: Physics-Aware Visual-Tactile Sensor Image Generation",
      "published": "2026-10-06T10:00:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08068",
          "title": "PhysTacGen: Physics-Aware Visual-Tactile Sensor Image Generation",
          "published": "2026-10-06T10:00:56Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "PhysTacGen服务视觉到触觉传感器图像生成，主要为特定机器人模态合成流水线；后训练机制可由对应track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08068",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08048",
      "title": "DAEDALUS: Bootstrapping Agent Memory from Self-Generated Tasks",
      "published": "2026-10-06T09:46:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.08048",
          "title": "DAEDALUS: Bootstrapping Agent Memory from Self-Generated Tasks",
          "published": "2026-10-06T09:46:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "DAEDALUS为agent自生成任务和程序记忆，不属基础模型track；由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.08048",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.08048",
          "title": "DAEDALUS: Bootstrapping Agent Memory from Self-Generated Tasks",
          "published": "2026-10-06T09:46:32Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.08048v1",
          "location": "§3；§4.1–4.2 Tables1–2；§5.1–5.3 Tables3/7；AppendixB；official GitHub contents",
          "decision": "accepted",
          "reason": "DAEDALUS用自生且Explorer亲自完成的任务、失败提炼heuristic、reset后连续3次成功验收、难度调节与冻结整库注入；真实记忆生成/验证机制适合evolve候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "Nr5/Nf8/Ns3在AppWorld预试后跨域固定；90/168 AppWorld，74/40tau retail，30/70AutomationOperations train/test隔离；AppWorld44.3→60.2MSR，五次推理但仅一套memorybank；9model ranking τ.89。",
          "limitations": "同一生成任务上的3次成功不是独立泛化验收；LLMjudgeκ.73–.81且自写successconditions，不能视oracle；成本主表排除一次性生成并假设完美promptcache；整合会丢scope，大库并不更好；不支持用户共同控制环境，线上持续更新未获稳定增益。",
          "code": "https://github.com/illuin-tech/daedalus",
          "code_status": "public code/config/tests/lockfile listed; not executed",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.08018",
      "title": "Structured but Silent: Probing Capability Requirements in LLM Hidden States",
      "published": "2026-10-06T09:12:53Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.08018",
          "title": "Structured but Silent: Probing Capability Requirements in LLM Hidden States",
          "published": "2026-10-06T09:12:53Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.08018",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "TACIT隐藏状态线性probe诊断能力需求，非执行策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07990",
      "title": "A Broader Look at Model Merging: Rethinking Implicit Regularization Induced by Task Arithmetic",
      "published": "2026-10-06T08:49:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07990",
          "title": "A Broader Look at Model Merging: Rethinking Implicit Regularization Induced by Task Arithmetic",
          "published": "2026-10-06T08:49:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "S-RandOpt以辅助数据梯度扩展task-vector子空间一维后随机采样选模，另比较真正weight-GD与系数GD；支持模型合并搜索研究候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07990",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07990v1",
              "location": "§3.1–3.2; §4.1–4.2/Table2–3; §5.1–5.4"
            },
            {
              "url": "https://arxiv.org/html/2610.07990v1",
              "location": "§3.1–3.2; §4.1–4.2/Table2–3; §5.1–5.4",
              "notes": "原训练集留10%aux，独立test；视觉fullweight/LLM LoRA。64随机点，aux选最优而非test；main表top5平均不是单模型ensemble结果。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07990v1",
          "locations": [
            "§3.1–3.2",
            "§4.1–4.2/Table2–3",
            "§5.1–5.4"
          ],
          "limitations": "WeightGD以更多compute换质量，极少aux会更差；TTA分支使用无标签test属transductive需单独标记，不能和固定模型测试混用。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "原训练集留10%aux，独立test；视觉fullweight/LLM LoRA。64随机点，aux选最优而非test；main表top5平均不是单模型ensemble结果。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07987",
      "title": "VisionWeave: Weaving Elastic Visual Representations as a Native Capability of MLLMs",
      "published": "2026-10-06T08:48:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07987",
          "title": "VisionWeave: Weaving Elastic Visual Representations as a Native Capability of MLLMs",
          "published": "2026-10-06T08:48:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "VisionWeave可学习gated 2×2 pooler+ViT中间granularity router，细/粗MRoPE中心对齐；三阶段teacher top512前向KL蒸馏依次pooler、soft-mix router、hard-route pooler+LLM，非OPD。训练子集校准50%节省，八bench和SGLang双A100长视频实测2.30×吞吐，FastV改为encoder后版本须标注。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07987",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07987v1",
              "location": "§2.2–2.5；§2.3式10–12；§3.1；§3.4 Table 5"
            },
            {
              "url": "https://arxiv.org/html/2610.07987v1",
              "location": "§2.2–2.5；§2.3式10–12；§3.1；§3.4 Table 5",
              "notes": "VisionWeave可学习gated 2×2 pooler+ViT中间granularity router，细/粗MRoPE中心对齐；三阶段teacher top512前向KL蒸馏依次pooler、soft-mix router、hard-route pooler+LLM，非OPD。训练子集校准50%节省，八bench和SGLang双A100长视频实测2.30×吞吐，FastV改为encoder后版本须标注。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07987v1",
          "locations": [
            "§2.2–2.5；§2.3式10–12；§3.1；§3.4 Table 5"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "VisionWeave可学习gated 2×2 pooler+ViT中间granularity router，细/粗MRoPE中心对齐；三阶段teacher top512前向KL蒸馏依次pooler、soft-mix router、hard-route pooler+LLM，非OPD。训练子集校准50%节省，八bench和SGLang双A100长视频实测2.30×吞吐，FastV改为encoder后版本须标注。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07982",
      "title": "M3SunAgent: Monocular 3D Spatial Understanding Agent for Metric Depth Estimation and 3D Visual Grounding",
      "published": "2026-10-06T08:45:25Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07982",
          "title": "M3SunAgent: Monocular 3D Spatial Understanding Agent for Metric Depth Estimation and 3D Visual Grounding",
          "published": "2026-10-06T08:45:25Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "M3SunAgent为工具协调的3D空间规划agent，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07982",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07972",
      "title": "Can Agents Work for Everyone? Cross-User Reliability for Mobile GUI Agents in Personalized User Interfaces",
      "published": "2026-10-06T08:38:30Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07972",
          "title": "Can Agents Work for Everyone? Cross-User Reliability for Mobile GUI Agents in Personalized User Interfaces",
          "published": "2026-10-06T08:38:30Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07972v1",
          "location": "§4–5 Eq1–6；§6/Table2；Appendix RePAIR training/Selection and review scope",
          "decision": "accepted",
          "reason": "PAIR可执行个性化GUI状态与RePAIR按跨用户UC子目标四rollout标准化优势构成可复现机制设计；接受为探索候选，接入必须重做独立validation选择。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "8train/2val/10test personas，960/240/1200task；每paireduser2rollout，UC逐goal减均值除总体SD再对全部UCgoal平均，零方差贡献0；主表SFT55.1→64.5SR/all20→27.5。",
          "limitations": "31训练spec由测试persona历史baseline结果挑选，因此test-informed不是严格heldout；validation未选择K8iter5；p10–p19尚未完成语义/browser审核。只冻结visualencoder训练LoRA，单训练seed/轮派生seed不是独立重复。oracle参考路径只给reward/eval，不得给Agent。",
          "code_status": "no author public implementation link found in inspected paper",
          "candidate_kind": "personalization_aware_agent_training",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07969",
      "title": "EmbodiedSmith: Scaling Embodied Data through Recursive Self-Improvement Flywheel in Simulation",
      "published": "2026-10-06T08:34:28Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07969",
          "title": "EmbodiedSmith: Scaling Embodied Data through Recursive Self-Improvement Flywheel in Simulation",
          "published": "2026-10-06T08:34:28Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "EmbodiedSmith完整审查确认数据生成/验证流程有价值，但公开harness、typed skills与最终接受任务包未定位，暂缓基础设施接入。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07969",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.07969v1",
              "location": "§3.1–3.3; §4.1–4.3 Table4; Appendix9/10",
              "notes": "资产canonicalize/reconstruct+physicsprobe，typedscenegraph与BeamDFS布置、CuRobo可达性，skillDAG编译/固定成功标准/独立VLM复核/执行失败修复。20hclean vs10hclean+10hrandom，π.5均分34.2→45.5，FastWAM13.3→15.3，mixed在simple反降。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.07969v1",
          "locations": [
            "§3.1–3.3",
            "§4.1–4.3 Table4",
            "Appendix9/10"
          ],
          "limitations": "deformable部分统一材质且释放回弹不全，physicalasset接scene仍futurework；场景内10任务sim数据不证明sim2real/generalist。无可重放源码任务包无法真实验收RSI，不能用预知plan的policy替实现。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "资产canonicalize/reconstruct+physicsprobe，typedscenegraph与BeamDFS布置、CuRobo可达性，skillDAG编译/固定成功标准/独立VLM复核/执行失败修复。20hclean vs10hclean+10hrandom，π.5均分34.2→45.5，FastWAM13.3→15.3，mixed在simple反降。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07966",
      "title": "Feature Encoding in VAE-based Audio Decoders: Effects of Input, Depth and Distribution",
      "published": "2026-10-06T08:32:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07966",
          "title": "Feature Encoding in VAE-based Audio Decoders: Effects of Input, Depth and Distribution",
          "published": "2026-10-06T08:32:02Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "RAVE/EnCodec内部特征探针与聚类分析，主要为表示解释性诊断。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07966",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07954",
      "title": "Revisiting Numerical Forecasting Models for Language-Based Trajectory Prediction",
      "published": "2026-10-06T08:28:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07954",
          "title": "Revisiting Numerical Forecasting Models for Language-Based Trajectory Prediction",
          "published": "2026-10-06T08:28:52Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MoRE为行人/运动员轨迹预测的专用RL奖励迁移，非通用基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07954",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07948",
      "title": "Confidence Reasoning Graphs: Structured Confidence Estimation for LLM Agents",
      "published": "2026-10-06T08:22:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07948",
          "title": "Confidence Reasoning Graphs: Structured Confidence Estimation for LLM Agents",
          "published": "2026-10-06T08:22:14Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CRG是agent轨迹的结构化置信度推断框架，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07948",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07948",
          "title": "Confidence Reasoning Graphs: Structured Confidence Estimation for LLM Agents",
          "published": "2026-10-06T08:22:14Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07948v1",
          "location": "§4 Eq2–5；§5；§6.2–6.4 Tables3–4；AppendixA.3/A.14.3；official GitHub API",
          "decision": "pending",
          "reason": "CRG成功命题递归必要充分子声明、证据有源引用、叶置信乘积聚合为明确可审计评测器；官方megagonlabs/crg_ce返回404，审结待公开实现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "maxdepth5；Supported/Undermined/Unverified；leaf仅看末引用前缀；dev495propagation消融ECE.35→.10；Codex ECE.19→.05但AUROC.63→.61，ClaudeCodeAUROC.64→.54。",
          "limitations": "乘积是条件独立近似，不是概率保证；重叠叶可能重复扣不确定性，缺引用会漏后续修复；BAS改善不等任务能力/辨别率全面提升；官方论文说repo有脚本但本次无法访问。",
          "code": "https://github.com/megagonlabs/crg_ce",
          "pending_reason": "official_repository_404",
          "candidate_kind": "confidence_evaluation_method",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07940",
      "title": "Hybrid Latent Attention for Looped Language Models",
      "published": "2026-10-06T08:14:07Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07940",
          "title": "Hybrid Latent Attention for Looped Language Models",
          "published": "2026-10-06T08:14:07Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "HLA为looped LM跨循环共享旋转潜KV并保留精确近期窗口；冻结骨干训练writer/reader，真实vLLM/A100同引擎速度与质量测量支持系统候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07940",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07940v1",
              "location": "§3.1–3.4 Eq1–4; §4.1–4.2; §5.1–5.5 Tables1–3; §6"
            },
            {
              "url": "https://arxiv.org/html/2610.07940v1",
              "location": "§3.1–3.4 Eq1–4; §4.1–4.2; §5.1–5.5 Tables1–3; §6",
              "notes": "Ouro1.4B/2.6B四循环，潜缓存每token省10.7倍但含窗口16K序列实际9.8倍；16K峰值吞吐4.4/7.4倍。数学微调同数据400步16sample均值16.2→16.4/27.2→28.0置信区间跨零，不能宣称显著能力提升。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07940v1",
          "locations": [
            "§3.1–3.4 Eq1–4",
            "§4.1–4.2",
            "§5.1–5.5 Tables1–3",
            "§6"
          ],
          "limitations": "只改善decode；1K单请求慢26%，4K打平。微调两遍前向与标准一遍不等算力；冻结权重RULER16K仍损3.1点，超过16K未测。新增0.35B/0.70B参数必须计入。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Ouro1.4B/2.6B四循环，潜缓存每token省10.7倍但含窗口16K序列实际9.8倍；16K峰值吞吐4.4/7.4倍。数学微调同数据400步16sample均值16.2→16.4/27.2→28.0置信区间跨零，不能宣称显著能力提升。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07937",
      "title": "Leveraging a four-quadrant approach for evaluating Redpine Science",
      "published": "2026-10-06T08:11:30Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07937",
          "title": "Leveraging a four-quadrant approach for evaluating Redpine Science",
          "published": "2026-10-06T08:11:30Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07937",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Redpine Science检索服务四象限评测报告，非新Agent算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07935",
      "title": "SIGMA: Self-Improving Alignment Generalization from a Model Spec",
      "published": "2026-10-06T08:09:56Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07935",
          "title": "SIGMA: Self-Improving Alignment Generalization from a Model Spec",
          "published": "2026-10-06T08:09:56Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07935v1",
          "location": "§2.1–2.2；§3.1/3.6 Table4；§5/Ethics",
          "decision": "accepted",
          "reason": "Apple/JHU SIGMA的同模型taskdesigner+配对一事实变化+spec/rubric自验收+训练监督生成是Agent自改进候选；保留真实模型judges与GRPO，不能以规则fixture代替。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "935seeds×8→7137pairs14274prompts；schema/selfconsistency/spec/difficulty筛；SFT16采样先spec全通过再rubric最高，失败样例只验收不训练；SFT/RL分别从Qwen3.6-27B初始化一epoch而非串行SFT→RL；RL Rrubric×Rspec只评最终答。",
          "limitations": "仅一轮selfimprove，bootstrapCI非独立训练seed；singleturn→agentic迁移不是所有domain OOD证明；安全/帮助平衡随spec变，不能只看拒绝率；8rolloutSFTAgentMisalignment3.8而RL9.0不可混用，二rolloutSFT1.1显示非单调规模收益；最终答reward不证明CoT监控性保持。",
          "code_status": "no author source link found in inspected full text",
          "candidate_kind": "agentic_alignment_data_generation",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07925",
      "title": "TF-PRVR: Training-Free Partially Relevant Video Retrieval",
      "published": "2026-10-06T08:03:58Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07925",
          "title": "TF-PRVR: Training-Free Partially Relevant Video Retrieval",
          "published": "2026-10-06T08:03:58Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "TF-PRVR冻结VLM，帧特征速度方向变化的db4 DWT分层边界、层内语义/时间与相邻层IoU图，闭式(1−β)(I−βW)^−1传播后逐时跨尺度平均取最大检索分。三标准retrieval数据及三backbone，β=.7固定；离线图逆矩阵/特征成本应计，非新VLM训练。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07925",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07925v1",
              "location": "§4.2式1–4；§4.3式5–8；§5.1–5.3"
            },
            {
              "url": "https://arxiv.org/html/2610.07925v1",
              "location": "§4.2式1–4；§4.3式5–8；§5.1–5.3",
              "notes": "TF-PRVR冻结VLM，帧特征速度方向变化的db4 DWT分层边界、层内语义/时间与相邻层IoU图，闭式(1−β)(I−βW)^−1传播后逐时跨尺度平均取最大检索分。三标准retrieval数据及三backbone，β=.7固定；离线图逆矩阵/特征成本应计，非新VLM训练。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07925v1",
          "locations": [
            "§4.2式1–4；§4.3式5–8；§5.1–5.3"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "TF-PRVR冻结VLM，帧特征速度方向变化的db4 DWT分层边界、层内语义/时间与相邻层IoU图，闭式(1−β)(I−βW)^−1传播后逐时跨尺度平均取最大检索分。三标准retrieval数据及三backbone，β=.7固定；离线图逆矩阵/特征成本应计，非新VLM训练。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07913",
      "title": "Multimodal Knowledge Distillation for Gastric Adenocarcinoma Classification from Whole-Slide Images",
      "published": "2026-10-06T07:56:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07913",
          "title": "Multimodal Knowledge Distillation for Gastric Adenocarcinoma Classification from Whole-Slide Images",
          "published": "2026-10-06T07:56:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "胃腺癌病理图像蒸馏是特定医疗应用，不是通用基础模型方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07913",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07903",
      "title": "Unsupervised Long-Tailed Adaptation of Vision-Language Models",
      "published": "2026-10-06T07:49:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07903",
          "title": "Unsupervised Long-Tailed Adaptation of Vision-Language Models",
          "published": "2026-10-06T07:49:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "MARS冻结CLIP学prompt/文本adapter：zero-shot视觉类中心识别unsupported概率迁移并修正weak目标，strong-view CE；再以teacher软类别频率与margin EMA控制KL/伪标签CE权重。9数据γ10/20/50三seed，未知先验但标签集合已知，非开放类别发现。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07903",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07903v1",
              "location": "§3.3式3–6；§3.4式7–10；§3.5；§4.1/Table 1"
            },
            {
              "url": "https://arxiv.org/html/2610.07903v1",
              "location": "§3.3式3–6；§3.4式7–10；§3.5；§4.1/Table 1",
              "notes": "MARS冻结CLIP学prompt/文本adapter：zero-shot视觉类中心识别unsupported概率迁移并修正weak目标，strong-view CE；再以teacher软类别频率与margin EMA控制KL/伪标签CE权重。9数据γ10/20/50三seed，未知先验但标签集合已知，非开放类别发现。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07903v1",
          "locations": [
            "§3.3式3–6；§3.4式7–10；§3.5；§4.1/Table 1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "MARS冻结CLIP学prompt/文本adapter：zero-shot视觉类中心识别unsupported概率迁移并修正weak目标，strong-view CE；再以teacher软类别频率与margin EMA控制KL/伪标签CE权重。9数据γ10/20/50三seed，未知先验但标签集合已知，非开放类别发现。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07898",
      "title": "FC-SWE: Failure-Conditioned RL for Long-Horizon Software Engineering Agents",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07898",
          "title": "FC-SWE: Failure-Conditioned RL for Long-Horizon Software Engineering Agents",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "真实R2E-Gym训练，失败时reset并提供patch/verifier上下文；每次attempt奖励独立、未执行padding不计优势。SWE-bench结果为verifier-assisted不是独立pass@K。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07898v1",
              "location": "§3.2–3.4式3–5；§4.1–4.2 Table 1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07898",
          "title": "FC-SWE: Failure-Conditioned RL for Long-Horizon Software Engineering Agents",
          "published": "2026-10-06T07:44:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07898v1",
          "location": "§3.2–3.4式3–5；§4.1–4.2 Table 1",
          "decision": "accepted",
          "reason": "真实R2E-Gym训练，失败时reset并提供patch/verifier上下文；每次attempt奖励独立、未执行padding不计优势。SWE-bench结果为verifier-assisted不是独立pass@K。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07887",
      "title": "Visual Abstention in Unified Multimodal Models",
      "published": "2026-10-06T07:33:42Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07887",
          "title": "Visual Abstention in Unified Multimodal Models",
          "published": "2026-10-06T07:33:42Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "VisTA在BAGEL上用feasible/infeasible配对：先reason再image或ABSTAIN，文本CE均训练、flowmatching仅feasible；38224对与1050对DoD图像/maze隔离。无reminder拒绝93.0%、误拒0.8%、edit74.3；paired minimal-change约束定义不可行，不能泛称现实世界不可能或安全对齐。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07887",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07887v1",
              "location": "§3.1–3.3；§5.1式10；§5.2；§5.3 Table 5"
            },
            {
              "url": "https://arxiv.org/html/2610.07887v1",
              "location": "§3.1–3.3；§5.1式10；§5.2；§5.3 Table 5",
              "notes": "VisTA在BAGEL上用feasible/infeasible配对：先reason再image或ABSTAIN，文本CE均训练、flowmatching仅feasible；38224对与1050对DoD图像/maze隔离。无reminder拒绝93.0%、误拒0.8%、edit74.3；paired minimal-change约束定义不可行，不能泛称现实世界不可能或安全对齐。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07887v1",
          "locations": [
            "§3.1–3.3；§5.1式10；§5.2；§5.3 Table 5"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "VisTA在BAGEL上用feasible/infeasible配对：先reason再image或ABSTAIN，文本CE均训练、flowmatching仅feasible；38224对与1050对DoD图像/maze隔离。无reminder拒绝93.0%、误拒0.8%、edit74.3；paired minimal-change约束定义不可行，不能泛称现实世界不可能或安全对齐。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07886",
      "title": "ShanLiangRen: A Nutrition Agent for Personalized Daily Meal Planning",
      "published": "2026-10-06T07:32:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07886",
          "title": "ShanLiangRen: A Nutrition Agent for Personalized Daily Meal Planning",
          "published": "2026-10-06T07:32:50Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07886v1",
          "location": "§3 five-module System Design; §4; §5 Table1; §6",
          "decision": "rejected",
          "reason": "ShanLiangRen是领域约束检索+LLM proposal/repair+确定营养计算+Pareto筛选demo，当前不纳通用Agent核心复现：无公开155万recipe/6万ingredient知识库与300评测实例，未拆解核心模块贡献或给预算/迭代配置。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "GPT5.4 backbone，300实例单营养博士人工复核，PCS/EPC100%、NIA78.9%、AND.09、61sec；线上微信demo是部署说明，不是生产A/B。",
          "limitations": "PCS是单项约束满足百分比不等于临床安全；nutrient interval/成分表与总量正确不证明可用于过敏或疾病处方。Pareto机制非独特通用策略且关键资料不可验证；保留领域应用线索，不实施医疗建议。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07881",
      "title": "Self-Referenced Social Preferences: Cooperation without Observing Others Rewards",
      "published": "2026-10-06T07:29:38Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07881",
          "title": "Self-Referenced Social Preferences: Cooperation without Observing Others Rewards",
          "published": "2026-10-06T07:29:38Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07881",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "传统MARL自参照奖励社会偏好，无LLM/工具Agent方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07868",
      "title": "CueRator: Agentic Search for Symbolic Rules to Adapt Frozen Multimodal Encoders",
      "published": "2026-10-06T07:18:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07868",
          "title": "CueRator: Agentic Search for Symbolic Rules to Adapt Frozen Multimodal Encoders",
          "published": "2026-10-06T07:18:02Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CueRator在冻结ImageBind上agent发现AST约束closed-form门限式，训练数据Sobol per-video oracle仅诊断结构上限，另训练Gaussian contextual policy用K4 leave-one-out REINFORCE预测10参数；3×20候选val选后测test。可接evolve operator但不可给部署agent访问oracle GT；编码器不训练、seen-only训练且val包含unseen。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07868",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07868v1",
              "location": "§3.2 Algorithm 1；§3.4–3.6；§4.1；§4.2/Table 1"
            },
            {
              "url": "https://arxiv.org/html/2610.07868v1",
              "location": "§3.2 Algorithm 1；§3.4–3.6；§4.1；§4.2/Table 1",
              "notes": "CueRator在冻结ImageBind上agent发现AST约束closed-form门限式，训练数据Sobol per-video oracle仅诊断结构上限，另训练Gaussian contextual policy用K4 leave-one-out REINFORCE预测10参数；3×20候选val选后测test。可接evolve operator但不可给部署agent访问oracle GT；编码器不训练、seen-only训练且val包含unseen。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07868v1",
          "locations": [
            "§3.2 Algorithm 1；§3.4–3.6；§4.1；§4.2/Table 1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "CueRator在冻结ImageBind上agent发现AST约束closed-form门限式，训练数据Sobol per-video oracle仅诊断结构上限，另训练Gaussian contextual policy用K4 leave-one-out REINFORCE预测10参数；3×20候选val选后测test。可接evolve operator但不可给部署agent访问oracle GT；编码器不训练、seen-only训练且val包含unseen。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07863",
      "title": "ReFold: Training-Free Reversible Inter-Turn Context Folding for Long-Horizon Agents",
      "published": "2026-10-06T07:09:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07863",
          "title": "ReFold: Training-Free Reversible Inter-Turn Context Folding for Long-Horizon Agents",
          "published": "2026-10-06T07:09:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ReFold属于agent交互上下文可逆渲染层，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07863",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07863",
          "title": "ReFold: Training-Free Reversible Inter-Turn Context Folding for Long-Horizon Agents",
          "published": "2026-10-06T07:09:54Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07863v1",
          "location": "§3 Eq1–7；§4.1/4.3/4.4；Reproducibility",
          "decision": "pending",
          "reason": "ReFold append-only原始history、exact重复stub、模型标stale后fold、chunk边界缓存保护及restore追加机制明确，适合上下文优化；正文仅承诺will release code/scripts，当前审结待发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "k=3，仅接受前k步stale，边界b=max(0,k floor((t-k)/k))；restore不改prefix；250tasks两Qwen骨干，2RTX6000Ada/vLLM；受限16k+48并发token−24%、时间−28%，均36/50解。",
          "limitations": "高并发解题增益主要包含服务拥塞/超时效应不能称纯推理能力；fullwindow每cell单次taskrecord，非多seed；k扫20SWE任务选参数需独立validation重建；chunk/reversible消融为固定轨迹rerender不是能力比较；A100需另实测。",
          "pending_reason": "author_code_and_scripts_not_released",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07862",
      "title": "A self-learning scientific agent for X-ray diffraction",
      "published": "2026-10-06T07:09:39Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07862",
          "title": "A self-learning scientific agent for X-ray diffraction",
          "published": "2026-10-06T07:09:39Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07862v1",
          "location": "Main self-improving workflows/Fig4; Methods Evaluation of self-improvement; Supplementary1.1/1.2/2.4; Data/Code availability; official DeltaXRDbench README/releases",
          "decision": "accepted",
          "reason": "Gan Jiang将XRD工具执行残差/失败转换为版本化skill修订并开发集成对选型、冻结后heldout比较；接受科学Agent机制及DeltaXRDbench公共评测候选，不能宣称完整闭源toolchain复现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "FullProf46.90→72.38/GSAS39.01→60.02/PyWPEM31.74→38.33是refinement score非结构识别率；公开xrdbench scorer/JSONL contract/tests、Asterbin release v1.0.0 datasets.zip1.34GB实际存在；CIF真值须仅评分器持有。",
          "limitations": "XMatcher完整实现closed-source，仅basic公开；技能三分支变更范围不同，未隔离单edit贡献且缺完整run/split/version清单。XQueryer split是同结构不同模拟seed，不是unseen structures；opXRD含私有来源，实验合成mixture不等真实混合。repo license null/README要求public redistribution前补license，数据各来源约束单独确认。",
          "upstream": "https://github.com/DeltaGanjiang/deltaxrdbench",
          "public_artifact_check": "README指Asterbin/xrdbench release，API核datasets.zip；公开scorer非完整GanJiang源码",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07860",
      "title": "WorkflowOps: Learning Agent Collaboration Priors for Multi-Agent Workflow Orchestration",
      "published": "2026-10-06T07:01:38Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07860",
          "title": "WorkflowOps: Learning Agent Collaboration Priors for Multi-Agent Workflow Orchestration",
          "published": "2026-10-06T07:01:38Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07860v1",
          "location": "§4 Alg1–2；§5 Tables1–2；§6 Limitations",
          "decision": "accepted",
          "reason": "WorkflowOps以Minilm能力匹配、低充分性新Agent生成、合成workflow一阶转移先验添DAG软边/分层执行构成明确orchestration候选，但非经证明持续自演化。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "约65合成workflow/35角色矩阵；τ.45/θ.3、最多4新Agent3轮；Mixed120val300test/MixedHard180val694test，DAG.890/.770；NoEvolve便宜2.7倍token仅低1.7pp。",
          "limitations": "历史频次不是成功因果，新增边可能提高串行约束；transitive reduction保持可达关系，本身不创造并行可执行性；池后续复用未测；基线局部适配且ADASpartial/MaASdeadlock；主成本605秒/query，不能按matcher省调用称整个系统低成本。",
          "code_status": "no author public code link found in inspected full text",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07851",
      "title": "RA-MoWE: Workflow-Affinity Embeddings for Query Clustering and Agentic Workflow Generation",
      "published": "2026-10-06T06:58:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07851",
          "title": "RA-MoWE: Workflow-Affinity Embeddings for Query Clustering and Agentic Workflow Generation",
          "published": "2026-10-06T06:58:16Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07851v1",
          "location": "§2 Eq1–4/Alg1；§3 Tables1/Fig3；AppendixB.2 Eq34/B.3/C.13",
          "decision": "accepted",
          "reason": "RA-MoWE离线probe outcome affinity→cluster expert search→BGE+MLP预测路由是真实可执行工作流优化候选；只能接受text-only Guided-BB路径，test measured affinity列必须诊断隔离。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "BGE1024→512→512→K，.7cosine+.3/K MSE，outer510/90内层earlystop；J6；600construction300test；Guided-BB .3358vsdirect.2763/proberoute.2955，calls2.113vs2.924。",
          "limitations": "A†用test outcome不是deployable；B三regime无预设显著收益且Haiku277/300塌单cluster，SWE全选direct。Guided-BB与CoT.3295差CI跨0；Hj已进入wholecluster反馈并非独立search验收；margin2/n非置信保证，后加分析探索性，完整guided-vs-unguided匹配实验缺失。",
          "code_status": "no public author repository link found; evidence manifests described in AppendixC.13",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07848",
      "title": "Dynamic Positional Attention Modulation for Parameter-Efficient Fine-Tuning of Large Language Models",
      "published": "2026-10-06T06:55:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07848",
          "title": "Dynamic Positional Attention Modulation for Parameter-Efficient Fine-Tuning of Large Language Models",
          "published": "2026-10-06T06:55:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DyPAM根据hidden低秩特征生成RoPE配对维度Q/K缩放，叠加head/layerbias，core PEFT公式完整且有验证选checkpoint和多seed公共任务。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07848",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07848v1",
              "location": "§3.1–3.6 Eq6–15; §4.1–4.4; App implementation"
            },
            {
              "url": "https://arxiv.org/html/2610.07848v1",
              "location": "§3.1–3.6 Eq6–15; §4.1–4.4; App implementation",
              "notes": "HAB→dimensionembedding，Q/K独立，s=1+.3(sigmoid(g)-.5)，beforeRoPE且pair同scale；GQA key共享；r128 d_e64，300train-derivedval、bestvalloss，seed2333+4复验。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07848v1",
          "locations": [
            "§3.1–3.6 Eq6–15",
            "§4.1–4.4",
            "App implementation"
          ],
          "limitations": "动态不能像LoRA简单离线merge；同参数不等FLOPs需计runtime，preRoPE pair scale改变幅值非旋转角度。已核官方仓库默认master分支README及finetune.py/eval.py/dypam_models.py入口；未运行代码，不能称复现成功。",
          "code_url": "https://github.com/Beihang-BIGSCity/DyPAM",
          "implementation_status": "not_implemented",
          "fulltext_notes": "HAB→dimensionembedding，Q/K独立，s=1+.3(sigmoid(g)-.5)，beforeRoPE且pair同scale；GQA key共享；r128 d_e64，300train-derivedval、bestvalloss，seed2333+4复验。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07842",
      "title": "Privileged Context as Drift in On-Policy Self-Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07842",
          "title": "Privileged Context as Drift in On-Policy Self-Distillation",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "27个adapter的特权上下文content×source控制研究；目标任务与既有lm-evaluation-harness留存benchmark，加逐token/逐序列KL和LoRA几何诊断。未定义独立新任务或评分器，作为OPSD风险/消融参考，不新增核心算法/公共评测入口。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07842v1",
              "location": "§2.1、§2.4；§3.1"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "固定OPSD配方比较特权上下文内容和来源的漂移，是控制实验而非新后训练算法。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07835",
      "title": "DHCG: Dynamic Construction of Hierarchical Collaboration Graphs for LLM-Based Multi-Agent Reasoning",
      "published": "2026-10-06T06:33:40Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07835",
          "title": "DHCG: Dynamic Construction of Hierarchical Collaboration Graphs for LLM-Based Multi-Agent Reasoning",
          "published": "2026-10-06T06:33:40Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07835v1",
          "location": "§3.1–3.3 Eq1–14；§4.1–4.5；官方PDF9页（末2页references，无被引用AppendixB）",
          "decision": "pending",
          "reason": "DHCG逐层动态角色/稀疏routing/Expand或Finalize及action-aware加权DPO机制合格；关键训练datafilter、valuegap阈值/λγ/预算指向AppendixB却官方HTML/PDF均未附，未找到代码，审结待补材料。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "仅上一层可见，finalsource由planner挑；树采样下游均值回传，跨action只taskvalue避免cheapFinalize偏差，同action计token且剔除双0；clippedgap归一权重×DPO。Qwen8Bplanner/worker，7bench平均73.43，报告3独立runs。",
          "limitations": "缺AppendixB使精确训练/污染核查不可完成；Pass@5为有oracle选择的上界非可执行Agent能力；不能用静态DAG或heuristicplanner代替训练policy；所谓RL实际offlineweightedDPO。",
          "pending_reason": "official_fulltext_omits_referenced_training_appendix_and_no_code",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07832",
      "title": "Harness Engineering for Software Engineering via Modular Executable Dev-Primitives",
      "published": "2026-10-06T06:32:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07832",
          "title": "Harness Engineering for Software Engineering via Modular Executable Dev-Primitives",
          "published": "2026-10-06T06:32:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "HERMES软件工程agent harness与驻留LLM模块，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07832",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07832",
          "title": "Harness Engineering for Software Engineering via Modular Executable Dev-Primitives",
          "published": "2026-10-06T06:32:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07832v1",
          "location": "§3; §4.1–4.3 Tables6–7; Appendix F.4–F.8/G/I",
          "decision": "accepted",
          "reason": "HERMES将持久文件包装为Dev-Primitive，按依赖动态激活、定向消息、执行诊断后至多3轮再激活修改；接受为文件级Agent编排核心机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "Table6强激活/诊断配Qwen3-8B workers在四基准落后全强模型1.2–4.5pp；Terminal Table7 50.6%/$2.51k对全强51.8%/$3.40k，26.2%成本降低。F.7 final grader不向求解暴露；G refactor20任务3次29.5/32/31.5。",
          "limitations": "F.8明确混合公开leaderboard与补跑匹配baseline，12.4pp平均不是全部统一控制实验；文件resident仅保存artifact/messages、不保存hidden state；selection precision/recall用oracle/reference只允许诊断。未发现作者代码链接；不宣称本地已运行。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07825",
      "title": "Forecast Accuracy Is Not Trading Profit: Evolving Small Recurrent Networks for Stock Return Prediction",
      "published": "2026-10-06T06:20:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07825",
          "title": "Forecast Accuracy Is Not Trading Profit: Evolving Small Recurrent Networks for Stock Return Prediction",
          "published": "2026-10-06T06:20:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "股票收益预测与交易策略中小循环网络进化比较，属于金融时序应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07825",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07819",
      "title": "$α$Transfer: Coefficient Transfer for Efficient Model Merging",
      "published": "2026-10-06T06:13:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07819",
          "title": "$α$Transfer: Coefficient Transfer for Efficient Model Merging",
          "published": "2026-10-06T06:13:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "alphaTransfer将小proxy搜索到的全局/任务/层合并系数转给同family大模型，层系数按相对深度复制/插值；目标taskvector编辑仍在大模型原生执行。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07819",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07819v1",
              "location": "§3 Eq1–8; §4.1–4.3 Tables2–3; Appendix A.1"
            },
            {
              "url": "https://arxiv.org/html/2610.07819v1",
              "location": "§3 Eq1–8; §4.1–4.3 Tables2–3; Appendix A.1",
              "notes": "3家族8vision/4language任务，Qwen.6→1.7/4B系数排名相关.94/.90；同validation选专家checkpoint；vision最高6.07x搜索省时。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07819v1",
          "locations": [
            "§3 Eq1–8",
            "§4.1–4.3 Tables2–3",
            "Appendix A.1"
          ],
          "limitations": "需要小/大对应专家checkpoint，省的仅系数搜索不含专家训练；跨family/recipe未证实，ViTB32→L14 AdaMerging++损7.02点，不可说普遍无损。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "3家族8vision/4language任务，Qwen.6→1.7/4B系数排名相关.94/.90；同validation选专家checkpoint；vision最高6.07x搜索省时。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07817",
      "title": "One Step at a Time: Trading LLM Autonomy for Process Predictability",
      "published": "2026-10-06T06:10:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07817",
          "title": "One Step at a Time: Trading LLM Autonomy for Process Predictability",
          "published": "2026-10-06T06:10:42Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07817v1",
          "location": "§3; §4.1–4.5 Tables3–4; §5.3; Limitations1–12; Artifacts",
          "decision": "pending",
          "reason": "One Step at a Time的SOP-MCP逐步server执行与审计有集成价值，但修订SOP、工具spec、trace、分析代码明确upon publication才发布；正文审查完成，精确公开评测暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "evidence": "15475 trials/13域，12域adherence；Ministral grounded+6.5pp但raw+2.3pp不显著，强模型raw下降2.5–4.7pp。MCP成本2.1–2.9倍；GLM5 pooled−2.9pp而domain mean+.8pp。",
          "limitations": "pilot调试同测试任务非独立dev且只MCP trace；逐步呈现/控制/元指令三机制捆绑。coverage只tool名不查顺序参数/输出消费，grounded≠流程正确；mock tools与fuzzy matcher未规模人工验证。不得将≈.3%ungrounded称真实安全或信任提升。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07816",
      "title": "Do I Need the Cloud? Uncertainty-Aware Step-Level Handoff for Small Language Model Agents",
      "published": "2026-10-06T06:09:31Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07816",
          "title": "Do I Need the Cloud? Uncertainty-Aware Step-Level Handoff for Small Language Model Agents",
          "published": "2026-10-06T06:09:31Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07816v1",
          "location": "§3; §4 Tables1–4; Appendix A.3/A.6–A.9; Appendix C",
          "decision": "accepted",
          "reason": "StepGate以本地动作反事实失败标签训练校准门控，结合六类特征、阈值/预算、按需一致性采样逐步选择本地/验证/强模型；接受为真实模型路由机制候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "单步52 heldout任务67.3→82.7%且30.8%强模型调用；100 scripted多轮轨迹48→69%，强模型82%。同30%调用对随机+9pp CI[-0.6,18.8]/p=.108，对query-level+12pp CI[2,22]/p=.029，对self-consistency+3pp不显著。",
          "limitations": "只Qwen2.5一族，7B4bit代替cloud；风险特征等预算无可靠提升，标注不是授权/安全保证，token不是隐私保证。Appendix A大量should/recommend为建议规范，不能当已公开artifact事实；未核实作者代码/完整100任务发布。原单步基线调用率不一致，须用rate-matched对照。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07810",
      "title": "SIFT: Search Intent-to-Filter Transformer for Multi-Task Personalized Filter Ranking at Airbnb",
      "published": "2026-10-06T06:05:45Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.07810",
          "title": "SIFT: Search Intent-to-Filter Transformer for Multi-Task Personalized Filter Ranking at Airbnb",
          "published": "2026-10-06T06:05:45Z",
          "repository_status": "new",
          "decision": "accepted",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "SIFT 的随机身份分流与酒店扩展线上证据满足门槛。过滤器点击人数 +20%，普通 booking +0.03% 不显著；酒店扩展 marketplace uncancelled booking +0.76%。原始旅程/过滤器/容量标签未公开，接受待实现不等于已实现。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07810",
              "location": "PDF p7 §8.2 Table 4; p8 Table 6"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.07810",
            "url": "https://arxiv.org/html/2610.07810v1",
            "sha256": "c0abba1e606ad4ecab6b86acc1087721b03c72653f4cf096f611e2ff7bd43249",
            "status": "downloaded",
            "characters": 50530,
            "errors": []
          }
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07809",
      "title": "MASKerade: Token-Routed Mask Experts for Dense-to-MoE Upcycling",
      "published": "2026-10-06T06:04:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07809",
          "title": "MASKerade: Token-Routed Mask Experts for Dense-to-MoE Upcycling",
          "published": "2026-10-06T06:04:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "MASKerade在冻结FFN上训练多专家binary mask与token router，真实hard mask+STE、top1保留softmax概率确保router梯度；等标称激活预算和mask种类对照支持多模态MoE适配候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07809",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07809v1",
              "location": "§3.1–3.4 Eq1–9; §4.1–4.2 Tables1–3; §5; Appendix Table12"
            },
            {
              "url": "https://arxiv.org/html/2610.07809v1",
              "location": "§3.1–3.4 Eq1–9; §4.1–4.2 Tables1–3; §5; Appendix Table12",
              "notes": "四专家top2半密度，665K MoELLaVA指令数据，多数三训练seed；预训练权重冻结，score初始化absW加噪，loadbalance.01。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07809v1",
          "code_url": "https://github.com/Ming-K9/MASKerade",
          "locations": [
            "§3.1–3.4 Eq1–9",
            "§4.1–4.2 Tables1–3",
            "§5",
            "Appendix Table12"
          ],
          "limitations": "nominal activated参数将重叠mask重复计数，不是unique权重、FLOPs或延迟；作者把重叠复用kernel留未来，不能以mask模拟声称GPU加速；对照expertwidth/LR不同须独立控制。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "四专家top2半密度，665K MoELLaVA指令数据，多数三训练seed；预训练权重冻结，score初始化absW加噪，loadbalance.01。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07787",
      "title": "OOPMAS: Object-Oriented Multi-Agent Systems for Query-Level Workflow Generation",
      "published": "2026-10-06T05:31:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07787",
          "title": "OOPMAS: Object-Oriented Multi-Agent Systems for Query-Level Workflow Generation",
          "published": "2026-10-06T05:31:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07787v1",
          "location": "§3.1–3.3 Algorithm1; §4.1–4.6 Table1; Appendix A/B",
          "decision": "rejected",
          "reason": "OOPMAS的OOP agent/workflow生成机制可作训练内搜索诊断，但当前论文的主要分数来自同批query反复正确性反馈并选skill开/关较高者，不满足隔离测试能力复现门槛。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "120 Mixed均来自validation；180 Hard同批优化3轮；Algorithm1每轮Score→wrong-output修复→保留分数；Appendix A数学/GPQA比gold、代码跑全部public/private tests。89.6/90.8不是独立test泛化证据。",
          "limitations": "baseline workflow格式不兼容造成0分，成本baseline为估计；正文$35/$15同时称约7×算术不一致。run-local技能库不跨部署持久化。若重做train/val/test独立实验才可另审，不能把oracle评分给被评估Agent。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07782",
      "title": "Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell",
      "published": "2026-10-06T05:17:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07782",
          "title": "Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell",
          "published": "2026-10-06T05:17:44Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07782",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "持久记忆消融的测量修正与null结果研究，不是独立新策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07781",
      "title": "Quantization Effects on Tool-Failure Recovery Vary Across Prompts and Evaluation Designs",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07781",
          "title": "Quantization Effects on Tool-Failure Recovery Vary Across Prompts and Evaluation Designs",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "4/8bit代理故障恢复的提示/评分协议评测，无训练算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07781",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07781",
          "title": "Quantization Effects on Tool-Failure Recovery Vary Across Prompts and Evaluation Designs",
          "published": "2026-10-06T05:17:10Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07781",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "量化Agent恢复对prompt/筛选/scoring敏感性的实验诊断。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07774",
      "title": "Reading, Not Manipulating: Leveraging Router Logits for Multimodal Safety in MoE Vision-Language Models",
      "published": "2026-10-06T05:09:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07774",
          "title": "Reading, Not Manipulating: Leveraging Router Logits for Multimodal Safety in MoE Vision-Language Models",
          "published": "2026-10-06T05:09:02Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "将MoE各层最终prompt token router logits拼接，train统计标准化、class-balanced L2 logistic detector，prefill后τ=.4(val选)拒绝，否则原模型生成；两MoE模型HoliSafe及OOD、MMMU。安全信息可读不等于可通过expert steering控制，残差state也有效；不宣称router独有。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07774",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07774v1",
              "location": "§3.1式4–6；§3.2/Table 1；§4.1–4.4"
            },
            {
              "url": "https://arxiv.org/html/2610.07774v1",
              "location": "§3.1式4–6；§3.2/Table 1；§4.1–4.4",
              "notes": "将MoE各层最终prompt token router logits拼接，train统计标准化、class-balanced L2 logistic detector，prefill后τ=.4(val选)拒绝，否则原模型生成；两MoE模型HoliSafe及OOD、MMMU。安全信息可读不等于可通过expert steering控制，残差state也有效；不宣称router独有。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07774v1",
          "locations": [
            "§3.1式4–6；§3.2/Table 1；§4.1–4.4"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "将MoE各层最终prompt token router logits拼接，train统计标准化、class-balanced L2 logistic detector，prefill后τ=.4(val选)拒绝，否则原模型生成；两MoE模型HoliSafe及OOD、MMMU。安全信息可读不等于可通过expert steering控制，残差state也有效；不宣称router独有。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07767",
      "title": "TRACE: Rollout-Guided Quantization-Aware Training for FP4 Reinforcement Learning of MoE Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07767",
          "title": "TRACE: Rollout-Guided Quantization-Aware Training for FP4 Reinforcement Learning of MoE Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "将训练activation相邻FP4 codeword选为更接近rollout codeword并缓存mantissa/scale；四MoE训练验证。原native NVFP4路径需相应硬件，不得A100模拟冒称原速度。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07767v1",
              "location": "§3.1式2–3；§4.1/4.4/4.5 Table 6–7"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07763",
      "title": "ST-Bench: A Spatial-Temporal Benchmark for Multi-Agent System Generation on Scientific Research Tasks",
      "published": "2026-10-06T04:59:49Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07763",
          "title": "ST-Bench: A Spatial-Temporal Benchmark for Multi-Agent System Generation on Scientific Research Tasks",
          "published": "2026-10-06T04:59:49Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07763v1",
          "location": "§2.1–2.2；§3.1–3.3；§4.1–4.5；Appendix C.2",
          "decision": "pending",
          "reason": "ST-Bench 的100科学任务、2067查询及连续reward适合多Agent工作流评测，但原文未给可验证任务/预处理文件/评分器下载入口，暂缓官方接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.07763",
          "fulltext_review_completed": true,
          "locations": [
            "§2.1–2.2",
            "§3.1–3.3",
            "§4.1–4.5",
            "Appendix C.2"
          ],
          "limitations": "1184/391/492 train/val/test；reward按0.1合法性+0.4阈值+0.5单Agent参考，不是复算科学结果的充分证明；所有指标由Agent报告，须增加产物复算。至少一个正数/-1判无效可能误伤真实非正科学指标。MAS收益主要覆盖率，1.85–4.5倍时间，token成本仅部分可测，不能宣称同预算全面更强。",
          "code_status": "not_found_in_paper_or_targeted_search",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07761",
      "title": "Contrastive Learning for Aspect Representation towards Explainable Recommendation",
      "published": "2026-10-06T04:55:55Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.07761",
          "title": "Contrastive Learning for Aspect Representation towards Explainable Recommendation",
          "published": "2026-10-06T04:55:55Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "CLARER 在 TripAdvisor HK、Yelp 2019、Amazon Movies/TV 做 RMSE/MAE/BLEU/ROUGE 离线对照；未给线上 A/B 或部署结果。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07761",
              "location": "§IV-A; Tables III–V"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.07761",
            "url": "https://arxiv.org/html/2610.07761v1",
            "sha256": "28f792df015c620cfecdb34834c80cb9690224c8df4694f8e1940562b1b9f120",
            "status": "downloaded",
            "characters": 51187,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07758",
      "title": "Later Is Better: Token Reduction for ViTs Under Distribution Shift",
      "published": "2026-10-06T04:54:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07758",
          "title": "Later Is Better: Token Reduction for ViTs Under Distribution Shift",
          "published": "2026-10-06T04:54:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Late-concentrated幂律层间token预算是明确可执行的ViT/VLM压缩算子，官方代码公开；多shift、多backbone和五类reducer在保守iso-GFLOPs下有收益。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07758",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07758v1",
              "location": "§3 Eq1; §4–5 Tables1–6; App A/U/V; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.07758v1",
              "location": "§3 Eq1; §4–5 Tables1–6; App A/U/V; official README",
              "notes": "gamma2，largest-remainder取整且每层最多去floor(n/2)，解析校准总去除数使FLOPs不超过flat；DeiT-S sev5 37.99→39.16，3.15G vs flat3.20G；oracle clean merge只诊断不可用测试clean counterpart。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07758v1",
          "locations": [
            "§3 Eq1",
            "§4–5 Tables1–6",
            "App A/U/V",
            "official README"
          ],
          "limitations": "§3一句late同预算更少FLOPs与其前后解释反向，实际应更少节约；按AppU准确预算。gamma默认依据同主基准敏感性曲线，接入须独立val；AppV只batch64两宽度吞吐不能外推全部iso延迟。部分组件非商业license；video/VLM harness释放状态未核。",
          "code_url": "https://github.com/chahh9808/LaterIsBetter",
          "implementation_status": "not_implemented",
          "fulltext_notes": "gamma2，largest-remainder取整且每层最多去floor(n/2)，解析校准总去除数使FLOPs不超过flat；DeiT-S sev5 37.99→39.16，3.15G vs flat3.20G；oracle clean merge只诊断不可用测试clean counterpart。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07757",
      "title": "Acquiring and Verifying Repository Norms for Coding Agents",
      "published": "2026-10-06T04:53:48Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07757",
          "title": "Acquiring and Verifying Repository Norms for Coding Agents",
          "published": "2026-10-06T04:53:48Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07757v1",
          "location": "§3.1–3.5 Eq1–2/Algorithm1; §4.1–4.5 Tables2–5; §5; §8",
          "decision": "pending",
          "reason": "RepoNorm有明确显式规范抽取、隐式总体检查/反例修订、独立证据验证、只读规范包机制及RepoNormBench；正文审查完成，但所称官方代码/数据地址API返回404，公开执行待发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "evidence": "121任务/6repo/14versions；gold规范、隐藏测试不输入norm acquisition/Agent。NCR相对提升7.42–10.77%，功能+9.09/+7.44/+5.79pp但六功能比较均不显著；自动review精度86→75.17%覆盖21.88→52.5%。",
          "limitations": "源码共性不是强制规范，必须保留required/recommended/observed。任务共享repo版本使task bootstrap可能低估不确定性；每cell一次运行；文档checker漏39误导文档变体。33.65%更多coding tokens且记录不完整。",
          "upstream": "https://github.com/SYSUSELab/RepoNorm",
          "public_artifact_check": "https://api.github.com/repos/SYSUSELab/RepoNorm/contents returned HTTP404",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07755",
      "title": "Trustworthy Method Comparison with AI Judges: Estimation and Design under Order, Batch, and Aggregation Effects",
      "published": "2026-10-06T04:53:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07755",
          "title": "Trustworthy Method Comparison with AI Judges: Estimation and Design under Order, Batch, and Aggregation Effects",
          "published": "2026-10-06T04:53:14Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "AI judge统计设计与Markov GLMM推断研究，非基础模型训练或推理核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07755",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07753",
      "title": "From Evidence to Action: How Tool-Using Agents Fail",
      "published": "2026-10-06T04:50:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07753",
          "title": "From Evidence to Action: How Tool-Using Agents Fail",
          "published": "2026-10-06T04:50:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07753v1",
          "location": "§3.1–3.3；§4.1–4.3；§5.1–5.3；Ethics/Reproducibility",
          "decision": "pending",
          "reason": "SafeActBench 用隐藏前置条件、来源绑定Evidence Ledger和确定性轨迹计分，区分调查后不行动、单步与依赖DAG；概念符合评测方向，官方项目页本次读取失败，尚未确认公开case和evaluator。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.07753",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.3",
            "§4.1–4.3",
            "§5.1–5.3",
            "Ethics/Reproducibility"
          ],
          "limitations": "656合成案例、五协议、每case配置3次；必须保留隐藏gold、返回值来源和行动前观测，不可简化成最终状态正确。内部团队参考轨迹全过不等于被测Agent成功，亦非真实业务安全认证。",
          "code_url": "https://safeact.github.io",
          "code_status": "project_read_failed; executable release unverified",
          "reviewer": "root",
          "code": "https://safeact.github.io"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07751",
      "title": "How Well Do LLMs Reason with Noisy Evidence? An Active Visual Reasoning Benchmark",
      "published": "2026-10-06T04:49:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07751",
          "title": "How Well Do LLMs Reason with Noisy Evidence? An Active Visual Reasoning Benchmark",
          "published": "2026-10-06T04:49:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07751v1",
          "location": "§3.1–3.2 Eq1–3；§4.1–4.2；Limitations；release footnote",
          "decision": "pending",
          "reason": "VisualNoiseQA 将VLM作为随机视觉sensor，文本Agent询问并观察抽样回答/语义一致性；1000人工可解难例适合active reasoning评测，但明确代码数据待发表后发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.07751",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.2 Eq1–3",
            "§4.1–4.2",
            "Limitations",
            "release footnote"
          ],
          "limitations": "初筛用11样本中gold命中1–5次，只能发生在基准构建；运行时一致性是回答间语义一致而非gold置信度，不能泄漏。5轨迹对GPT-5Mini单次不可同样解释方差；BP只是任务prompt上界非新训练算法。",
          "code_status": "promised_after_publication",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07739",
      "title": "Cite What You Explore: Budget-Aware LLM Reasoning over Medical KGs with Verifiable Evidence",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07739",
          "title": "Cite What You Explore: Budget-Aware LLM Reasoning over Medical KGs with Verifiable Evidence",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "证据有/无的同snapshot预测loss差构成paired gain，叠加预算与citation integrity，REINFORCE训练检索reasoner；需真实MIMIC/PrimeKG映射，非手写分数替代。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07739v1",
              "location": "§2.4式7–10；§3.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07731",
      "title": "Learning to Retrieve via Reinforcement Learning in Embedding Space",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07731",
          "title": "Learning to Retrieve via Reinforcement Learning in Embedding Space",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "vMF嵌入策略+G×G product rollout+RLOO，CMP投影降噪；ReasonRank训练、BRIGHT评测、三paired seeds。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07731v1",
              "location": "§3.1–3.3；§4.1.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07730",
      "title": "SanSi: A Looped Typed Decision Model for System 1.5 Thinking",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07730",
          "title": "SanSi: A Looped Typed Decision Model for System 1.5 Thinking",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "主要贡献为循环typed-decision模型架构和逐循环proper scoring，转基础模型审查。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07730",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07729",
      "title": "Foveated Compression: Selective High-Resolution Preservation for Token-Efficient VLMs",
      "published": "2026-10-06T04:28:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07729",
          "title": "Foveated Compression: Selective High-Resolution Preservation for Token-Efficient VLMs",
          "published": "2026-10-06T04:28:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Foveated Compression的混合分辨率表示与tie-aware region selector有明确算法，适合作为token压缩/选择诊断候选；不将test-oracle或弱于resize的真实结果包装为提升。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07729",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07729v1",
              "location": "§3 Eq1–5; §4 Tables1/2; §5; App A.1–A.3/D"
            },
            {
              "url": "https://arxiv.org/html/2610.07729v1",
              "location": "§3 Eq1–5; §4 Tables1/2; §5; App A.1–A.3/D",
              "notes": "冻结Qwen2.5VL7B，3x3 merger residualmean32.77M KL原模型greedyteacher，10.8M selector用九个训练intervention的winner-set NLL，imagegroup train/val；replace一个粗cell exact17/81tokens，nativegrid MRope不变。selector69.61>random67.98但<matchedresize70.99，oracle82.73只上限。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07729v1",
          "locations": [
            "§3 Eq1–5",
            "§4 Tables1/2",
            "§5",
            "App A.1–A.3/D"
          ],
          "limitations": "完整visionencoder仍运行，不能把20.99%tokens当E2Ecompute；questionablation无收益。cachedteacher top256非精确fullKL需按论文记录；bootstrap仅样本不含训练seed，decoderuncertainty在生成后不能偷作prefillfree特征。无作者源码链接/公开仓库找到。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "冻结Qwen2.5VL7B，3x3 merger residualmean32.77M KL原模型greedyteacher，10.8M selector用九个训练intervention的winner-set NLL，imagegroup train/val；replace一个粗cell exact17/81tokens，nativegrid MRope不变。selector69.61>random67.98但<matchedresize70.99，oracle82.73只上限。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07706",
      "title": "WASD: Wasserstein-based Knowledge Distillation for Large Language Models",
      "published": "2026-10-06T03:58:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07706",
          "title": "WASD: Wasserstein-based Knowledge Distillation for Large Language Models",
          "published": "2026-10-06T03:58:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "WASD用teacherembedding成本的去偏Sinkhorn divergence及stopgrad双potential差优化学生概率，有官方训练/评测脚本与等wallclock对照。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07706",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07706v1",
              "location": "§3.1–3.2 Eq6/10–11 Algorithms1–2; §4.1–4.2; AppC/E; 官方README"
            },
            {
              "url": "https://arxiv.org/html/2610.07706v1",
              "location": "§3.1–3.2 Eq6/10–11 Algorithms1–2; §4.1–4.2; AppC/E; 官方README",
              "notes": "cost固定，symmetric kNN+selfloop稀疏k8/Qwen2，eps.001迭代10；gradient等价在最优dual时成立；crosspotential-selfpotential差而非KL近似。mainAMiD+onpolicy分支和纯divergence无SFT分支区分。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07706v1",
          "locations": [
            "§3.1–3.2 Eq6/10–11 Algorithms1–2",
            "§4.1–4.2",
            "AppC/E",
            "官方README"
          ],
          "limitations": "实做有限10iter与稀疏support是近似不是无条件精确OTgradient；约2x训练时20%memory，不能称免费；五evalseed不是五trainseed；temperature2与judge/ROUGE偏差需冻结；兼容词表内方法不能自动跨tokenizer。",
          "code_url": "https://github.com/aailab-kaist/WASD",
          "implementation_status": "not_implemented",
          "fulltext_notes": "cost固定，symmetric kNN+selfloop稀疏k8/Qwen2，eps.001迭代10；gradient等价在最优dual时成立；crosspotential-selfpotential差而非KL近似。mainAMiD+onpolicy分支和纯divergence无SFT分支区分。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07704",
      "title": "Independent Multi-Agent Reinforcement Learning with Counterfactual Semantic-Social World Models",
      "published": "2026-10-06T03:53:47Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07704",
          "title": "Independent Multi-Agent Reinforcement Learning with Counterfactual Semantic-Social World Models",
          "published": "2026-10-06T03:53:47Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07704",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "CASTLE独立PPO和双world model传统MARL，无LLM Agent执行。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07689",
      "title": "Unlocking Fine-Grained Perception in CLIP via Structurally-Aware Latent Masked Modeling",
      "published": "2026-10-06T03:25:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07689",
          "title": "Unlocking Fine-Grained Perception in CLIP via Structurally-Aware Latent Masked Modeling",
          "published": "2026-10-06T03:25:22Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SALM通过patch关系/范数差双矩阵和teacher latent masked reconstruction改造CLIP，含无外部teacher的SALM-Self，核心loss和训练课程可保真复现。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07689",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07689v1",
              "location": "§3.2–3.6 Eq1; §4.1–4.4; App A.1–A.3/C; official project page"
            },
            {
              "url": "https://arxiv.org/html/2610.07689v1",
              "location": "§3.2–3.6 Eq1; §4.1–4.4; App A.1–A.3/C; official project page",
              "notes": "trainable CLIP+frozen DINOv2+frozenoriginalCLIP正则，75%mask、CGA self/crossattention预测teacherlatent；1epoch DMA、2epoch插值、1epochrecon，inference丢CGA。Self用layer6 EMAteacher、取消recon改DMA。ImageNettrain imageonly，LLAVA SFT阶段仍用文本LoRA，不能称整个MLLM无文本监督。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07689v1",
          "locations": [
            "§3.2–3.6 Eq1",
            "§4.1–4.4",
            "App A.1–A.3/C",
            "official project page"
          ],
          "limitations": "same modelsize不等训练compute，RADIO是作者IN1K重训不代表全尺度原版；需隔离超参val并记录seed不确定性；teacher结构上限。官方项目页只有paper/method无源码链接，未找到作者源码发布。",
          "code_url": null,
          "project_url": "https://qzfm.github.io/salm_project_page/",
          "implementation_status": "not_implemented",
          "fulltext_notes": "trainable CLIP+frozen DINOv2+frozenoriginalCLIP正则，75%mask、CGA self/crossattention预测teacherlatent；1epoch DMA、2epoch插值、1epochrecon，inference丢CGA。Self用layer6 EMAteacher、取消recon改DMA。ImageNettrain imageonly，LLAVA SFT阶段仍用文本LoRA，不能称整个MLLM无文本监督。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07668",
      "title": "CACHEFORGE: LLM-Guided End-to-End Generative Cache Replacement Policy for Performance and Hardware Efficiency",
      "published": "2026-10-06T03:03:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07668",
          "title": "CACHEFORGE: LLM-Guided End-to-End Generative Cache Replacement Policy for Performance and Hardware Efficiency",
          "published": "2026-10-06T03:03:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CACHEFORGE用LLM进化CPU硬件cache替换策略，不是LLM KV缓存算法；属agent辅助硬件设计。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07668",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.07668",
          "title": "CACHEFORGE: LLM-Guided End-to-End Generative Cache Replacement Policy for Performance and Hardware Efficiency",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "LLM生成C++缓存策略并在模拟器演化，不是LLM参数后训练；转Agent研究。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07668",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07657",
      "title": "Where Rules End and Judges Begin: Measuring the Judgment Boundary in Multi-Agent Systems Security",
      "published": "2026-10-06T02:52:51Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07657",
          "title": "Where Rules End and Judges Begin: Measuring the Judgment Boundary in Multi-Agent Systems Security",
          "published": "2026-10-06T02:52:51Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07657v1",
          "location": "§II–V; §VI-A/VI-B4/VI-C; §VII-B; official README/provenance/contents/license",
          "decision": "accepted",
          "reason": "DEFER提供27确定/相似度检查后残余LLM panel的实际host工具/记忆安全管线、四域testbed与outcome oracle，公开MIT代码/attacks/benchmarks/logs/scripts/tests，可作安全评测候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "300攻击变体+35benign，variant级cluster bootstrap。四域ASR30→3%；CyberOps同judges only34.7→2.2%。持久state正常completion97→5%，不失效replay key使87.5%正常后果动作被拒，是重要负例。",
          "limitations": "CyberOps手调是development upper bound，跨域共用同skeleton；静态攻击非适应攻击，stub工具/合成memory。panel主要offline re-adjudication只直接后果不重生后续轨迹；v3.1主要结果与v2.2/v2.9第三方/其他模型分开，缺ACL+judge基线。未运行代码，不能宣称安全保证。",
          "upstream": "https://github.com/shaswata09/DEFER",
          "public_artifact_check": "GitHub contents确认agents/attacks/benchmarks/analysis/scripts/tests/logs；README给重放与live入口；API license MIT",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07654",
      "title": "Does On-Policy Distillation for Safety Pose Backdoor Risks?",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07654",
          "title": "Does On-Policy Distillation for Safety Pose Backdoor Risks?",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Lazy Defense对teacher-student sampled token log-ratio双侧clipping再stop-gradient，四teacher/student组合测试仅延迟backdoor，不是保证消除。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07654v1",
              "location": "§6.1式6–7；§6.2"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07645",
      "title": "SkillPoison: Progressive Skill Poisoning via Successful Experiences",
      "published": "2026-10-06T02:38:36Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07645",
          "title": "SkillPoison: Progressive Skill Poisoning via Successful Experiences",
          "published": "2026-10-06T02:38:36Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07645v1",
          "location": "§3.1–3.4/Eq2–10; §4.1–4.4; Appendix B.1/B.3 Eq13–16/C; official repository README/LICENSE",
          "decision": "accepted",
          "reason": "SkillPoison揭示真实成功经历被提炼为脱离适用条件的技能时产生的治理漏洞，可作为防御性技能晋级回归评测/机制诊断候选，不接受为能力提升策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "两skill框架、HANS/PAWS/DS1000；strict ASR分母是无攻击原本答对样本，要求攻击后错误且具有目标行为证据，PAWS Trace2Skill最高95.71%；固定formation预算消融验证局部归因与跨经历组织。官方MIT代码提供formation-record pipeline。",
          "limitations": "样本先过滤与目标无关类别，再冻结池，非全基准无条件ASR；Adoption基于自报applied_prior_skill/程序模式代理不是因果；公开README只形成经历管线，未核得完整victim技能抽取+冻结任务集+下游ASR evaluator，尚不算evolve可执行基准接入。不开启现实系统攻击，不运行攻击代码。",
          "code": "https://github.com/DEEP-JLU/SkillPoison",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07643",
      "title": "Monte Carlo Estimation for KV Cache Eviction",
      "published": "2026-10-06T02:36:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07643",
          "title": "Monte Carlo Estimation for KV Cache Eviction",
          "published": "2026-10-06T02:36:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "LORE-KV 从冻结模型采样多条短续写估计未来 query，以中心化 log-prob、熵和分歧加权，再按输出投影后的反事实删除代价选择 KV；采样轨迹随后丢弃。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07643",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07643v1",
              "location": "§3.1–3.5 Eq1–8; §4.1–4.5; §5 / Reproducibility statement"
            },
            {
              "url": "https://arxiv.org/html/2610.07643v1",
              "location": "§3.1–3.5 Eq1–8; §4.1–4.5; §5 / Reproducibility statement",
              "notes": ""
            }
          ],
          "kind": "kv_cache_eviction",
          "locations": [
            "§3.1–3.5 Eq1–8",
            "§4.1–4.5",
            "§5 / Reproducibility statement"
          ],
          "limitations": "只靠 attention 分数不能替代该方法；必须计入一次性 lookahead/scoring 成本，并对齐缓存预算与 lookahead token。真实未来 query 仅允许事后诊断，不可用于在线选择；不保证不可见续写性能。",
          "code_url": null,
          "code_status": "no author repository located in reviewed body/reproducibility statement",
          "official_url": "https://arxiv.org/html/2610.07643v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07640",
      "title": "Towards the Automatic Synthesis of Interpretable Chess Tactics",
      "published": "2026-10-06T02:35:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07640",
          "title": "Towards the Automatic Synthesis of Interpretable Chess Tactics",
          "published": "2026-10-06T02:35:09Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07640",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "PAL归纳逻辑学习国际象棋符号战术，不是LLM Agent方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07639",
      "title": "HarnessSecurity-Bench: Do Security Mechanisms Really Protect Coding Agent Harnesses?",
      "published": "2026-10-06T02:34:53Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07639",
          "title": "HarnessSecurity-Bench: Do Security Mechanisms Really Protect Coding Agent Harnesses?",
          "published": "2026-10-06T02:34:53Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07639v1",
          "location": "§5.1–5.5；§6.1；§7.1–7.3；Data Availability；official README",
          "decision": "accepted",
          "reason": "HarnessSecurity-Bench 在固定合法任务下对原生安全机制ON/OFF配对，分离外部确定性utility与attack-effect oracle，适合离线隔离harness回归。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.07639",
          "fulltext_review_completed": true,
          "locations": [
            "§5.1–5.5",
            "§6.1",
            "§7.1–7.3",
            "Data Availability",
            "official README"
          ],
          "limitations": "23任务、九机制、六harness、单GLM-5.2、每组合10次；未知oracle从分母排除须公开coverage。官方仓库仅task包和utility checks，完整runner另维护；不能宣称全基准已可复现。攻击仅限隔离合成canary环境，禁止对真实凭据/外部业务运行。许可未在根页列明。",
          "code_url": "https://github.com/TsingPig/HarnessSecurity-Benchmark",
          "code_status": "partial official task packages; full runner separate",
          "reviewer": "root",
          "code": "https://github.com/TsingPig/HarnessSecurity-Benchmark"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07625",
      "title": "Stateless Language Agents: Scaling Long-Horizon Automated Research",
      "published": "2026-10-06T02:17:32Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07625",
          "title": "Stateless Language Agents: Scaling Long-Horizon Automated Research",
          "published": "2026-10-06T02:17:32Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07625v1",
          "location": "§3.1–3.3; §4.1–4.2 Tables1–3; §5; Appendix B.1–B.2",
          "decision": "pending",
          "reason": "SLA由harness重建无状态Advisor/Worker上下文，证据分组分配实验、保留局部候选、独立protected evaluator及Landlock隔离，强相关evolve核心候选；正文已审，但官方仓库当前仅assets目录，无代码/README/许可证，公开原实现暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "evidence": "Anthropic kernel Codex三独立run 1112.0±8.9cycles对Swarm1275.7±133.9；67.9M vs986.3M tokens到共同目标。其余多数配置单run；FrontierSWE四题在1/4budget全落后、fullbudget全领先。",
          "limitations": "ablation仍全部stateless，只改变上下文/隔离/分配，不直接证明stateless优于stateful；token匹配不含实验/评估compute成本；intra-task search反复看aggregate scores，不是heldout task泛化。不能将论文大量token或GPU实验称本地完成。",
          "upstream": "https://github.com/Alex-q-z/stateless-language-agents",
          "public_artifact_check": "API contents only assets; license null; raw main README404",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07615",
      "title": "AFA-BANDIT: Provably Near-Optimal Online Multi-Feature Classification Under Budget Constraints",
      "published": "2026-10-06T02:02:27Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07615",
          "title": "AFA-BANDIT: Provably Near-Optimal Online Multi-Feature Classification Under Budget Constraints",
          "published": "2026-10-06T02:02:27Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07615",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "AFA-BANDIT在线特征获取bandit分类，不是LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07594",
      "title": "BiGym 2.0: Benchmarking Learned and Agent-Developed Policies for Humanoid Household Manipulation",
      "published": "2026-10-06T01:33:35Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07594",
          "title": "BiGym 2.0: Benchmarking Learned and Agent-Developed Policies for Humanoid Household Manipulation",
          "published": "2026-10-06T01:33:35Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07594",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "BiGym2人形机器人家务基准，对照VLA/IL/RL/编码Agent，不是新语言策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07588",
      "title": "Personal-Agent Mediated Recommendation with Cross-Platform User History",
      "published": "2026-10-06T01:26:01Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07588",
          "title": "Personal-Agent Mediated Recommendation with Cross-Platform User History",
          "published": "2026-10-06T01:26:01Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07588v1",
          "location": "§3–5 Eq8/17–21; §6.1–6.2 Table3; Appendix A.5; introduction release footnote",
          "decision": "pending",
          "reason": "PAMO以full/去cross-history rationale loglik差估支持，NDCG cutoff advantage固定正负质量、value-floor约束指数分配后GRPO；算法可作为Agent/后训练交叉候选。MediateRec明确internal approval后发布，当前固定splits/platform ranking未公开，官方复现暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "evidence": "Movie/Toy各5000train1000val2000test、Grocery/Beauty各2000test、OpenPlay645；user disjoint且val选checkpoint/kappa。OpenPlay GRPO→PAMO HR10 47.4→47.9,NDCG10 .267→.284,harm7.1→6.0。",
          "limitations": "gold target保证在50候选，非end-to-end retrieval；catalog/负采样popularity用全时段产生时间泄漏边界；support是模型相对依赖非因果正确，value-preservation仅固定rollout组不保证policy/test单调；未见多训练seed/CI；无生产AB不能纳推荐工业条目。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07587",
      "title": "Large Language Model Orchestration under Heterogeneous Preferences via Explicit Persona Inference",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07587",
          "title": "Large Language Model Orchestration under Heterogeneous Preferences via Explicit Persona Inference",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "HARP外置贝叶斯persona后验及规划探索奖励，主要是推理时多代理编排而非参数后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07587",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07587",
          "title": "Large Language Model Orchestration under Heterogeneous Preferences via Explicit Persona Inference",
          "published": "2026-10-06T01:24:56Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07587v1",
          "location": "§3.1–3.3 Algorithm1/Eq2–3/Assumption3.1; §4.1–4.3; Limitations; Appendix A.1 open-text boundary",
          "decision": "accepted",
          "reason": "HARP以有限persona库、离线校准response scorer更新每Agent贝叶斯后验，posterior sampling集中规划；HARP+加reward-disagreement探索bonus。接受精确算法/机制诊断候选，不宣称开放对话Agent能力提升。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "TI/RL/PF条件下factor posterior等于joint，10commonseeds controlledHP-SPGG低regret；Concordia使用固定payoff解析枚举而非原生交互；MaaSSim16规则、factored/joint posterior差至2.5e-14。",
          "limitations": "缩减belief不缩减planner；personas固定且response locality/independent prior限制强。Appendix A.1纠正此前static posterior后，30cases×4reps开放对话所有HARP差异CI下界不正；posterior确实更新仍无score收益。provider不支持seed，cache replay不是model随机种子匹配。未找到公开作者仓库链接。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07585",
      "title": "REViT-v2: Hierarchical Windowed Roto-reflection Equivariant ViT for Equivariant Feature Extraction",
      "published": "2026-10-06T01:23:15Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07585",
          "title": "REViT-v2: Hierarchical Windowed Roto-reflection Equivariant ViT for Equivariant Feature Extraction",
          "published": "2026-10-06T01:23:15Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "REViT-v2以group-equivariant QKV卷积、完整representation-field多头局部窗口及群卷积downsample构成层次ViT，O(NM²C)非globalN²；ImageNet及RotMNIST实测，含同stem global控制。需保留有限p4m群/窗口划分几何条件，不能泛称任意角旋转严格等变。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07585",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07585v1",
              "location": "§2.1–2.3式1–6；§3；§4 Tables 1–2；Appendix A"
            },
            {
              "url": "https://arxiv.org/html/2610.07585v1",
              "location": "§2.1–2.3式1–6；§3；§4 Tables 1–2；Appendix A",
              "notes": "REViT-v2以group-equivariant QKV卷积、完整representation-field多头局部窗口及群卷积downsample构成层次ViT，O(NM²C)非globalN²；ImageNet及RotMNIST实测，含同stem global控制。需保留有限p4m群/窗口划分几何条件，不能泛称任意角旋转严格等变。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07585v1",
          "locations": [
            "§2.1–2.3式1–6；§3；§4 Tables 1–2；Appendix A"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "REViT-v2以group-equivariant QKV卷积、完整representation-field多头局部窗口及群卷积downsample构成层次ViT，O(NM²C)非globalN²；ImageNet及RotMNIST实测，含同stem global控制。需保留有限p4m群/窗口划分几何条件，不能泛称任意角旋转严格等变。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07578",
      "title": "Cooperating with Future Collaborators: Multi-Agent RL under Staggered Participation",
      "published": "2026-10-06T01:13:24Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07578",
          "title": "Cooperating with Future Collaborators: Multi-Agent RL under Staggered Participation",
          "published": "2026-10-06T01:13:24Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07578",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "SPL错峰传统MARL训练增广，无LLM策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07576",
      "title": "CETUS: How Far Do Representations Trained on Earth Transfer to Cassini SAR of Titan?",
      "published": "2026-10-06T01:11:34Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07576",
          "title": "CETUS: How Far Do Representations Trained on Earth Transfer to Cassini SAR of Titan?",
          "published": "2026-10-06T01:11:34Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CETUS地球到土卫六SAR表征迁移评测，摘要明确比较无法隔离预训练效应；属于专用领域诊断。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07576",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07572",
      "title": "Two Vectors Replace In-Context Demos: Structured Task Adaptation via Embeddings",
      "published": "2026-10-06T01:05:57Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07572",
          "title": "Two Vectors Replace In-Context Demos: Structured Task Adaptation via Embeddings",
          "published": "2026-10-06T01:05:57Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "STAVE在frozenLM/LMM输入结构组加两向量、paired有/无demo监督，是真实2d参数适配而非gold-inference或每层模拟。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07572",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07572v1",
              "location": "§3.1–3.4 Eq2–7; §4.1–4.3; AppJ"
            },
            {
              "url": "https://arxiv.org/html/2610.07572v1",
              "location": "§3.1–3.4 Eq2–7; §4.1–4.3; AppJ",
              "notes": "readout last+answercue，context其余eligible，按合并token数sqrtN归一；excludeanswer/BOS/pad/demo（First例外）；两branch同goldCE训练，推理无demo且无新token；11backbone多公共任务3runs。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07572v1",
          "locations": [
            "§3.1–3.4 Eq2–7",
            "§4.1–4.3",
            "AppJ"
          ],
          "limitations": "是每任务有监督训练不是真零shot学习；Table1评val并bestepoch不能作独立test，Tables2/3具heldout协议；反传throughfrozen仍需activationcost；不以首tokengold读取诊断冒充自由生成能力；源码入口未查到正文。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "readout last+answercue，context其余eligible，按合并token数sqrtN归一；excludeanswer/BOS/pad/demo（First例外）；两branch同goldCE训练，推理无demo且无新token；11backbone多公共任务3runs。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07570",
      "title": "Unanimously Wrong: Certified Abstention from How Medical LLM Consensus Forms",
      "published": "2026-10-06T00:59:31Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07570",
          "title": "Unanimously Wrong: Certified Abstention from How Medical LLM Consensus Forms",
          "published": "2026-10-06T00:59:31Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07570v1",
          "location": "§3.1–3.3 Eq3–6; §4.1/4.4; §5.1–5.3; Appendix D Algorithm2/E proof/J; author GitHub API",
          "decision": "pending",
          "reason": "ProbeGuard的过程信号+反证检索重回答+分层LTT弃权机制已审，有Agent风险控制价值；官方仓库404，且标准化隔离细节未核实，已审暂缓精确复现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "MedQA一致层coverage .553±.038、风险9.0%在alpha .15；50次calibration/test切分，非50独立模型运行。附录证明使用严格高于次序统计量阈值，排除定义阈值的样本，再对20grid×2strata Bonferroni。",
          "limitations": "定理要求固定逐样本评分及同分布IID；正文per-dataset z(keep)+z(RSE)未明确统计量是否在独立数据固定，需核实现，不能直接背书分布无关证书；RSE实际互相蕴含均值非熵；全MedQA覆盖约32%，不能把一致层55.3%说成全流60%；MCQ非临床效果，probe额外中位114秒/4381token；官方contents HTTP404。",
          "code": "https://github.com/wangxiaoyang0412/probeguard",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07569",
      "title": "OpenSplatGraph: From Dense Semantic Maps to Structured Scene Graphs for Open-Vocabulary Robot Perception",
      "published": "2026-10-06T00:58:30Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07569",
          "title": "OpenSplatGraph: From Dense Semantic Maps to Structured Scene Graphs for Open-Vocabulary Robot Perception",
          "published": "2026-10-06T00:58:30Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "OpenSplatGraph在线3D高斯语义地图转场景图，属于机器人感知地图系统。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07569",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07557",
      "title": "CheckerBench: Can Long-Horizon Agents Synthesize Static-Analysis Checkers?",
      "published": "2026-10-06T00:42:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07557",
          "title": "CheckerBench: Can Long-Horizon Agents Synthesize Static-Analysis Checkers?",
          "published": "2026-10-06T00:42:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07557v1",
          "location": "§3.1 stages I–VI；§4；§5.1–5.2；official README",
          "decision": "accepted",
          "reason": "CheckerBench/CheckerLab 按补丁与漏洞前后版本生成静态检查器，冻结产物后独立重建、差分、误报和语义门禁；300任务公共包及固定Linux runtime适合代码Agent评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.07557",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1 stages I–VI",
            "§4",
            "§5.1–5.2",
            "official README"
          ],
          "limitations": "50分钟/任务、21配置各3次；pilot允许人类指导最多2次重跑且筛选至少40步成功轨迹，非无偏任务分布。heldout verifier/reference不能挂载给agent。判断不纯确定性，Opus5参与语义/误报审查，效率只统计成功轨迹。官方要求至少100GB磁盘；第三方许可分别保留，无统一再授权。",
          "code_url": "https://github.com/ahang0712/CheckerBench-Dataset",
          "code_status": "official tasks and restoration scripts accessible; frozen release attachments not executed",
          "reviewer": "root",
          "code": "https://github.com/ahang0712/CheckerBench-Dataset"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07556",
      "title": "Decoupled Multi-Agent Orchestration",
      "published": "2026-10-06T00:41:46Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07556",
          "title": "Decoupled Multi-Agent Orchestration",
          "published": "2026-10-06T00:41:46Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07556v1",
          "location": "§3.1–3.4; §4.1–4.5 Tables2–5; Appendix B.1–B.5",
          "decision": "pending",
          "reason": "DeOrch把DAG分解/协作operation两阶段RL与worker matcher解耦，嵌套rollout分别归因，density-corrected probes+6维匿名pool特征、MMR/Thompson适配有可复现算法；官方匿名代码入口not_connected，原实现暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "evidence": "fixed decomposition conditional advantage，StageII Qexp(-beta calls)而StageI只quality；51.9/7.78calls→51.5/5.35；全新4worker pool不重训50.2；15k adaptation另1927heldout 51.3→52.9。",
          "limitations": "新worker要55,676 probe calls不算免费；约410k训练orchestrations/4H200，不以轻量heuristic代替。独立probe/train/test与adapt-heldout边界须保留；best-single为hindsight reference。无训练seed方差结论，匿名源码未读取成功。",
          "upstream": "https://anonymous.4open.science/r/DeOrch-code-F8D3/",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07553",
      "title": "Which and When to Admit: Gradient Admission for Data-Centric Small Language Model Finetuning",
      "published": "2026-10-06T00:34:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07553",
          "title": "Which and When to Admit: Gradient Admission for Data-Centric Small Language Model Finetuning",
          "published": "2026-10-06T00:34:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "GRADE样本梯度对齐与EMA更新门确为新训练机制，但公开正文预算与选择协议存在未解决缺口：Appendix A成本仅anticipated并承诺未来表；U保留TBD；T一处称读取held-out最高Avg、另一处称早期validation-loss预选。需公开实测成本与选择记录，不能仅凭Meta合作署名接纳。",
          "review_level": "fulltext",
          "official_url": "https://arxiv.org/html/2610.07553v1",
          "locations": [
            "§4.1–4.2",
            "§5.1–5.2/Table1",
            "Appendix A",
            "Appendix O.4",
            "Appendix T/Table3",
            "Appendix U"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07553",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07553v1",
              "location": "§4.1–4.2; §5.1–5.2/Table1; Appendix A; Appendix O.4; Appendix T/Table3; Appendix U"
            },
            {
              "url": "https://arxiv.org/html/2610.07553v1",
              "location": "§4.1–4.2; §5.1–5.2/Table1; Appendix A; Appendix O.4; Appendix T/Table3; Appendix U",
              "notes": "同rank16 LoRA三骨干均值增益+0.99pp，但额外候选和参考forward成本约1.3–1.5倍仅预计；128 reference来自in-pool val，外部三task test；门跳optimizer但仍执行forward/backward。"
            }
          ],
          "institution": "Arizona State University / Clemson / Meta AI / NEC Laboratories America",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "同rank16 LoRA三骨干均值增益+0.99pp，但额外候选和参考forward成本约1.3–1.5倍仅预计；128 reference来自in-pool val，外部三task test；门跳optimizer但仍执行forward/backward。",
          "review_status": "reviewed_deferred"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07550",
      "title": "Foundation Model-Aided Multi-Agent Reinforcement Learning for Wireless Random Access Network Optimization",
      "published": "2026-10-06T00:27:24Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07550",
          "title": "Foundation Model-Aided Multi-Agent Reinforcement Learning for Wireless Random Access Network Optimization",
          "published": "2026-10-06T00:27:24Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07550",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "FM辅助无线随机接入actor-critic，非LLM工具Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07545",
      "title": "Quality-Aware Self-Correcting Speech Translation on an Edge Device",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07545",
          "title": "Quality-Aware Self-Correcting Speech Translation on an Edge Device",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "明确无需重训的边缘语音翻译QE/MBR推理纠正。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07545",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07535",
      "title": "Disentangling Models from Personas in Heterogeneous LLM Simulations",
      "published": "2026-10-06T00:01:30Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07535",
          "title": "Disentangling Models from Personas in Heterogeneous LLM Simulations",
          "published": "2026-10-06T00:01:30Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07535",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "异构模型社会仿真影响研究，无新执行算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07534",
      "title": "The EPIC Framework for Spec-Driven Development",
      "published": "2026-10-06T00:00:54Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07534",
          "title": "The EPIC Framework for Spec-Driven Development",
          "published": "2026-10-06T00:00:54Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07534",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "EPIC规格质量实践框架/访谈与相关性研究，非Agent算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07533",
      "title": "SkillFormer: Skill-Decomposed Adaptation for Audio Language Models",
      "published": "2026-10-06T00:00:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07533",
          "title": "SkillFormer: Skill-Decomposed Adaptation for Audio Language Models",
          "published": "2026-10-06T00:00:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SkillFormer question embedding kmeans六技能、r16并行adapter及question top2router，先每cluster500步再balanced2000步joint校准；50kQA、三audio模型/三bench。§2.4 PhaseB明确解冻LLM，与PhaseA“throughout冻结”用词有歧义，复现按分阶段并报告训练参数成本，不能宣传全程仅LoRA。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07533",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07533v1",
              "location": "§2.1–2.4式1–3；§3.1–3.4 Table 1"
            },
            {
              "url": "https://arxiv.org/html/2610.07533v1",
              "location": "§2.1–2.4式1–3；§3.1–3.4 Table 1",
              "notes": "SkillFormer question embedding kmeans六技能、r16并行adapter及question top2router，先每cluster500步再balanced2000步joint校准；50kQA、三audio模型/三bench。§2.4 PhaseB明确解冻LLM，与PhaseA“throughout冻结”用词有歧义，复现按分阶段并报告训练参数成本，不能宣传全程仅LoRA。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07533v1",
          "locations": [
            "§2.1–2.4式1–3；§3.1–3.4 Table 1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "SkillFormer question embedding kmeans六技能、r16并行adapter及question top2router，先每cluster500步再balanced2000步joint校准；50kQA、三audio模型/三bench。§2.4 PhaseB明确解冻LLM，与PhaseA“throughout冻结”用词有歧义，复现按分阶段并报告训练参数成本，不能宣传全程仅LoRA。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07532",
      "title": "Safeguarding LLMs via Model-Agnostic Latent Safety Signals from Dark Knowledge",
      "published": "2026-10-05T23:59:28Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07532",
          "title": "Safeguarding LLMs via Model-Agnostic Latent Safety Signals from Dark Knowledge",
          "published": "2026-10-05T23:59:28Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "LADE按有害/良性首token概率差选安全token，跨tokenizer首有效子词和重复映射权重，L1归一特征到有害参考集的kNN距离门控；可实现防御机制。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07532",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.07532v1",
              "location": "§3.1–3.3 Eq1–5; §4.1; Appendix M",
              "notes": "LADE按有害/良性首token概率差选安全token，跨tokenizer首有效子词和重复映射权重，L1归一特征到有害参考集的kNN距离门控；可实现防御机制。"
            }
          ],
          "source": "https://arxiv.org/html/2610.07532v1",
          "locations": [
            "§3.1–3.3 Eq1–5",
            "§4.1",
            "Appendix M"
          ],
          "limitations": "Hex-Phi和XSTest用于提取/阈值不得再算heldout；K5/k500/quantile0.9。需安全对齐模型和logprobs，过拒与已知token自适应绕过仍在。阈值参考集自距离处理和重复映射非概率守恒应忠实核验；未找到作者代码。",
          "code_status": "not_found_in_examined_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07532v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "LADE按有害/良性首token概率差选安全token，跨tokenizer首有效子词和重复映射权重，L1归一特征到有害参考集的kNN距离门控；可实现防御机制。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07522",
      "title": "Activation Denoising: A Robustness View on Parallel vs Sequential LLM Quantization",
      "published": "2026-10-05T23:41:48Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07522",
          "title": "Activation Denoising: A Robustness View on Parallel vs Sequential LLM Quantization",
          "published": "2026-10-05T23:41:48Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Activation denoising 用干净/噪声前向估计 H/C/N 二阶矩，先线性预变换权重，再在新度量下 GPTQ/QuIP# rounding，使各层可并行量化。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07522",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07522v1",
              "location": "§4 Eq2–3 / Algorithm1; §5 Algorithm2; §6 Setup/Metrics/Table1; §7"
            },
            {
              "url": "https://arxiv.org/html/2610.07522v1",
              "location": "§4 Eq2–3 / Algorithm1; §5 Algorithm2; §6 Setup/Metrics/Table1; §7",
              "notes": ""
            }
          ],
          "kind": "parallel_quantization",
          "locations": [
            "§4 Eq2–3 / Algorithm1",
            "§5 Algorithm2",
            "§6 Setup/Metrics/Table1",
            "§7"
          ],
          "limitations": "原文明确按 WikiText-2 test perplexity 选配置，不能照搬为无泄漏评测；本地须单设 validation 再冻结参数。噪声是传播的逐通道高斯近似，不是每层独立任意噪声；并行可用不等于已测单卡加速。",
          "code_url": null,
          "code_status": "no author implementation located; body references upstream quantizers",
          "official_url": "https://arxiv.org/html/2610.07522v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.07522",
          "title": "Activation Denoising: A Robustness View on Parallel vs Sequential LLM Quantization",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "并行PTQ激活去噪与量化误差正则，属于量化而非RL/OPD后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07522",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07518",
      "title": "Harmful SFT Leaves a Continuous Trace in LLM Checkpoint Updates",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07518",
          "title": "Harmful SFT Leaves a Continuous Trace in LLM Checkpoint Updates",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "TRACE以有效SFT权重增量核与纯目标参考bank做非负拟合，sH是几何关联而非有害样本比例；4个7/8B骨干有checkpoint审计实验。匿名作者代码入口暂不可读，公共审计执行资源待确认；不是NVFP4的同名TRACE。 补充直接HTTP检查为401。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07518v1",
              "location": "§2.3式3–5；§3.1、§4.1"
            },
            {
              "url": "https://anonymous.4open.science/r/Code4TRACE-54D3",
              "location": "作者资源入口；当前可用性限制见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "TRACE为只读checkpoint的安全审计方法，识别已有SFT目标，不提出训练算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "TRACE以有效SFT权重增量核与纯目标参考bank做非负拟合，sH是几何关联而非有害样本比例；4个7/8B骨干有checkpoint审计实验。匿名作者代码入口暂不可读，公共审计执行资源待确认；不是NVFP4的同名TRACE。 补充直接HTTP检查为401。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07509",
      "title": "On Open-Ended Information Seeking for Information Elicitation Agents",
      "published": "2026-10-05T23:20:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07509",
          "title": "On Open-Ended Information Seeking for Information Elicitation Agents",
          "published": "2026-10-05T23:20:16Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07509",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "信息引出偏好受模型影响的受控行为研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07491",
      "title": "Who Bears the Burden? Learning Responsibility for Shared Constraints in Multi-Agent Reinforcement Learning",
      "published": "2026-10-05T22:53:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07491",
          "title": "Who Bears the Burden? Learning Responsibility for Shared Constraints in Multi-Agent Reinforcement Learning",
          "published": "2026-10-05T22:53:33Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07491",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "LiRA共享约束传统MARL福利梯度，不是LLM策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07489",
      "title": "Deep Defence on Wheels: A Dual Intrusion Detection System Architecture for Comprehensive In-Vehicle Network Security",
      "published": "2026-10-05T22:52:39Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07489",
          "title": "Deep Defence on Wheels: A Dual Intrusion Detection System Architecture for Comprehensive In-Vehicle Network Security",
          "published": "2026-10-05T22:52:39Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "车内CAN网络双入侵检测器的FPGA部署，不属基础模型研究。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07489",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07475",
      "title": "Adapting to Changes in Agent Behavior via Finite-Depth Policy Sensitivity",
      "published": "2026-10-05T22:40:40Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07475",
          "title": "Adapting to Changes in Agent Behavior via Finite-Depth Policy Sensitivity",
          "published": "2026-10-05T22:40:40Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07475",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "有限深度RL策略敏感性估计与追逃博弈，无语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07473",
      "title": "PsyCIDRA: A Dual-Agent Framework for Psychiatric Interviewing and Diagnostic Reasoning",
      "published": "2026-10-05T22:40:24Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07473",
          "title": "PsyCIDRA: A Dual-Agent Framework for Psychiatric Interviewing and Diagnostic Reasoning",
          "published": "2026-10-05T22:40:24Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07473v1",
          "location": "§4.1–4.2; §5.1–5.3; §6.1–6.2; Limitations/Ethics; official repository",
          "decision": "pending",
          "reason": "PsyCIDRA用五类notepad+60expert skills/ICDlookup访谈Agent与独立transcript诊断Agent；模拟患者研究评测可有价值，但所称代码/134profile官方库当前仅README '# PsyCIDRA'，正文已审、公开执行暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "evidence": "53dev/81heldout，heldout R1 60.5对51.9%；101人52/49臂，diagnostic-decision79.6对65.4%，shared43positive R129对26；58expert-withheld中39对27withhold。",
          "limitations": "human参考只同transcript专家共识非独立临床诊断；非population代表样本、4早期safety-stop排除。PsyCIRA3/49安全flags含2crisis，Direct2/52；不能称临床有效/安全或ready even supervised。人类对话不公开；源码/模拟profile亦尚未实际发布。",
          "upstream": "https://github.com/PsyCIDRA/PsyCIDRA",
          "public_artifact_check": "GitHub contents只有README.md，正文声称public artifacts与当前可访问发布不符",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07460",
      "title": "ElasticFit: Fit-Aware 3D Object Insertion via VLM Reasoning and Generative Adaptation",
      "published": "2026-10-05T22:12:18Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07460",
          "title": "ElasticFit: Fit-Aware 3D Object Insertion via VLM Reasoning and Generative Adaptation",
          "published": "2026-10-05T22:12:18Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ElasticFit为3D物体插入和几何约束适配流水线，非通用多模态基础模型训练。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07460",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07457",
      "title": "AlignQuant: Tile-Aligned Mixed-Precision Quantization for Efficient LLM Generation",
      "published": "2026-10-05T22:06:04Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07457",
          "title": "AlignQuant: Tile-Aligned Mixed-Precision Quantization for Efficient LLM Generation",
          "published": "2026-10-05T22:06:04Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "AlignQuant 以64×64 tile统一量化分配、打包与GPU执行；prefill/decode Fisher敏感度分别归一化后取最大值，低敏感tile使用4bit，其余8bit；实际整数路径是核心组成。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07457",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07457v1",
              "location": "§3.1–3.3 Eq1–3; §4.1–4.4 Tables1–3; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.07457v1",
              "location": "§3.1–3.3 Eq1–3; §4.1–4.4 Tables1–3; official README",
              "notes": ""
            }
          ],
          "kind": "mixed_precision_cuda_kernel",
          "locations": [
            "§3.1–3.3 Eq1–3",
            "§4.1–4.4 Tables1–3",
            "official README"
          ],
          "limitations": "不能用fake quant张量当作速度实现；需实际CUDA/CUTLASS扩展、打包字节、变换和暂存开销，含TTFT可能比BF16慢。原文A100结果不代替仓库自己的A100验收。",
          "code_url": "https://github.com/HanzhiZhang-Ulrica/AlignQuant",
          "code_status": "official repository and calibrate/build/infer entrypoints accessible; requires SM80/CUDA/CUTLASS; license not displayed",
          "official_url": "https://arxiv.org/html/2610.07457v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.07457",
          "title": "AlignQuant: Tile-Aligned Mixed-Precision Quantization for Efficient LLM Generation",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "GPU tile对齐混合精度PTQ和kernel，不是策略后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07457",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07426",
      "title": "AccentCL: Robust Accent Classification with Incremental Expansion",
      "published": "2026-10-05T21:34:23Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07426",
          "title": "AccentCL: Robust Accent Classification with Incremental Expansion",
          "published": "2026-10-05T21:34:23Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "AccentCL英语口音分类及类别增量扩展，属于特定语音分类任务。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07426",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07423",
      "title": "2d-fet-bench: from spatial reasoning to fet design on flakes",
      "published": "2026-10-05T21:30:25Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07423",
          "title": "2d-fet-bench: from spatial reasoning to fet design on flakes",
          "published": "2026-10-05T21:30:25Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07423v1",
          "location": "§3 Eq1–2；§4；§5；§7；Appendix J/L",
          "decision": "pending",
          "reason": "2D-FET-Bench 用真实flake轮廓和隐藏几何约束评测布局Agent，但128任务与代码明确待发表后公开，暂缓官方评测接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.07423",
          "fulltext_review_completed": true,
          "locations": [
            "§3 Eq1–2",
            "§4",
            "§5",
            "§7",
            "Appendix J/L"
          ],
          "limitations": "KLayout保存后XOR固定图层校验是独立必需项，不能只运行交互verifier；7680次结果中自动通过不等于制造可用，专家仅认可56.4–63.5%的抽样通过布局。主要ReAct-3对照为事后选择、不同模型推理模式有差异；MoSe2/WSe2只是graphene轮廓上的角色标签。",
          "code_status": "promised_after_publication; proposed Apache2 code / CC-BY4 tasks",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07402",
      "title": "Rethinking Semantic ID Construction for Generative Recommendation: SimHash with Parallel Decoding and Semantic Alignment",
      "published": "2026-10-05T21:15:13Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.07402",
          "title": "Rethinking Semantic ID Construction for Generative Recommendation: SimHash with Parallel Decoding and Semantic Alignment",
          "published": "2026-10-05T21:15:13Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "FLASH 在四类 Amazon 数据上做 Recall/NDCG 与 early stopping；作者开源不替代工业线上证据。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07402",
              "location": "§3.1–3.2; Conclusion"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.07402",
            "url": "https://arxiv.org/html/2610.07402v1",
            "sha256": "de4ba5e99fdfb2971c9144fcd255a61c6ad06f014b200b6e908c98ed2504033d",
            "status": "downloaded",
            "characters": 69341,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07389",
      "title": "Inference and learning in sparse autoencoders as natural gradient flow",
      "published": "2026-10-05T21:03:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07389",
          "title": "Inference and learning in sparse autoencoders as natural gradient flow",
          "published": "2026-10-05T21:03:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "BeFOND将Bernoulli稀疏编码的推断与字典学习同时构造为natural-gradient flow，具closed-form更新、可执行官方核心与公共SAEBench任务，适合作为表示诊断/干预算子候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07389",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07389v1",
              "location": "§3 Eq9–17; §5–6; App B.6–B.7 Algorithm1; App D.1–D.3 Tables7/10; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.07389v1",
              "location": "§3 Eq9–17; §5–6; App B.6–B.7 Algorithm1; App D.1–D.3 Tables7/10; official README",
              "notes": "factorized Bernoulli+Gaussian decoder，rolling prior、ETD1推断、matrix-free指数decoder更新，no inference-trajectory backprop；Gemma2-2B layer12 50Mtoken三seed vs baseline五seed，524k RAVEL .827 vs .748；probe超参按val ROC-AUC。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07389v1",
          "locations": [
            "§3 Eq9–17",
            "§5–6",
            "App B.6–B.7 Algorithm1",
            "App D.1–D.3 Tables7/10",
            "official README"
          ],
          "limitations": "12–14x BatchTopK每token训练时长；1000x是6M/8Btoken比非FLOP节约；ZCA预处理看500Mtrain tokens应计额外数据。仅一个LM层，理论rare补偿依赖frozen matched moments。官方默认etd1_guarded与paperETD1须按PAPER_MODELS固定，预训练checkpoint未发布；不能用toy结果冒充Gemma干预。",
          "code_url": "https://github.com/hadivafaii/BeFOND",
          "implementation_status": "not_implemented",
          "fulltext_notes": "factorized Bernoulli+Gaussian decoder，rolling prior、ETD1推断、matrix-free指数decoder更新，no inference-trajectory backprop；Gemma2-2B layer12 50Mtoken三seed vs baseline五seed，524k RAVEL .827 vs .748；probe超参按val ROC-AUC。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07385",
      "title": "Semantic Capability Acquisition and Specialization During Vision-Language Model Fine-Tuning",
      "published": "2026-10-05T20:56:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07385",
          "title": "Semantic Capability Acquisition and Specialization During Vision-Language Model Fine-Tuning",
          "published": "2026-10-05T20:56:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SSR训练时NAME/ATTRIBUTE routed causal隔离、融合summary及可选NAME dropout=.5，评测恢复普通EOT；P3无name及CAPP反事实区分描述可读性。6CLIP类模型跨数据验证，P3轨迹峰值为回溯诊断不是可部署选模，部署按P1选择。未保留fork revision及subset生成脚本降低精确复现强度但核心训练定义可实现。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07385",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07385v1",
              "location": "§3；§4.1–4.4；Appendix B（class subsets）、training environment"
            },
            {
              "url": "https://arxiv.org/html/2610.07385v1",
              "location": "§3；§4.1–4.4；Appendix B（class subsets）、training environment",
              "notes": "SSR训练时NAME/ATTRIBUTE routed causal隔离、融合summary及可选NAME dropout=.5，评测恢复普通EOT；P3无name及CAPP反事实区分描述可读性。6CLIP类模型跨数据验证，P3轨迹峰值为回溯诊断不是可部署选模，部署按P1选择。未保留fork revision及subset生成脚本降低精确复现强度但核心训练定义可实现。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07385v1",
          "locations": [
            "§3；§4.1–4.4；Appendix B（class subsets）、training environment"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "SSR训练时NAME/ATTRIBUTE routed causal隔离、融合summary及可选NAME dropout=.5，评测恢复普通EOT；P3无name及CAPP反事实区分描述可读性。6CLIP类模型跨数据验证，P3轨迹峰值为回溯诊断不是可部署选模，部署按P1选择。未保留fork revision及subset生成脚本降低精确复现强度但核心训练定义可实现。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07376",
      "title": "MemCo: Memory-Centric Collaboration for Generalizing LLM Agents to Unseen Environments",
      "published": "2026-10-05T20:46:22Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07376",
          "title": "MemCo: Memory-Centric Collaboration for Generalizing LLM Agents to Unseen Environments",
          "published": "2026-10-05T20:46:22Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07376v1",
          "location": "§3.1–3.5 Eq2–10; §4/4.2; §6; Appendix D.1/F.1; official README/NOTICE",
          "decision": "accepted",
          "reason": "MemCo本地trajectory graph提取条件化规则，episode-reduced正负证据经role抽象exact-key聚合，Wilson分数促进/撤回global records，state/phase/goal检索+grounding组合；接受Agent memory核心候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "source memory构建与test任务分离，冻结memory评估；32B README97.46%unseen，对GMemory+10.27pp。within-snapshot Wilson相对经验率736→426记录，heldout+1.43pp；不是更多memory prompt。",
          "limitations": "unseen为agent未采集该域，其他agent可已见；必须与layout-heldout区分。Wilson是近似binomial界，episode去重不保证跨episodeIID；ablation同snapshot非独立重复。官方NOTICE说明上游GMemory无许可、再分发尚待确认，源码可读不等于可直接复制；模型/生成memory/logs不含在artifact。",
          "upstream": "https://github.com/SYannL/nvdamas",
          "public_artifact_check": "README/mas/configs/data/tasks/launch/scripts可读；NOTICE.md明确许可证缺口",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07359",
      "title": "Evaluate the Stack, Not the Layer: Do Deterministic and LLM Gates for Agent Actions Fail Independently?",
      "published": "2026-10-05T20:26:58Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07359",
          "title": "Evaluate the Stack, Not the Layer: Do Deterministic and LLM Gates for Agent Actions Fail Independently?",
          "published": "2026-10-05T20:26:58Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.07359",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "确定规则与LLM gate错误耦合的统计评测，不是新策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07355",
      "title": "Tracking Is Not Permanence: What Video World Models Keep of a Hidden Object",
      "published": "2026-10-05T20:22:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07355",
          "title": "Tracking Is Not Permanence: What Video World Models Keep of a Hidden Object",
          "published": "2026-10-05T20:22:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "正文已审：latent/pixel/AR二世界hidden-region距离探针与never-shown/exit控制，合成curriculum改变V-JEPA记忆；主要renderer为训练同源，IntPhys只dev且部分公开协议未复现，Appendix J明确不是全体worldmodel结论。可作诊断评测但未找到作者公开renderer/runner入口；暂缓公共评测接入，不把GT参考world作为agent可读输入。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07355",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07355v1",
              "location": "§3.1–3.5；§4.4–4.6；Appendix I/J"
            },
            {
              "url": "https://arxiv.org/html/2610.07355v1",
              "location": "§3.1–3.5；§4.4–4.6；Appendix I/J",
              "notes": "正文已审：latent/pixel/AR二世界hidden-region距离探针与never-shown/exit控制，合成curriculum改变V-JEPA记忆；主要renderer为训练同源，IntPhys只dev且部分公开协议未复现，Appendix J明确不是全体worldmodel结论。可作诊断评测但未找到作者公开renderer/runner入口；暂缓公共评测接入，不把GT参考world作为agent可读输入。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.07355v1",
          "locations": [
            "§3.1–3.5；§4.4–4.6；Appendix I/J"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "正文已审：latent/pixel/AR二世界hidden-region距离探针与never-shown/exit控制，合成curriculum改变V-JEPA记忆；主要renderer为训练同源，IntPhys只dev且部分公开协议未复现，Appendix J明确不是全体worldmodel结论。可作诊断评测但未找到作者公开renderer/runner入口；暂缓公共评测接入，不把GT参考world作为agent可读输入。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07349",
      "title": "RELACE: retrospective likelihood-based action credit estimation for long-horizon language agents",
      "published": "2026-10-05T20:19:04Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07349",
          "title": "RELACE: retrospective likelihood-based action credit estimation for long-horizon language agents",
          "published": "2026-10-05T20:19:04Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "RELACE多步agent RL信用分配，应由post-training/agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07349",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.07349",
          "title": "RELACE: retrospective likelihood-based action credit estimation for long-horizon language agents",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "执行动作原始/结果条件似然比修正局部return，终局信息仅用于训练credit；ALFWorld/WebShop真实训练，但主表混用文献baseline，应本地同预算复核。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07349v1",
              "location": "§3.1–3.4式1–14；§4.1–4.2"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07348",
      "title": "Stepped MoE: Segment-Level Routing with Configurable Inference Complexity",
      "published": "2026-10-05T20:18:26Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07348",
          "title": "Stepped MoE: Segment-Level Routing with Configurable Inference Complexity",
          "published": "2026-10-05T20:18:26Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SteppedMoE以前12dense层一次预测后44层专家集合，每段首token刷新、预算embedding与多稀疏度loss缩放联合训练，真实12B模型1Ttoken支持可变计算架构候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07348",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07348v1",
              "location": "§2.3–2.5 Eq1–3; §3.1/Tables1–3; §3.4/Figure3; §5"
            },
            {
              "url": "https://arxiv.org/html/2610.07348v1",
              "location": "§2.3–2.5 Eq1–3; §3.1/Tables1–3; §3.4/Figure3; §5",
              "notes": "segment内共享路由，无expert概率加权输出；多active预算每batch复制4次，SFT用最后prompttoken选首response段，后续首token维护因果。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07348v1",
          "locations": [
            "§2.3–2.5 Eq1–3",
            "§3.1/Tables1–3",
            "§3.4/Figure3",
            "§5"
          ],
          "limitations": "吞吐来自NPU模拟器与真实matmul/NANDtransfer参数，不是实机端到端；总训练成本近4个static模型合计，1Ttoken不等单dense训练算力。loss缩放作者明确为简化proxy并非专家频次精确LR。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "segment内共享路由，无expert概率加权输出；多active预算每batch复制4次，SFT用最后prompttoken选首response段，后续首token维护因果。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07339",
      "title": "A doctrine-grounded visual question answering dataset for Tactical Combat Casualty Care",
      "published": "2026-10-05T20:14:31Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07339",
          "title": "A doctrine-grounded visual question answering dataset for Tactical Combat Casualty Care",
          "published": "2026-10-05T20:14:31Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "TC3-VQA战术伤救视觉问答数据集，主要贡献是领域数据与来源锚定。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07339",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07338",
      "title": "Logbook: Extremely Long-form Audio Event Understanding",
      "published": "2026-10-05T20:13:46Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07338",
          "title": "Logbook: Extremely Long-form Audio Event Understanding",
          "published": "2026-10-05T20:13:46Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Meta Logbook提供连续音频全覆盖事件分段+description：E2E10min或10s caption→text10min，Ego4D/SINS/EgoLife；fAcc主分段、OLMo atomicfacts+BARTMNLI重叠段dF1主描述。人工参考含视觉/LLM标签非上限，PFLOPs为估计非延迟。官方repo有loaders/prompts/run_e2e/run_cascade/eval评分，可接公共audio evaluator。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07338",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07338v1",
              "location": "§2.1–2.4；§3；§4.1–4.2；官方README Repo layout; README: Repo layout / scripts/run_e2e.py / run_cascade.py / eval_segmentation.py / eval_descriptions.py"
            },
            {
              "url": "https://arxiv.org/html/2610.07338v1",
              "location": "§2.1–2.4；§3；§4.1–4.2；官方README Repo layout; README: Repo layout / scripts/run_e2e.py / run_cascade.py / eval_segmentation.py / eval_descriptions.py",
              "notes": "Meta Logbook提供连续音频全覆盖事件分段+description：E2E10min或10s caption→text10min，Ego4D/SINS/EgoLife；fAcc主分段、OLMo atomicfacts+BARTMNLI重叠段dF1主描述。人工参考含视觉/LLM标签非上限，PFLOPs为估计非延迟。官方repo有loaders/prompts/run_e2e/run_cascade/eval评分，可接公共audio evaluator。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07338v1",
          "locations": [
            "§2.1–2.4；§3；§4.1–4.2；官方README Repo layout",
            "README: Repo layout / scripts/run_e2e.py / run_cascade.py / eval_segmentation.py / eval_descriptions.py"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Meta Logbook提供连续音频全覆盖事件分段+description：E2E10min或10s caption→text10min，Ego4D/SINS/EgoLife；fAcc主分段、OLMo atomicfacts+BARTMNLI重叠段dF1主描述。人工参考含视觉/LLM标签非上限，PFLOPs为估计非延迟。官方repo有loaders/prompts/run_e2e/run_cascade/eval评分，可接公共audio evaluator。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07335",
      "title": "Selective Critique for Cost-Aware LLM Agents in Long-Horizon Decision Making",
      "published": "2026-10-05T20:09:48Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07335",
          "title": "Selective Critique for Cost-Aware LLM Agents in Long-Horizon Decision Making",
          "published": "2026-10-05T20:09:48Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "SAG选择性critique用于长程agent，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07335",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07335",
          "title": "Selective Critique for Cost-Aware LLM Agents in Long-Horizon Decision Making",
          "published": "2026-10-05T20:09:48Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07335v1",
          "location": "§3.1–3.4 Eq1–4; §5; Appendix G.1–G.3/H.3–H.5; official README",
          "decision": "accepted",
          "reason": "SAG对可执行动作长度归一loglik分布算entropy+top2margin门控，无gold critic纠偏；每10成功episode从同base重新LoRA-SFT累计action pairs，接受真实门控+在线学习候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "ALFWorld matched online SFT：ReAct30.2/57k、alwayscritic74.2/341k、SAG78.3/56k；3episodeorders78.3±.3不是多独立训练seed。官方SAG-code三环境入口与环境依赖可读。",
          "limitations": "这是顺序test-time adaptation，先前test成功轨迹可训练后续episode，非冻结模型heldout能力；后续不回测旧episode。token效率不含训练/全候选action likelihood计算成本；WebShop只初始search后有限click动作。默认公开WebShop500/BabyAI50与论文200/100不同须固定配置；license null不可直接视作可再分发。",
          "upstream": "https://github.com/h2w1/SAG-code",
          "public_artifact_check": "official project links repository; README+SAG_alfworld.py/SAG_babyai.py/SAG_webshop.py/envs可读，未执行；GitHub license null",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07332",
      "title": "Structuring MoE Expert Selection for Agentic Reinforcement Learning",
      "published": "2026-10-05T20:06:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07332",
          "title": "Structuring MoE Expert Selection for Agentic Reinforcement Learning",
          "published": "2026-10-05T20:06:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "operation标签和router互信息、相邻token专家集合一致性及entropy gate联合agentic RL；AppWorld/AutomationBench真实训练，需模型路由不可用proxy。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07332",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07332v1",
              "location": "§3.1–3.3；§4.1"
            }
          ],
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "review_provenance": "post_training_review正文审查复用；foundation核对交叉记录",
          "official_url": "https://arxiv.org/html/2610.07332v1",
          "locations": [
            "§3.1–3.3；§4.1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": [
            {
              "url": "https://arxiv.org/html/2610.07332v1",
              "location": "§3.1–3.3；§4.1"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.07332",
          "title": "Structuring MoE Expert Selection for Agentic Reinforcement Learning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "operation标签和router互信息、相邻token专家集合一致性及entropy gate联合agentic RL；AppWorld/AutomationBench真实训练，需模型路由不可用proxy。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07332v1",
              "location": "§3.1–3.3；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07332",
          "title": "Structuring MoE Expert Selection for Agentic Reinforcement Learning",
          "published": "2026-10-05T20:06:47Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07332v1",
          "location": "§3.1–3.3；§4.1",
          "decision": "accepted",
          "reason": "operation标签和router互信息、相邻token专家集合一致性及entropy gate联合agentic RL；AppWorld/AutomationBench真实训练，需模型路由不可用proxy。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07324",
      "title": "Scale-Invariant Training for Time Series Foundation Models",
      "published": "2026-10-05T19:56:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07324",
          "title": "Scale-Invariant Training for Time Series Foundation Models",
          "published": "2026-10-05T19:56:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ScaleIn将loss置于context-normalized target空间，作为时间序列基础模型training-config算子候选；本文是已存在策略的系统理论/实证审计，不宣称全新网络。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07324",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07324v1",
              "location": "§3 Eq1–10/Theorem3.2; §4.1–4.4 Tables3/4; App C/G.1/H"
            },
            {
              "url": "https://arxiv.org/html/2610.07324v1",
              "location": "§3 Eq1–10/Theorem3.2; §4.1–4.4 Tables3/4; App C/G.1/H",
              "notes": "仅context估a,b，同a,b缩放future target而非用future算统计；ScaleCon梯度=b^p ScaleIn，固定epsilon破坏严格缩放等变。4架构随机初始化80kupdates batch512四seed同初始化/数据/优化，73datasets series90/10split排除benchmarkval/test；24对MASE皆降。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.07324v1",
          "locations": [
            "§3 Eq1–10/Theorem3.2",
            "§4.1–4.4 Tables3/4",
            "App C/G.1/H"
          ],
          "limitations": "TimesFM49.6M减宽减深并去quantilehead非原200M；监督任务仅MASE平均1.9% WQL1.1%，非处处大增。带arcsinh非仅b^p比率，固定统计/偏置须保真；无本论文官方源码链接找到，AppendixC可执行定义可独立实现。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "仅context估a,b，同a,b缩放future target而非用future算统计；ScaleCon梯度=b^p ScaleIn，固定epsilon破坏严格缩放等变。4架构随机初始化80kupdates batch512四seed同初始化/数据/优化，73datasets series90/10split排除benchmarkval/test；24对MASE皆降。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07311",
      "title": "Understanding and Mitigating Inference-Time Overreliance Using Agentic Memory",
      "published": "2026-10-05T19:48:54Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07311",
          "title": "Understanding and Mitigating Inference-Time Overreliance Using Agentic Memory",
          "published": "2026-10-05T19:48:54Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07311v1",
          "location": "§2; §3.1–3.3 Eq1; §4.1–4.4; Appendix A.1/C benchmark construction",
          "decision": "accepted",
          "reason": "MemTrim用LLM规范化原子证据+task signature/answer support，独立key-value trie索引；删与当前重复或矛盾证据、support变化则抑制旧answer、task变化则typed reuse，接受memory治理机制候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "RippleEdits/CounterLogic/CLADDER-derived，先前memory正确但与当前任务可不一致；同retrieved set上TA/TD-Dup与正确→错误分别评估；冲突memory-only无可信排序则全部withhold；parser失败仅重试一次且不得复用unchecked outcome。",
          "limitations": "当前query无条件优先是关键可信性假设，不能移用于攻击者query或称通用防御；support/实体canonicalization由LLM估计不是因果依赖证明。overlap sweep同时恢复answer-relevant信息，不能证明仅重复量的纯因果效应。写入parser成本被摊销、runtime仅read+generation；未找到作者代码，需独立实现且不能替换parser为fixture。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07289",
      "title": "Catching Developers in the Flow: Low-Latency Agentic Program Repair at Google Scale",
      "published": "2026-10-05T19:23:06Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07289",
          "title": "Catching Developers in the Flow: Low-Latency Agentic Program Repair at Google Scale",
          "published": "2026-10-05T19:23:06Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.07289v1",
          "location": "PDF pp1–10; §3; §4.1; §4.2/Table2; §5; Data Availability",
          "decision": "accepted",
          "reason": "Google FlowAgent以预/后执行过滤、ReAct generate-and-validate和最终测试完成低延迟presubmit修复；核心候选接受，未实现。",
          "reviewer": "parent_agent",
          "evidence": "§4.1人工评估195例准确率67.18%；§4.2/Table2 2,567,829失败changes、295,508显示修复、28,554采用。",
          "limitations": "不是随机A/B；采用有选择偏差；内部Gemini和私有数据/源码不公开，公开APR替代仅能独立机制验证。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07269",
      "title": "What Words Keep of a Place: Zero-Shot Language Reasoning for Cross-View Geo-Localization",
      "published": "2026-10-05T19:11:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07269",
          "title": "What Words Keep of a Place: Zero-Shot Language Reasoning for Cross-View Geo-Localization",
          "published": "2026-10-05T19:11:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "GeoLingual跨视角定位语言描述的可辨识性与负结果诊断，主要是应用评估。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07269",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07261",
      "title": "Verifying Coordination in Parallel Coding Agents: NP-Bench and a Scheduling Planner",
      "published": "2026-10-05T19:02:27Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07261",
          "title": "Verifying Coordination in Parallel Coding Agents: NP-Bench and a Scheduling Planner",
          "published": "2026-10-05T19:02:27Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07261v1",
          "location": "§3–5 Algorithm1；§6.2–6.3；§9/reproducibility",
          "decision": "accepted",
          "reason": "Nerveplane被动观察git状态，按文件scope冲突着色分批并按契约依赖排序合并，NP-Bench含真实git集成与live coding agents，可作并行evolve协作评测候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.07261",
          "fulltext_review_completed": true,
          "locations": [
            "§3–5 Algorithm1",
            "§6.2–6.3",
            "§9/reproducibility"
          ],
          "limitations": "scope和依赖人工给定；DAG保证不覆盖cycle-break启发式。脚本TierA仅机制诊断，live仅3–15seed简单构造；planner比baseline多获得确切契约，不隔离信息量与时机，不能宣传普遍100%协调成功。",
          "code_url": "https://github.com/sumanyumuku98/Nerveplane",
          "code_status": "official system and coordination-evals public; paper version v0.17.0 requires pin",
          "reviewer": "root",
          "code": "https://github.com/sumanyumuku98/Nerveplane"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07258",
      "title": "Lineage-Aware Memory Governance: A Derivation-Gated Framework for Privacy-Preserving Column-Level Access Control in Enterprise AI Agents",
      "published": "2026-10-05T18:56:56Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07258",
          "title": "Lineage-Aware Memory Governance: A Derivation-Gated Framework for Privacy-Preserving Column-Level Access Control in Enterprise AI Agents",
          "published": "2026-10-05T18:56:56Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07258v1",
          "location": "§III-A–C algorithms/Eq1–2; §IV Theorem1/Corollary3; §VI-A–E TablesVI–VII; §VII-B; §VIII",
          "decision": "accepted",
          "reason": "Lineage-Aware Memory Governance以敏感列派生标签、最新安全记忆检索及定义hash冲突提示实现明确可复现的共享Agent记忆治理；接受为机制诊断候选而非生产安全能力。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "30seeds合成/TPC-H模拟重用95.8%降82.6/81.5%，避免对应敏感列派生泄漏；真实Agent仅9次roundtrip；43手标pair hash recall1/precision.651，column-graph漏全部8个逻辑运算变化。",
          "limitations": "定理仅完整lineage+fresh computation预先授权+最新policy标签；缓存key只有metric而非语义一致定义，冲突只提示不阻止；只管登记敏感列非所有ACL。未识别view/UDF内部列时解析可能静默成功，fail-closed仅在检测失败触发，故不能保证所有不完整提取安全。模拟不等能力比较；原码明确future open-source，无发布URL，独立机制实现不能冒称作者完整复现。",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07247",
      "title": "Learning What to Distill: Bilevel Top-K Token Selection for Self-Distillation in Large Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07247",
          "title": "Learning What to Distill: Bilevel Top-K Token Selection for Self-Distillation in Large Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Soft-OR效用、softplus阈值内层与soft mask形成近似bilevel选择；阈值detach、全词表forward KL。200步最终checkpoint；TIP比较同时改变divergence，不可单独归因选择器。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07247v1",
              "location": "§3.1–3.3式1–8；§4.1–4.2"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07243",
      "title": "Hybrid Cross-Modal Attention Network for Early Breast Cancer Detection in Low-Resource Clinical Settings",
      "published": "2026-10-05T18:44:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07243",
          "title": "Hybrid Cross-Modal Attention Network for Early Breast Cancer Detection in Low-Resource Clinical Settings",
          "published": "2026-10-05T18:44:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "HCMAN乳腺癌临床图像/结构化资料融合，专用医疗模型应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07243",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07226",
      "title": "Minimal Witness Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07226",
          "title": "Minimal Witness Reinforcement Learning",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "MWRL核心是集合格上的minimal-witness策略梯度；LLM实验冻结Qwen并搜索head/MLP子集，不是训练LLM语言策略，转电路发现/通用RL。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07226v1",
              "location": "§3.1–3.4；§4.1、§4.3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07212",
      "title": "Reward-Driven Learning under Prompt-Level Differential Privacy",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07212",
          "title": "Reward-Driven Learning under Prompt-Level Differential Privacy",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "DP-GRPO以prompt group为DP-SGD裁剪记录、单更新GRPO为record loss；隐私会计与实际Qwen1.5B LoRA实验，保留DP机制而非仅加噪声示意。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07212v1",
              "location": "§V Algorithm 1；§VIII-A"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07191",
      "title": "Agentic Design Space Exploration for Joint Hardware Configuration Selection and Mapping of AI Inference Workloads on Heterogeneous Edge SoCs",
      "published": "2026-10-05T18:08:58Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07191",
          "title": "Agentic Design Space Exploration for Joint Hardware Configuration Selection and Mapping of AI Inference Workloads on Heterogeneous Edge SoCs",
          "published": "2026-10-05T18:08:58Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07191v1",
          "location": "§3.1–3.6; §4; §5.1–5.3 Tables2–4",
          "decision": "accepted",
          "reason": "TraceDSE以真实硬件执行trace→工具化critic→proposer→Pareto/exploration state组成实测搜索闭环，适合evolve算子机制候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "四工作负载Intel Meteor Lake；相同3初始种子，基线12小时；TraceDSE 27–104硬件评估、2.1–3.3小时，5.6–9倍更少评估；ImageBind五独立搜索HV .744–.764。",
          "limitations": "能耗50次推理窗口采样减idle，非瞬时单次读数；跨全部算法的Pareto max归一reference依赖已观察结果；critic估计不捕获争用必须真实验证；更换模拟器不复现论文硬件收益，未找到作者发布代码；不是Google机构，仅用Gemini。",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07177",
      "title": "CLM-as-a-Judge: Evaluating an Open Contrastive Decision Model on Public Judge Benchmarks",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07177",
          "title": "CLM-as-a-Judge: Evaluating an Open Contrastive Decision Model on Public Judge Benchmarks",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公共judge评测与校准级联协议：calibration/eval隔离、双顺序、常数baseline及成本—风险读数。arXiv官方abstract页已枚举ancillary的pins、split、per-item预测、judges/run_pass/metrics/analysis源码。托管strong judge不可固定revision；本次未运行代码，单个附件浏览器读取报错。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07177v1",
              "location": "§3；§5–6；§10 Reproducibility"
            },
            {
              "url": "https://arxiv.org/abs/2610.07177",
              "location": "Ancillary-file links：README、code/judges.py、run_pass.py、metrics.py、analysis/gating.py及manifests"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "公开judge benchmark上的CLM评测和温度校准，未提出新策略后训练方法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07168",
      "title": "A theory of platonic representations in language models",
      "published": "2026-10-05T18:00:09Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07168",
          "title": "A theory of platonic representations in language models",
          "published": "2026-10-05T18:00:09Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "跨语言柏拉图表征理论及合成语言诊断，主贡献是解释规律而非新基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07168",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07132",
      "title": "CroissantMiner: Automated Extraction and Validation of Croissant Metadata for ML Datasets",
      "published": "2026-10-05T17:59:48Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07132",
          "title": "CroissantMiner: Automated Extraction and Validation of Croissant Metadata for ML Datasets",
          "published": "2026-10-05T17:59:48Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CroissantMiner含102human-gold+500silver的30字段paper metadata，singlepass及4agentic抽取，rule/LLM分字段score与NULL惩罚；Sonnet4.5预填不参与排名，judge最终κ.708/hardset.663应替代初始.890。外部metadata enrichment与paper-only gold有边界冲突需分开；官方MIT仓库有data/evaluation/CLI，可接evolve信息抽取评测。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07132",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07132v1",
              "location": "§3.1–3.3；§4.1；§5.1–5.3；官方README/data/evaluation; README benchmark/data/evaluation/CLI, MIT"
            },
            {
              "url": "https://arxiv.org/html/2610.07132v1",
              "location": "§3.1–3.3；§4.1；§5.1–5.3；官方README/data/evaluation; README benchmark/data/evaluation/CLI, MIT",
              "notes": "CroissantMiner含102human-gold+500silver的30字段paper metadata，singlepass及4agentic抽取，rule/LLM分字段score与NULL惩罚；Sonnet4.5预填不参与排名，judge最终κ.708/hardset.663应替代初始.890。外部metadata enrichment与paper-only gold有边界冲突需分开；官方MIT仓库有data/evaluation/CLI，可接evolve信息抽取评测。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07132v1",
          "locations": [
            "§3.1–3.3；§4.1；§5.1–5.3；官方README/data/evaluation",
            "README benchmark/data/evaluation/CLI, MIT"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "CroissantMiner含102human-gold+500silver的30字段paper metadata，singlepass及4agentic抽取，rule/LLM分字段score与NULL惩罚；Sonnet4.5预填不参与排名，judge最终κ.708/hardset.663应替代初始.890。外部metadata enrichment与paper-only gold有边界冲突需分开；官方MIT仓库有data/evaluation/CLI，可接evolve信息抽取评测。"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07132",
          "title": "CroissantMiner: Automated Extraction and Validation of Croissant Metadata for ML Datasets",
          "published": "2026-10-05T17:59:48Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07132v1",
          "location": "§3.1–3.3；§4.1；§5.1；Limitations；official README",
          "decision": "accepted",
          "reason": "CroissantMiner 提供论文到30字段Croissant metadata的单次/并行专家/triage-critique/locator/ReAct对照，以及602论文、102人工gold，可用于研究资料提取的公开评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.07132",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.3",
            "§4.1",
            "§5.1",
            "Limitations",
            "official README"
          ],
          "limitations": "14开发/88测试，500silver不可冒充人工gold；原文未载字段应null，部分Agent额外查外部metadata会改变任务定义，须区分paper-only与enriched。judge为模型且gold基于Sonnet预填，Sonnet4.5明确不排名；不能拿自动提取替代本项目逐篇证据核查。",
          "code_url": "https://github.com/berkearda/croissantminer",
          "code_status": "official MIT code/data/evaluation accessible",
          "reviewer": "root",
          "code": "https://github.com/berkearda/croissantminer"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07127",
      "title": "PlaySuite: A Large-Scale Benchmark for Interactive Visual Intelligence",
      "published": "2026-10-05T17:52:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07127",
          "title": "PlaySuite: A Large-Scale Benchmark for Interactive Visual Intelligence",
          "published": "2026-10-05T17:52:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "复用Agent reviewer已核§3–6及App A.3：5734games/14models网络隔离worker+共享vLLM，1fps Qwen3.5-9B milestone ordinal0–4非完成比例；暂停游戏等待推理非实时，60video/6human评判一致性有限。官方README code+data coming soon，尚无可公开执行runner；PyWeek/itch许可也不能统一作开源。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07127",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07127v1",
              "location": "§3–6；Appendix A.3；官方README code/data coming soon；agent-fulltext-decisions.json; README release status；agent reviewer已核查并共享"
            },
            {
              "url": "https://arxiv.org/html/2610.07127v1",
              "location": "§3–6；Appendix A.3；官方README code/data coming soon；agent-fulltext-decisions.json; README release status；agent reviewer已核查并共享",
              "notes": "复用Agent reviewer已核§3–6及App A.3：5734games/14models网络隔离worker+共享vLLM，1fps Qwen3.5-9B milestone ordinal0–4非完成比例；暂停游戏等待推理非实时，60video/6human评判一致性有限。官方README code+data coming soon，尚无可公开执行runner；PyWeek/itch许可也不能统一作开源。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.07127v1",
          "locations": [
            "§3–6；Appendix A.3；官方README code/data coming soon；agent-fulltext-decisions.json",
            "README release status；agent reviewer已核查并共享"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "复用Agent reviewer已核§3–6及App A.3：5734games/14models网络隔离worker+共享vLLM，1fps Qwen3.5-9B milestone ordinal0–4非完成比例；暂停游戏等待推理非实时，60video/6human评判一致性有限。官方README code+data coming soon，尚无可公开执行runner；PyWeek/itch许可也不能统一作开源。"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07127",
          "title": "PlaySuite: A Large-Scale Benchmark for Interactive Visual Intelligence",
          "published": "2026-10-05T17:52:40Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07127v1",
          "location": "§3–4；§5/Table2正文；§6/Limitations；AppendixA.3；官方README",
          "decision": "pending",
          "reason": "PlaySuite闭环键鼠/统一视频milestone评分及5734游戏具有evolve公共评测价值，但官方README明确code/data/harness/judge coming soon且API license=null，保留待发布而非按benchmark拒绝。",
          "reviewer": "agent_review",
          "evidence": "14open模型、5734游戏；Qwen3.5-9B judge1fps，milestone映射0–4；60视频6人校验human alpha.624、含judge.605；8worker H100吞吐6.7→42.4 eval/GPUh。",
          "limitations": "progress为序数均值不是完成比例；推理时暂停游戏，不测实时反应；PyWeek仅未修改免费分发授权，itch.io免费可访问不等于开源统一许可；公开游戏污染不可排除。",
          "code": "https://github.com/dhevarghese/PlaySuite",
          "pending_reason": "public_artifacts_coming_soon",
          "candidate_kind": "evaluation_infrastructure",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07121",
      "title": "SoloQ: Calibration-Free Quantization for Diffusion Language Models",
      "published": "2026-10-05T17:30:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07121",
          "title": "SoloQ: Calibration-Free Quantization for Diffusion Language Models",
          "published": "2026-10-05T17:30:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SoloQ K-RPBH在permuted blockHadamard后Haar跨块混合，weight E8P/activation Lloyd或NVFP4分布quantizer，无校准数据；scale ||z||²/<q(z),z>修正仅恢复投影非无误差。blockdiffusion仅commit KV量化、active保持高精度。五dLLM实验，H200 accuracy/低位硬件性能须区别A100可运行性。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07121",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.07121v1",
              "location": "§4.2–4.5式4、7–12；§5.1–5.3；Appendix B/C"
            },
            {
              "url": "https://arxiv.org/html/2610.07121v1",
              "location": "§4.2–4.5式4、7–12；§5.1–5.3；Appendix B/C",
              "notes": "SoloQ K-RPBH在permuted blockHadamard后Haar跨块混合，weight E8P/activation Lloyd或NVFP4分布quantizer，无校准数据；scale ||z||²/<q(z),z>修正仅恢复投影非无误差。blockdiffusion仅commit KV量化、active保持高精度。五dLLM实验，H200 accuracy/低位硬件性能须区别A100可运行性。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.07121v1",
          "locations": [
            "§4.2–4.5式4、7–12；§5.1–5.3；Appendix B/C"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "SoloQ K-RPBH在permuted blockHadamard后Haar跨块混合，weight E8P/activation Lloyd或NVFP4分布quantizer，无校准数据；scale ||z||²/<q(z),z>修正仅恢复投影非无误差。blockdiffusion仅commit KV量化、active保持高精度。五dLLM实验，H200 accuracy/低位硬件性能须区别A100可运行性。"
        },
        {
          "track": "post-training",
          "id": "2610.07121",
          "title": "SoloQ: Calibration-Free Quantization for Diffusion Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "SoloQ为免校准扩散模型量化与KV压缩，非策略后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07121",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07118",
      "title": "AMBER: Training Long-Horizon Web Agents through Append-Only Memory",
      "published": "2026-10-05T17:11:07Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07118",
          "title": "AMBER: Training Long-Horizon Web Agents through Append-Only Memory",
          "published": "2026-10-05T17:11:07Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "AMBER长程web agent追加记忆RL，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07118",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.07118",
          "title": "AMBER: Training Long-Horizon Web Agents through Append-Only Memory",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "append-only两回合memory/action共享GRPO终局优势，插入模板token mask；实验先SFT初始化，不得声称完全无SFT；需web环境。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.07118v1",
              "location": "§4.2式10；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.07118",
          "title": "AMBER: Training Long-Horizon Web Agents through Append-Only Memory",
          "published": "2026-10-05T17:11:07Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07118v1",
          "location": "§4.2式10；§5",
          "decision": "accepted",
          "reason": "append-only两回合memory/action共享GRPO终局优势，插入模板token mask；实验先SFT初始化，不得声称完全无SFT；需web环境。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07105",
      "title": "Beyond Successor Accuracy: State Retention for Recursive Self-Improvement in Recommendation",
      "published": "2026-10-05T15:03:27Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.07105",
          "title": "Beyond Successor Accuracy: State Retention for Recursive Self-Improvement in Recommendation",
          "published": "2026-10-05T15:03:27Z",
          "repository_status": "new",
          "decision": "deferred",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "RecRSI 用 Amazon/Yelp、GRU4Rec/SASRec/FMLP 做离线保留率轨迹，34/36 成功轨迹不是线上实验。可保留为 RSI 研究线索，但不能借 RSI 标签绕开工业推荐门槛；需单独学术例外批准。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07105",
              "location": "§3 paired-retention and multi-update experiments"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.07105",
            "url": "https://arxiv.org/html/2610.07105v1",
            "sha256": "a4f5da01a35fb9731b9c5c11f5a7c1390083903cd7e773f157d7fe03942781bc",
            "status": "downloaded",
            "characters": 28692,
            "errors": []
          }
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07091",
      "title": "Smart Content Ingestion for Generative AI Workloads",
      "published": "2026-10-05T13:22:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07091",
          "title": "Smart Content Ingestion for Generative AI Workloads",
          "published": "2026-10-05T13:22:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "企业多格式内容抽取系统与检索评估，非基础模型核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07091",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07089",
      "title": "Towards a Unified Misuse Monitoring Benchmark",
      "published": "2026-10-05T12:57:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07089",
          "title": "Towards a Unified Misuse Monitoring Benchmark",
          "published": "2026-10-05T12:57:03Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07089v1",
          "location": "§3.1–3.4；§4.1；§5 protocol；§6/Limitations；Reproducibility",
          "decision": "pending",
          "reason": "Unified Misuse Monitoring Benchmark 用固定误报预算与首次flag是否落在harm-window联合评估monitor；框架可用但官方代码仓库仍coming soon，暂缓数据集集成。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.07089",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.4",
            "§4.1",
            "§5 protocol",
            "§6/Limitations",
            "Reproducibility"
          ],
          "limitations": "正文主表在evaluation选阈值，必须采用附录E.1的10% benign calibration冻结方案；单Gemma模拟全部工具输出，非真实工具执行能力。标注模型化，精确位置一致率67.5%；不能把更早阻断一律解释成安全差，时序指标依赖所定义窗口。",
          "code_url": "https://github.com/atryt0ne/unified-misuse-monitoring-benchmark",
          "code_status": "official repository coming soon",
          "reviewer": "root",
          "code": "https://github.com/atryt0ne/unified-misuse-monitoring-benchmark"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07086",
      "title": "SchemaFill: Efficient LLM Tool Calling via Slot-Parallel Speculative Decoding",
      "published": "2026-10-05T12:22:34Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07086",
          "title": "SchemaFill: Efficient LLM Tool Calling via Slot-Parallel Speculative Decoding",
          "published": "2026-10-05T12:22:34Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07086v1",
          "location": "§3.1–3.3 Eq1–2; §4.1–4.3 Algorithm1; §5.1–5.3 Table1; AppendixA/B/C.1",
          "decision": "pending",
          "reason": "SchemaFill按公共schema/BM25预测3call slot并行draft，MAIN/SIDE隔离；side值必须在真实prefix再验证，全部结构token由target确定。解码机制符合核心候选但官方repo404，完整EAGLE头和数值一致实现未公开可取，已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "Glaive650单call、BFCL450三个并行类别；RTXPRO6000 batch1三launch，3.73/4.05×TPS、ARagreement100%；训练9216请求与测试development去重；统计gold与推理输入分离。",
          "limitations": "4.05×是结构化response生成不是包含真实toolexecution全Agent任务；oracle skeleton仅ParallelFill诊断baseline不能给本法。贪心等价要求target logits数值/掩码/位置完全一致；stochastic用真实proposal q或pointmass与residual采样，不可用单纯argmax验证宣称distribution-preserving。论文Blackwell速度不能等同A100，未有本地执行。",
          "code": "https://github.com/Czzzk/SchemaFill",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07062",
      "title": "Learning to Simulate Individuals from Macro Social Signals",
      "published": "2026-10-05T06:56:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07062",
          "title": "Learning to Simulate Individuals from Macro Social Signals",
          "published": "2026-10-05T06:56:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "macro2mind市场信号训练用户模拟器，属专用后训练应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07062",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07060",
      "title": "Skillful Data-Driven Subseasonal Soil Moisture Forecasting: Prospects and Limits for Flash Drought Prediction",
      "published": "2026-10-05T06:34:10Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07060",
          "title": "Skillful Data-Driven Subseasonal Soil Moisture Forecasting: Prospects and Limits for Flash Drought Prediction",
          "published": "2026-10-05T06:34:10Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "土壤湿度次季节预测的特定气象模型与问题表述。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07060",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07043",
      "title": "TRIAGE: Direction-Aware Mismatch Stabilization of Native NVFP4 Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07043",
          "title": "TRIAGE: Direction-Aware Mismatch Stabilization of Native NVFP4 Reinforcement Learning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "TRIAGE在负优势负gap token按segment门控并保持响应更新质量归一化，正优势加有界pseudo-Huber修复；真实NVFP4 learner/sampler实验，A100仿真不能宣称原生吞吐。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07043",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.07043v1",
              "location": "§4.1–4.2 Eq.12–20；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07032",
      "title": "Investigating Model Compression for Neural Machine Translation in the Biomedical Domain",
      "published": "2026-10-04T19:01:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07032",
          "title": "Investigating Model Compression for Neural Machine Translation in the Biomedical Domain",
          "published": "2026-10-04T19:01:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "法英生医翻译的已有蒸馏量化结合，属于领域压缩应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07032",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07023",
      "title": "Beyond Refusal Patterns: Safe-Role Internalization for Robust and Generalizable LLM Safety Alignment",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.07023",
          "title": "Beyond Refusal Patterns: Safe-Role Internalization for Robust and Generalizable LLM Safety Alignment",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "SSRFT核心是安全角色QA生成扩展与常规SFT的安全对齐数据流程，未形成新增优化器/蒸馏算法；保留安全数据研究价值但不收入本轮核心算法。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07023",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.07023v1",
              "location": "§3；§3.6；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07014",
      "title": "DTFormer: Text-Guided Semantic Alignment for RGB-D Segmentation",
      "published": "2026-10-04T14:06:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.07014",
          "title": "DTFormer: Text-Guided Semantic Alignment for RGB-D Segmentation",
          "published": "2026-10-04T14:06:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "DTFormer RGB-D分割加入文本语义原型，为专用分割网络。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.07014",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.07004",
      "title": "Topology-Consistent Task Planning over Cellular Workflow Complexes for LLM-based Agents",
      "published": "2026-10-04T10:24:20Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.07004",
          "title": "Topology-Consistent Task Planning over Cellular Workflow Complexes for LLM-based Agents",
          "published": "2026-10-04T10:24:20Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.07004v1",
          "location": "§3–4；Appendix B/D/G.1/G.3/G.4",
          "decision": "pending",
          "reason": "TopoPlanner将dependencygraph升为cycle-region cellular complex，queryconditioned cosheaf gate/closure retrieval再multidimensionalmessagepassing softgraph token训练planner。原TaskBench公开，但核心拓扑扩展grouped splits/构造包与代码未定位，暂缓原文评测复现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.07004",
          "limitations": "merge的cyclecell不代表重复执行，loop终止仍executor负责；greedyclosure不是PCST最优。原goldtool仅NLL/外部评分；node/link F1及ACC为plan结构非真实tool success。Kmax有限不保证完整cyclebasis，固定graph motif生成query需heldouttopology审计，4H800训练缩小版不能冒充原规模。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06993",
      "title": "DART-ES: Difficulty-Aware Reweighting and Targeted Replay for Fine-Tuning LLMs with Evolution Strategies",
      "published": "2026-10-04T07:42:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06993",
          "title": "DART-ES: Difficulty-Aware Reweighting and Targeted Replay for Fine-Tuning LLMs with Evolution Strategies",
          "published": "2026-10-04T07:42:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "DART-ES进化策略后训练的难度重加权，由post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06993",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.06993",
          "title": "DART-ES: Difficulty-Aware Reweighting and Targeted Replay for Fine-Tuning LLMs with Evolution Strategies",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "DART-ES用扰动种群正确率EMA构造连续难度权重，并以掌握阈值和零成功耐心控制稀有可解样本重放；实际LLM数学ES对比，不能把历史正确率oracle放入评价agent。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06993",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.06993v1",
              "location": "§3.2 Eq.3–6/Algorithm1；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06977",
      "title": "Visual-Invariance-Augmented Feature Optimal Alignment for Transferable Adversarial Attacks against Closed-Source MLLMs",
      "published": "2026-10-04T00:16:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06977",
          "title": "Visual-Invariance-Augmented Feature Optimal Alignment for Transferable Adversarial Attacks against Closed-Source MLLMs",
          "published": "2026-10-04T00:16:22Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "IAU-FOA多模态迁移攻击，非基础模型能力算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06977",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06972",
      "title": "BoT-Feedback: Grounding Multimodal Reasoning in Biomechanical Evidence for Explainable Human Action Feedback",
      "published": "2026-10-03T20:22:29Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06972",
          "title": "BoT-Feedback: Grounding Multimodal Reasoning in Biomechanical Evidence for Explainable Human Action Feedback",
          "published": "2026-10-03T20:22:29Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "BoT-Feedback生物力学指导动作教学反馈，专用应用框架。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06972",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06971",
      "title": "AegisFlow: A Multi-Agent Agentic AI Framework for Autonomous Remediation and Self-Healing in Fragile Data Ecosystems",
      "published": "2026-10-03T19:12:31Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06971",
          "title": "AegisFlow: A Multi-Agent Agentic AI Framework for Autonomous Remediation and Self-Healing in Fragile Data Ecosystems",
          "published": "2026-10-03T19:12:31Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.06971v1",
          "location": "PDF pp14–20,34,38–42; Shadow Sandbox; Supplementary materials",
          "decision": "pending",
          "reason": "AegisFlow 给出数据流水线 monitor/diagnose/LLM repair/shadow sandbox/hot-swap 多 agent 闭环及人工 override/rollback，正文有完整架构与实验声明。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "source_url": "https://arxiv.org/pdf/2610.06971v1",
          "limitations": "审后延期：原文声明 github.com/mbilalawan/aegisflow 含数据/脚本，但本轮未确认访问及结果来源；98% on-call、300% feature velocity 不具公开可核验定义；禁止凭架构描述复述为量化线上证据。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "AegisFlow 给出数据流水线 monitor/diagnose/LLM repair/shadow sandbox/hot-swap 多 agent 闭环及人工 override/rollback，正文有完整架构与实验声明。",
          "data_verifiability": "审后延期：原文声明 github.com/mbilalawan/aegisflow 含数据/脚本，但本轮未确认访问及结果来源；98% on-call、300% feature velocity 不具公开可核验定义；禁止凭架构描述复述为量化线上证据。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06966",
      "title": "APEX: Active Protection at Execution Boundaries for LLM Agents",
      "published": "2026-10-03T17:53:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06966",
          "title": "APEX: Active Protection at Execution Boundaries for LLM Agents",
          "published": "2026-10-03T17:53:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06966v1",
          "location": "APEX Algorithm1; WRAP/PLANT coordination; §experiments; Appendix C/D",
          "decision": "accepted",
          "reason": "APEX 冻结用户授权合同，在执行边界以 WRAP 核验效应授权，以 PLANT deception receipts 暴露未获准信息使用，失败安全延续。AgentDojo/ASB/MCPTox/MSB/Skills 公开任务支持验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.06966v1",
          "limitations": "0 ASR 不等于开放环境安全保证；攻击者按每个 defense 固定反馈优化，需透明报告；禁止让 skill 文本改写授权；合同误差、阻断和恢复失败单列。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "APEX 冻结用户授权合同，在执行边界以 WRAP 核验效应授权，以 PLANT deception receipts 暴露未获准信息使用，失败安全延续。AgentDojo/ASB/MCPTox/MSB/Skills 公开任务支持验证。",
          "data_verifiability": "0 ASR 不等于开放环境安全保证；攻击者按每个 defense 固定反馈优化，需透明报告；禁止让 skill 文本改写授权；合同误差、阻断和恢复失败单列。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06964",
      "title": "Principles that Guide, Actions that Inform: Agent Evolution via Knowledge Abstraction",
      "published": "2026-10-03T17:29:38Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06964",
          "title": "Principles that Guide, Actions that Inform: Agent Evolution via Knowledge Abstraction",
          "published": "2026-10-03T17:29:38Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06964v1",
          "location": "SAGA retrieval-utilization-abstraction; Algorithm1; normalized p34,44,82–90,115–116",
          "decision": "accepted",
          "reason": "SAGA 将执行轨迹抽象为分层经验/原则，检索后适配当前任务，并可 SFT/GRPO 优化 actor。ScienceWorld/ALFWorld 的证据 grounding 与 utility ledger 规则可执行。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.06964v1",
          "limitations": "严格 ALFWorld 7B complete-hierarchy R1–R3 没有 L3 原则通过验证，不能将性能归因已验证原则；强 builder 弱 actor 非纯同模型自进化；API fault 不可丢弃成成功。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "SAGA 将执行轨迹抽象为分层经验/原则，检索后适配当前任务，并可 SFT/GRPO 优化 actor。ScienceWorld/ALFWorld 的证据 grounding 与 utility ledger 规则可执行。",
          "data_verifiability": "严格 ALFWorld 7B complete-hierarchy R1–R3 没有 L3 原则通过验证，不能将性能归因已验证原则；强 builder 弱 actor 非纯同模型自进化；API fault 不可丢弃成成功。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06963",
      "title": "WavePrune: One period is often enough for RoPE",
      "published": "2026-10-03T17:01:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06963",
          "title": "WavePrune: One period is often enough for RoPE",
          "published": "2026-10-03T17:01:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "WavePrune将每个RoPE二维通道的QK贡献限制在首旋转周期，FlashWavePrune按16维组取最大窗口实现TensorCore稀疏算子，可用于推理及重新预训练。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06963",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06963v1",
              "location": "§3.1 Eq6; §3.3 Eq8; §4.1–4.5; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.06963v1",
              "location": "§3.1 Eq6; §3.3 Eq8; §4.1–4.5; official README",
              "notes": "WavePrune将每个RoPE二维通道的QK贡献限制在首旋转周期，FlashWavePrune按16维组取最大窗口实现TensorCore稀疏算子，可用于推理及重新预训练。"
            }
          ],
          "source": "https://arxiv.org/html/2610.06963v1",
          "locations": [
            "§3.1 Eq6",
            "§3.3 Eq8",
            "§4.1–4.5",
            "official README"
          ],
          "limitations": "是通道贡献置零而非整token的softmax mask；组近似与exact应分别校验。KV物理淘汰仍futurework，A100内核速度非整模型收益。alpha/通道消融用HELMET需新val选择后独立test，不能拿调参集提升作泛化。代码目录有kernel/训练/eval但完整README待发，许可需单独核验。",
          "code_url": "https://github.com/ducatiqwq/WavePrune",
          "code_status": "official code and kernels accessible; documentation incomplete",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06963v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "WavePrune将每个RoPE二维通道的QK贡献限制在首旋转周期，FlashWavePrune按16维组取最大窗口实现TensorCore稀疏算子，可用于推理及重新预训练。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06962",
      "title": "Verdicts Without Annotated Evidence: Rejection Sampling or Label-Only Post-Training for Evidence Recovery?",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06962",
          "title": "Verdicts Without Annotated Evidence: Rejection Sampling or Label-Only Post-Training for Evidence Recovery?",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "ContractNLI既有任务上的label-only SFT与RSFT比较，document split无重叠但单seed；新内容是两种监督的证据质量解耦分析，未形成独立公开任务/评分器。作为evidence recovery消融参考，非新增入口。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06962v1",
              "location": "§2.1；§3.1–3.2；§5；§8"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "ContractNLI上label-only训练与拒绝采样对比，单seed诊断，无独立新优化器主张。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06950",
      "title": "Learning to Decide, Not to Reason: Parameter-Efficient Decision Operators via Low-Rank Activation Steering",
      "published": "2026-10-03T12:57:57Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06950",
          "title": "Learning to Decide, Not to Reason: Parameter-Efficient Decision Operators via Low-Rank Activation Steering",
          "published": "2026-10-03T12:57:57Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DecSteer训练共享低秩activation residual与token门控，初始identity但输出支路有梯度，集中学习决策而非全模型；真实SearchQA/LiveMath BC及多基准，需保留RMS+SiLU+gate结构。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06950",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06950v1",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）; §3；§4–5"
            },
            {
              "url": "https://arxiv.org/abs/2610.06950",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.06950v1",
              "location": "§3；§4–5"
            }
          ],
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "review_provenance": "post_training_review正文审查复用；foundation核对交叉记录",
          "official_url": "https://arxiv.org/html/2610.06950v1",
          "locations": [
            "Abstract（输入检索工件中的完整摘要已逐条审阅）",
            "§3；§4–5"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": [
            {
              "url": "https://arxiv.org/abs/2610.06950",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.06950v1",
              "location": "§3；§4–5"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.06950",
          "title": "Learning to Decide, Not to Reason: Parameter-Efficient Decision Operators via Low-Rank Activation Steering",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "DecSteer训练共享低秩activation residual与token门控，初始identity但输出支路有梯度，集中学习决策而非全模型；真实SearchQA/LiveMath BC及多基准，需保留RMS+SiLU+gate结构。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06950",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.06950v1",
              "location": "§3；§4–5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06949",
      "title": "AdaLoop: Adaptive-Depth Latent Reasoning for Audio Language Models",
      "published": "2026-10-03T11:27:41Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06949",
          "title": "AdaLoop: Adaptive-Depth Latent Reasoning for Audio Language Models",
          "published": "2026-10-03T11:27:41Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "AdaLoop确有问题条件化多尺度循环音频connector和ACT加权输出，但§2.3 Eq6把ponder cost写为硬停止步数K，未说明对halting参数的可微余量/梯度估计；SFT只训练connector而AdaLoop第二阶段联合训练LM，能力归因需保留Fixed4控制并澄清真实训练损失。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06949",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06949v1",
              "location": "§2.1–2.3 Eq1–6; §3.1–3.4 Tables1–2; §4"
            },
            {
              "url": "https://arxiv.org/html/2610.06949v1",
              "location": "§2.1–2.3 Eq1–6; §3.1–3.4 Tables1–2; §4",
              "notes": "50K EvoAudio派生QA，先1000步冻结LM再3000步联合训练，3骨干3基准。Qwen平均59.3→63.1，Fixed4为61.4；平均3.8循环但无等实测算力证据。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.06949v1",
          "locations": [
            "§2.1–2.3 Eq1–6",
            "§3.1–3.4 Tables1–2",
            "§4"
          ],
          "limitations": "论文公式所示硬K对halting概率几乎处处零梯度，与声称ponder训练机制不完整；未见官方代码补足实现。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "50K EvoAudio派生QA，先1000步冻结LM再3000步联合训练，3骨干3基准。Qwen平均59.3→63.1，Fixed4为61.4；平均3.8循环但无等实测算力证据。",
          "review_status": "reviewed_deferred"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06947",
      "title": "FactorBench: A Portfolio-Aware Benchmark for Automated Factor Mining",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06947",
          "title": "FactorBench: A Portfolio-Aware Benchmark for Automated Factor Mining",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公共评测：统一symbolic/Python factor→date×asset signal契约，5市场、训练2017–21/验证2022–23/测试2024–25，组合和成本回测。官网仓库含data/evaluator/mining入口，可作为专门的自动研究任务，不宣称普适LLM能力或实盘A/B。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06947v1",
              "location": "§3.1–3.3；§4；Appendix B"
            },
            {
              "url": "https://github.com/ZhuoHan1998/FactorBench-Release",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "out_of_scope",
          "core_algorithm_reason": "金融因子挖掘benchmark，非LLM后训练新算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06947",
          "title": "FactorBench: A Portfolio-Aware Benchmark for Automated Factor Mining",
          "published": "2026-10-03T10:57:37Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06947v1",
          "location": "§3.1–3.3；§4；Appendix B；作者仓库README/文件列表已只读核查",
          "decision": "accepted",
          "reason": "公共评测：统一symbolic/Python factor→date×asset signal契约，5市场、训练2017–21/验证2022–23/测试2024–25，组合和成本回测。官网仓库含data/evaluator/mining入口，可作为专门的自动研究任务，不宣称普适LLM能力或实盘A/B。",
          "id": "2610.06947",
          "repository_status": "new",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06947v1",
              "location": "§3.1–3.3；§4；Appendix B"
            },
            {
              "url": "https://github.com/ZhuoHan1998/FactorBench-Release",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "out_of_scope",
          "core_algorithm_reason": "金融因子挖掘benchmark，非LLM后训练新算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "reviewer": "post_training_review_reused",
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06932",
      "title": "RADC: Risk-Aware Dual Caching for Vision-Language Test-Time Adaptation",
      "published": "2026-10-03T02:28:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06932",
          "title": "RADC: Risk-Aware Dual Caching for Vision-Language Test-Time Adaptation",
          "published": "2026-10-03T02:28:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "RADC前景/全局双cache与高斯风险准入是具体VLM TTA候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06932",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06932v1",
              "location": "§2.2 Eq3–7; §2.3 Eq8–9; §3.1–3.4 Table4"
            },
            {
              "url": "https://arxiv.org/html/2610.06932v1",
              "location": "§2.2 Eq3–7; §2.3 Eq8–9; §3.1–3.4 Table4",
              "notes": "CLIP后3ViT层或RN50AttentionPool拆patch贡献，topK语义与top1相似≥.7独立mask后融合；前景残差λ.1，cache16。原图+63AugMix保留低熵10%，风险logsumexp包含均值类间margin+方差；先查历史再入当前。CD/OOD RN50及ViTB16。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.06932v1",
          "locations": [
            "§2.2 Eq3–7",
            "§2.3 Eq8–9",
            "§3.1–3.4 Table4"
          ],
          "limitations": "64视图/patch获取不可换成单forward；4090 ImageNetA RADC12.26min/2084MiB，对SCA7.14min/988MiB更慢更大，只准确率更高。Gaussian风险是近似不是校准正确性保证；超参全域固定但调参验证来源须补，未找到源码链接。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "CLIP后3ViT层或RN50AttentionPool拆patch贡献，topK语义与top1相似≥.7独立mask后融合；前景残差λ.1，cache16。原图+63AugMix保留低熵10%，风险logsumexp包含均值类间margin+方差；先查历史再入当前。CD/OOD RN50及ViTB16。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06923",
      "title": "RadOnc-Agent: An LLM-Orchestrated Framework for AI Workflows Across the Radiotherapy Care Pathway",
      "published": "2026-10-02T22:39:48Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06923",
          "title": "RadOnc-Agent: An LLM-Orchestrated Framework for AI Workflows Across the Radiotherapy Care Pathway",
          "published": "2026-10-02T22:39:48Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06923v1",
          "location": "§II.1–2、evaluation、Code and Data availability",
          "decision": "pending",
          "reason": "RadOnc-Agent 用26标准化函数schema接通17临床与9辅助功能，LLM选函数和参数，controller dispatch、异步影像处理及结构化结果回传。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "2600问题×3session技术选择/schema/dispatch指标，不是临床效果；核心代码明确不公开、真实病人数据受IRB隐私限制。公开SynthRAD部分不能替代完整临床工作流。",
          "code": "正文明确原始框架与临床数据不公开",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06923v1",
              "location": "§II.1–2、evaluation、Code and Data availability"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06918",
      "title": "Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
      "published": "2026-10-02T20:54:53Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06918",
          "title": "Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
          "published": "2026-10-02T20:54:53Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06918",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Robust Async-Fed-Q联邦表格RL理论，不是语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06910",
      "title": "GAMEGO: Training Game-Dev Agents with Synthetic Trajectories Anchored in Real-World Assets",
      "published": "2026-10-02T17:05:07Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06910",
          "title": "GAMEGO: Training Game-Dev Agents with Synthetic Trajectories Anchored in Real-World Assets",
          "published": "2026-10-02T17:05:07Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06910v1",
          "location": "§3–5、Appendix E、reproducibility statement",
          "decision": "pending",
          "reason": "GameGo 从真实game seeds经多阶段PRD/asset grounding/query compression，生成55060 sandbox轨迹做assistant-mask SFT，再用真实headless browser playtester与judge评估。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "124bench seed先切分，training核心需真实可运行game轨迹。附录声明实现待acceptance后公开且不含GameGoData轨迹，与摘要全开放承诺不一致；等待训练数据/模型可核实。build通过不等于game行为正确，judge偏好/asset license单列。",
          "code": "https://github.com/Haoyue-Yang/GameGo （声明待发布；训练轨迹不包含于实现释放）",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06910v1",
              "location": "§3–5、Appendix E、reproducibility statement"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06902",
      "title": "Tree Navigation Without LLM Summaries: A Matched-Cost Study of Hierarchical Retrieval for Long-Document QA",
      "published": "2026-09-30T08:42:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06902",
          "title": "Tree Navigation Without LLM Summaries: A Matched-Cost Study of Hierarchical Retrieval for Long-Document QA",
          "published": "2026-09-30T08:42:45Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "NavTree确定性层级RAG检索导航，agent track范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06902",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06896",
      "title": "Medical Image Alignment Assessment as a Test of Generalist Visual Reasoning in Frontier Multimodal Models",
      "published": "2026-09-28T17:17:27Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06896",
          "title": "Medical Image Alignment Assessment as a Test of Generalist Visual Reasoning in Frontier Multimodal Models",
          "published": "2026-09-28T17:17:27Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "医疗图像对齐的前沿多模态模型评估，无新核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06896",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06892",
      "title": "Axiom Satisfiability of Linear Rewards in Alignment",
      "published": "2026-09-26T15:24:29Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06892",
          "title": "Axiom Satisfiability of Linear Rewards in Alignment",
          "repository_status": "new",
          "published": "2026-09-26T15:24:29Z",
          "decision": "accepted",
          "reason": "LP3在有限偏好图上共同最小化candidate slack和线性reward margin违反，以LP松弛替代ILP；Habermas真实偏好验证，不含LLM策略训练，也不保证未见response公理。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06892",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.06892v1",
              "location": "§3 LP1；§4.1 ILP/LP3；§5"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06874",
      "title": "Statistical Turbulence and High-Fidelity Disturbance Fields for Quadrotor Flight Control",
      "published": "2026-09-09T05:14:20Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06874",
          "title": "Statistical Turbulence and High-Fidelity Disturbance Fields for Quadrotor Flight Control",
          "published": "2026-09-09T05:14:20Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06874",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "风场保真度对四旋翼PPO控制器的交叉评测，非LLM Agent研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06861",
      "title": "When Does External Guidance Help LLM Reasoning? A Bias-Variance Theory of Guidance-Augmented GRPO",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06861",
          "title": "When Does External Guidance Help LLM Reasoning? A Bias-Variance Theory of Guidance-Augmented GRPO",
          "pool": "late_extra",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "GA-GRPO独立混合无指导/指导rollout梯度，以σ0²/(σ0²+Rmax²δ²T)调权，正文有Qwen2.5-Math-7B九benchmark及8×A100训练。关键adaptive TV divergence估计、方差估计和IS clipping实现未在已查方法/实现段具体定义，且T兼作rollout horizon/训练步的解释有歧义；不能凭曲线把核心算法忠实实现条件记为已闭合。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "fulltext_scope": "方法§3、定理假设§4、实验实现§5.1、§6组件分析定向核查；未独立验证证明",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06861v1",
              "location": "§3.2–3.3式2–6；§4.2–4.3；§5.1；§6.8"
            }
          ],
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "GA-GRPO独立混合无指导/指导rollout梯度，以σ0²/(σ0²+Rmax²δ²T)调权，正文有Qwen2.5-Math-7B九benchmark及8×A100训练。关键adaptive TV divergence估计、方差估计和IS clipping实现未在已查方法/实现段具体定义，且T兼作rollout horizon/训练步的解释有歧义；不能凭曲线把核心算法忠实实现条件记为已闭合。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06851",
      "title": "Base Models Can Reason By Taking a Cue From Training Data",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06851",
          "title": "Base Models Can Reason By Taking a Cue From Training Data",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "通过起始token及预训练数据因果干预研究reasoning cue，非新的后训练算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06851",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06844",
      "title": "Learning to Read the Contextual Tokens in Diffusion Transformers",
      "published": "2026-10-05T17:59:17Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06844",
          "title": "Learning to Read the Contextual Tokens in Diffusion Transformers",
          "published": "2026-10-05T17:59:17Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Contextual Reader用跨MM-DiT层contexttokens加layer/timestep embedding→2层Qformer→冻结LLM QA探测；核心CoAl以单早层1query aligner负cos匹配冻结SigLIP clean图teacher，jointflow训练并对null-condition加权抑制prompt捷径，推理丢aligner。COCO从零与SD3 Fine-T2I微调分开验证，不能把readoutprobe当新生成能力。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06844",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06844v1",
              "location": "§3.1–3.3；§4.1；§4.2–4.3"
            },
            {
              "url": "https://arxiv.org/html/2610.06844v1",
              "location": "§3.1–3.3；§4.1；§4.2–4.3",
              "notes": "Contextual Reader用跨MM-DiT层contexttokens加layer/timestep embedding→2层Qformer→冻结LLM QA探测；核心CoAl以单早层1query aligner负cos匹配冻结SigLIP clean图teacher，jointflow训练并对null-condition加权抑制prompt捷径，推理丢aligner。COCO从零与SD3 Fine-T2I微调分开验证，不能把readoutprobe当新生成能力。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06844v1",
          "locations": [
            "§3.1–3.3；§4.1；§4.2–4.3"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Contextual Reader用跨MM-DiT层contexttokens加layer/timestep embedding→2层Qformer→冻结LLM QA探测；核心CoAl以单早层1query aligner负cos匹配冻结SigLIP clean图teacher，jointflow训练并对null-condition加权抑制prompt捷径，推理丢aligner。COCO从零与SD3 Fine-T2I微调分开验证，不能把readoutprobe当新生成能力。"
        },
        {
          "track": "post-training",
          "id": "2610.06844",
          "title": "Learning to Read the Contextual Tokens in Diffusion Transformers",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "视觉扩散Transformer contextual tokens读取与对齐，属于图像生成模型训练而非LLM RL/OPD。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06844",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06843",
      "title": "Recursive Video In-Context Learning for Agentic Robot",
      "published": "2026-10-05T17:59:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06843",
          "title": "Recursive Video In-Context Learning for Agentic Robot",
          "published": "2026-10-05T17:59:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06843v1",
          "location": "§3.1–3.3 Algorithm1; §4; §5.1–5.4 Tables1–4; Appendix A/B; Limitations",
          "decision": "accepted",
          "reason": "RV-ICL的多层示范索引与按子目标重入是明确Agent上下文访问机制；只接受示范条件化诊断候选，须将阶段目标/仿真状态来源与非gold能力评测隔离。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "LIBERO-PRO 40基础任务400episode报告92.6→96.5%，基线来自不同10seed运行，本法5seed；LIBERO-Plus自选120variants配对基线86.7→95.8。",
          "limitations": "phase map含示范状态派生目标、task objects/regions，目标改写时还明确告知哪些示范无效；这不是无gold-plan自主规划证据。若本地沿用评测隐藏目标/解答计划则只能诊断，不得evolve能力晋级；旧基线与新法非同episode配对，pooled z未任务簇修正；未找到本法公开代码链接；所有实验仿真非真机。",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06833",
      "title": "Towards Looped Models Done Right, Part II: Rethinking at Fixed Points",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06833",
          "title": "Towards Looped Models Done Right, Part II: Rethinking at Fixed Points",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "循环模型固定点、depth prior和正交注入主要为架构/训练基础，交由基础模型track。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06833",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06830",
      "title": "MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents",
      "published": "2026-10-05T17:58:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06830",
          "title": "MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents",
          "published": "2026-10-05T17:58:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MemPilot多模态agent记忆编排策略，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06830",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.06830",
          "title": "MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "质量/成本/延迟分别组归一后合并，prefix probe边际答案质量修正阶段credit；训练latency用proxy estimator，不能冒称直接壁钟reward。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06830v1",
              "location": "§3.3式7–13；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06830",
          "title": "MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents",
          "published": "2026-10-05T17:58:06Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06830v1",
          "location": "§3.3式7–13；§4.1",
          "decision": "accepted",
          "reason": "质量/成本/延迟分别组归一后合并，prefix probe边际答案质量修正阶段credit；训练latency用proxy estimator，不能冒称直接壁钟reward。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06829",
      "title": "CLIFT: Conformal Self-Verification for Web Agent Training and Test-Time Scaling",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06829",
          "title": "CLIFT: Conformal Self-Verification for Web Agent Training and Test-Time Scaling",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "conformal自验证非负bonus和URL-stratified return优势改变credit；WAI训练、VWA bank transfer、OM2W无policy训练须分别报告。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06829v1",
              "location": "§2.2式6–7；§3 Experimental Design"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06829",
          "title": "CLIFT: Conformal Self-Verification for Web Agent Training and Test-Time Scaling",
          "published": "2026-10-05T17:57:51Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06829v1",
          "location": "§2.2式6–7；§3 Experimental Design",
          "decision": "accepted",
          "reason": "conformal自验证非负bonus和URL-stratified return优势改变credit；WAI训练、VWA bank transfer、OM2W无policy训练须分别报告。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06825",
      "title": "PlotGround: Grounding Plot Digitization in Real Scientific Figures and Their Source Data",
      "published": "2026-10-05T17:57:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06825",
          "title": "PlotGround: Grounding Plot Digitization in Real Scientific Figures and Their Source Data",
          "published": "2026-10-05T17:57:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "PlotGround图表到源数据重建recipe与1119题人工核验基准适合评估，但正文明确pipeline和PlotGround-1k将于接收后发布，当前不能复现原任务包。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06825",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.06825v1",
              "location": "§3.1–3.4; §4.1–4.2/4.6; Limitations",
              "notes": "PlotGround图表到源数据重建recipe与1119题人工核验基准适合评估，但正文明确pipeline和PlotGround-1k将于接收后发布，当前不能复现原任务包。"
            }
          ],
          "source": "https://arxiv.org/html/2610.06825v1",
          "locations": [
            "§3.1–3.4",
            "§4.1–4.2/4.6",
            "Limitations"
          ],
          "limitations": "判分±5%及±2%相对误差需零值规则；源表是标签构造依据，纯图像评测不可泄漏。figure/table Agent是不同输入条件，不能算同信息模型提升；模型API默认推理预算不同。",
          "code_status": "release_promised_upon_acceptance",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.06825v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "PlotGround图表到源数据重建recipe与1119题人工核验基准适合评估，但正文明确pipeline和PlotGround-1k将于接收后发布，当前不能复现原任务包。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06817",
      "title": "Paradee: Distilling Kokoro-82M into an 8M-Parameter Single-Voice Text-to-Speech Model",
      "published": "2026-10-05T17:56:07Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06817",
          "title": "Paradee: Distilling Kokoro-82M into an 8M-Parameter Single-Voice Text-to-Speech Model",
          "published": "2026-10-05T17:56:07Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Paradee 将 Kokoro 单音色蒸馏为 8.07M TTS，分阶段训练文本与解码器，保留多分辨率频谱损失、GAN 精调和相位锁定。WikiText103 教师生成语音与 200 句评测可重建。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06817",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.06817v1",
              "location": "§4.1–4.6; §5–9; Appendix A–C",
              "notes": "Paradee 将 Kokoro 单音色蒸馏为 8.07M TTS，分阶段训练文本与解码器，保留多分辨率频谱损失、GAN 精调和相位锁定。WikiText103 教师生成语音与 200 句评测可重建。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06817v1",
          "locations": [
            "§4.1–4.6; §5–9; Appendix A–C"
          ],
          "limitations": "只验证 af_heart 单音色；自动 UTMOS/WER 不等于人类自然度评价；CPU 计时排除音素化；int8 是权重而非全激活量化。",
          "code_url": "https://github.com/sahilmahendrakar/paradee",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Paradee 将 Kokoro 单音色蒸馏为 8.07M TTS，分阶段训练文本与解码器，保留多分辨率频谱损失、GAN 精调和相位锁定。WikiText103 教师生成语音与 200 句评测可重建。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06804",
      "title": "Sharpen Without Search: On-Policy Distillation of Sequence-Level Power Distribution",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06804",
          "title": "Sharpen Without Search: On-Policy Distillation of Sequence-Level Power Distribution",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Rényi梯度对应teacher幂分布×student分布的加权MLE，SMC沿student proposal重采样；GSM8K训练不读reference答案，保留整条SMC训练链。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06804v1",
              "location": "§3.1–3.5；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06790",
      "title": "Back to the Future: Rethinking EDA Infrastructure for Agentic Systems in Chip Design Verification",
      "published": "2026-10-05T17:48:14Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06790",
          "title": "Back to the Future: Rethinking EDA Infrastructure for Agentic Systems in Chip Design Verification",
          "published": "2026-10-05T17:48:14Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06790v1",
          "location": "§3.1–3.2; §4 Tables1–2; §5; Appendix A",
          "decision": "rejected",
          "reason": "BTTF主要贡献是领域专用VCD→SQLite及标准分工/自纠错Agent工程；未公开150查询/RTL波形/评分器，缺独立通用Agent算法和可接入评测包，不通过当前复现门槛。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "4.2GB/18450nets/150专家标注query overall95.33%；多agent较单agentautorater质量+17.3%、延迟1.96倍；zero-toggle仅active nets coverage100，below-average剪枝降至64.23%。",
          "limitations": "SVA规则匹配/已观测波形检查不是完整formal verification；作者“hallucination-free production”超出单自建集证据，无随机生产AB；未报告多次独立运行/heldout划分/代码数据链接。",
          "fulltext_review_completed": true
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06784",
      "title": "How to scale your HEP ML models: A recipe for robust architecture comparisons at scale",
      "published": "2026-10-05T17:44:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06784",
          "title": "How to scale your HEP ML models: A recipe for robust architecture comparisons at scale",
          "published": "2026-10-05T17:44:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "高能物理jet模型的缩放律比较方法，非当前语言/视觉/多模态基础模型算法范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06784",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06782",
      "title": "T-Search: An Open Agentic Retriever and Playground for Hard Multi-Step Search",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06782",
          "title": "T-Search: An Open Agentic Retriever and Playground for Hard Multi-Step Search",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公共检索Agent入口：冻结语料search/save_and_advance/finalize工具及多轮证据状态，TRuST/SynthComp公开基准；官方Apache-2.0 harness已可读。final-set Recall@10与生成Agent trajectory recall不可直接横比，融合3次须计预算。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06782v1",
              "location": "§3–4；§6；Appendix C–D"
            },
            {
              "url": "https://github.com/turbo-llm/t-search-harness",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "T-Search为检索模型、数据和playground，摘要训练是现成SFT+GSPO，没有独立优化器机制主张。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06751",
      "title": "MatrixFormer: A Foundation Model for Matrix Completion",
      "published": "2026-10-05T17:28:38Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.06751",
          "title": "MatrixFormer: A Foundation Model for Matrix Completion",
          "published": "2026-10-05T17:28:38Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "MatrixFormer 属于通用 Transformer 架构，已转基础模型全文审查。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06751",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "foundation-model",
          "id": "2610.06751",
          "title": "MatrixFormer",
          "decision": "accepted",
          "review_level": "fulltext",
          "kind": "foundation_matrix_completion",
          "reason": "二维cell grid、行列轴向注意力与synthetic prior训练的78M通用矩阵补全模型，作为表格基础模型研究候选，而非工业推荐AB通过。",
          "official_url": "https://arxiv.org/html/2610.06751v1",
          "locations": [
            "§2 Eq1–11",
            "§2.1",
            "§3.1–3.6 Tables1–3",
            "§4"
          ],
          "evidence": "8层d768/16head，5000bin概率输出；两冻结teacher点预测蒸馏+真值NLL/CDF。128K主训练+5K尺寸扩展，synthetic validation选checkpoint；公开imputation、causalplacebo及固定LLMscore矩阵。",
          "limitations": "作者承认开发期间看过下游benchmark，UCIcontext为exploratory。ensemble在输入已观测未mask单元拟权重有乐观风险，heldout权重留作未来；107x是单expert固定10列H200计时，双expert需两pass。未核到作者公开模型代码。",
          "implementation_status": "not_implemented",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06750",
      "title": "Balancing Memory Pathways: Analyzing and Improving Memory Utilization in Hybrid LMs",
      "published": "2026-10-05T17:27:30Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06750",
          "title": "Balancing Memory Pathways: Analyzing and Improving Memory Utilization in Hybrid LMs",
          "published": "2026-10-05T17:27:30Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "保留混合LM两条记忆路径，额外attention跨segment屏蔽的递归辅助SFT损失有公开实现，符合可执行训练operator。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06750",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06750v1",
              "location": "§3; §4.1; §5.1–5.2; §6; AppB/C.1; 官方README"
            },
            {
              "url": "https://arxiv.org/html/2610.06750v1",
              "location": "§3; §4.1; §5.1–5.2; §6; AppB/C.1; 官方README",
              "notes": "Qwen3.5-4B和NemotronH4B LoRAr16；L_sft+lambda L_rec，额外forward步骤减半匹配compute；QA12k/2ktrainval，8.2ktest；TextWorld和BabyAI不同seed集，官方runner不向模型供goldwalkthrough。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.06750v1",
          "locations": [
            "§3",
            "§4.1",
            "§5.1–5.2",
            "§6",
            "AppB/C.1",
            "官方README"
          ],
          "limitations": "lambda.25按Quest最优但附录未明确val选参，应本地锁val；two-pass半steps不是实测FLOPs完全等价；§6perexampleOracle与给成功/失败反馈只diagnostic，不把oracle32%当可部署。",
          "code_url": "https://github.com/amy-hyunji/Balancing-Memory-Pathways",
          "kind": "core_algorithm",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Qwen3.5-4B和NemotronH4B LoRAr16；L_sft+lambda L_rec，额外forward步骤减半匹配compute；QA12k/2ktrainval，8.2ktest；TextWorld和BabyAI不同seed集，官方runner不向模型供goldwalkthrough。",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06750",
          "title": "Balancing Memory Pathways: Analyzing and Improving Memory Utilization in Hybrid LMs",
          "published": "2026-10-05T17:27:30Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06750v1",
          "location": "§3/§4.1/§5.1–5.2 Table1; §6; AppendixB.2/C.1/C.3; official README",
          "decision": "accepted",
          "reason": "Balancing Memory Pathways对hybrid recurrent-attention LM加auxiliary recurrent-only NTP，屏蔽跨segment注意力但保留跨段递归状态；LoRA双前向训练后完整模型正常执行。接受Agent记忆学习/后训练跨轨候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "Qwen3.5 QA34.6→38.5，Nemotron31→36.2；训练步数减半匹配双前向compute。TextWorld1000train/150val/200test非重叠seed；官方已公开数据生成、train_aux_loss、eval_agent和路径消融入口。",
          "limitations": "lambda.25从Quest表现挑选，须在本地validation重选/固定；未见独立多训练seed区间。成功示范实验使用同game已有成功轨迹，仅条件化效率诊断；oracle逐例选最佳路径非部署。默认不含goldwalkthrough，训练gold与评测隔离；repo未见LICENSE，公开可读不代表再分发授权。",
          "code": "https://github.com/amy-hyunji/Balancing-Memory-Pathways",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06748",
      "title": "BazaarBench: Delegation Safety in Decentralized C2C Marketplaces Run by LLM Agents",
      "published": "2026-10-05T17:26:17Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06748",
          "title": "BazaarBench: Delegation Safety in Decentralized C2C Marketplaces Run by LLM Agents",
          "published": "2026-10-05T17:26:17Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06748v1",
          "location": "§3.1–3.3；§4.1；Appendix B/C",
          "decision": "accepted",
          "reason": "BazaarBench 以可复制30天市场状态和固定20代理群做7天continuation，事件/库存真值与交易安全阶段分开，适合多Agent委托约束评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06748",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.3",
            "§4.1",
            "Appendix B/C"
          ],
          "limitations": "100代理、3基础市场、45continuation各单次并非多独立seed；照片是JSON不是视觉。部分风险标签依赖GPT5，idealized inspection不是实物验收，虚拟收益不是线上A/B。L0阻断库存错误而L1–L3只记录，不能直接跨条件解释因果。仅合成服务，禁止连真实交易账号。",
          "code_url": "https://github.com/ziyan-wang98/BazaarBench",
          "code_status": "official repository accessible; release license requires separate check",
          "reviewer": "root",
          "code": "https://github.com/ziyan-wang98/BazaarBench"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06744",
      "title": "ufakzeka-karar: An Open Turkish Typed-Decision Model with Order-Invariant Option Scoring",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06744",
          "title": "ufakzeka-karar: An Open Turkish Typed-Decision Model with Order-Invariant Option Scoring",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "土耳其typed-decision模型头与数据发布；主要比较交叉熵和REINFORCE，非新LLM策略算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06744",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06729",
      "title": "Improving Diversity in LLM Short Story Generation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06729",
          "title": "Improving Diversity in LLM Short Story Generation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "DivLM的CPT指令残差恢复与群体genre/tone/style/entity多样性奖励为可执行两阶段训练配方，需真实judge与语料。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06729v1",
              "location": "§4.1–4.2；§5.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06726",
      "title": "Decoupling Time and Space: A Temporally Conditioned Refinement for EEG Source Imaging",
      "published": "2026-10-05T17:15:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06726",
          "title": "Decoupling Time and Space: A Temporally Conditioned Refinement for EEG Source Imaging",
          "published": "2026-10-05T17:15:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "EEG源定位时间条件细化，属于医疗信号逆问题专用模型。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06726",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06715",
      "title": "Domain adaptation of Russian ModernBERT for long legal documents",
      "published": "2026-10-05T17:07:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06715",
          "title": "Domain adaptation of Russian ModernBERT for long legal documents",
          "published": "2026-10-05T17:07:02Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "俄语法律ModernBERT领域继续预训练比较，摘要未提出新的通用训练算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06715",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06703",
      "title": "Reading the Mood: Emotion-Guided Book-to-Music Recommendation via CGANs and LLMs",
      "published": "2026-10-05T17:01:18Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.06703",
          "title": "Reading the Mood: Emotion-Guided Book-to-Music Recommendation via CGANs and LLMs",
          "published": "2026-10-05T17:01:18Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "SAGA-CDR 使用 Amazon 2023 图书到音乐、Douban 交叉验证与多 seed 离线冷启动评价；没有线上流量实验。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06703",
              "location": "§IV-A; experimental tables"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.06703",
            "url": "https://arxiv.org/html/2610.06703v1",
            "sha256": "73e9f4e02ddca1cf3270abf26ea4221c3d9b20ea748e6ff438f4d6dcca70d355",
            "status": "downloaded",
            "characters": 61525,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06695",
      "title": "MedPrune: Topology-Efficient Multimodal Multi-Agent Communication Evolution for Medical VQA Tasks",
      "published": "2026-10-05T16:55:58Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06695",
          "title": "MedPrune: Topology-Efficient Multimodal Multi-Agent Communication Evolution for Medical VQA Tasks",
          "published": "2026-10-05T16:55:58Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MedPrune医疗多agent通信拓扑优化，由agent track判定，非基础模型架构。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06695",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.06695",
          "title": "MedPrune: Topology-Efficient Multimodal Multi-Agent Communication Evolution for Medical VQA Tasks",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "MedPrune优化多代理通信图节点/边，主要结构搜索，不是LLM参数后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06695",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06695",
          "title": "MedPrune: Topology-Efficient Multimodal Multi-Agent Communication Evolution for Medical VQA Tasks",
          "published": "2026-10-05T16:55:58Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.06695v1",
          "location": "§3 Eq2–10; §4 Tables1–2; AppendixB.1–B.3; PDFp14 Algorithm1; D.2/D.3",
          "decision": "pending",
          "reason": "MedPrune通过policy-gradient学习异质时空通信图，再节点weighted-degree及核范数正则边剪枝，机制相关但关键采样/训练协议不足且无作者代码链接，审完暂缓忠实实现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "Qwen3VL8B MIMIC指标均值42.26、IU-Xray91.07；两阶段各40训练instance，候选部门排序实际由Qwen3.6Plus397B；PDF补核HTML遗漏Algorithm1与Table3。",
          "limitations": "正文one-shot节点剪枝与Algorithm1每training step剪枝不一致；row-softmax图采样概率只乘保留边，DAG采样分布未明；自然语言输出加权求和如何转prompt未明；few-shot10/20/40而测试含原train+test全量，训练示例排除未说明；validation选择/患者级隔离未报告。核范数促低秩不自动稀疏，不能声称临床鲁棒/完全抑制恶意。",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06686",
      "title": "OVAL: Output-Aware Local Page Bases for KV Cache Retrieval",
      "published": "2026-10-05T16:51:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06686",
          "title": "OVAL: Output-Aware Local Page Bases for KV Cache Retrieval",
          "published": "2026-10-05T16:51:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "OVAL 对键能量与键值输出敏感度矩阵做归一化混合，以主特征子空间构建页表示；decode 用低秩重建 logits 的 logsumexp 选页，无需每次读取值统计。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06686",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06686v1",
              "location": "§3 Eq1–5 / Algorithm1; §4.1; §4.3; §4.5; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.06686v1",
              "location": "§3 Eq1–5 / Algorithm1; §4.1; §4.3; §4.5; official README",
              "notes": ""
            }
          ],
          "kind": "kv_page_retrieval",
          "locations": [
            "§3 Eq1–5 / Algorithm1",
            "§4.1",
            "§4.3",
            "§4.5",
            "official README"
          ],
          "limitations": "主表 η* 是逐设置最佳值，不是固定无泄漏结果；接入要按独立 calibration 冻结 η，并报告转换和检索开销。原文相对FreeKV有约10% decode成本，不应只报道质量提升。",
          "code_url": "https://github.com/Ashkan13776/oval-kv",
          "code_status": "official code, FreeKV patch, scripts/results/protocol notes accessible; upstream pinned by setup; license not displayed",
          "official_url": "https://arxiv.org/html/2610.06686v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06685",
      "title": "Aligning Multimodal Patient Evidence with Biomedical Knowledge Graphs for Clinical LLMs",
      "published": "2026-10-05T16:51:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06685",
          "title": "Aligning Multimodal Patient Evidence with Biomedical Knowledge Graphs for Clinical LLMs",
          "published": "2026-10-05T16:51:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MM-KG临床证据与生医知识图融合，属于医疗知识系统应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06685",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06671",
      "title": "Learning What to Imitate: Entropy-Aware Distribution Mixing",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06671",
          "title": "Learning What to Imitate: Entropy-Aware Distribution Mixing",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "ConMix/GeoMix由student top-K归一entropy控制teacher比重，用于采样SFT与forward KL；两种混合本身已有AMiD，新增是entropy调度。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06671v1",
              "location": "§3式1–2及§3.2–3.3；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06670",
      "title": "Reward Stealing Attack on Large Language Models",
      "published": "2026-10-05T16:44:00Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06670",
          "title": "Reward Stealing Attack on Large Language Models",
          "published": "2026-10-05T16:44:00Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ReSA逆RL提取代理安全奖励用于攻击，主贡献为攻击而非基础模型能力算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06670",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.06670",
          "title": "Reward Stealing Attack on Large Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "ReSA逆RL抽取代理安全reward后在推理时反转解码，主要攻击/推理方法而非训练改进。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06670",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06666",
      "title": "What Matters for Latent Reasoning with Flow Matching",
      "published": "2026-10-05T16:42:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06666",
          "title": "What Matters for Latent Reasoning with Flow Matching",
          "published": "2026-10-05T16:42:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "FLaRe以symbolicCoT VAE+noise-shiftedFM和verified rollout全路径反传，包含独立可执行latent reasoning训练机制，不只是测量综述。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06666",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06666v1",
              "location": "§2.2–2.3; §3.1/3.2.1–3.2.4; §4.1–4.5; §5; AppA.3/D/E"
            },
            {
              "url": "https://arxiv.org/html/2610.06666v1",
              "location": "§2.2–2.3; §3.1/3.2.1–3.2.4; §4.1–4.5; §5; AppA.3/D/E",
              "notes": "8×512latent，stage1logitNormal(-2,.8)time、50/50noised/stopgradpredendpoint；stage2新100k训练问题reference验证8thoughts20step，reencode正确trace+replay，answerCE反传10step双CFGbranch。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.06666v1",
          "locations": [
            "§2.2–2.3",
            "§3.1/3.2.1–3.2.4",
            "§4.1–4.5",
            "§5",
            "AppA.3/D/E"
          ],
          "limitations": "训练reference验证合法但推理不得goldcheck；decodedreading借3BautoregressiveVAE不能标无CoT效率；direct2Euler为97%CoTacc/3.9x单GPU，而默认20step需分别计budget；多samplepass16非部署selector；stage1EMA/stage2LIVE要保真，tinyarith模型不可泛化通用reasoning。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "8×512latent，stage1logitNormal(-2,.8)time、50/50noised/stopgradpredendpoint；stage2新100k训练问题reference验证8thoughts20step，reencode正确trace+replay，answerCE反传10step双CFGbranch。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06651",
      "title": "Considering Context: When World Models Need Context Encoders",
      "published": "2026-10-05T16:32:15Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06651",
          "title": "Considering Context: When World Models Need Context Encoders",
          "published": "2026-10-05T16:32:15Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06651",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "模型式RL context predictive-sufficiency诊断理论，无LLM Agent算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06650",
      "title": "Wikidata Search Traces: A Dataset for Training Knowledge Graph Search Agents",
      "published": "2026-10-05T16:29:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06650",
          "title": "Wikidata Search Traces: A Dataset for Training Knowledge Graph Search Agents",
          "published": "2026-10-05T16:29:22Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Wikidata搜索轨迹数据和RLM harness，属于agent track。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06650",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06650",
          "title": "Wikidata Search Traces: A Dataset for Training Knowledge Graph Search Agents",
          "published": "2026-10-05T16:29:22Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06650v1",
          "location": "§3.2–3.5；§4.1；§5 limitations",
          "decision": "accepted",
          "reason": "Wikidata约束图构造唯一可验证问题，持久Python REPL组合13类图查询函数，保留成功搜索轨迹，适合训练数据/Agent工具harness候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06650",
          "fulltext_review_completed": true,
          "locations": [
            "§3.2–3.5",
            "§4.1",
            "§5 limitations"
          ],
          "limitations": "采集教师曾获得答案路径clue，导出prompt删除clue不等于无特权rollout；只能作教师训练数据，正式评测不得传线索。10,235条成功筛选偏差、RLM图调用远多于tool baseline，尚无小模型训练结果；必须固定图快照、匹配查询预算和heldout题。",
          "code_status": "paper references released corpus and nano-rlm dependency; canonical author release URL not located in extracted text",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06648",
      "title": "Representation-Space MMD for Diffusion Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06648",
          "title": "Representation-Space MMD for Diffusion Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "冻结DLM token表示RBF-MMD，离散单denoiser pass采样后group REINFORCE，连续bootstrap后求导；OWT/GSM8K及16B DMax实验。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06648v1",
              "location": "§3.1式3、§3.2–3.3；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06647",
      "title": "LoGRA: Scaling LLM Reinforcement Learning with Low-Rank Gradient Sketches",
      "published": "2026-10-05T16:28:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06647",
          "title": "LoGRA: Scaling LLM Reinforcement Learning with Low-Rank Gradient Sketches",
          "published": "2026-10-05T16:28:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "LoGRA低秩梯度与KL步长控制用于RL后训练，由post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06647",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.06647",
          "title": "LoGRA: Scaling LLM Reinforcement Learning with Low-Rank Gradient Sketches",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "直接累积随机投影gradient sketch、低秩update与predicted-KL步长；PPO实际多scale训练，H100结果不能外推A100。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06647v1",
              "location": "§2.1式2–3及§2.3；§3.1–3.3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06637",
      "title": "Long-Horizon Textual World Modeling through Structured Reasoning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06637",
          "title": "Long-Horizon Textual World Modeling through Structured Reasoning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "真实encode-transition-decode rollout tree按兄弟组credit，predictive gain与中间状态reward共同训练；无需gold textual state。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06637v1",
              "location": "§4.2式7–8；§5.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06636",
      "title": "Differentially Private Mixing of Public Datasets Improves Private Learning",
      "published": "2026-10-05T16:25:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06636",
          "title": "Differentially Private Mixing of Public Datasets Improves Private Learning",
          "published": "2026-10-05T16:25:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DP-MixMin对公共预训练源权重进行有隐私会计的凸代理优化，是基础LM数据混合候选，不仅医疗应用；GPT2-Medium两个文本域有完整预训练/DP微调实验。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06636",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06636v1",
              "location": "§4.1–4.2 Algorithm1; §5.2–5.3 Tables1/2; App A.3.2/A.7/A.8"
            },
            {
              "url": "https://arxiv.org/html/2610.06636v1",
              "location": "§4.1–4.2 Algorithm1; §5.2–5.3 Tables1/2; App A.3.2/A.7/A.8",
              "notes": "每源124M代理45Mtoken、16域CommonPile，私有split上clipped noisy gradients+entropic simplex更新；公共混合训练355M 7.1Btoken，再仅末两层+head DP微调。混合/微调disjoint保护单元并行组合max ε/δ；Enron按user、OWM按example，三seedPPL16.78vs19.88与12.22vs14.05。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.06636v1",
          "locations": [
            "§4.1–4.2 Algorithm1",
            "§5.2–5.3 Tables1/2",
            "App A.3.2/A.7/A.8"
          ],
          "limitations": "理论依赖MixMin reduction/Bayesoptimal假设，实证代理不保证；noise会计不可用普通SGD替代，imagepilot/validation选择额外隐私使用需单列，canary下界不能证明全上界。Enron148users且仅sent避免多人归属，不等于任意邮箱级DP；原作者源码未找到。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "每源124M代理45Mtoken、16域CommonPile，私有split上clipped noisy gradients+entropic simplex更新；公共混合训练355M 7.1Btoken，再仅末两层+head DP微调。混合/微调disjoint保护单元并行组合max ε/δ；Enron按user、OWM按example，三seedPPL16.78vs19.88与12.22vs14.05。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06617",
      "title": "RealtimeWAM: One-Step Asynchronous World Action Models",
      "published": "2026-10-05T16:18:07Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06617",
          "title": "RealtimeWAM: One-Step Asynchronous World Action Models",
          "published": "2026-10-05T16:18:07Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "RealtimeWAM以teacher10步endpoint的interval velocity锚定CD，λ=.2等价1/t² endpoint权重，frozenvideo共享KV只LoRA action；CUDA双stream每层KV projection后event、action attention才wait的wavefront保持依赖。LIBERO/RoboTwin/Plus及同训练distill控制，延迟含VAE不含episode一次文本。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06617",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06617v1",
              "location": "§4.1式6–9；§4.2式10–13；§5.1–5.4"
            },
            {
              "url": "https://arxiv.org/html/2610.06617v1",
              "location": "§4.1式6–9；§4.2式10–13；§5.1–5.4",
              "notes": "RealtimeWAM以teacher10步endpoint的interval velocity锚定CD，λ=.2等价1/t² endpoint权重，frozenvideo共享KV只LoRA action；CUDA双stream每层KV projection后event、action attention才wait的wavefront保持依赖。LIBERO/RoboTwin/Plus及同训练distill控制，延迟含VAE不含episode一次文本。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06617v1",
          "locations": [
            "§4.1式6–9；§4.2式10–13；§5.1–5.4"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "RealtimeWAM以teacher10步endpoint的interval velocity锚定CD，λ=.2等价1/t² endpoint权重，frozenvideo共享KV只LoRA action；CUDA双stream每层KV projection后event、action attention才wait的wavefront保持依赖。LIBERO/RoboTwin/Plus及同训练distill控制，延迟含VAE不含episode一次文本。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06616",
      "title": "Video Encoders Built on Image Representations",
      "published": "2026-10-05T16:18:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06616",
          "title": "Video Encoders Built on Image Representations",
          "published": "2026-10-05T16:18:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "image-first视频输入保留源位置，固定token预算下DPP/跨帧关联选择加可选18M时序refiner；Appendix C.1训练自由对照已隔离额外训练。",
          "review_level": "fulltext",
          "official_url": "https://arxiv.org/html/2610.06616v1",
          "locations": [
            "§2–3",
            "§4.1–4.4/Table1/Table2",
            "Appendix C.1–C.3/Table4/Table5"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06616",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06616v1",
              "location": "§2–3; §4.1–4.4/Table1/Table2; Appendix C.1–C.3/Table4/Table5"
            },
            {
              "url": "https://arxiv.org/html/2610.06616v1",
              "location": "§2–3; §4.1–4.4/Table1/Table2; Appendix C.1–C.3/Table4/Table5",
              "notes": "三骨干选择only相比最强既有训练自由压缩Avg13提升2.49/2.78/2.36点；1535token Qwen3VL8B由62.64经refiner到62.75，主要增益来自选择非训练；32B完整E2E含编码/选择/refiner911.2→421.8ms。"
            }
          ],
          "limitations": "固定输出token不等于全路径零开销；refiner训练65K VideoChatGPT过滤后两epoch96 A100 GPU小时；本文报告不替代仓库GPU收据。",
          "institution": "包括Google DeepMind顾问合作作者，正文声明仅顾问贡献",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "三骨干选择only相比最强既有训练自由压缩Avg13提升2.49/2.78/2.36点；1535token Qwen3VL8B由62.64经refiner到62.75，主要增益来自选择非训练；32B完整E2E含编码/选择/refiner911.2→421.8ms。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06614",
      "title": "FREA: A Multi-Source Expert Benchmark for Reaction Feasibility Verification",
      "published": "2026-10-05T16:17:37Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06614",
          "title": "FREA: A Multi-Source Expert Benchmark for Reaction Feasibility Verification",
          "published": "2026-10-05T16:17:37Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06614",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "FREA反应可行性专家benchmark与forward model训练，非Agent策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06611",
      "title": "Lens3D: Target-Conditioned Visual Foveation for Fine-Grained 3D Understanding",
      "published": "2026-10-05T16:16:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06611",
          "title": "Lens3D: Target-Conditioned Visual Foveation for Fine-Grained 3D Understanding",
          "published": "2026-10-05T16:16:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Lens3D先grounder目标box→depth-visible voxel增量coverage选多视图并wireframe标注→2DVLM；LensDistill privileged teacher caption监督native3DLLM+目标center，无test额外view/VLM。LensBench2068object/141valscene与561train分离但reference为3模型silver，100object人评；GTbox版本不得混作端到端grounding。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06611",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06611v1",
              "location": "§3.2式3–5；§3.3–3.4式6；§4.1 Tables 1–2"
            },
            {
              "url": "https://arxiv.org/html/2610.06611v1",
              "location": "§3.2式3–5；§3.3–3.4式6；§4.1 Tables 1–2",
              "notes": "Lens3D先grounder目标box→depth-visible voxel增量coverage选多视图并wireframe标注→2DVLM；LensDistill privileged teacher caption监督native3DLLM+目标center，无test额外view/VLM。LensBench2068object/141valscene与561train分离但reference为3模型silver，100object人评；GTbox版本不得混作端到端grounding。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06611v1",
          "locations": [
            "§3.2式3–5；§3.3–3.4式6；§4.1 Tables 1–2"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Lens3D先grounder目标box→depth-visible voxel增量coverage选多视图并wireframe标注→2DVLM；LensDistill privileged teacher caption监督native3DLLM+目标center，无test额外view/VLM。LensBench2068object/141valscene与561train分离但reference为3模型silver，100object人评；GTbox版本不得混作端到端grounding。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06603",
      "title": "Word-Level Text Unmixing via Evidence-Preserving Ownership Routing with Language Models",
      "published": "2026-10-05T16:12:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06603",
          "title": "Word-Level Text Unmixing via Evidence-Preserving Ownership Routing with Language Models",
          "published": "2026-10-05T16:12:41Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06603",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "EPOR逐词文本源归属重建监督方法，不是Agent行动算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06598",
      "title": "SimForcing: Distilling Simulation Motion Priors into Real-Domain Robot World Models",
      "published": "2026-10-05T16:08:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06598",
          "title": "SimForcing: Distilling Simulation Motion Priors into Real-Domain Robot World Models",
          "published": "2026-10-05T16:08:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SimForcing动作条件视频worldmodel，真实轨迹sim重放扰动训teacher，pairedsim/real同noise/time的相邻cleanlatent差L2蒸馏；逐block zero-initconv simcondition按样本共享dropout并噪声腐坏。Bridge/InternData视频质量及LIBERO下游，世界预训练不预测动作，sim侧刻意排除objectinteraction不能夸大为学通用物理。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06598",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06598v1",
              "location": "§3.1–3.3式1–12；§4.1–4.3；Appendix A"
            },
            {
              "url": "https://arxiv.org/html/2610.06598v1",
              "location": "§3.1–3.3式1–12；§4.1–4.3；Appendix A",
              "notes": "SimForcing动作条件视频worldmodel，真实轨迹sim重放扰动训teacher，pairedsim/real同noise/time的相邻cleanlatent差L2蒸馏；逐block zero-initconv simcondition按样本共享dropout并噪声腐坏。Bridge/InternData视频质量及LIBERO下游，世界预训练不预测动作，sim侧刻意排除objectinteraction不能夸大为学通用物理。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06598v1",
          "locations": [
            "§3.1–3.3式1–12；§4.1–4.3；Appendix A"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "SimForcing动作条件视频worldmodel，真实轨迹sim重放扰动训teacher，pairedsim/real同noise/time的相邻cleanlatent差L2蒸馏；逐block zero-initconv simcondition按样本共享dropout并噪声腐坏。Bridge/InternData视频质量及LIBERO下游，世界预训练不预测动作，sim侧刻意排除objectinteraction不能夸大为学通用物理。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06597",
      "title": "Can Agent Harnesses and Inference Engines Hear Each Other? The HEAR Protocol for Agentic LLM Serving",
      "published": "2026-10-05T16:07:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06597",
          "title": "Can Agent Harnesses and Inference Engines Hear Each Other? The HEAR Protocol for Agentic LLM Serving",
          "published": "2026-10-05T16:07:33Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06597v1",
          "location": "§3.1–3.4; §4.1–4.4 Tables3–5; AppendixA.1/A.3–4; B Table17/JudgeProvenance",
          "decision": "pending",
          "reason": "HEAR双向harness-engine协议区分intent/control、偏好/要求、观察/保证及接受/完成；cache+等待保护与角色配置实例有可接入执行优化价值，但作者匿名repo not_connected，完整补丁/manifest不可取，已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "SCBench1.61×batch，BrowseComp1.23×、DeepResearch2.45×；模式选择development校验后冻结，非逐请求在线搜索。BCP208paired质量+.48pp CI[-5.29,6.25]，DRB共同89有效+.51 CI[-.36,1.46]。",
          "limitations": "非劣证明不足，DRB只89共同有效配对不可替代全部100分母；Mooncake100%负载session+cache+guard吞吐反降至.89×，组合非单调；cache近似配置不保持数值模型语义完全相同。Judge在不同GPU运行；调参/离线profiling不计运行总时长；公开匿名API返回not_connected。",
          "code": "https://anonymous.4open.science/r/hear-3D1E/",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06590",
      "title": "SPRIG: Semantic-ID-enhanced Paths for Knowledge Graph-based Generative Recommendation",
      "published": "2026-10-05T16:04:55Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.06590",
          "title": "SPRIG: Semantic-ID-enhanced Paths for Knowledge Graph-based Generative Recommendation",
          "published": "2026-10-05T16:04:55Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "SPRIG 将知识图谱与 SID 结合，在 ML1M/LFM2B 上比较；属于公开离线推荐研究，未满足线上准入。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06590",
              "location": "§4 datasets; Table 2; Conclusion"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.06590",
            "url": "https://arxiv.org/html/2610.06590v1",
            "sha256": "9c4f3cbf8bd86355aa6f2abe5e22c06b0244c9bdb5dca3deb5755efda362d142",
            "status": "downloaded",
            "characters": 45536,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06584",
      "title": "Does AI Help Cyber Attackers or Defenders? Evidence from Nonpublic Vulnerabilities and Subsequent Attacks",
      "published": "2026-10-05T16:00:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06584",
          "title": "Does AI Help Cyber Attackers or Defenders? Evidence from Nonpublic Vulnerabilities and Subsequent Attacks",
          "published": "2026-10-05T16:00:23Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06584",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "非公开漏洞攻防能力评测，不是新Agent方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06582",
      "title": "Mind the Execution Gap: Action-Semantic Mismatch in World-Model Control",
      "published": "2026-10-05T15:59:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06582",
          "title": "Mind the Execution Gap: Action-Semantic Mismatch in World-Model Control",
          "published": "2026-10-05T15:59:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "异步执行与控制器动作语义纠正接口，主要为控制系统诊断与接口修复。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06582",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06576",
      "title": "Before Agent Tells The Lie: Has Deception Already Been Represented?",
      "published": "2026-10-05T15:54:02Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06576",
          "title": "Before Agent Tells The Lie: Has Deception Already Been Represented?",
          "published": "2026-10-05T15:54:02Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06576v1",
          "location": "§3.1–3.4 Eq3–9; §4.1–4.4 Table1/Figs3–4; §5; Reproducibility",
          "decision": "pending",
          "reason": "深核MMD白盒前缀探针与类型平衡CAA诚实方向干预有Agent监控诊断价值；全文已审，但官方匿名代码not_connected且关键训练/部署选择不足，已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "Qwen3-14B，1500平衡训练/500平衡测试；事后关键步前t−7 AUROC90.4%，开始相对p1→p10平均51.2→80.0%；门控264例中原216欺骗121变诚实，48诚实仅35保留。",
          "limitations": "decisive-step事后对齐不是可在线知道的时点，prefix幸存者/任务长度变化可混杂；无taskgrouped分割/验证集规模、正则项完整定义；alpha2按最佳结果选但未说明validation。labels是行为非内在意图；7/500无效不能丢，诚实保持72.9%说明干预代价；未核公共资源。",
          "code": "https://anonymous.4open.science/r/deception-prediction/",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06571",
      "title": "BrainTRACE: Tracing Longitudinal, Multimodal, and Volumetric Evidence in Brain MRI Clinical Reasoning",
      "published": "2026-10-05T15:52:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06571",
          "title": "BrainTRACE: Tracing Longitudinal, Multimodal, and Volumetric Evidence in Brain MRI Clinical Reasoning",
          "published": "2026-10-05T15:52:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "BrainTRACE纵向脑MRI证据链benchmark，非基础模型新算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06571",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06563",
      "title": "HERA: Harness-Environment Co-Evolution for Reliable Agentic Abstention",
      "published": "2026-10-05T15:49:12Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06563",
          "title": "HERA: Harness-Environment Co-Evolution for Reliable Agentic Abstention",
          "published": "2026-10-05T15:49:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06563v1",
          "location": "§3.1–3.2; §4; §5 Table1; Appendix B.3/B.4/C.1; official README",
          "decision": "pending",
          "reason": "HERA构建同任务feasible/infeasible环境对，失败驱动环境及harness共同进化，独立15pair validation上Abstain/Pair非退化选型；高相关evolve候选。公开base/final harness与runner已有，但README明确120实例数据私有需授权，完整评测暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "evidence": "20→50train pairs、60test pairs，六轮每轮4harness更新；final Abstain83.3/Act76.7/Pair70对base61.7/68.3/48.3。初始failure生成baseline Pair73.3高于共同进化70，不能称三指标全胜。",
          "limitations": "infeasible通过替代路径/逆mutation/语义审查认证非形式证明；pair衍生需group split，task-disjoint不等于environment/domain-disjoint。validation单rollout/15pairs，未证明可靠长期泛化；未核到公开完整co-evolution训练管线。",
          "upstream": "https://github.com/lhannnn/HERA-Bench",
          "public_artifact_check": "README明确dataset currently private，HF sxcn/HERA-Bench；公开hera_runner/harnesses/tests/dataset.lock.json",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06514",
      "title": "ANT: A Multi-Granularity Network Traffic Dataset and Benchmark for Agents Behavior Auditing",
      "published": "2026-10-05T15:30:02Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06514",
          "title": "ANT: A Multi-Granularity Network Traffic Dataset and Benchmark for Agents Behavior Auditing",
          "published": "2026-10-05T15:30:02Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06514v1",
          "location": "§3.1；§4.1；§5；Ethics/Reproducibility",
          "decision": "pending",
          "reason": "ANT 是网络侧Agent行为/隐私审计数据集，可作为辅助观测评测；匿名公开入口读取失败，尚未核实104GB数据与执行包，暂缓接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.06514",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1",
            "§4.1",
            "§5",
            "Ethics/Reproducibility"
          ],
          "limitations": "3114episode/47primitive；按episode切分、屏蔽IP，不能把同轨迹segment散入训练测试。209测试episode仅20恶意，拒绝轨迹排除会改变分布。只允许授权隔离实验，不捕获真实用户流量；这是流量分类而非Agent任务能力提升。",
          "code_url": "https://anonymous.4open.science/r/ant-main-suite-7BC0/",
          "code_status": "paper declares GPLv3 code / CC-BY4 data; endpoint unverified",
          "reviewer": "root",
          "code": "https://anonymous.4open.science/r/ant-main-suite-7BC0/"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06479",
      "title": "Behavior-Preserving KV Cache Compression",
      "published": "2026-10-05T15:06:18Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06479",
          "title": "Behavior-Preserving KV Cache Compression",
          "published": "2026-10-05T15:06:18Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Behavior-Preserving KV 以全缓存下一token分布为目标，投影删除扰动经最终norm Jacobian/LM head近似到logits，用singleton候选池和mask-level边际KL贪心优化缓存。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06479",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06479v1",
              "location": "§4.1–4.4 Eq1–8; §5.1 / Table1; §6; Limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.06479v1",
              "location": "§4.1–4.4 Eq1–8; §5.1 / Table1; §6; Limitations",
              "notes": ""
            }
          ],
          "kind": "kv_cache_compression",
          "locations": [
            "§4.1–4.4 Eq1–8",
            "§5.1 / Table1",
            "§6",
            "Limitations"
          ],
          "limitations": "残差直通传播是近似，不能宣称精确输出保真；仅使用可见prompt尾或已生成query，不能读取未来答案。预填充仍需全缓存，选择开销更高；正文仅找到kvpress基线链接，未找到作者实现。",
          "code_url": null,
          "code_status": "author implementation not found in reviewed PDF; NVIDIA kvpress is baseline, not paper code",
          "official_url": "https://arxiv.org/html/2610.06479v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06454",
      "title": "AgentPrivArena: Evaluating and Auditing Real-world AI Agent Privacy",
      "published": "2026-10-05T14:55:53Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06454",
          "title": "AgentPrivArena: Evaluating and Auditing Real-world AI Agent Privacy",
          "published": "2026-10-05T14:55:53Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06454v1",
          "location": "§3.1–3.4；§4.1–4.2；§5；Limitations/Ethics；official README",
          "decision": "accepted",
          "reason": "AgentPrivArena/AgentPrivAudit 在六个容器服务中做389可执行隐私任务，读后提取来源/主体/接收方信息流、写前Pass/Abstract/Block，可作为真实工具状态评测与防护策略候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06454",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.4",
            "§4.1–4.2",
            "§5",
            "Limitations/Ethics",
            "official README"
          ],
          "limitations": "493来源只转成389，群聊缺失造成覆盖偏差；分数来自2/3模型judge尚未人工核验，fail-open不能作为对抗安全保证。敏感原观察仍进模型，不是隔离机制；公开MIT代码，PrivacyLens需单独按上游许可准备，所有记录合成。",
          "code_url": "https://github.com/voidreaming/agentprivarena",
          "code_status": "official MIT code, services, adapters and tests accessible",
          "reviewer": "root",
          "code": "https://github.com/voidreaming/agentprivarena"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06446",
      "title": "The Assistance Dilemma: Learning to Teach via Multi-Turn Reinforcement Learning",
      "published": "2026-10-05T14:50:58Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06446",
          "title": "The Assistance Dilemma: Learning to Teach via Multi-Turn Reinforcement Learning",
          "published": "2026-10-05T14:50:58Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Eduardo教学多轮RL奖励设计，由post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06446",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.06446",
          "title": "The Assistance Dilemma: Learning to Teach via Multi-Turn Reinforcement Learning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "tutor无gold solution；masked近迁移post-test只保留学生tokens，配合correctness/no-handover gate；冻结学生与跨benchmark评估。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06446v1",
              "location": "§3.1–3.6；§4.1–4.3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06439",
      "title": "Better Call Reward: Reward Hacking as Strategic Abstention in Legal Reasoning Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06439",
          "title": "Better Call Reward: Reward Hacking as Strategic Abstention in Legal Reasoning Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公开reward hacking诊断入口：LegalBench16任务分离surface proxy、真实可解析正确性、CTS与滚动GDM；Apache-2.0仓库有notebook与结果。刻意错误proxy训练用于检测format/abstention坍塌，不得宣传为能力改进。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06439v1",
              "location": "§3.1–3.3；§4–5"
            },
            {
              "url": "https://github.com/SubramanyamSahoo/Better-Call-Reward",
              "location": "作者资源入口只读核查；边界见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "LegalBench表面reward导致不作答的负面诊断及诊断指标，不是新训练改进算法。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06413",
      "title": "SpatialChain: A Benchmark for Auditing Spatial Reasoning Faithfulness in VLMs",
      "published": "2026-10-05T14:29:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06413",
          "title": "SpatialChain: A Benchmark for Auditing Spatial Reasoning Faithfulness in VLMs",
          "published": "2026-10-05T14:29:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SpatialChain用GQA scenegraph生成/answer过滤28,350train+899test CoT，评测模型输入image/question，judge可读GT graph评AC/RF/RC；surface overlap不证明faithfulness，RF是graph一致性非模型因果忠实性。官方data+eval+judge CLI齐全，可作公共评测；需把gold/reference与agent隔离。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06413",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06413v1",
              "location": "§3.2–3.3；§4.1–4.3；§5；Appendix L；官方README; README Dataset/Repository Structure/eval/judge"
            },
            {
              "url": "https://arxiv.org/html/2610.06413v1",
              "location": "§3.2–3.3；§4.1–4.3；§5；Appendix L；官方README; README Dataset/Repository Structure/eval/judge",
              "notes": "SpatialChain用GQA scenegraph生成/answer过滤28,350train+899test CoT，评测模型输入image/question，judge可读GT graph评AC/RF/RC；surface overlap不证明faithfulness，RF是graph一致性非模型因果忠实性。官方data+eval+judge CLI齐全，可作公共评测；需把gold/reference与agent隔离。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06413v1",
          "locations": [
            "§3.2–3.3；§4.1–4.3；§5；Appendix L；官方README",
            "README Dataset/Repository Structure/eval/judge"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "SpatialChain用GQA scenegraph生成/answer过滤28,350train+899test CoT，评测模型输入image/question，judge可读GT graph评AC/RF/RC；surface overlap不证明faithfulness，RF是graph一致性非模型因果忠实性。官方data+eval+judge CLI齐全，可作公共评测；需把gold/reference与agent隔离。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06411",
      "title": "From Benchmark to Bench: Can Agents Survive Real-World Drug Discovery?",
      "published": "2026-10-05T14:28:53Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06411",
          "title": "From Benchmark to Bench: Can Agents Survive Real-World Drug Discovery?",
          "published": "2026-10-05T14:28:53Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06411v1",
          "location": "§3.1–3.2；§4 protocol；§6–7；supplement code DOI",
          "decision": "pending",
          "reason": "MAGI由MCP编排REINVENT/ADMET/结构预测，五轮版本化目标修订与候选保留；实用研究控制机制，但完整九项目含未披露AstraZeneca和受限项目scorer。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.06411",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.2",
            "§4 protocol",
            "§6–7",
            "supplement code DOI"
          ],
          "limitations": "终点是预测不是新湿实验；一backend一trajectory、无静态目标对照，无法隔离agent贡献。Sanofi时间截断不能排除预训练暴露，不应在本库伪造私有评分数据。仅公开子集可另立后续边界。",
          "code_url": "https://doi.org/10.5281/zenodo.18758006",
          "code_status": "paper-linked DOI, full author workflow availability not yet verified",
          "reviewer": "root",
          "code": "https://doi.org/10.5281/zenodo.18758006"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06409",
      "title": "FlashCart: Fast Cartesian Tensor Products for Equivariant Interatomic Potentials",
      "published": "2026-10-05T14:26:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06409",
          "title": "FlashCart: Fast Cartesian Tensor Products for Equivariant Interatomic Potentials",
          "published": "2026-10-05T14:26:22Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "FlashCart为原子势能等变张量积GPU内核与结构，属于专用原子模拟模型而非当前基础模型范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06409",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06406",
      "title": "What Did the Agent Actually Do? Evidence-Grounded Oversight for Long-Horizon Agents",
      "published": "2026-10-05T14:25:16Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06406",
          "title": "What Did the Agent Actually Do? Evidence-Grounded Oversight for Long-Horizon Agents",
          "published": "2026-10-05T14:25:16Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "EBG和AgentMonBench用于长程agent监督，应由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06406",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06406",
          "title": "What Did the Agent Actually Do? Evidence-Grounded Oversight for Long-Horizon Agents",
          "published": "2026-10-05T14:25:16Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06406v1",
          "location": "§3.1–3.4; §4.1–4.3 Eq1–2; §5.1–5.2; AppendixD.1/F; official README/dataset_card",
          "decision": "accepted",
          "reason": "EBG确定性证据→行为→scope图、需求驱动一跳扩展及原文回核；AgentMonBench分离遗漏规范、测试不变语义替换和事后反馈前缀，接受监督机制与条件性公共评测候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "3组件各100例，484遗漏条件/500语义变更；双模型语义judge与规则定位分开。官方MIT graph/predict/judge/source_review/构建代码已发布，dataset_card明确visible_bundles与hidden_gold只供scorer。",
          "limitations": "FeedbackTrace以之后pushback选样但监控不见后续，属于选择性监督任务非实时发生率；EHR只需命中一证据不是完整充分性；Codex5case非因果一般化证据。公开Drive输入入口存在但此环境未列出档案，完整冻结数据下载未验证；dataset-specific release terms pending，上游CCBY/ODCBy需分别遵守；不得宣称benchmark已执行/全部许可无条件。",
          "code": "https://github.com/zhk-lab/EBG",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06404",
      "title": "Quantifying the Stability of Multi-Step Reasoning via Error Amplification",
      "published": "2026-10-05T14:22:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06404",
          "title": "Quantifying the Stability of Multi-Step Reasoning via Error Amplification",
          "published": "2026-10-05T14:22:59Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "随机有序子采样CoT步骤与STE量化感知SFT组合，降低step-to-step误差放大；CLRS-Text/LEGO上可复现实验及Jacobian诊断。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06404",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.06404v1",
              "location": "§3 error amplification; §4 Algorithm1; §5.1/Table1; Appendix B",
              "notes": "随机有序子采样CoT步骤与STE量化感知SFT组合，降低step-to-step误差放大；CLRS-Text/LEGO上可复现实验及Jacobian诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.06404v1",
          "locations": [
            "§3 error amplification",
            "§4 Algorithm1",
            "§5.1/Table1",
            "Appendix B"
          ],
          "limitations": "不是直接Jacobian罚项训练；2000train/200val/200test，λ和bits只val调。10%长度外推主结果，20%所有方法低于25%，不能宣传长推理普适提升。图算法/符号7任务和Qwen1.5B，非开放文本证明。",
          "code_url": "https://github.com/VirtuosoResearch/Multi-step-reasoning-experiments",
          "code_status": "author release linked in paper; not executed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06404v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "随机有序子采样CoT步骤与STE量化感知SFT组合，降低step-to-step误差放大；CLRS-Text/LEGO上可复现实验及Jacobian诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06401",
      "title": "RAISED: Self-Distillation for Robustness to Prompt Injection in LLM Agents",
      "published": "2026-10-05T14:21:30Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06401",
          "title": "RAISED: Self-Distillation for Robustness to Prompt Injection in LLM Agents",
          "published": "2026-10-05T14:21:30Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06401v1",
          "location": "§3 threat; §5.1–5.2 Eq3–4; §6; AppendixC.5.1/E Table14/F/G; official GitHubAPI",
          "decision": "pending",
          "reason": "RAISED自生成真实可执行工具链，独立clean教师分布监督clean/注入学生同response tokens，保留top256+残余桶forwardKL；防御训练机制符合候选，但官方仓库404，完整数据/脚本受阻已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "每模型1万verified轨迹，LoRA1epoch、注入率.5、3seeds；控制相同Glaive与自生成数据分别对比SFT/DPO/自蒸馏。Gemma AgentDojo clean84.5→83.5/ASR39.5→1.0，AgentDyn61.7→60.0/53.4→1.6。",
          "limitations": "离线固定clean teacher轨迹而非on-policy rollout distillation；只能抗静态注入，AppF自适应攻击reward为零的失败优化明确不算鲁棒证据；成功check由同model生成且筛选，自蒸馏可能保留原错误行为；soft桶是coarsenedKL不是fullvocab精确KL；算教师生成/15GB分布存储成本，不能用hardSFT冒充。",
          "code": "https://github.com/orailix/RAISED",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06394",
      "title": "Harnessing Multimodal Large Language Models for Training-Free Human-Object Interaction Detection",
      "published": "2026-10-05T14:16:28Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06394",
          "title": "Harnessing Multimodal Large Language Models for Training-Free Human-Object Interaction Detection",
          "published": "2026-10-05T14:16:28Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "HarnessHOI用MLLM主动交互假设进行HOI检测，属于视觉应用harness，而非基础模型训练。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06394",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06387",
      "title": "Scaling Down the Scaling Laws: Parameter Efficiency and Compute-Optimal Training in Resource-Constrained Large Language Models",
      "published": "2026-10-05T14:12:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06387",
          "title": "Scaling Down the Scaling Laws: Parameter Efficiency and Compute-Optimal Training in Resource-Constrained Large Language Models",
          "published": "2026-10-05T14:12:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "资源受限LLM缩放律综述，没有新的原始核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06387",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06360",
      "title": "Ontology Concept Overlap as a Training Signal: Knowledge-Grounded Reinforcement Learning for Clinical Question Answering",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.06360",
          "title": "Ontology Concept Overlap as a Training Signal: Knowledge-Grounded Reinforcement Learning for Clinical Question Answering",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "UMLS concept overlap+judge+consistency属于任务reward组合，GRPO目标标准；贡献限临床3–3.8B且7B全collapse，不当作通用新优化器。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06360v1",
              "location": "§2.2；§3 Table 1及§3.5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06324",
      "title": "Readout Blindness: VLM Scores Miss the Spatial Direction Their Frozen Encoders Retain",
      "published": "2026-10-05T13:36:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06324",
          "title": "Readout Blindness: VLM Scores Miss the Spatial Direction Their Frozen Encoders Retain",
          "published": "2026-10-05T13:36:45Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ADR冻结encoder patch/独立词特征做Sinkhorn excess coupling或dense定位质心，再根据解析subject-object关系轴作有符号位移；无新训练且context-free/unary盲性定理有前提，不能泛称所有VLM encoder无法方向。九模型五direction-balanced集，derangement null校正grounded gain抵消语言prior；适合readout方法与diagnostic evaluator。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06324",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06324v1",
              "location": "§4 Theorems；§5 Algorithm 1；§6；§7 Tables 1–2；Appendix D"
            },
            {
              "url": "https://arxiv.org/html/2610.06324v1",
              "location": "§4 Theorems；§5 Algorithm 1；§6；§7 Tables 1–2；Appendix D",
              "notes": "ADR冻结encoder patch/独立词特征做Sinkhorn excess coupling或dense定位质心，再根据解析subject-object关系轴作有符号位移；无新训练且context-free/unary盲性定理有前提，不能泛称所有VLM encoder无法方向。九模型五direction-balanced集，derangement null校正grounded gain抵消语言prior；适合readout方法与diagnostic evaluator。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06324v1",
          "locations": [
            "§4 Theorems；§5 Algorithm 1；§6；§7 Tables 1–2；Appendix D"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "ADR冻结encoder patch/独立词特征做Sinkhorn excess coupling或dense定位质心，再根据解析subject-object关系轴作有符号位移；无新训练且context-free/unary盲性定理有前提，不能泛称所有VLM encoder无法方向。九模型五direction-balanced集，derangement null校正grounded gain抵消语言prior；适合readout方法与diagnostic evaluator。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06320",
      "title": "CRAFTER: Causality-based Self-adaptation for Autonomous IoT Systems",
      "published": "2026-10-05T13:34:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06320",
          "title": "CRAFTER: Causality-based Self-adaptation for Autonomous IoT Systems",
          "published": "2026-10-05T13:34:23Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06320",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "CRAFTER因果RL自适应IoT系统，非LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06293",
      "title": "VepAgent: Bridging Causal-Transition via Tool-Augmented Reinforcement Learning for Video Event Prediction",
      "published": "2026-10-05T13:19:10Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06293",
          "title": "VepAgent: Bridging Causal-Transition via Tool-Augmented Reinforcement Learning for Video Event Prediction",
          "published": "2026-10-05T13:19:10Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "VepAgent视频事件预测的工具增强RL，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06293",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06286",
      "title": "DeferKV: Rethinking Eviction Timing for One-Shot KV Cache Compression",
      "published": "2026-10-05T13:13:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06286",
          "title": "DeferKV: Rethinking Eviction Timing for One-Shot KV Cache Compression",
          "published": "2026-10-05T13:13:14Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DeferKV 等首个真实生成token进入decode获得query后再压缩prompt缓存；将其与尾部prompt query按时间折扣融合，沿用底层方法的平滑/预算/选择。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06286",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06286v1",
              "location": "§4.1–4.3 Eq6–9; §5.1; §5.4–5.6 Table4; Limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.06286v1",
              "location": "§4.1–4.3 Eq6–9; §5.1; §5.4–5.6 Table4; Limitations",
              "notes": ""
            }
          ],
          "kind": "kv_eviction_timing",
          "locations": [
            "§4.1–4.3 Eq6–9",
            "§5.1",
            "§5.4–5.6 Table4",
            "Limitations"
          ],
          "limitations": "首个decode前仍需全prompt KV；额外生成token的KV须保留。η=0.7来自LongBench敏感度实验，本地应单独验证选择；不默认适配MLA/混合线性状态缓存。",
          "code_url": null,
          "code_status": "no author repository located in reviewed body",
          "official_url": "https://arxiv.org/html/2610.06286v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06269",
      "title": "Evolving in Thought Space: Training a Small Model at Test Time Unlocks Better Discoveries",
      "published": "2026-10-05T13:04:05Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06269",
          "title": "Evolving in Thought Space: Training a Small Model at Test Time Unlocks Better Discoveries",
          "published": "2026-10-05T13:04:05Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06269v1",
          "location": "§3.1–3.4; §4.1–4.3; Appendix A.3/C.4–C.5/D.3; official guidance-ttt-support recipe README/LICENSE",
          "decision": "accepted",
          "reason": "Guidance-TTT仅训练小guidance LoRA，用archive parent summary提策略、冻结executor读完整parent落实、独立verifier给reward；adaptive entropic LOO advantage+centered base correction的实际RL闭环，接受高优先evolve候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "30updates×8parents×16rollouts；beta使KL(softmaxreward||uniform)=log2；loss是detached importance-weight REINFORCE非PPO。Polyomino91.89、Lasso.1739、AHC850082731、TriMul1129μs；官方Apache2分支含四任务judge/Harbor/contracts/训练入口。",
          "limitations": "多数最佳search结果不等于跨任务泛化；固定program三/五重复的std非独立训练seed；TriMul历史archive baselines与新配对timing不能混合置信区间。GPTOSS同executor成本比较83.19低于TTT83.72，是便宜但略低分。官方README明确paper records是历史结果非当前port新运行；H100结果不是本地A100验证。",
          "upstream": "https://github.com/Human-Agent-Society/reef/tree/guidance-ttt-support",
          "public_artifact_check": "指定分支recipe/README、四任务独立grade.py、LICENSE Apache2可读；未执行",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06251",
      "title": "Shared Stopping Decisions Change Answers in HQQ Cache Quantization",
      "published": "2026-10-05T12:47:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06251",
          "title": "Shared Stopping Decisions Change Answers in HQQ Cache Quantization",
          "published": "2026-10-05T12:47:45Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "HQQ共享停止条件导致跨请求干扰的实现诊断与修复，无新基础模型核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06251",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06226",
      "title": "LeAVJEPA: A Minimalist Architecture for Audio-Visual Self-Supervised Learning",
      "published": "2026-10-05T12:33:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06226",
          "title": "LeAVJEPA: A Minimalist Architecture for Audio-Visual Self-Supervised Learning",
          "published": "2026-10-05T12:33:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "LeAVJEPA以共享早期融合ViT、模态专属局部视图、对称不变性与SIGReg构成可训练视听JEPA；附录C.3表A3同编码器/30epoch/批量512的控制实验证实局部视图机制。仅接受为研究候选，不宣称SOTA或已复现。",
          "review_level": "fulltext",
          "official_url": "https://arxiv.org/html/2610.06226v1",
          "locations": [
            "§3.1–3.4",
            "§4.1–4.4/Table2/Table4",
            "Appendix B.1",
            "Appendix C.3/TableA3"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06226",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06226v1",
              "location": "§3.1–3.4; §4.1–4.4/Table2/Table4; Appendix B.1; Appendix C.3/TableA3"
            },
            {
              "url": "https://arxiv.org/html/2610.06226v1",
              "location": "§3.1–3.4; §4.1–4.4/Table2/Table4; Appendix B.1; Appendix C.3/TableA3",
              "notes": "模态局部视图43.9/47.1线性/注意力探针，对照随机dropout38.1/41.3、joint locals13.7/24.7；AudioSet20K mAP36.03、VGGSound61.1均不及全部既有最强模型。"
            }
          ],
          "limitations": "多项为单次训练；原始视听数据可访问性需实现前确认；本次官方页面未找到作者代码链接。",
          "institution": "ELLIS Institute Finland / Aalto University",
          "original_publication_date": "2026-10-05",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "模态局部视图43.9/47.1线性/注意力探针，对照随机dropout38.1/41.3、joint locals13.7/24.7；AudioSet20K mAP36.03、VGGSound61.1均不及全部既有最强模型。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06207",
      "title": "AI-Decision Checkpoints for AI-Augmented Business Process Management: Framework and Educational Instantiation",
      "published": "2026-10-05T12:18:14Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06207",
          "title": "AI-Decision Checkpoints for AI-Augmented Business Process Management: Framework and Educational Instantiation",
          "published": "2026-10-05T12:18:14Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06207",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "AI-decision checkpoints业务流程教学框架，非算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06204",
      "title": "Do Small Language Models Learn to Negotiate? A Controlled Scaling Study of RL-Trained Sellers",
      "published": "2026-10-05T12:17:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06204",
          "title": "Do Small Language Models Learn to Negotiate? A Controlled Scaling Study of RL-Trained Sellers",
          "published": "2026-10-05T12:17:22Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "小模型谈判GRPO学习率/规模比较，领域后训练经验研究。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06204",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.06204",
          "title": "Do Small Language Models Learn to Negotiate? A Controlled Scaling Study of RL-Trained Sellers",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "独立双边谈判ledger环境：私有Dirichlet效用、JSON counter/accept、12轮封顶与held-out买家/领域，具公共评测潜力。正文给协议但未找到作者环境/场景生成器发布链接；跨size有架构/计算混淆，不能据此结论能力scale。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.06204v1",
              "location": "§3；§4；§6"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "四尺度卖方GRPO与学习率对照，结论是调参与评测协议，未提出新算法。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "独立双边谈判ledger环境：私有Dirichlet效用、JSON counter/accept、12轮封顶与held-out买家/领域，具公共评测潜力。正文给协议但未找到作者环境/场景生成器发布链接；跨size有架构/计算混淆，不能据此结论能力scale。"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06204",
          "title": "Do Small Language Models Learn to Negotiate? A Controlled Scaling Study of RL-Trained Sellers",
          "published": "2026-10-05T12:17:22Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06204",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Gemma谈判RL受控规模/学习率研究，未提出新的Agent核心训练方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06196",
      "title": "EORestore-Agent: Fidelity-Guided Agentic Restoration of Remote Sensing Images with Composite Degradations",
      "published": "2026-10-05T12:11:31Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06196",
          "title": "EORestore-Agent: Fidelity-Guided Agentic Restoration of Remote Sensing Images with Composite Degradations",
          "published": "2026-10-05T12:11:31Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "EORestore遥感图像恢复agent，属领域工具编排系统。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06196",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06193",
      "title": "Correct Code, Broken Contributions? SWE-CC: Benchmarking Repository Policy Compliance for Coding Agents",
      "published": "2026-10-05T12:08:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06193",
          "title": "Correct Code, Broken Contributions? SWE-CC: Benchmarking Repository Policy Compliance for Coding Agents",
          "published": "2026-10-05T12:08:33Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06193v1",
          "location": "§3.1–3.5；§4.1–4.2；Appendix B/D；official README",
          "decision": "accepted",
          "reason": "SWE-CC 将12个SWE-bench仓库的823条贡献政策编译成有前置条件的确定性检查器，同时评估轨迹与补丁，适合作为代码Agent合同评测候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06193",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.5",
            "§4.1–4.2",
            "Appendix B/D",
            "official README"
          ],
          "limitations": "合规率必须联报触发率、withheld和功能成功率，少做任务不能冒充更合规。150个人工抽审平均接受87.2%，未经人工修正的checker有错误；文档版本与任务历史版本需绑定。官方MIT发布任务、checkers、runner和8千次outcome，但没有完整历史轨迹，不能独立复判所有旧运行。",
          "code_url": "https://github.com/dangtruong01/swe-cc-arxiv",
          "code_status": "official MIT code/tasks/evaluator accessible; historical full traces absent",
          "reviewer": "root",
          "code": "https://github.com/dangtruong01/swe-cc-arxiv"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06192",
      "title": "Copies or Sources? Measuring How LLM Aggregators Count Restated Evidence in Multi-Agent Systems",
      "published": "2026-10-05T12:08:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06192",
          "title": "Copies or Sources? Measuring How LLM Aggregators Count Restated Evidence in Multi-Agent Systems",
          "published": "2026-10-05T12:08:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06192v1",
          "location": "§2–3 testbeds；§5.1–5.3；Appendix G prompts",
          "decision": "accepted",
          "reason": "用精确Bayes可数来源任务测复制证据权重，比较去重声明、抽取唯一读数、只转发引用三种通信干预，可加入多Agent证据聚合诊断。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06192",
          "fulltext_review_completed": true,
          "locations": [
            "§2–3 testbeds",
            "§5.1–5.3",
            "Appendix G prompts"
          ],
          "limitations": "抽取多一次模型调用且可能漏证据；引用须能解析到原始来源，层级摘要仍重复，不能靠声明假定相互独立。Web文档摘要复制消除较弱，真实复杂知识任务收益尚未建立。",
          "code_status": "complete prompts in paper; linked GULI-SET is related benchmark, no canonical author code release located",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06191",
      "title": "Judged Useless, Queried Anyway: Tool-Using Agents Rarely Turn Their Own Evidence Judgments into Stopping Decisions",
      "published": "2026-10-05T12:08:04Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06191",
          "title": "Judged Useless, Queried Anyway: Tool-Using Agents Rarely Turn Their Own Evidence Judgments into Stopping Decisions",
          "published": "2026-10-05T12:08:04Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06191v1",
          "location": "§2 setting；§5–6；Limitations；Appendix D",
          "decision": "accepted",
          "reason": "根据Agent自身USELESS判断累计失败检索，在连续五次无用时由harness触发整合/停止；固定步数对比和新300题确认，适合工具预算控制候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06191",
          "fulltext_review_completed": true,
          "locations": [
            "§2 setting",
            "§5–6",
            "Limitations",
            "Appendix D"
          ],
          "limitations": "side-channel判断额外3–5次调用应计费，keyword reader只部分模型有效；阈值针对最多三次恢复的模拟故障，晚恢复会过早停止。gold只供评测不得用于停止信号；离开工具后凭记忆回答仍需安全/准确性检查。",
          "code_url": "https://github.com/bennidict23/judged-useless-queried-anyway",
          "code_status": "official code and data accessible; not executed",
          "reviewer": "root",
          "code": "https://github.com/bennidict23/judged-useless-queried-anyway"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06190",
      "title": "Bridging the Evidence-to-Execution Gap:A Reflective Agent for Multi-Objective Peptide Design",
      "published": "2026-10-05T12:07:21Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06190",
          "title": "Bridging the Evidence-to-Execution Gap:A Reflective Agent for Multi-Objective Peptide Design",
          "published": "2026-10-05T12:07:21Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06190v1",
          "location": "§3.1–3.3 Eq1–2; §4; §5.2 Table3/§5.3–5.4; AppendixB/C.1 Algorithm1/G",
          "decision": "pending",
          "reason": "EASER把离线学习固定低秩蛋白属性控制接口与证据Agent的probe再分配采样结合，可迁移的多目标搜索控制机制；作者明确代码/矩阵/划分将发布，已审暂缓原实验复现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "reviewer": "agent_review",
          "evidence": "同generator/actionspace六run各2560候选，EASER meanHV .0450、random .0389、LinUCB .0373；独立external predictors与evaluationfront不进入决策；checkpoint在validation选择。",
          "limitations": "所有活性/安全/CPP效果只是预测器分数，无湿实验或临床证据；搜索受内部predictor偏差，不能用安全分数断言安全；equal候选不等LLM/检索总预算；候选/矩阵/curated evidence resource尚未发布，不能简化为标量随机搜索冒充定义算法。",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06163",
      "title": "Where Did the Repair First Go Wrong? Localizing the Origins of Silent Failures in Agentic Vulnerability Repair",
      "published": "2026-10-05T11:31:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06163",
          "title": "Where Did the Repair First Go Wrong? Localizing the Origins of Silent Failures in Agentic Vulnerability Repair",
          "published": "2026-10-05T11:31:16Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06163v1",
          "location": "§3.2–3.4；§4.3；§5.1–5.2；Data Availability",
          "decision": "pending",
          "reason": "SAGE 用prefix-only安全推理量表和逐次代码快照定位已确认silent failure的最早可观察偏离，适合作为轨迹诊断；官方Zenodo数据入口本次读取失败，完整normalizer/judge脚本未核实，暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.06163",
          "fulltext_review_completed": true,
          "locations": [
            "§3.2–3.4",
            "§4.3",
            "§5.1–5.2",
            "Data Availability"
          ],
          "limitations": "5400尝试只3684有效进入验证，95确认案例来自19任务；失败锚点仅供事后定位，不得喂给被测Agent或逐步评分judge。重复judge一致不等于正确或因果归因，人工标注仅覆盖代码来源/引入写入。SecurityEval无测试套件，L1仅语法/导入/结构不足以保证功能。",
          "code_url": "https://zenodo.org/records/23108850",
          "code_status": "dataset declared; endpoint inaccessible; full pipeline release unverified",
          "reviewer": "root",
          "code": "https://zenodo.org/records/23108850"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06161",
      "title": "Introducing Code-Switched Contexts to Cognitively-Inspired Bilingual Model Training",
      "published": "2026-10-05T11:30:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06161",
          "title": "Introducing Code-Switched Contexts to Cognitively-Inspired Bilingual Model Training",
          "published": "2026-10-05T11:30:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "字典/POS受控code-switch与四阶段密度课程是可执行数据增强候选，适合小型双语预训练机制诊断；必须同时保留英中退化负结果。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06161",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06161v1",
              "location": "§3.1–3.2/Table1; §4–5; §7/Limitations; App A/B/D"
            },
            {
              "url": "https://arxiv.org/html/2610.06161v1",
              "location": "§3.1–3.2/Table1; §4–5; §7/Limitations; App A/B/D",
              "notes": "GPT2small BPE16k，BabyLM100M预算10epoch约1B曝光三seed；静态总10%替换，课程四等额阶段eligible90/70/40/0%用约20%active rate对齐密度；noun/verb/adj可选。MGIZA IBM1/3/4双向+grow-diag-final-and，英中phrase层最多5英词6汉字，POS BiLSTM无预训练，成本从预算扣。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.06161v1",
          "locations": [
            "§3.1–3.2/Table1",
            "§4–5",
            "§7/Limitations",
            "App A/B/D"
          ],
          "limitations": "只英荷/英中小尺度，英荷收益而英中grammar/translationretrieval下降；不能称普适跨语言提升或认知忠实模型。词典/POS噪声和word/token预算区分需显式记录；未找到作者源码链接，独立实现保留语料版本与词典构建预算。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "GPT2small BPE16k，BabyLM100M预算10epoch约1B曝光三seed；静态总10%替换，课程四等额阶段eligible90/70/40/0%用约20%active rate对齐密度；noun/verb/adj可选。MGIZA IBM1/3/4双向+grow-diag-final-and，英中phrase层最多5英词6汉字，POS BiLSTM无预训练，成本从预算扣。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06148",
      "title": "Reinforcement Learning-Based Optimization of Workload-Aware Power Delivery Networks",
      "published": "2026-10-05T11:19:00Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06148",
          "title": "Reinforcement Learning-Based Optimization of Workload-Aware Power Delivery Networks",
          "published": "2026-10-05T11:19:00Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06148",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "PDN电网DQN线宽优化，非语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06147",
      "title": "Efficient Test-time Adaptation through Candidate Verification and Divergence Shifts",
      "published": "2026-10-05T11:18:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06147",
          "title": "Efficient Test-time Adaptation through Candidate Verification and Divergence Shifts",
          "published": "2026-10-05T11:18:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "TTC候选memory子空间稳定性校正，公开代码/特征包使其适合作为无梯度VLM适配候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06147",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06147v1",
              "location": "§3 Eq1–8; §4.1/4.3/4.4; App B/C/D; 作者README"
            },
            {
              "url": "https://arxiv.org/html/2610.06147v1",
              "location": "§3 Eq1–8; §4.1/4.3/4.4; App B/C/D; 作者README",
              "notes": "原logit top3，m16 memory；各假设插入x，ridge投影的行L2重构误差加双向divergenceshift差；仅选定类随后更新，3随机teststream。无标签test预测初始化，有标签fewshot固定entries。官方TTC-features与CoOp/CuPL数据布局/runner公开。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.06147v1",
          "locations": [
            "§3 Eq1–8",
            "§4.1/4.3/4.4",
            "App B/C/D",
            "作者README"
          ],
          "limitations": "Table5预提features且无augmentation，是适配阶段而非端到端2x；top3外准确率必0，受伪标记memory污染/空类coldstart限制。labeled train memory与label-free协议不得混报，test_l只用于最后评分。",
          "code_url": "https://github.com/mmai-laboratory/ttc",
          "implementation_status": "not_implemented",
          "fulltext_notes": "原logit top3，m16 memory；各假设插入x，ridge投影的行L2重构误差加双向divergenceshift差；仅选定类随后更新，3随机teststream。无标签test预测初始化，有标签fewshot固定entries。官方TTC-features与CoOp/CuPL数据布局/runner公开。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06122",
      "title": "Benchmarking Jailbreak Guardrails for Embodied Agents",
      "published": "2026-10-05T10:56:18Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06122",
          "title": "Benchmarking Jailbreak Guardrails for Embodied Agents",
          "published": "2026-10-05T10:56:18Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06122v1",
          "location": "§3 taxonomy/metrics；§4.1–4.3；§6；Reproducibility/Ethics",
          "decision": "pending",
          "reason": "固定具身Agent后端对比感知/计划/控制阶段guardrail，联合测bypass、模拟器hazard、正常任务完成与成本；匿名补充材料未给可验证公开入口，保留已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.06122",
          "fulltext_review_completed": true,
          "locations": [
            "§3 taxonomy/metrics",
            "§4.1–4.3",
            "§6",
            "Reproducibility/Ethics"
          ],
          "limitations": "仅AI2-THOR的300安全/300不安全任务，部分结果依赖GPT4o比较reference plan而非环境真值；不是实机安全认证。只可隔离模拟器防御评测，不能连接物理机器人执行有害指令。不同guardrail的误拦截与延迟必须同时报告，不按单一bypass排名。",
          "code_status": "anonymous supplementary code claimed; public executable release not verified",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06100",
      "title": "From Traces to Agentic Worlds: Agentic Language World Models for Interactive Environment Simulation",
      "published": "2026-10-05T10:32:28Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06100",
          "title": "From Traces to Agentic Worlds: Agentic Language World Models for Interactive Environment Simulation",
          "published": "2026-10-05T10:32:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06100v1",
          "location": "§4.1–4.3 Eq3–8; §5.1–5.4 Tables1–3; AppendixC.3 Table13; official REPRODUCING.md",
          "decision": "accepted",
          "reason": "Trace2Env从trace构造冻结worldbook，区分跨episode知识、当前state与逐步memory；适用性gate、schema/约束验证分阶段commit，配真实环境重放W2R评测，接受世界模型/Agent环境候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "reviewer": "agent_review",
          "evidence": "Android/SWE taskgrouped5fold，EnvScaler任务heldout；ALFWorld WM88/W2R85 vs纯prompt97/3，SciWorld87.5/60 vs92.5/45。官方训练构建、AWB评测、ALF/SciWorld real replay代码公开。",
          "limitations": "gate只schema/约束而非真实转移证明；模型提案合法即接收，拒绝时清effects但仍返回原observation，可能状态叙述不一致；所有主表single run，judge失败样本排除需coverage。除Terminal外冻结worldbooks/原traces/results多为on-request，可重采样但非精确复现；SciWorld建模用goldpath只限构建train，不得给测试taskagent；CR不是逐轨迹一致性概率。",
          "code": "https://github.com/ruyue0001/trace2env",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06083",
      "title": "Boosting Transferable Adversarial Attacks against Deep Reinforcement Learning",
      "published": "2026-10-05T10:14:05Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06083",
          "title": "Boosting Transferable Adversarial Attacks against Deep Reinforcement Learning",
          "published": "2026-10-05T10:14:05Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06083",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "DQN/DDQN CartPole迁移对抗扰动，非LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06069",
      "title": "Attention Tax, Handoff Tax: A Stylised Model of When Multi-Agent LLM Systems Help",
      "published": "2026-10-05T10:04:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06069",
          "title": "Attention Tax, Handoff Tax: A Stylised Model of When Multi-Agent LLM Systems Help",
          "published": "2026-10-05T10:04:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "多agent可靠性/通信代价理论模型，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06069",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06069",
          "title": "Attention Tax, Handoff Tax: A Stylised Model of When Multi-Agent LLM Systems Help",
          "published": "2026-10-05T10:04:20Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06069",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "多Agent可靠性的stylised attention/handoff理论与测量，非独立新执行算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06064",
      "title": "TrustMI: Causally controlling how assistants trust their users",
      "published": "2026-10-05T09:56:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06064",
          "title": "TrustMI: Causally controlling how assistants trust their users",
          "published": "2026-10-05T09:56:52Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06064v1",
          "location": "§3–6；Appendix B/C/D.3–4/D.6/E；官方README、LICENSE/数据许可",
          "decision": "accepted",
          "reason": "TrustMI以冻结LM的全层BiPO steering矩阵+正向trust NLL抑制likelihood displacement；用户span和assistant span分别训练，Agent主实验把user-trained矩阵加到所有用户及工具输出。接受Meta高优先安全机制及公共评测候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "institution": "Inria; Sorbonne; LightOn; Meta SuperIntelligence Labs",
          "evidence": "2000合成contrastive pairs，1800train/200test；6模型，Inspect-AI AgentHarm/AgentDojo/Misalignment与4能力对照，除Misalignment外3次。官方10-07已公开MIT代码、CC-BY4.0 corpus/vectors/results和runner，覆盖正文旧“acceptance后发布”声明。人工60非tie judge agreement78.3±10.4%。",
          "limitations": "仅用户span steering反而提高Qwen注入ASR；必须包括tool spans。moderate α能力平均近似保持不等于每子任务无损；α/γ等需另设validation，原文仅1800/200未明确独立调参集。因果activation干预不证明唯一纯trust心理变量；相关doubt/sycophancy未解耦，judge替换不可直接比较原benchmark绝对分。",
          "code": "https://github.com/Blyzi/trustmi",
          "license": "MIT code; CC-BY-4.0 data/vectors/results; upstream model/benchmark terms apply",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06063",
      "title": "Vision Transformer Ensembles for Panoramic Street Segmentation",
      "published": "2026-10-05T09:56:48Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06063",
          "title": "Vision Transformer Ensembles for Panoramic Street Segmentation",
          "published": "2026-10-05T09:56:48Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "街景分割挑战现有架构集成，无新基础模型方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06063",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06056",
      "title": "ROT: Rotating Hidden States towards Contextual Vectors for Hallucination Mitigation in LVLMs",
      "published": "2026-10-05T09:49:09Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06056",
          "title": "ROT: Rotating Hidden States towards Contextual Vectors for Hallucination Mitigation in LVLMs",
          "published": "2026-10-05T09:49:09Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "ROT核心旋转/平滑与实验已核，但保真配置仍缺trigger τ和模型specific layer zone；正文LLaVA6–26与AppendixAlgorithm1从1到Lmid不一致，无法确认作者路径，保留具体待补项。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06056",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06056v1",
              "location": "§3.1–3.2 Eq1; §4.1–4.2 Eq2–6; §5 Tables1–3; App A Algorithm1/C/D"
            },
            {
              "url": "https://arxiv.org/html/2610.06056v1",
              "location": "§3.1–3.2 Eq1; §4.1–4.2 Eq2–6; §5 Tables1–3; App A Algorithm1/C/D",
              "notes": "attention对文本/视觉各归一汇总X^{k−1}，post-attn residual h，E=2−cos(h,CT)−cos(h,CV)，超阈Slerp toward normalized(.44CV+.56CT) β.062，later γ.51 smoothing；CHAIR15.7→6.7、recall75.2→75.6。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.06056v1",
          "locations": [
            "§3.1–3.2 Eq1",
            "§4.1–4.2 Eq2–6",
            "§5 Tables1–3",
            "App A Algorithm1/C/D"
          ],
          "limitations": "附录给α/β/γ未给τ；从3000CHAIR选layer且未交代独立验证划分，不能在test调阈。MME只三perception子集非全任务，POPE也不超过全部baselines；缓存previouslayer preFFN与正文hk−1语义须确定。官方正文无源码链接，搜索未找到作者公开源码，不以抽象heuristic替代。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "attention对文本/视觉各归一汇总X^{k−1}，post-attn residual h，E=2−cos(h,CT)−cos(h,CV)，超阈Slerp toward normalized(.44CV+.56CT) β.062，later γ.51 smoothing；CHAIR15.7→6.7、recall75.2→75.6。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06050",
      "title": "MATE: Adaptive Long- and Short-Term User Memory for LLM-Based Recommendation",
      "published": "2026-10-05T09:44:24Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.06050",
          "title": "MATE: Adaptive Long- and Short-Term User Memory for LLM-Based Recommendation",
          "published": "2026-10-05T09:44:24Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "MATE 在 ML10M、Amazon Luxury Beauty、KuaiRec2.0 做完整目录离线 streaming replay，预测先于记忆更新；不是线上曝光试验。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06050",
              "location": "Experiments: datasets and streaming protocol"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.06050",
            "url": "https://arxiv.org/html/2610.06050v1",
            "sha256": "9ea0782369b7ba706113c457fb407e1129c78d3c59232b1e9e8791ba7040c58b",
            "status": "downloaded",
            "characters": 84206,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06047",
      "title": "Let the Agent Do It? How Software Practitioners Understand and Make Permission Decisions in Agentic AI Assistants",
      "published": "2026-10-05T09:43:54Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06047",
          "title": "Let the Agent Do It? How Software Practitioners Understand and Make Permission Decisions in Agentic AI Assistants",
          "published": "2026-10-05T09:43:54Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06047",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "从业者权限决策访谈/调查，非算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06039",
      "title": "MercerFlow: Flow Matching in a Kernel-Induced Latent Space for Probabilistic Forecasting",
      "published": "2026-10-05T09:38:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06039",
          "title": "MercerFlow: Flow Matching in a Kernel-Induced Latent Space for Probabilistic Forecasting",
          "published": "2026-10-05T09:38:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MercerFlow针对概率时序预测的核潜空间建模，未宣称通用基础模型预训练。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06039",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06026",
      "title": "Differentiable Bit-Widths: Co-optimizing Pruning and Quantization via SVD for Ultra-Efficient LLM Compression",
      "published": "2026-10-05T09:25:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06026",
          "title": "Differentiable Bit-Widths: Co-optimizing Pruning and Quantization via SVD for Ultra-Efficient LLM Compression",
          "published": "2026-10-05T09:25:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DBW按SVD分量学习含0的位宽，STE加Hamilton剩余位分配、矩阵级预算和奇异值熵正则，联合剪枝与低比特量化。公开训练/评估实现适合压缩算子候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06026",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06026v1",
              "location": "§2.2/Eq1–4/Algorithm1; §2.3; §3.1–3.2; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.06026v1",
              "location": "§2.2/Eq1–4/Algorithm1; §2.3; §3.1–3.2; official README",
              "notes": "DBW按SVD分量学习含0的位宽，STE加Hamilton剩余位分配、矩阵级预算和奇异值熵正则，联合剪枝与低比特量化。公开训练/评估实现适合压缩算子候选。"
            }
          ],
          "source": "https://arxiv.org/html/2610.06026v1",
          "locations": [
            "§2.2/Eq1–4/Algorithm1",
            "§2.3",
            "§3.1–3.2",
            "official README"
          ],
          "limitations": "4096×2048 RedPajama校准、1.61bpw与group128；需统计U/V尺度和真实packed存储而非fake quant。64token时多GEMM启动不如OmniQuant快，长序列优势不能泛化成低延迟decode。GPU训练和内核须独立A100/A30验证；官方许可未在首页明确。",
          "code_url": "https://github.com/MMAI-Laboratory/DBW",
          "code_status": "official training/evaluation and HF checkpoints linked; not run",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06026v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "DBW按SVD分量学习含0的位宽，STE加Hamilton剩余位分配、矩阵级预算和奇异值熵正则，联合剪枝与低比特量化。公开训练/评估实现适合压缩算子候选。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06025",
      "title": "Grounded Joint-Attention Other-Play for Zero-Shot Coordination",
      "published": "2026-10-05T09:23:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06025",
          "title": "Grounded Joint-Attention Other-Play for Zero-Shot Coordination",
          "published": "2026-10-05T09:23:11Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06025",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "MATE视觉joint-attention传统MARL，非LLM工具Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06021",
      "title": "Scalable Minimal-Change Learning for Controllable Image Editing",
      "published": "2026-10-05T09:18:55Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06021",
          "title": "Scalable Minimal-Change Learning for Controllable Image Editing",
          "published": "2026-10-05T09:18:55Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Arro VLM分别审计未实现/意外变化，group内LLM去重统一rubric再VLM Boolean核验，负count两channel独立标准化→加权→batch重归一后flowGDPO；不是简单单reward求和。MinEval10k/600disjoint另MagicBrush/AnyBench/EmuEdit，模型judge分数非生产AB，需计group auditor预算与外部judges。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06021",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.06021v1",
              "location": "§3.2–3.4式4–8；§4.1–4.4；Appendix B/E/F"
            },
            {
              "url": "https://arxiv.org/html/2610.06021v1",
              "location": "§3.2–3.4式4–8；§4.1–4.4；Appendix B/E/F",
              "notes": "Arro VLM分别审计未实现/意外变化，group内LLM去重统一rubric再VLM Boolean核验，负count两channel独立标准化→加权→batch重归一后flowGDPO；不是简单单reward求和。MinEval10k/600disjoint另MagicBrush/AnyBench/EmuEdit，模型judge分数非生产AB，需计group auditor预算与外部judges。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.06021v1",
          "locations": [
            "§3.2–3.4式4–8；§4.1–4.4；Appendix B/E/F"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Arro VLM分别审计未实现/意外变化，group内LLM去重统一rubric再VLM Boolean核验，负count两channel独立标准化→加权→batch重归一后flowGDPO；不是简单单reward求和。MinEval10k/600disjoint另MagicBrush/AnyBench/EmuEdit，模型judge分数非生产AB，需计group auditor预算与外部judges。"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.06021",
          "title": "Scalable Minimal-Change Learning for Controllable Image Editing",
          "published": "2026-10-05T09:18:55Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06021v1",
          "location": "§3.2–3.4；§4；§5 Limitations；Appendix B/E/F",
          "decision": "accepted",
          "reason": "ARRO以VLM列出未实施与意外修改，再用组共享原子rubric二次审核，分别group-normalize两通道奖励并batch-renormalize优势，以flow-GDPO训练编辑器。适合多模态后训练/Agent reward跨轨收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06021",
          "limitations": "约10K MinEval训练与heldout分离；EditScore与分割OffTarget-L1依赖judge/perception，不能当完整语义正确率。单训练种子且未建立diffusion迁移；约束保留Kontext真实训练，启发式audit只能诊断。",
          "code": "https://github.com/Showwwwwwwww/ARRO",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06019",
      "title": "Adaptive Expert Guidance for Efficient On-Policy Reinforcement Learning",
      "published": "2026-10-05T09:18:27Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06019",
          "title": "Adaptive Expert Guidance for Efficient On-Policy Reinforcement Learning",
          "published": "2026-10-05T09:18:27Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.06019",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "PPO learner/expert控制份额联合学习，传统RL无语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06018",
      "title": "Investigating Query-Insensitive Behavior in Spatio-Temporal Video Grounding",
      "published": "2026-10-05T09:17:57Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.06018",
          "title": "Investigating Query-Insensitive Behavior in Spatio-Temporal Video Grounding",
          "published": "2026-10-05T09:17:57Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "视频grounding查询不敏感的诊断，无新能力训练算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.06018",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.06001",
      "title": "AgentSpy: Making AI Agent Behavior Observable",
      "published": "2026-10-05T08:55:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.06001",
          "title": "AgentSpy: Making AI Agent Behavior Observable",
          "published": "2026-10-05T08:55:52Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.06001v1",
          "location": "§3.1–3.4；§4.1–4.2；Threats to validity；§6",
          "decision": "accepted",
          "reason": "AgentSpy 在隔离microVM外记录进程树系统调用/网络，再按命令、文件、主机的归一化计数构造star graph与weighted Jaccard，可作为独立可观测性机制候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.06001",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.4",
            "§4.1–4.2",
            "Threats to validity",
            "§6"
          ],
          "limitations": "77/87任务、三次运行；超时选择性重试/丢弃会改变样本。资源相似不代表任务正确、读取skill不代表使用知识；RQ2作者在指标可见下标注，非盲验证。安全五类只检测四类，不能宣称完整防护。Linux microVM/内核权限需独立验证，所有监控仅限授权沙箱，源码入口未在原文找到。",
          "code_status": "not_found_in_paper_or_targeted_search; independent mechanism implementation only",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05994",
      "title": "How (and How Not) to Use Data Augmentation in VLA Post-Training",
      "published": "2026-10-05T08:48:13Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05994",
          "title": "How (and How Not) to Use Data Augmentation in VLA Post-Training",
          "published": "2026-10-05T08:48:13Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "VLA 数据增强为具身基础模型方向，已转基础模型审查。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05994",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "foundation-model",
          "id": "2610.05994",
          "title": "Where and When Does Image Augmentation Help VLAs?",
          "decision": "accepted",
          "review_level": "fulltext",
          "kind": "post_training_cross_track",
          "reason": "VLA PPO critic-only图像增强在clean actor/rollout上通过advantage影响策略，是真实可复现训练干预；可作后训练/机器人研究候选，不是工业推荐结果。",
          "official_url": "https://arxiv.org/html/2610.05994v1",
          "locations": [
            "§3/Table1",
            "§4/Tables2–3",
            "§5",
            "Limitations"
          ],
          "evidence": "pi0.5/GR00TN1.5冻结VLM，只训actionexpert+valuehead；Flow-SDE计算logprob；300epoch每512episodes，LIBEROPlus1662任务五视觉轴；最优OOD+7.8/+10.0。",
          "limitations": "critic-only需要额外backbone forward，matched epochs不等FLOPs；每配置一个训练seed，重复同checkpoint评估不是训练重复；最佳增强类型/强度应另设validation，仿真结果不等真实机器人。",
          "implementation_status": "not_implemented",
          "fulltext_review_completed": true
        },
        {
          "track": "post-training",
          "id": "2610.05994",
          "title": "How (and How Not) to Use Data Augmentation in VLA Post-Training",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "使用既有PPO/Flow-SDE比较augmentation placement，贡献是critic-only增强经验规则，而非新的RL/OPD核心算法。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.05994v1",
              "location": "§3 Experimental Framework；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "针对方法、实验协议与主要结果的正文定向核查；非逐字通读全部附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05993",
      "title": "From Transformation to Target State: Rethinking Query Representation for Zero-Shot Composed Image Retrieval",
      "published": "2026-10-05T08:47:15Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05993",
          "title": "From Transformation to Target State: Rethinking Query Representation for Zero-Shot Composed Image Retrieval",
          "published": "2026-10-05T08:47:15Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ASAP-CIR冻结MLLM把reference+edit重构多holistic静态target描述与weighted atomicfacts，CLIP global及patchsoftmax匹配分别query-wise zscore融合。FashionIQ val/CIRR test1/CIRCO test，无任务训练但有dataset-specific prompts，不能称无任务设计/无额外MLLM成本。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05993",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05993v1",
              "location": "§3.2式1–3；§3.3式4起；§4.1–4.4"
            },
            {
              "url": "https://arxiv.org/html/2610.05993v1",
              "location": "§3.2式1–3；§3.3式4起；§4.1–4.4",
              "notes": "ASAP-CIR冻结MLLM把reference+edit重构多holistic静态target描述与weighted atomicfacts，CLIP global及patchsoftmax匹配分别query-wise zscore融合。FashionIQ val/CIRR test1/CIRCO test，无任务训练但有dataset-specific prompts，不能称无任务设计/无额外MLLM成本。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05993v1",
          "locations": [
            "§3.2式1–3；§3.3式4起；§4.1–4.4"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "ASAP-CIR冻结MLLM把reference+edit重构多holistic静态target描述与weighted atomicfacts，CLIP global及patchsoftmax匹配分别query-wise zscore融合。FashionIQ val/CIRR test1/CIRCO test，无任务训练但有dataset-specific prompts，不能称无任务设计/无额外MLLM成本。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05982",
      "title": "Breaking the Tie: A Cluster-Aware Routing Framework for Large Language Models",
      "published": "2026-10-05T08:35:05Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05982",
          "title": "Breaking the Tie: A Cluster-Aware Routing Framework for Large Language Models",
          "published": "2026-10-05T08:35:05Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "CASLR对查询聚类，用簇内专家正确数构造masked软标签训练BERT router；算法清晰，但独立训练/校准/测试切分和标签统计范围未交代完整，先暂缓能力对比。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05982",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05982v1",
              "location": "§4 Eq4–9; §5.2–5.3; §5 routing cost; Appendix A"
            },
            {
              "url": "https://arxiv.org/html/2610.05982v1",
              "location": "§4 Eq4–9; §5.2–5.3; §5 routing cost; Appendix A",
              "notes": "CASLR对查询聚类，用簇内专家正确数构造masked软标签训练BERT router；算法清晰，但独立训练/校准/测试切分和标签统计范围未交代完整，先暂缓能力对比。"
            }
          ],
          "source": "https://arxiv.org/html/2610.05982v1",
          "locations": [
            "§4 Eq4–9",
            "§5.2–5.3",
            "§5 routing cost",
            "Appendix A"
          ],
          "limitations": "正确性只能用于训练集标注，不能用待测集构造簇级utility；正文未找到具体split/seed或作者代码。1.13秒router成本应如实计入，不称几乎零开销；新专家加入需重新统计而非直接泛化。",
          "code_status": "not_found_in_paper",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.05982v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "CASLR对查询聚类，用簇内专家正确数构造masked软标签训练BERT router；算法清晰，但独立训练/校准/测试切分和标签统计范围未交代完整，先暂缓能力对比。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05981",
      "title": "Mechanizing the User's Eye: Pre-Registered Deployment of a Sabotage-Validated Fail-Plausible Observer in a Production LLM Agent Runtime",
      "published": "2026-10-05T08:34:18Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05981",
          "title": "Mechanizing the User's Eye: Pre-Registered Deployment of a Sabotage-Validated Fail-Plausible Observer in a Production LLM Agent Runtime",
          "published": "2026-10-05T08:34:18Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05981v1",
          "location": "§3–5 Tables1–3；§6 Table4；§7 Table5；§9；官方docs/fail_plausible_bench.md与LICENSE",
          "decision": "accepted",
          "reason": "接受小规模Agent可靠性回归基准：五确定性signals→带verbatim substring证据闸门的LLM judge；14例公开offline corpus+逐detector sabotage+固定manifest/评分器，适合evolve防退化diagnostic而非通用能力分。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "MIT官方bisdom-cell/openclaw-model-bridge已核llm_observer_selfcheck.py/groundtruth/bench文档；6/6 regression、0/4 FP、heldout0/4；生产26shadow clean、12on days零触发，precision/latency/recall均未测得，不是100%或A/B。",
          "limitations": "24 incidents中16结构不可见；规则由历史例设计，CategoryA是回归非泛化；4个heldout太小，不能让优化器看gold/期望signal。官方仓库修正旧约70%user发现为13/22=59%，论文继承旧数，引用必须标版本。无独立标注，2/14日缺失；公共runner未在本轮执行。",
          "code": "https://github.com/bisdom-cell/openclaw-model-bridge",
          "license": "MIT",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05978",
      "title": "Byte Language Models: Scaling, Emergent Abstractions, and Information Allocation",
      "published": "2026-10-05T08:29:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05978",
          "title": "Byte Language Models: Scaling, Emergent Abstractions, and Information Allocation",
          "published": "2026-10-05T08:29:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Byte模型256vocab+hash ngram/DeltaNetconv16+前30%四byte TST后70%NTP，与subword做IsoFLOPs而非相同text exposure；late-layer pooledspan干预为诊断，200M分段模型不可省略。speculative仅给定evaltext的oracle simulation非真实decoded latency，不能把3.4×接受token当3.4×提速。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05978",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05978v1",
              "location": "§2.1–2.4；§3.2；§4.2/Table 3；Appendix G"
            },
            {
              "url": "https://arxiv.org/html/2610.05978v1",
              "location": "§2.1–2.4；§3.2；§4.2/Table 3；Appendix G",
              "notes": "Byte模型256vocab+hash ngram/DeltaNetconv16+前30%四byte TST后70%NTP，与subword做IsoFLOPs而非相同text exposure；late-layer pooledspan干预为诊断，200M分段模型不可省略。speculative仅给定evaltext的oracle simulation非真实decoded latency，不能把3.4×接受token当3.4×提速。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05978v1",
          "locations": [
            "§2.1–2.4；§3.2；§4.2/Table 3；Appendix G"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Byte模型256vocab+hash ngram/DeltaNetconv16+前30%四byte TST后70%NTP，与subword做IsoFLOPs而非相同text exposure；late-layer pooledspan干预为诊断，200M分段模型不可省略。speculative仅给定evaltext的oracle simulation非真实decoded latency，不能把3.4×接受token当3.4×提速。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05961",
      "title": "Strategic Multi-Agent Learning for Interpretable Action Valuation of All Players in Football",
      "published": "2026-10-05T08:13:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05961",
          "title": "Strategic Multi-Agent Learning for Interpretable Action Valuation of All Players in Football",
          "published": "2026-10-05T08:13:42Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05961",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "足球球员动态博弈action valuation，非LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05949",
      "title": "Technical Report on the Turba Fertilizer Machine Learning Stack in Morocco",
      "published": "2026-10-05T08:04:09Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05949",
          "title": "Technical Report on the Turba Fertilizer Machine Learning Stack in Morocco",
          "published": "2026-10-05T08:04:09Z",
          "repository_status": "new",
          "decision": "out_of_scope",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "Turba 是摩洛哥施肥建议函数的代理回归和数据工程，不是互联网搜广推或通用 LLM 算法。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05949",
              "location": "Abstract"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05940",
      "title": "ReMem: Streaming Video Understanding With Long Context Retention",
      "published": "2026-10-05T07:56:41Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05940",
          "title": "ReMem: Streaming Video Understanding With Long Context Retention",
          "published": "2026-10-05T07:56:41Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ReMem训练外SCM以固定generalquery注意力选择递归压缩、保留RoPE原位+时间offset；RVM clip pooledkey与query向量cos检索topclip，有限FIFO淘汰，非无限无损记忆。Streaming/OVO/长视频与NIAH；r=.7在StreamingBench SQA选择，正式复现必须重建validation并不能把调参集成绩作为独立test。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05940",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05940v1",
              "location": "Methodology/SCM/GQC/RVM式1–3；Experiments；Appendix A compression-ratio study"
            },
            {
              "url": "https://arxiv.org/html/2610.05940v1",
              "location": "Methodology/SCM/GQC/RVM式1–3；Experiments；Appendix A compression-ratio study",
              "notes": "ReMem训练外SCM以固定generalquery注意力选择递归压缩、保留RoPE原位+时间offset；RVM clip pooledkey与query向量cos检索topclip，有限FIFO淘汰，非无限无损记忆。Streaming/OVO/长视频与NIAH；r=.7在StreamingBench SQA选择，正式复现必须重建validation并不能把调参集成绩作为独立test。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05940v1",
          "locations": [
            "Methodology/SCM/GQC/RVM式1–3；Experiments；Appendix A compression-ratio study"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "ReMem训练外SCM以固定generalquery注意力选择递归压缩、保留RoPE原位+时间offset；RVM clip pooledkey与query向量cos检索topclip，有限FIFO淘汰，非无限无损记忆。Streaming/OVO/长视频与NIAH；r=.7在StreamingBench SQA选择，正式复现必须重建validation并不能把调参集成绩作为独立test。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05935",
      "title": "ThunderSyncRL: Lossless Acceleration of Agentic Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05935",
          "title": "ThunderSyncRL: Lossless Acceleration of Agentic Reinforcement Learning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "ThunderSyncRL用固定策略版本、GRPO双梯度累积和OPD按token延迟归一化在单次optimizer barrier前流式计算，数学更新等价；B200/H200数值核查和真实agent训练，不应把异步陈旧梯度代理当复现。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05935",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05935v1",
              "location": "§3.3–3.4 Eq.1–9；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05935",
          "title": "ThunderSyncRL: Lossless Acceleration of Agentic Reinforcement Learning",
          "published": "2026-10-05T07:51:46Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05935v1",
          "location": "§3.3–3.4 Eq.1–9；§4",
          "decision": "accepted",
          "reason": "ThunderSyncRL用固定策略版本、GRPO双梯度累积和OPD按token延迟归一化在单次optimizer barrier前流式计算，数学更新等价；B200/H200数值核查和真实agent训练，不应把异步陈旧梯度代理当复现。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05897",
      "title": "Fitting Vision Adapters at Frontier Scales",
      "published": "2026-10-05T07:13:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05897",
          "title": "Fitting Vision Adapters at Frontier Scales",
          "published": "2026-10-05T07:13:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "仅约50M vision projector连接冻结encoder/reader，sharedvocab affine embedding对齐初始化、SFT空think后仅adapter CISPO image-math RL恢复reasoning，正reward需非空reason/answer。Qwen4–32B同recipe可控，550/743B MoE训练/奖励不同不能规模因果比较；blind/图像破坏验证是关键。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05897",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05897v1",
              "location": "§3.1–3.3式3–5；§4.1–4.4；Appendix A.2/C"
            },
            {
              "url": "https://arxiv.org/html/2610.05897v1",
              "location": "§3.1–3.3式3–5；§4.1–4.4；Appendix A.2/C",
              "notes": "仅约50M vision projector连接冻结encoder/reader，sharedvocab affine embedding对齐初始化、SFT空think后仅adapter CISPO image-math RL恢复reasoning，正reward需非空reason/answer。Qwen4–32B同recipe可控，550/743B MoE训练/奖励不同不能规模因果比较；blind/图像破坏验证是关键。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05897v1",
          "locations": [
            "§3.1–3.3式3–5；§4.1–4.4；Appendix A.2/C"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "仅约50M vision projector连接冻结encoder/reader，sharedvocab affine embedding对齐初始化、SFT空think后仅adapter CISPO image-math RL恢复reasoning，正reward需非空reason/answer。Qwen4–32B同recipe可控，550/743B MoE训练/奖励不同不能规模因果比较；blind/图像破坏验证是关键。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05896",
      "title": "TasteRoute: Personalized Routing for Video Generation",
      "published": "2026-10-05T07:12:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05896",
          "title": "TasteRoute: Personalized Routing for Video Generation",
          "published": "2026-10-05T07:12:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "TasteRoute frozen request embedding+generator/user embedding与交叉特征，BTpairwise+ordinalquality，general五fold prompt隔离、personal每annotator独立train/val/test且userdropout.4；不生成video直接预算内排序。仅9annotator/3128video，冲突偏好准确55.2%增益有限，不泛化到大众用户，oracle verifier结果不可作可部署能力。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05896",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05896v1",
              "location": "§4；§6.1–6.2式1–3；§7；§9.2"
            },
            {
              "url": "https://arxiv.org/html/2610.05896v1",
              "location": "§4；§6.1–6.2式1–3；§7；§9.2",
              "notes": "TasteRoute frozen request embedding+generator/user embedding与交叉特征，BTpairwise+ordinalquality，general五fold prompt隔离、personal每annotator独立train/val/test且userdropout.4；不生成video直接预算内排序。仅9annotator/3128video，冲突偏好准确55.2%增益有限，不泛化到大众用户，oracle verifier结果不可作可部署能力。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05896v1",
          "locations": [
            "§4；§6.1–6.2式1–3；§7；§9.2"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "TasteRoute frozen request embedding+generator/user embedding与交叉特征，BTpairwise+ordinalquality，general五fold prompt隔离、personal每annotator独立train/val/test且userdropout.4；不生成video直接预算内排序。仅9annotator/3128video，冲突偏好准确55.2%增益有限，不泛化到大众用户，oracle verifier结果不可作可部署能力。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05885",
      "title": "The Optimization Landscape of Learning Compacted Context Models",
      "published": "2026-10-05T07:00:44Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05885",
          "title": "The Optimization Landscape of Learning Compacted Context Models",
          "published": "2026-10-05T07:00:44Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Fast Diamond简化Perceiver KV writer有明确单次/递归压缩及预算对照，保留为学习型KV压缩算法；正文readout矛盾已由canonical附录解读为frozen并显式记录。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05885",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05885v1",
              "location": "§2–5; §6.1–6.3; §8; AppA Table2/G Fig20"
            },
            {
              "url": "https://arxiv.org/html/2610.05885v1",
              "location": "§2–5; §6.1–6.3; §8; AppA Table2/G Fig20",
              "notes": "unrotateKV拼256维，单crosshead直接latentquery，L2normalize+RoPE，trainWK/WV/WO；AppA输出readoutfrozen截断identity。独立256medical docs758MCQ8k→1k，recurrentpersistent1k query/answer不计预算。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.05885v1",
          "locations": [
            "§2–5",
            "§6.1–6.3",
            "§8",
            "AppA Table2/G Fig20"
          ],
          "limitations": "§5末句leave trainable与前文frozen及AppA冲突，必须以canonical冻结契约并保留偏差注记；code/data承诺camera-ready未公开，医学OOD固定集需补资源；16/32k反复压缩弱于StreamingH2O；归一utility非原始acc，不能把questionexcludedbudget作总内存。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "unrotateKV拼256维，单crosshead直接latentquery，L2normalize+RoPE，trainWK/WV/WO；AppA输出readoutfrozen截断identity。独立256medical docs758MCQ8k→1k，recurrentpersistent1k query/answer不计预算。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05879",
      "title": "Learning to Learn a Language",
      "published": "2026-10-05T06:52:58Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05879",
          "title": "Learning to Learn a Language",
          "published": "2026-10-05T06:52:58Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "PFLM以每序列新采样的recurrent SCM先验进行byte-level预训练，再冻结权重从长前缀学习预测；核心数据生成定义与300M模型/权重公开，属于基础模型新训练范式候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05879",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05879v1",
              "location": "§2.1–2.4 Eq1–3/Table1; §3–4 Table2; App A/B/D; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.05879v1",
              "location": "§2.1–2.4 Eq1–3/Table1; §3–4 Table2; App A/B/D; official README",
              "notes": "六种结构方程、随机稀疏图/activation/periodicrate/noise，8observedbinary quantization成256bytes；GDN:windowattention3:1，150Bsyntheticbytes 1k→1M六阶段。Wiki6languages32streams1Mbyte，numbersqueries不在demos，BPB逐字只看prefix。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.05879v1",
          "locations": [
            "§2.1–2.4 Eq1–3/Table1",
            "§3–4 Table2",
            "App A/B/D",
            "official README"
          ],
          "limitations": "BPB跨语言UTF8字节成本不同，不能当语言理解排名；未胜现代自然文本LM，数值任务大量shots不等零样本。官方repo核实model/HF integration/stream scoring，未证完整SCM生成/训练pipeline已释放；若复现训练须精确AppA prior不能用任意随机串替代。",
          "code_url": "https://github.com/cbl/prior-fitted-language-model",
          "weights_url": "https://huggingface.co/lennartcb/pflm1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "六种结构方程、随机稀疏图/activation/periodicrate/noise，8observedbinary quantization成256bytes；GDN:windowattention3:1，150Bsyntheticbytes 1k→1M六阶段。Wiki6languages32streams1Mbyte，numbersqueries不在demos，BPB逐字只看prefix。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05874",
      "title": "Global Communication or Graph-Specific Memory?",
      "published": "2026-10-05T06:43:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05874",
          "title": "Global Communication or Graph-Specific Memory?",
          "published": "2026-10-05T06:43:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "静态图Transformer全局共享记忆有效性诊断，非当前基础模型核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05874",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05872",
      "title": "Off-Policy Merging Beats On-Policy Self-Distillation for Continual Learning",
      "published": "2026-10-05T06:40:34Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05872",
          "title": "Off-Policy Merging Beats On-Policy Self-Distillation for Continual Learning",
          "published": "2026-10-05T06:40:34Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "以离策略donor微调增量、retention Fisher/KFAC敏感方向投影与缩放合并到当前模型，Qwen/OLMo持续学习验证；不同于2610.00767信念移植及旧GRAFT2609.37868轨迹交换。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05872",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05872v1",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）; §4 Algorithm 1；§5"
            },
            {
              "url": "https://arxiv.org/abs/2610.05872",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05872v1",
              "location": "§4 Algorithm 1；§5"
            }
          ],
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "review_provenance": "post_training_review正文审查复用；foundation核对交叉记录",
          "official_url": "https://arxiv.org/html/2610.05872v1",
          "locations": [
            "Abstract（输入检索工件中的完整摘要已逐条审阅）",
            "§4 Algorithm 1；§5"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": [
            {
              "url": "https://arxiv.org/abs/2610.05872",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05872v1",
              "location": "§4 Algorithm 1；§5"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.05872",
          "title": "Off-Policy Merging Beats On-Policy Self-Distillation for Continual Learning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "以离策略donor微调增量、retention Fisher/KFAC敏感方向投影与缩放合并到当前模型，Qwen/OLMo持续学习验证；不同于2610.00767信念移植及旧GRAFT2609.37868轨迹交换。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05872",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05872v1",
              "location": "§4 Algorithm 1；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05863",
      "title": "CCQ: A Multi-State Child Care Quality Dataset to Support AI for Children's Health Research",
      "published": "2026-10-05T06:30:09Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05863",
          "title": "CCQ: A Multi-State Child Care Quality Dataset to Support AI for Children's Health Research",
          "published": "2026-10-05T06:30:09Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CCQ儿童照护质量数据集及预测基准，非基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05863",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05861",
      "title": "Imagine to Act: High-Fidelity Data Synthesis via Image Editing World Model for Scalable GUI Agent Training",
      "published": "2026-10-05T06:28:58Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05861",
          "title": "Imagine to Act: High-Fidelity Data Synthesis via Image Editing World Model for Scalable GUI Agent Training",
          "published": "2026-10-05T06:28:58Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Infinite-Dreamer训练时从before/after/action/nextaction提delta；合成时AppDesigner text→delta驱动FLUX2Klein截图编辑，VLM筛step后SFT GUIactor。worldmodel AndroidControl train/val，actor仅合成、AndroidWorld/MobileWorld在线评；合成可用future设计但评测agent不能读gold nextstate/plan，worldmodel并非真实应用状态机。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05861",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05861v1",
              "location": "§3.2–3.5式1–8；§4.1；Appendix A.5/A.6"
            },
            {
              "url": "https://arxiv.org/html/2610.05861v1",
              "location": "§3.2–3.5式1–8；§4.1；Appendix A.5/A.6",
              "notes": "Infinite-Dreamer训练时从before/after/action/nextaction提delta；合成时AppDesigner text→delta驱动FLUX2Klein截图编辑，VLM筛step后SFT GUIactor。worldmodel AndroidControl train/val，actor仅合成、AndroidWorld/MobileWorld在线评；合成可用future设计但评测agent不能读gold nextstate/plan，worldmodel并非真实应用状态机。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05861v1",
          "locations": [
            "§3.2–3.5式1–8；§4.1；Appendix A.5/A.6"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Infinite-Dreamer训练时从before/after/action/nextaction提delta；合成时AppDesigner text→delta驱动FLUX2Klein截图编辑，VLM筛step后SFT GUIactor。worldmodel AndroidControl train/val，actor仅合成、AndroidWorld/MobileWorld在线评；合成可用future设计但评测agent不能读gold nextstate/plan，worldmodel并非真实应用状态机。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05842",
      "title": "HLA: Expressive Hybrid Linear Attention via Chunk-Wise Dynamic Mixing",
      "published": "2026-10-05T05:49:31Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05842",
          "title": "HLA: Expressive Hybrid Linear Attention via Chunk-Wise Dynamic Mixing",
          "published": "2026-10-05T05:49:31Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "HLA以query gate对完整chunk仿射GDN transition作identity插值并按时序复合，核心不同于固定state加权，适合长上下文结构operator。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05842",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05842v1",
              "location": "§3 Eq1–13; §4.1; §4.2–4.3 Tables1–4"
            },
            {
              "url": "https://arxiv.org/html/2610.05842v1",
              "location": "§3 Eq1–13; §4.1; §4.2–4.3 Tables1–4",
              "notes": "A_j/B_j完整转移，sigmoid nonnormalizedgate同时调A/B；当前chunk始终1且causalprefix；traincontinuous，infer<.1零化；100Btoken1.3B同batch/opt，RULER4–32k；H200decode额外13.9–18.8%。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.05842v1",
          "locations": [
            "§3 Eq1–13",
            "§4.1",
            "§4.2–4.3 Tables1–4"
          ],
          "limitations": "历史chunk状态随序列增长，不是常量memory或比原GDN更快；2x省存对tokenKV且未含所有router/activation；chunk/pool按LongBenchV2最优且trainp16evalp32需validation复核；静态任务，额外模块预算非FLOPs匹配。",
          "code_url": null,
          "kind": "core_algorithm",
          "implementation_status": "not_implemented",
          "fulltext_notes": "A_j/B_j完整转移，sigmoid nonnormalizedgate同时调A/B；当前chunk始终1且causalprefix；traincontinuous，infer<.1零化；100Btoken1.3B同batch/opt，RULER4–32k；H200decode额外13.9–18.8%。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05833",
      "title": "Request Order Matters: Cache-History Sensitivity in Selective KV-Cache Reuse for Rolling Agents",
      "published": "2026-10-05T05:37:22Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05833",
          "title": "Request Order Matters: Cache-History Sensitivity in Selective KV-Cache Reuse for Rolling Agents",
          "published": "2026-10-05T05:37:22Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05833v1",
          "location": "§2.2–3 Eq1与document-aligned selector；§4设置；§5 Tables1–4；§6",
          "decision": "accepted",
          "reason": "接受Agent长时rolling context的KV重计算机制诊断：固定5% token预算，按doc均值deviation选择整span及连续余量；对照token-top-k和其他连续块，核心证据支持contiguity而非document边界/评分本身。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "evidence": "Qwen3-8B+LMCache0.5.1/vLLM0.23，L4，7735请求/84doc窗口/5历史顺序；答案历史变异69→26.1%，约5.7× medianTTFT，单连续窗口消融最好92.8%。",
          "limitations": "仅逐字复制current文档的合成rolling任务，非真实Agent能力提升；chronological fullprefill fidelity86.8vs85.4无显著差异，reverse doc仅54.3%；latency仅prefill非端到端。未发现作者代码/完整工作负载发布，原数字复现受限；接受独立机制验证，不冒充论文完整复现。",
          "reviewer": "agent_review",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05828",
      "title": "Data-Driven Personas for Survey Simulation: Insights into Simulation Alignment Across Data-Access Regimes",
      "published": "2026-10-05T05:30:27Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05828",
          "title": "Data-Driven Personas for Survey Simulation: Insights into Simulation Alignment Across Data-Access Regimes",
          "published": "2026-10-05T05:30:27Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05828",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "群体persona调查仿真对数据来源敏感性分析。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05787",
      "title": "Constraint-Aware Conversational Job Recommendation in Code-Mixed Low-Resource Settings",
      "published": "2026-10-05T04:36:18Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05787",
          "title": "Constraint-Aware Conversational Job Recommendation in Code-Mixed Low-Resource Settings",
          "published": "2026-10-05T04:36:18Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "JobCCC/W-SCAR 用 988 标注对话与 22,410 个职位比较离线检索/多目标排序，没有线上部署或 A/B 证据。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05787",
              "location": "§5.1 dataset and evaluation"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.05787",
            "url": "https://arxiv.org/html/2610.05787v1",
            "sha256": "9c89e861c88e11d906842813f8aee4870562dba585525bb91dd4450a15da7f1d",
            "status": "downloaded",
            "characters": 69532,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05778",
      "title": "MedicalHarness: A Controlled Evaluation of LLMs and Agent Harnesses on Medical Tasks",
      "published": "2026-10-05T04:22:28Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05778",
          "title": "MedicalHarness: A Controlled Evaluation of LLMs and Agent Harnesses on Medical Tasks",
          "published": "2026-10-05T04:22:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05778v1",
          "location": "§3–6.1；§6.3/7；Appendix C/D/H；official README",
          "decision": "accepted",
          "reason": "MedicalHarness 的MH-Lab在相同执行循环中切换摘要、显式计划和工具发现接口，并将回答率、正确率、轨迹和成本分开；公开代码/MedTool可作为harness消融候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05778",
          "fulltext_review_completed": true,
          "locations": [
            "§3–6.1",
            "§6.3/7",
            "Appendix C/D/H",
            "official README"
          ],
          "limitations": "107任务三seed，grader/gold隔离，bootstrap按任务；产品harness对比不是完全单因素，MH-Lab才是组件控制实验。MedMemory病历文本私有且单独提供，不能标整套107任务可公开复现；MedWeb等需上游资产与条款，官方smoke使用脚本响应不是模型能力。只离线研究，不做临床部署。",
          "code_url": "https://github.com/REAL-Lab-NU/MedicalHarness",
          "code_status": "official harness/evaluator/MedTool accessible; private MedMemory and other upstream assets separate",
          "reviewer": "root",
          "code": "https://github.com/REAL-Lab-NU/MedicalHarness"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05774",
      "title": "AdaSpark: Adaptive DSpark with Online Learning for Tree Verification and N-gram Fill",
      "published": "2026-10-05T04:18:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05774",
          "title": "AdaSpark: Adaptive DSpark with Online Learning for Tree Verification and N-gram Fill",
          "published": "2026-10-05T04:18:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "AdaSpark将DSpark候选与请求内ngram合并，按路径接受概率排序合法树前缀，用在线低分位延迟模型和接受率模型选择验证宽度；可作为推测解码控制器候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05774",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05774v1",
              "location": "§3.1–3.4; §4.1/4.5–4.6; §5; official imparo README"
            },
            {
              "url": "https://arxiv.org/html/2610.05774v1",
              "location": "§3.1–3.4; §4.1/4.5–4.6; §5; official imparo README",
              "notes": "AdaSpark将DSpark候选与请求内ngram合并，按路径接受概率排序合法树前缀，用在线低分位延迟模型和接受率模型选择验证宽度；可作为推测解码控制器候选。"
            }
          ],
          "source": "https://arxiv.org/html/2610.05774v1",
          "locations": [
            "§3.1–3.4",
            "§4.1/4.5–4.6",
            "§5",
            "official imparo README"
          ],
          "limitations": "贪心而非任意sampling保证；空store冷启动55–67轮成本计入，跨请求持久化需绑定硬件/权重/内核。42会话95回复，循环到cap和单delta回复部分剔除；主增益含引擎优化，在线宽度仅打平最优固定宽度，不能全部归因新调度。官方Rust Metal/CUDA/CPU版本多变需pin。",
          "code_url": "https://github.com/zeraix/imparo",
          "code_status": "official Apache2 engine accessible; exact paper revision requires pinning",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05774v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "AdaSpark将DSpark候选与请求内ngram合并，按路径接受概率排序合法树前缀，用在线低分位延迟模型和接受率模型选择验证宽度；可作为推测解码控制器候选。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05750",
      "title": "Beyond Semantic Similarity: Performance and Costs of Agentic Retrieval for Complex Tasks",
      "published": "2026-10-05T03:55:10Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05750",
          "title": "Beyond Semantic Similarity: Performance and Costs of Agentic Retrieval for Complex Tasks",
          "published": "2026-10-05T03:55:10Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05750",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "既有ReAct检索成本/效果研究，无独立新核心机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05744",
      "title": "CIPHER-MoE: Balancing Efficiency and Routing Fidelity in Trillion-Scale MoE Training",
      "published": "2026-10-05T03:51:17Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05744",
          "title": "CIPHER-MoE: Balancing Efficiency and Routing Fidelity in Trillion-Scale MoE Training",
          "published": "2026-10-05T03:51:17Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CIPHER-MoE保持tokenTopK，专家端cosine affinity与capacity admission加locality loss，区分严格drop与reroute，有真实大规模SFT效率/质量证据。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05744",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05744v1",
              "location": "§3.2 Eq4–10; §4 Tables2–3; AppA.4/A.5"
            },
            {
              "url": "https://arxiv.org/html/2610.05744v1",
              "location": "§3.2 Eq4–10; §4 Tables2–3; AppA.4/A.5",
              "notes": "capacity factor8，reroutefill4；assignment丢弃不删除token/loss、sharedexperts全处理；284B–1.6T domainSFT，测得1.10–1.94x；1.6T vanillaOOM需以fixedrouter对照。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.05744v1",
          "locations": [
            "§3.2 Eq4–10",
            "§4 Tables2–3",
            "AppA.4/A.5"
          ],
          "limitations": "定理依赖球面/条件recall假设仅保证信号保留非质量；zeroassignment梯度及weight renorm实现必须严格还原；code正文willrelease未公开；非工业在线AB结论、不能把1.6T OOM对比当数值speedup。",
          "code_url": null,
          "kind": "core_algorithm",
          "implementation_status": "not_implemented",
          "fulltext_notes": "capacity factor8，reroutefill4；assignment丢弃不删除token/loss、sharedexperts全处理；284B–1.6T domainSFT，测得1.10–1.94x；1.6T vanillaOOM需以fixedrouter对照。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05715",
      "title": "Rotated, but How Far? Diagnosing and Improving Object-Rotation Reasoning in VLMs",
      "published": "2026-10-05T02:55:27Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05715",
          "title": "Rotated, but How Far? Diagnosing and Improving Object-Rotation Reasoning in VLMs",
          "published": "2026-10-05T02:55:27Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "RotationCue 使用三个可学习关系查询，顺序预测对象同一性、旋转存在与角度范围，将条件化角度提示注入冻结 VLM。ALOI/ModelNet40 可构造训练，OR-Bench 为对象隔离的完整测试集。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05715",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.05715v1",
              "location": "§3–5.4; Appendix F/H",
              "notes": "RotationCue 使用三个可学习关系查询，顺序预测对象同一性、旋转存在与角度范围，将条件化角度提示注入冻结 VLM。ALOI/ModelNet40 可构造训练，OR-Bench 为对象隔离的完整测试集。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05715v1",
          "locations": [
            "§3–5.4; Appendix F/H"
          ],
          "limitations": "Oracle 角度提示仅诊断；方位旋转不是二维图像旋转；应保留对象级隔离和打乱提示对照。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "RotationCue 使用三个可学习关系查询，顺序预测对象同一性、旋转存在与角度范围，将条件化角度提示注入冻结 VLM。ALOI/ModelNet40 可构造训练，OR-Bench 为对象隔离的完整测试集。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05709",
      "title": "Nexus: An Execution Fabric for AI Agents Across Cloud, Edge, and Devices",
      "published": "2026-10-05T02:47:01Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05709",
          "title": "Nexus: An Execution Fabric for AI Agents Across Cloud, Edge, and Devices",
          "published": "2026-10-05T02:47:01Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05709v1",
          "location": "§3–4；§5.7；§6.1–6.3；Software and Documentation；Appendix D/E",
          "decision": "accepted",
          "reason": "Nexus将调用持久化为task，使用invocation-scoped委托、operation journal、device receipt及cursor恢复，明确已提交结果重用与不确定外部副作用的资源端协调。接受执行基础设施候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05709",
          "limitations": "单宿主OpenWrt/Android虚拟化控制实验，各机制未在一个版本端到端组合；24 paired任务中22共同成功延迟比较，不能忽略失败。Cloud admission/settlement仍中心依赖，CPU ceiling下降非实际商业成本；重复副作用抑制需资源配合。",
          "code": "https://github.com/Nexilume-AI",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05699",
      "title": "Planetary Geospatial Foundation Models for Global Public Health",
      "published": null,
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05699",
          "title": "Planetary Geospatial Foundation Models for Global Public Health",
          "decision": "out_of_scope",
          "review_level": "fulltext",
          "reason": "Google PDFM五项公共卫生下游案例均以已有embedding为固定协变量，不是新基础模型训练算法；原预训练代码专有、下游脚本不公开且多健康数据受限，不能当现成公共evolve执行任务。",
          "official_url": "https://arxiv.org/html/2610.05699v1",
          "code_url": "https://github.com/google-research/population-dynamics",
          "locations": [
            "§1–2/Table1",
            "§4 Methods/PDFM Embeddings",
            "Data Availability",
            "Code Availability"
          ],
          "evidence": "四国家五任务：疫苗、心血管、登革热、霍乱、产后抑郁；DRC样本稀疏时实际上用200维PCA而非同SSL encoder；论文明确off-the-shelf downstream非custom算法。",
          "limitations": "部分US v0 embedding公开，其余研究申请；不能将公共教程误称完整论文复现源码。",
          "institution": "Google及公共卫生学术合作机构",
          "implementation_status": "not_implemented",
          "fulltext_review_completed": true
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05697",
      "title": "From Token-Max to Outcome-Max: How You Use AI Determines Its Productivity",
      "published": "2026-10-05T02:16:26Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05697",
          "title": "From Token-Max to Outcome-Max: How You Use AI Determines Its Productivity",
          "published": "2026-10-05T02:16:26Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05697v1",
          "location": "§3–5；Appendix A.5 Algorithm1；C/D",
          "decision": "accepted",
          "reason": "TokenEcom按verified output/cost而非token量设模拟监督策略，跨代只传递可重用playbook，执行反馈提炼双方skill。公共SWE/HumanEval/GSM8K/MATH适合cost-aware evolve评测候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05697",
          "limitations": "人类由LLM模拟，directive同时改变停止行为，不能孤立归因纯奖励；310 matched主SWE对中hard任务正确率下降。skill20训练15heldout且100validation，gold仅外部评分；经济账户/审计罚款是假设，不是真实工作场所因果证据。",
          "code": "https://github.com/chenxu2-gif/TokenEcom",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05690",
      "title": "Errors of LLM-Assisted Literature Retrieval in Environmental Science: A Comparison Study of Abstract versus Full-text Based Prompts",
      "published": "2026-10-05T02:04:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05690",
          "title": "Errors of LLM-Assisted Literature Retrieval in Environmental Science: A Comparison Study of Abstract versus Full-text Based Prompts",
          "published": "2026-10-05T02:04:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "环境科学文献检索错误比较，不提出新基础模型方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05690",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05685",
      "title": "Spend Bytes on Breadth: Precision-Count Trade-offs for Decode-Time KV Compression in Long Chain-of-Thought Reasoning",
      "published": "2026-10-05T01:56:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05685",
          "title": "Spend Bytes on Breadth: Precision-Count Trade-offs for Decode-Time KV Compression in Long Chain-of-Thought Reasoning",
          "published": "2026-10-05T01:56:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "BreadthKV在相同decode KV字节预算下联合KIVI量化和SnapKV-D淘汰，以独立AIME22–23校准位宽，研究更广低精度缓存优于少量高精度缓存。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05685",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05685v1",
              "location": "§3 Eq1; §4–5.1; §5.7/kernel; Limitations; Appendix A/B"
            },
            {
              "url": "https://arxiv.org/html/2610.05685v1",
              "location": "§3 Eq1; §4–5.1; §5.7/kernel; Limitations; Appendix A/B",
              "notes": "BreadthKV在相同decode KV字节预算下联合KIVI量化和SnapKV-D淘汰，以独立AIME22–23校准位宽，研究更广低精度缓存优于少量高精度缓存。"
            }
          ],
          "source": "https://arxiv.org/html/2610.05685v1",
          "locations": [
            "§3 Eq1",
            "§4–5.1",
            "§5.7/kernel",
            "Limitations",
            "Appendix A/B"
          ],
          "limitations": "prompt保留且不计预算，fp16残差128–191token，预算误差约5%须另报实际memory-time；R1-Qwen AIME24是开发集而非测试。只有单sampling seed；内核H200一层一step并未端到端更快，int2反而慢。公开代码入口正文未找到，独立实现需保持真实packed量化与校准/测试分离。",
          "code_status": "not_found_in_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05685v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "BreadthKV在相同decode KV字节预算下联合KIVI量化和SnapKV-D淘汰，以独立AIME22–23校准位宽，研究更广低精度缓存优于少量高精度缓存。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05681",
      "title": "Automatic Speech Recognition for Low-Resource Sinhala: A Critical Review of Methods, Challenges, and Future Directions",
      "published": "2026-10-05T01:49:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05681",
          "title": "Automatic Speech Recognition for Low-Resource Sinhala: A Critical Review of Methods, Challenges, and Future Directions",
          "published": "2026-10-05T01:49:45Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "僧伽罗语ASR综述，无原始核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05681",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05670",
      "title": "Generate What You Can Trust: Content Credibility in Generative Recommenders",
      "published": "2026-10-05T01:33:29Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05670",
          "title": "Generate What You Can Trust: Content Credibility in Generative Recommenders",
          "published": "2026-10-05T01:33:29Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "CreGR 的证据为 PolitiFact/GossipCop/MHMisinfo 公共标签数据离线实验；正文承认更大规模评估仍待进行，未达到工业内容审核准入。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05670",
              "location": "Experiments; Limitations; Ethics"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.05670",
            "url": "https://arxiv.org/html/2610.05670v1",
            "sha256": "36ec66cb61fc1749b0cddd4820602e4f8cc58539f5aef341987e1d9f50d01ec4",
            "status": "downloaded",
            "characters": 102350,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05664",
      "title": "StageVLN: Spatial and Trajectory Auxiliary Guidance for Efficient Vision-Language Navigation",
      "published": "2026-10-05T01:20:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05664",
          "title": "StageVLN: Spatial and Trajectory Auxiliary Guidance for Efficient Vision-Language Navigation",
          "published": "2026-10-05T01:20:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "StageVLN多层current-image cosine对齐冻结geometryteacher，历史相对heading sin/cos与expert forward步比例progress辅助训练，pre-action hidden避免teacherforce读GT当前action。jointR2R/RxR train、valunseen，推理去teacher/projectors/heads；progress不是成功率也不是STOP规则。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05664",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05664v1",
              "location": "§III-C式2–5；§III-D式6–12；§III-E；§IV-A–D"
            },
            {
              "url": "https://arxiv.org/html/2610.05664v1",
              "location": "§III-C式2–5；§III-D式6–12；§III-E；§IV-A–D",
              "notes": "StageVLN多层current-image cosine对齐冻结geometryteacher，历史相对heading sin/cos与expert forward步比例progress辅助训练，pre-action hidden避免teacherforce读GT当前action。jointR2R/RxR train、valunseen，推理去teacher/projectors/heads；progress不是成功率也不是STOP规则。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05664v1",
          "locations": [
            "§III-C式2–5；§III-D式6–12；§III-E；§IV-A–D"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "StageVLN多层current-image cosine对齐冻结geometryteacher，历史相对heading sin/cos与expert forward步比例progress辅助训练，pre-action hidden避免teacherforce读GT当前action。jointR2R/RxR train、valunseen，推理去teacher/projectors/heads；progress不是成功率也不是STOP规则。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05637",
      "title": "Visual Grounding Safety in Vision-Language Models",
      "published": "2026-10-05T00:14:23Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05637",
          "title": "Visual Grounding Safety in Vision-Language Models",
          "published": "2026-10-05T00:14:23Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "grounding safety以相同intent VQA/定位匹配评测，SFT混harmfulrefusal+有中性证据的benignselfdistill+1548capabilitygrounding；plain和placeholder格式分别训LLM。最终坐标/回答而非think判refusal，定位失败也可能假安全故单列PointArena能力/overrefusal；placeholder非真实可执行坐标。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05637",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05637v1",
              "location": "§2.1–2.3；§3.1–3.4 Table 3；Appendix A"
            },
            {
              "url": "https://arxiv.org/html/2610.05637v1",
              "location": "§2.1–2.3；§3.1–3.4 Table 3；Appendix A",
              "notes": "grounding safety以相同intent VQA/定位匹配评测，SFT混harmfulrefusal+有中性证据的benignselfdistill+1548capabilitygrounding；plain和placeholder格式分别训LLM。最终坐标/回答而非think判refusal，定位失败也可能假安全故单列PointArena能力/overrefusal；placeholder非真实可执行坐标。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05637v1",
          "locations": [
            "§2.1–2.3；§3.1–3.4 Table 3；Appendix A"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "grounding safety以相同intent VQA/定位匹配评测，SFT混harmfulrefusal+有中性证据的benignselfdistill+1548capabilitygrounding；plain和placeholder格式分别训LLM。最终坐标/回答而非think判refusal，定位失败也可能假安全故单列PointArena能力/overrefusal；placeholder非真实可执行坐标。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05630",
      "title": "Atomic Visual Entailment: Enhancing Zero-Shot Vision-Language Reasoning through Atomic Fact Decomposition and Learned Selection",
      "published": "2026-10-04T23:46:35Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05630",
          "title": "Atomic Visual Entailment: Enhancing Zero-Shot Vision-Language Reasoning through Atomic Fact Decomposition and Learned Selection",
          "published": "2026-10-04T23:46:35Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "AVE冻结Decomposer原句拆atoms，两VLM direct/atomic候选pool；XGBoost以labelscore/entropy/agreement等meta预测最终label，非必选pool已有label，再取代表justification GroundingDINO定位。47,203train中20%val选后固定SNLI-VE dev/test，94%oracle不能当部署结果；Flickr30kEntities是近似证据定位非完整faithfulness。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05630",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05630v1",
              "location": "§3.1–3.4；§4.1；§4.3–4.6"
            },
            {
              "url": "https://arxiv.org/html/2610.05630v1",
              "location": "§3.1–3.4；§4.1；§4.3–4.6",
              "notes": "AVE冻结Decomposer原句拆atoms，两VLM direct/atomic候选pool；XGBoost以labelscore/entropy/agreement等meta预测最终label，非必选pool已有label，再取代表justification GroundingDINO定位。47,203train中20%val选后固定SNLI-VE dev/test，94%oracle不能当部署结果；Flickr30kEntities是近似证据定位非完整faithfulness。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05630v1",
          "locations": [
            "§3.1–3.4；§4.1；§4.3–4.6"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "AVE冻结Decomposer原句拆atoms，两VLM direct/atomic候选pool；XGBoost以labelscore/entropy/agreement等meta预测最终label，非必选pool已有label，再取代表justification GroundingDINO定位。47,203train中20%val选后固定SNLI-VE dev/test，94%oracle不能当部署结果；Flickr30kEntities是近似证据定位非完整faithfulness。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05622",
      "title": "UndoBench: Separating Task Competence from Recovery Capability in Tool-Using AI Agents",
      "published": "2026-10-04T23:36:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05622",
          "title": "UndoBench: Separating Task Competence from Recovery Capability in Tool-Using AI Agents",
          "published": "2026-10-04T23:36:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05622v1",
          "location": "§2–3；§6；Limitations；Appendix G/K/L；official README",
          "decision": "accepted",
          "reason": "UndoBench 对相同seed执行control/fault配对试验，以独立mutation log与state oracle区分能力、恢复、重复和漏执行，适合工具Agent容错评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05622",
          "fulltext_review_completed": true,
          "locations": [
            "§2–3",
            "§6",
            "Limitations",
            "Appendix G/K/L",
            "official README"
          ],
          "limitations": "36工作流14/10/12开发验证测试，20seed仍只有12独立测试cluster。主实验只单次lost-ACK，其他边界是后续扩展；CRSR零control成功时必须N/A。EvoUndo零权限约束不代表其完整能力，B6是事后对照，EOR由日志事后重算。只能本地模拟API，不连接真实支付/生产服务；冻结版本而非读取最新变化。",
          "code_url": "https://github.com/tradertanmay/undobench",
          "code_status": "official code/tasks/oracle/adapters accessible; not executed in this review",
          "reviewer": "root",
          "code": "https://github.com/tradertanmay/undobench"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05615",
      "title": "DREAM: Dynamic Resolution Assignment For Multimodal Multi-agent Debate",
      "published": "2026-10-04T23:23:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05615",
          "title": "DREAM: Dynamic Resolution Assignment For Multimodal Multi-agent Debate",
          "published": "2026-10-04T23:23:02Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "DREAM多agent辩论动态视觉分辨率，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05615",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05615",
          "title": "DREAM: Dynamic Resolution Assignment For Multimodal Multi-agent Debate",
          "published": "2026-10-04T23:23:02Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05615v1",
          "location": "§3.2–3.3 Eq3–4；§4–6；Appendix A/B/F/G",
          "decision": "accepted",
          "reason": "DREAM用多分辨率probe的ANLL均值减标准差形成confident set，五分支分配visual payload；丢弃probe历史后debate，按每agent ANLL轨迹回滚早期低不确定答案，再judge。适合多模态Agent推理候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05615",
          "limitations": "500例每benchmark、3推理seed；probe全响应logprobs真实计算，不能用伪置信度。α=.5在同测试benchmark sweep最优，与无tuning说法冲突，须validation重选。tokens增加，非节省总成本；LLaVA Div-MAD例外下降。代码仅承诺发布，未找到现有repo。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05600",
      "title": "An LLM-in-the-loop RL Framework for Bioinformatics Feature Selection",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05600",
          "title": "An LLM-in-the-loop RL Framework for Bioinformatics Feature Selection",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "RL用于生物特征选择，LLM提供建议和奖励但不更新LLM策略本身。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05600",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05600",
          "title": "An LLM-in-the-loop RL Framework for Bioinformatics Feature Selection",
          "published": "2026-10-04T23:05:21Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05600v1",
          "location": "§2–4；Experimental Evaluation",
          "decision": "out_of_scope",
          "reason": "LLM为bioinformatics feature selection的DQN提供soft行动建议和validation+知识奖励，策略为传统select/skip DQN，核心为领域特征筛选而非LLM后训练或通用Agent新机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05600",
          "limitations": "允许T=5d重复探索；标签应仅train/validation，下游test独立。公开数据名称不等于可复建split，未报告独立seed/源码；GPT4o生物建议非真实医学验证。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05591",
      "title": "What Is a Repeated Token Worth? The Scaling Geometry of Multi-Epoch Pretraining",
      "published": "2026-10-04T22:55:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05591",
          "title": "What Is a Repeated Token Worth? The Scaling Geometry of Multi-Epoch Pretraining",
          "published": "2026-10-04T22:55:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "rejected",
          "reason": "属于重复预训练经验缩放/数据排列研究，具体重分词干预直接采用既有BPE-dropout；不另建新算法adapter，可作为重复次数选择/数据预算审计的支撑文献。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05591",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05591v1",
              "location": "§3 Eq1–2; §4.1–4.4 Eq3–5; §6.2–6.3; §7 Limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.05591v1",
              "location": "§3 Eq1–2; §4.1–4.4 Eq3–5; §6.2–6.3; §7 Limitations",
              "notes": "23–361M grid175runs，成本z=(R-1)Ntotal/U；compute-matched freshbaseline，dev选recipe、heldoutbpb；同bytesBPEdropout.05在R8/16有利R1/4有害，间隔重播优于consecutive。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.05591v1",
          "locations": [
            "§3 Eq1–2",
            "§4.1–4.4 Eq3–5",
            "§6.2–6.3",
            "§7 Limitations"
          ],
          "limitations": "frontier是拟合曲面不是额外isoFLOP实测；无weightdecay/dropout配方，常数不能外推frontierLLM；BPE改变token数所以同bytes未必同FLOPs；不把lawanalysis当已验证通用选择器。",
          "code_status": "未在已核官方正文中找到作者源码入口；算法/实验描述可复核，未宣称源码已发布",
          "kind": "analysis",
          "implementation_status": "not_implemented",
          "fulltext_notes": "23–361M grid175runs，成本z=(R-1)Ntotal/U；compute-matched freshbaseline，dev选recipe、heldoutbpb；同bytesBPEdropout.05在R8/16有利R1/4有害，间隔重播优于consecutive。",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05586",
      "title": "AgentDoxx: Agentic Re-identification of Anonymized Text with Web Search",
      "published": "2026-10-04T22:41:04Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05586",
          "title": "AgentDoxx: Agentic Re-identification of Anonymized Text with Web Search",
          "published": "2026-10-04T22:41:04Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05586v1",
          "location": "§3.1–3.2；§4.1；§5/Limitations；Ethics/Data and release policy",
          "decision": "pending",
          "reason": "AgentDoxx对Agent去标识文本再识别风险做评测，但822合成访谈仍基于真实身份，作者明确不发布文本/gold，受控托管评测仅筹备中；暂缓接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05586",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.2",
            "§4.1",
            "§5/Limitations",
            "Ethics/Data and release policy"
          ],
          "limitations": "仅保留防御性隐私审计启示：联合测输出/检索泄露与匿名化效用。不得重建真实身份关联、抓取私人访谈或发布识别结果。真实1250访谈无身份gold，43匹配不能作准确率；样本只含主动公开身份者，不代表总体风险。纯虚构身份离线canary可以研究，但不得冒充官方AgentDoxx复现。",
          "code_status": "dataset/gold deliberately withheld; controlled service planned",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05572",
      "title": "Disentangling Task Difficulty from Run-Level Failure in Agent Failure Prediction",
      "published": "2026-10-04T22:17:04Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05572",
          "title": "Disentangling Task Difficulty from Run-Level Failure in Agent Failure Prediction",
          "published": "2026-10-04T22:17:04Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05572v1",
          "location": "§4.2–4.8 Eq1–2；§6.2–6.3；§7 scope",
          "decision": "accepted",
          "reason": "分解pooled AUROC为同任务/跨任务比较，以task-grouped交叉验证和绝对turn prefix区分任务难度与当前run失败信号，适合统一预算控制评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05572",
          "fulltext_review_completed": true,
          "locations": [
            "§4.2–4.8 Eq1–2",
            "§6.2–6.3",
            "§7 scope"
          ],
          "limitations": "oracle历史难度和半合成监控只诊断；按最终轨迹比例截断泄漏未来长度。早停相对预算分配无显著收益，阈值0.84–0.93不是通用规律；干预是recorded replay而非live，不能宣称已改善Agent。",
          "code_status": "public upstream corpora identified; complete author supplementary pipeline URL not located",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05569",
      "title": "Factoriax: A GPU-Accelerated Factorio-Style Simulator for Reinforcement Learning",
      "published": "2026-10-04T22:02:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05569",
          "title": "Factoriax: A GPU-Accelerated Factorio-Style Simulator for Reinforcement Learning",
          "published": "2026-10-04T22:02:44Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05569",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Factoriax工厂JAX模拟器与PPO基准，不是LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05563",
      "title": "G-CARB: Graph-Localized Conformal Agent Risk Budget for Compositional Harm",
      "published": "2026-10-04T21:49:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05563",
          "title": "G-CARB: Graph-Localized Conformal Agent Risk Budget for Compositional Harm",
          "published": "2026-10-04T21:49:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05563v1",
          "location": "§3–5 Algorithm1；Appendix B/C/D/G",
          "decision": "accepted",
          "reason": "CARB对stopped-prefix全episode harm ledger做finite-grid corrected conformal risk calibration；G-CARB只向固定scorer提供prefix-visible source-to-sink依赖路径，保留proposal空结果与threshold nesting。接受安全门控机制候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05563",
          "limitations": "保证是exchangeable episode期望loss，并非每轨迹安全或shift保证；ledger未独立误差审计。AgentDojo同corpus200重划分percentile非独立CI；equal-size随机context自然数据同等收益，图优势仅构造诊断。record-count节省非tokens/延迟，online64episode仅一致性诊断；未定位代码包。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05559",
      "title": "Cut Binary Cross Entropy: Efficient Large-Vocabulary Loss and Gradient Kernels for Sequential Recommendation",
      "published": "2026-10-04T21:47:02Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05559",
          "title": "Cut Binary Cross Entropy: Efficient Large-Vocabulary Loss and Gradient Kernels for Sequential Recommendation",
          "published": "2026-10-04T21:47:02Z",
          "repository_status": "new",
          "decision": "deferred",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "Google CutBCE 公开 JAX/Pallas TPU kernel，在 Yambda50M/SASRec 上测显存与速度；不是线上 A/B。TPU v5e/v6e 定义算子尚无本项目可验证环境，不能将普通 CUDA BCE 冒充复现，也不转基础模型以规避门槛。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05559",
              "location": "§IV hardware and §IV-B; §V"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.05559",
            "url": "https://arxiv.org/html/2610.05559v1",
            "sha256": "a9f1d3bf0c9d6c740d80760983128e731dd731a061e6bd0c0b5a49881ebe5463",
            "status": "downloaded",
            "characters": 28867,
            "errors": []
          }
        },
        {
          "track": "foundation-model",
          "id": "2610.05559",
          "title": "CutBCE",
          "decision": "reviewed_deferred",
          "review_level": "fulltext",
          "kind": "deferred_infrastructure",
          "reason": "已审明确TPU JAX/Pallas exactBCE基础设施，可保留研究候选；没有工业AB、不是LLM实验，当前NVIDIA复现路径不能代替原TPU内核，需TPU环境与单独接入范围批准。",
          "official_url": "https://arxiv.org/html/2610.05559v1",
          "code_url": "https://github.com/AI-Hypercomputer/RecML/blob/main/recml/core/ops/binary_cross_entropy_ops.py",
          "locations": [
            "§III-A Eq1–2",
            "§IV-B/TableIII",
            "§V"
          ],
          "evidence": "背景softplus+稀疏target correction/customVJP，Yambda50M876938items SASRec，8chipTPUv6e 300Ksteps。HBM22.37→7.67GiB、6.14→20.01step/s，Hit@8 .186→.183。",
          "limitations": "65.7%HBM与225.9%速度是TPUv6e，NVIDIA未验证；不能重命名foundation绕工业AB门槛。",
          "implementation_status": "not_implemented",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05540",
      "title": "SALUS: Automated Auditing of NL-to-SQL Benchmarks through Weak Supervision of Multi-Agent Output",
      "published": "2026-10-04T21:12:58Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05540",
          "title": "SALUS: Automated Auditing of NL-to-SQL Benchmarks through Weak Supervision of Multi-Agent Output",
          "published": "2026-10-04T21:12:58Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05540v1",
          "location": "§3.1–3.4；§4–5.1；§5.6；§6.1；Appendix A/B",
          "decision": "accepted",
          "reason": "SALUS对多agent候选SQL执行/结构/intent弱标记建generative label model，均衡高置信伪标签训练SQL-feature条件化agent reliability decision plane，融合verdict检测基准错误。适合评测质量基础设施候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05540",
          "limitations": "human审计298 BIRD-Clean-xs仅评估、训练/选择用弱标签；错误率37%为模型估计非全量gold。stacking65536规则上界明确使用eval gold只能oracle诊断；自动SQL修正只44%Incorrect SQL且不能修复问题歧义/数据错误。保留dev选择与heldout测试，勿由correlated模型一致推论真值。",
          "code": "https://github.com/ucisharadlab/SALUS",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05538",
      "title": "LiFT: Loop Flow Transformers",
      "published": "2026-10-04T21:11:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05538",
          "title": "LiFT: Loop Flow Transformers",
          "published": "2026-10-04T21:11:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "LiFT以随机连续深度坐标监督共享DiT核心的逐步速度修正，stop-gradient初始速度锚与prelude辅助损失保留核心机制；同训练token、块设计、执行深度与近等FLOPs的dense对照支持接入研究候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05538",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05538v1",
              "location": "§3.1–3.2 Eq4–9; §4.1–4.6 Tables1–2; Limitations; Appendix D.5.1/Table17"
            },
            {
              "url": "https://arxiv.org/html/2610.05538v1",
              "location": "§3.1–3.2 Eq4–9; §4.1–4.6 Tables1–2; Limitations; Appendix D.5.1/Table17",
              "notes": "各模型500K步batch256，32.768B latent tokens，额外head成本<0.2%。L/2四循环25sampler步FID13.16/7.397TFLOPs，dense50步16.94/8.069TFLOPs。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.05538v1",
          "locations": [
            "§3.1–3.2 Eq4–9",
            "§4.1–4.6 Tables1–2",
            "Limitations",
            "Appendix D.5.1/Table17"
          ],
          "limitations": "B/2所有成本点落后dense，所有LiFT在训练深度也落后；单次训练/样本，只有256图像无CFG。报告的是解析FLOPs非硬件速度。最优循环/采样步数来自公开FID sweep，未来接入须另设validation选配置。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "各模型500K步batch256，32.768B latent tokens，额外head成本<0.2%。L/2四循环25sampler步FID13.16/7.397TFLOPs，dense50步16.94/8.069TFLOPs。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05532",
      "title": "DelegationBench: Measuring When AI Agents Should Ask Before Acting",
      "published": "2026-10-04T20:54:35Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05532",
          "title": "DelegationBench: Measuring When AI Agents Should Ask Before Acting",
          "published": "2026-10-04T20:54:35Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "DelegationBench 是 Agent 委派评测，已转 Agent 评测基础设施审查。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05532",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05532",
          "title": "DelegationBench: Measuring When AI Agents Should Ask Before Acting",
          "decision": "accepted",
          "review_level": "fulltext",
          "reviewer": "agent_review",
          "source": "https://arxiv.org/html/2610.05532v1",
          "location": "§3–4；§5.2–5.4/Tables1–2；§6–7；AppendixO；官方README",
          "reason": "接受为evolve权限/信息需求分离的评测基础设施；156场景48matched pairs、Act/Ask/Request/Refuse分别计分，Tool-Loop与post-approval测试行动而非只问判断。",
          "evidence": "代码由delegation-bench重定向discretion-bench；任务、parser、15模拟tool、strict/normalized scorer和分类结果公开，MIT代码/CCBY4数据。",
          "limitations": "无provider客户端，需独立API wrapper；三学生标签为参考非gold真理；工具无持久state；13matched pairs多因素变更；完整raw输出受provider条款未发，explicit-rule研究未发；author notes与reference label严禁给Agent。",
          "code": "https://github.com/PieLord757/discretion-bench",
          "candidate_kind": "evaluation_infrastructure",
          "source_group": "cross_track",
          "fulltext_review_completed": true,
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05501",
      "title": "Logic-Logit: A Logic-Based Approach to Choice Modeling",
      "published": "2026-10-04T20:14:20Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05501",
          "title": "Logic-Logit: A Logic-Based Approach to Choice Modeling",
          "published": "2026-10-04T20:14:20Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "Logic-Logit 用列生成和 Frank-Wolfe 拟合规则，实验是合成数据、2013 Expedia Kaggle 与 MIMIC-IV 离线选择预测；不含线上随机对照。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05501",
              "location": "§6.1–6.4; §7; Appendix D"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.05501",
            "url": "https://arxiv.org/html/2610.05501v1",
            "sha256": "20a7aed8516dc153d6ac3ad50adfccf499bc8db462330d83bd22119958e03f78",
            "status": "downloaded",
            "characters": 83783,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05484",
      "title": "Universal Test-Time Training",
      "published": "2026-10-04T19:43:36Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05484",
          "title": "Universal Test-Time Training",
          "published": "2026-10-04T19:43:36Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "uTTT通过跨层共享快权重池与分离读写路由形成新长上下文算法；同总状态/活跃计算/训练token控制支持核心贡献。",
          "review_level": "fulltext",
          "official_url": "https://arxiv.org/html/2610.05484v1",
          "locations": [
            "§3",
            "§4.1–4.3/Table2",
            "§5.1–5.2",
            "Appendix D–E"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05484",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05484v1",
              "location": "§3; §4.1–4.3/Table2; §5.1–5.2; Appendix D–E"
            },
            {
              "url": "https://arxiv.org/html/2610.05484v1",
              "location": "§3; §4.1–4.3/Table2; §5.1–5.2; Appendix D–E",
              "notes": "124M/760M同训练配置下TTT-MoE→uTTT RULER12.82→15.46/25.73→27.85；760M PTL2.5815→2.5768。匹配内核实测达到dense TTT最终损失需1540 H100 GPU小时，少15%。"
            }
          ],
          "limitations": "RULER仍低于full attention16.52/34.16；超32K检索衰减；原始实测不替代本仓库A100/A30复现。",
          "institution": "University of Wisconsin–Madison / University of Michigan–Ann Arbor / Adobe",
          "original_publication_date": "2026-10-04",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "124M/760M同训练配置下TTT-MoE→uTTT RULER12.82→15.46/25.73→27.85；760M PTL2.5815→2.5768。匹配内核实测达到dense TTT最终损失需1540 H100 GPU小时，少15%。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05481",
      "title": "CodeForge-MA: Execution-Verified Multi-Agent Learning with Language-Conditioned LoRA for Multilingual Code Generation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05481",
          "title": "CodeForge-MA: Execution-Verified Multi-Agent Learning with Language-Conditioned LoRA for Multilingual Code Generation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "PPO+SFT本身是标准配方，但语言条件稀疏Mixture-of-LoRA门控是可执行新增参数机制；Qwen1.8B与72B API实验。应复现路由和辅助约束，非仅重命名PPO。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05481",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05481v1",
              "location": "§IV-C–D Eq.12–20；实验配置"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05481",
          "title": "CodeForge-MA: Execution-Verified Multi-Agent Learning with Language-Conditioned LoRA for Multilingual Code Generation",
          "published": "2026-10-04T19:40:17Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05481v1",
          "location": "§IV-C–D Eq.12–20；实验配置",
          "decision": "accepted",
          "reason": "PPO+SFT本身是标准配方，但语言条件稀疏Mixture-of-LoRA门控是可执行新增参数机制；Qwen1.8B与72B API实验。应复现路由和辅助约束，非仅重命名PPO。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05473",
      "title": "Hierarchical Reinforcement Learning with Stable Temporal Abstraction for Language Model Agents",
      "published": "2026-10-04T19:25:27Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05473",
          "title": "Hierarchical Reinforcement Learning with Stable Temporal Abstraction for Language Model Agents",
          "published": "2026-10-04T19:25:27Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05473v1",
          "location": "§2–4 Eq5–11；Appendix A/B/C/F",
          "decision": "accepted",
          "reason": "STAC在HiPER归一化boundary advantage上按已采样KEEP/SWITCH减去过早重规划与过时保留成本，PPO仅boundary token改变，reward/critic/subgoal/action保持host算法。适合hierarchical Agent RL。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05473",
          "limitations": "正文实验是固定μshort=μstale=.1、dmin2/dmax8，并未实施adaptive dual/budget保证。最高validation checkpoint及类别成绩在同validation报告，应另设test。3seed区间宽，ablation成功率差异未显著；需真实层级policy训练，不能规则keep切换冒充。未定位新源码。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05463",
      "title": "Human-Like Attention? A Psychophysical Comparison of Visual Search in Humans and MLLMs",
      "published": "2026-10-04T19:11:35Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05463",
          "title": "Human-Like Attention? A Psychophysical Comparison of Visual Search in Humans and MLLMs",
          "published": "2026-10-04T19:11:35Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "人类与MLLM视觉搜索心理物理比较，属于认知评测。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05463",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05461",
      "title": "AI Safety via Debate is Compromised by Cognitive Biases",
      "published": "2026-10-04T19:11:18Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05461",
          "title": "AI Safety via Debate is Compromised by Cognitive Biases",
          "published": "2026-10-04T19:11:18Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05461",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "人类辩论裁决认知偏差实验，无新Agent策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05446",
      "title": "Hierarchical Time-aware Bootstrapping for Off-Policy Subgoal Value Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05446",
          "title": "Hierarchical Time-aware Bootstrapping for Off-Policy Subgoal Value Learning",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "HIRO类AntFall层次控制的off-policy subgoal value learning，无语言模型后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05446",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05425",
      "title": "Unmentioned Checklist Findings Change How Reinforcement Learning Appears to Improve Chest Radiograph Report Checking",
      "published": "2026-10-04T18:06:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05425",
          "title": "Unmentioned Checklist Findings Change How Reinforcement Learning Appears to Improve Chest Radiograph Report Checking",
          "published": "2026-10-04T18:06:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "胸片报告checklist标签协议对RL效果影响，领域评测诊断。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05425",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.05425",
          "title": "Unmentioned Checklist Findings Change How Reinforcement Learning Appears to Improve Chest Radiograph Report Checking",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公开checklist/reader格式稳健性诊断：图像writer不读待查句，checker不读图；matched-label pair和三个checker区分omission/order影响。官方代码/格式/analysis可访问，CheXpert数据须注册协议；医学专门诊断不作临床效益或通用视觉提升证据。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.05425v1",
              "location": "Results study design；Methods；Code/Data availability"
            },
            {
              "url": "https://github.com/ali-vosoughi/VerifyGRPO-Rad",
              "location": "作者资源入口只读核查；边界见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "胸片checklist未提及项如何改变RL评测的控制研究，非新的优化算法。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05418",
      "title": "EvoMem-VLA: State-Evolution Memory for Long-Horizon Robot Manipulation",
      "published": "2026-10-04T17:59:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05418",
          "title": "EvoMem-VLA: State-Evolution Memory for Long-Horizon Robot Manipulation",
          "published": "2026-10-04T17:59:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "EvoMem-VLA冻结paired DINO delta tokenizer，initial+recent+事件state/delta交织记忆，keyframehead预测未来record offset只在时间到达提交；task routing是配置而非learned classifier。训练GTsubtask/test生成subtask有暴露偏差，闭环只读已观测，RMBench/RoboMME+双embodiment80实机episodes。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05418",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05418v1",
              "location": "§3.1–3.4式2–6；§4.1–4.4"
            },
            {
              "url": "https://arxiv.org/html/2610.05418v1",
              "location": "§3.1–3.4式2–6；§4.1–4.4",
              "notes": "EvoMem-VLA冻结paired DINO delta tokenizer，initial+recent+事件state/delta交织记忆，keyframehead预测未来record offset只在时间到达提交；task routing是配置而非learned classifier。训练GTsubtask/test生成subtask有暴露偏差，闭环只读已观测，RMBench/RoboMME+双embodiment80实机episodes。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05418v1",
          "locations": [
            "§3.1–3.4式2–6；§4.1–4.4"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "EvoMem-VLA冻结paired DINO delta tokenizer，initial+recent+事件state/delta交织记忆，keyframehead预测未来record offset只在时间到达提交；task routing是配置而非learned classifier。训练GTsubtask/test生成subtask有暴露偏差，闭环只读已观测，RMBench/RoboMME+双embodiment80实机episodes。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05417",
      "title": "Render to Reason: Novel-View Semantic Prediction Improves Spatial Understanding in VLMs",
      "published": "2026-10-04T17:58:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05417",
          "title": "Render to Reason: Novel-View Semantic Prediction Improves Spatial Understanding in VLMs",
          "published": "2026-10-04T17:58:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Meta Render2Reason以VGGT geometry/camera与视觉crossattention融合，aux新视角16×16九类semantic query并行CE+QA CE，避免teacherforce邻接GT标签捷径；训练target图仅供frozenVGGT提camera，QA推理无target。4B控制实验与8Bsystem不同数据需分开，Appendix A.5有target泄露控制；实现必须维持此边界。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05417",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05417v1",
              "location": "§3.1–3.3式1–3；§4.1–4.3；Appendix A.5"
            },
            {
              "url": "https://arxiv.org/html/2610.05417v1",
              "location": "§3.1–3.3式1–3；§4.1–4.3；Appendix A.5",
              "notes": "Meta Render2Reason以VGGT geometry/camera与视觉crossattention融合，aux新视角16×16九类semantic query并行CE+QA CE，避免teacherforce邻接GT标签捷径；训练target图仅供frozenVGGT提camera，QA推理无target。4B控制实验与8Bsystem不同数据需分开，Appendix A.5有target泄露控制；实现必须维持此边界。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05417v1",
          "locations": [
            "§3.1–3.3式1–3；§4.1–4.3；Appendix A.5"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Meta Render2Reason以VGGT geometry/camera与视觉crossattention融合，aux新视角16×16九类semantic query并行CE+QA CE，避免teacherforce邻接GT标签捷径；训练target图仅供frozenVGGT提camera，QA推理无target。4B控制实验与8Bsystem不同数据需分开，Appendix A.5有target泄露控制；实现必须维持此边界。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05413",
      "title": "A Strong Baseline for Evaluating Vision Encoders in Multimodal Large Language Models",
      "published": "2026-10-04T17:54:09Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05413",
          "title": "A Strong Baseline for Evaluating Vision Encoders in Multimodal Large Language Models",
          "published": "2026-10-04T17:54:09Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "RAVEL视觉编码器评价指标，非基础模型能力新算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05413",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05402",
      "title": "Task Vector Descent: Learning from Non-IID Batches",
      "published": "2026-10-04T17:37:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05402",
          "title": "Task Vector Descent: Learning from Non-IID Batches",
          "published": "2026-10-04T17:37:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "TVD将连续同分布小批更新的task vector部分整合，同时插值Adam一阶矩/步数、平方根空间二阶矩；固定样本预算与训练/评价分离，覆盖SFT及GRPO。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05402",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05402v1",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）; §3.1 Eq.3–4；§3.2–3.3；§4"
            },
            {
              "url": "https://arxiv.org/abs/2610.05402",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05402v1",
              "location": "§3.1 Eq.3–4；§3.2–3.3；§4"
            }
          ],
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "review_provenance": "post_training_review正文审查复用；foundation核对交叉记录",
          "official_url": "https://arxiv.org/html/2610.05402v1",
          "locations": [
            "Abstract（输入检索工件中的完整摘要已逐条审阅）",
            "§3.1 Eq.3–4；§3.2–3.3；§4"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": [
            {
              "url": "https://arxiv.org/abs/2610.05402",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05402v1",
              "location": "§3.1 Eq.3–4；§3.2–3.3；§4"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.05402",
          "title": "Task Vector Descent: Learning from Non-IID Batches",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "TVD将连续同分布小批更新的task vector部分整合，同时插值Adam一阶矩/步数、平方根空间二阶矩；固定样本预算与训练/评价分离，覆盖SFT及GRPO。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05402",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05402v1",
              "location": "§3.1 Eq.3–4；§3.2–3.3；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05400",
      "title": "CASE: Cost-Aware Stopping for Efficient Long-Video Agents",
      "published": "2026-10-04T17:35:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05400",
          "title": "CASE: Cost-Aware Stopping for Efficient Long-Video Agents",
          "published": "2026-10-04T17:35:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CASE长视频agent停止决策，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05400",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05399",
      "title": "Adaptive Code Revision Attacks on AI Pull Request Reviewers",
      "published": "2026-10-04T17:34:56Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05399",
          "title": "Adaptive Code Revision Attacks on AI Pull Request Reviewers",
          "published": "2026-10-04T17:34:56Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05399v1",
          "location": "§3–4；§5 RQ1–4；Threats to Validity",
          "decision": "pending",
          "reason": "AFCRA以reviewer反馈改代码并保留同CVE property，fresh evaluator执行PoC且在historicalfix阻断才认exploitable，159 runnable PR可作安全评测。正文仅提replication package未给可定位公开包，暂缓等待任务及容器/PoC发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05399",
          "limitations": "attacker可获目标PoC属显式威胁模型；reviewer无gold/referencefix外查。Upper-bound有额外target信息只oracle诊断；33先前成功attack上的防御/false-reject结果非全量安全保证，历史CVE污染不可消除。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05398",
      "title": "MMPostTrainBench: Benchmarking Autonomous Research for Multimodal Post-Training",
      "published": "2026-10-04T17:32:58Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05398",
          "title": "MMPostTrainBench: Benchmarking Autonomous Research for Multimodal Post-Training",
          "published": "2026-10-04T17:32:58Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05398v1",
          "location": "§3.2–3.4；§4.1；§4.3–4.4",
          "decision": "accepted",
          "reason": "MMPostTrainBench将多模态训练任务封装成Harbor独立verifier，MMResearch把媒体证据、假设、干预结果构成图并配global/core/archive记忆，适合多模态evolve控制器。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05398",
          "fulltext_review_completed": true,
          "locations": [
            "§3.2–3.4",
            "§4.1",
            "§4.3–4.4"
          ],
          "limitations": "原实验Qwen3-Omni30B、8GPU×24h，单卡缩小必须注明；候选test轨迹仅事后审计不可反馈调参。每对三loop但完整审计只抽一个，违规loop回退base不等于全程防泄漏。",
          "code_url": "https://github.com/sod1010/MMPostTrainBench",
          "code_status": "official benchmark repository reachable; task/checkpoint resources need per-task verification",
          "reviewer": "root",
          "code": "https://github.com/sod1010/MMPostTrainBench"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05387",
      "title": "GNN-CB: A Graph Neural Network Competition Benchmark for Human and LLM Evaluation",
      "published": "2026-10-04T17:16:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05387",
          "title": "GNN-CB: A Graph Neural Network Competition Benchmark for Human and LLM Evaluation",
          "published": "2026-10-04T17:16:44Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05387v1",
          "location": "§3.1–3.3；§5/Limitations；Data and Code Availability",
          "decision": "pending",
          "reason": "GNN-CB用18个图学习竞赛和隐藏test评分检验plan→code→执行修复，可作为CPU coding/evolve基准；论文只承诺将发布MIT基础设施，未定位可用官方评分包，暂缓接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05387",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.3",
            "§5/Limitations",
            "Data and Code Availability"
          ],
          "limitations": "API每调用10k输出而agent是native session预算，不完全等算力；单次greedy、人类LLM辅助无法完全审计；不同指标不可简单均值排名。必须拿到官方split/scorer，不能重新编造同名任务。",
          "code_status": "promised MIT release; no verified runnable official task package",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05383",
      "title": "Sibyl: An Efficient Small-large Model Collaboration Framework for Long-horizon Tasks",
      "published": "2026-10-04T17:14:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05383",
          "title": "Sibyl: An Efficient Small-large Model Collaboration Framework for Long-horizon Tasks",
          "published": "2026-10-04T17:14:41Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05383v1",
          "location": "§4.2–4.4 Eq9–21；§5；Appendix A/D/F",
          "decision": "accepted",
          "reason": "Sibyl先hindsight skill OPD+RL增强本地policy，失败prefix replay找单次cloud action能逆转结果的decisive disagreement冷启动call_cloud，再以trajectory/matched-state/consultation counterfactual credit联合训练和skill internalization。适合Agent RL/OPD跨轨。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05383",
          "limitations": "无matched local continuation时cf credit=0；摘要95.2/80.4是绝对success，非同比提升百分比。Seen140/Unseen134、WebShop500官方test，训练需隔离skill/task/validation；成本break-even排除149.7/205.7训练GPUhours。云上下文传输和服务不可用未解决，需真实checkpoint及环境。",
          "code": "https://github.com/real-fzw/Sibyl",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05380",
      "title": "VHDL-REPOBENCH: A Repository-Level Benchmark for Evaluating Large Language Models on VHDL Design Generation",
      "published": "2026-10-04T17:12:34Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05380",
          "title": "VHDL-REPOBENCH: A Repository-Level Benchmark for Evaluating Large Language Models on VHDL Design Generation",
          "published": "2026-10-04T17:12:34Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "VHDL-RepoBench保留跨文件依赖，四类补全/摘要/模块生成任务与GHDL、VUnit/Cocotb验证；暂未在正文定位官方完整任务包/构建依赖发布。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05380",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.05380v1",
              "location": "§III-A–C; §IV metrics; §V",
              "notes": "VHDL-RepoBench保留跨文件依赖，四类补全/摘要/模块生成任务与GHDL、VUnit/Cocotb验证；暂未在正文定位官方完整任务包/构建依赖发布。"
            }
          ],
          "source": "https://arxiv.org/html/2610.05380v1",
          "locations": [
            "§III-A–C",
            "§IV metrics",
            "§V"
          ],
          "limitations": "大部分Pass@k实际仅编译成功，只有135个SMG模块子集要求testbench；不能将所有分数称功能正确率。约100仓库公开代码污染和测试隔离未明确；摘要ROUGE/偏好不等于仿真正确。",
          "code_status": "official_benchmark_package_not_located",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.05380v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "VHDL-RepoBench保留跨文件依赖，四类补全/摘要/模块生成任务与GHDL、VUnit/Cocotb验证；暂未在正文定位官方完整任务包/构建依赖发布。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05373",
      "title": "Towards Unbiased On-Policy Distillation for Block Diffusion Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05373",
          "title": "Towards Unbiased On-Policy Distillation for Block Diffusion Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Un-OPD筛选可见上下文对齐的block决策，对高teacher-support位置混合teacher与detach student logits校准，并复用rollout；真实BDLM实验。标题unbiased不可扩展为任意复用无偏保证。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05373",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05373v1",
              "location": "§3.2–3.4 Eq.3–7；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05369",
      "title": "AutoDP-LLM: Automating Data Pre-processing for Intrusion Detection Systems using Large Language Models",
      "published": "2026-10-04T16:50:21Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05369",
          "title": "AutoDP-LLM: Automating Data Pre-processing for Intrusion Detection Systems using Large Language Models",
          "published": "2026-10-04T16:50:21Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05369v1",
          "location": "§III；§IV；Appendix A/B prompts",
          "decision": "out_of_scope",
          "reason": "AutoDP-LLM为IDS生成受约束preprocessing代码，host固定budget/selection、semantic-RF-MI特征筛选和resampling；主要是领域数据工程应用，未提供通用Agent策略或新的LLM训练算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05369",
          "limitations": "train-only profiler/validation选择冻结test为正确边界；多个backbone可执行pipeline非Agent能力通用提升。HPC并行仅未来工作，不能宣称实现。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05367",
      "title": "AIProver: Agentic Auto-Formalization of Mathematical Research via Certificate-Driven Evolving Harness",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05367",
          "title": "AIProver: Agentic Auto-Formalization of Mathematical Research via Certificate-Driven Evolving Harness",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "AIProver交替训练模型与进化harness，SAM双视图对比及CE、证书RLSF和独立fitness集accept/rollback；需真实形式验证链，不得用gold证明fixture替代。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05367",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05367v1",
              "location": "§4（SAM与HarnessEvolve）；Table 3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05367",
          "title": "AIProver: Agentic Auto-Formalization of Mathematical Research via Certificate-Driven Evolving Harness",
          "published": "2026-10-04T16:48:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05367v1",
          "location": "§4（SAM与HarnessEvolve）；Table 3",
          "decision": "accepted",
          "reason": "AIProver交替训练模型与进化harness，SAM双视图对比及CE、证书RLSF和独立fitness集accept/rollback；需真实形式验证链，不得用gold证明fixture替代。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05342",
      "title": "IRSTD-Agent: Agentic Infrared Small Target Detection via Zoom-Guided Interaction Learning",
      "published": "2026-10-04T16:10:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05342",
          "title": "IRSTD-Agent: Agentic Infrared Small Target Detection via Zoom-Guided Interaction Learning",
          "published": "2026-10-04T16:10:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "IRSTD-Agent红外小目标工具搜索，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05342",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05342",
          "title": "IRSTD-Agent: Agentic Infrared Small Target Detection via Zoom-Guided Interaction Learning",
          "published": "2026-10-04T16:10:08Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05342v1",
          "location": "§3；§4；Appendix A.1–A.4/B.1–B.2",
          "decision": "accepted",
          "reason": "IRSTD-Agent用proposal/zoom/detect/drop/refine视觉工具，基于train mask构造target-preserving/offset-recovery/negative trajectories，SFT预测工具及坐标，测试从native image获得证据。可作为多模态主动视觉Agent候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05342",
          "limitations": "GT只用于训练trajectory/外部评分，不得eval crop oracle。proposal为多空间滤波+FFT无学习，refine image区域连通mask；该工具单独不是MLLM策略复现。27B实际CUDA训练需receipt。Full2000 specialized detector F1更高，agent优势主要Large44原尺寸分组；matched IoU只匹配目标非整体成功。未定位官方源码。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05334",
      "title": "AgentDiscover: Autonomous Discovery with Minimal Search Scaffolding",
      "published": "2026-10-04T15:55:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05334",
          "title": "AgentDiscover: Autonomous Discovery with Minimal Search Scaffolding",
          "published": "2026-10-04T15:55:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "AgentDiscover自主发现搜索框架，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05334",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05334",
          "title": "AgentDiscover: Autonomous Discovery with Minimal Search Scaffolding",
          "published": "2026-10-04T15:55:47Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05334v1",
          "location": "§3.2；§4–5；Appendix A/B/C/D",
          "decision": "accepted",
          "reason": "AgentDiscover用sandbox coding agent自行查询idea/candidate/session/lesson图数据库并提交隔离评分，跨session fresh context保留tools/skills；meta agent从trace提炼搜索指导，可接开放搜索evolve。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05334",
          "limitations": "单run主表无variance；historical AtCoder publiccases搜索/officialsystem测试分开。须保留privatefutureworkload隔离、不返回候选stdout/异常、禁止pickle在scorer反序列化；signalprocessing残余错误metric明确未修，分数不可当真实denoise能力。费用是list-price估算非账单；未找到原创代码公开链接。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05329",
      "title": "Understanding the Weight Averaging Mechanism in LLM Training for Post-Training Quantization",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05329",
          "title": "Understanding the Weight Averaging Mechanism in LLM Training for Post-Training Quantization",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "预训练权重平均与PTQ的理论和kernel，属于基础模型量化。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05329",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05319",
      "title": "Understanding the Hierarchical Structure and Functional Landscape of the Model Context Protocol Ecosystem",
      "published": "2026-10-04T15:39:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05319",
          "title": "Understanding the Hierarchical Structure and Functional Landscape of the Model Context Protocol Ecosystem",
          "published": "2026-10-04T15:39:33Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05319v1",
          "location": "§3.1–3.3 Algorithm1；§4 RQ4；Threats to Validity/Ethics",
          "decision": "pending",
          "reason": "MCPacific静态提取百万tools，node级LLM设计/独立pilot修订taxonomy再embedding routing+人审，提供same-enabled-tool hierarchical retrieval对照，适合tool discovery基础设施。但作者仅承诺release且未定位完整corpus/taxonomy/runner，暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05319",
          "limitations": "功能可比不保证schema或行为等价；Semgrep alert非confirmed漏洞。静态pattern漏dynamictool；GPT5.4兼被测与judge，claim coverage不是执行任务成功，工具来源仅公开七语言。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05318",
      "title": "Robust Parameter-Efficient LLM Adaptation on Analog Hardware",
      "published": "2026-10-04T15:39:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05318",
          "title": "Robust Parameter-Efficient LLM Adaptation on Analog Hardware",
          "published": "2026-10-04T15:39:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "冻结base用功能等价通道缩放，LoRA用校准异常通道拆分及数字残差累积保留亚阈值更新；可作为模拟硬件误差下的训练机制诊断。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05318",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05318v1",
              "location": "§3.1–3.3/Eq1–5; §4 setup; §5 limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.05318v1",
              "location": "§3.1–3.3/Eq1–5; §4 setup; §5 limitations",
              "notes": "冻结base用功能等价通道缩放，LoRA用校准异常通道拆分及数字残差累积保留亚阈值更新；可作为模拟硬件误差下的训练机制诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.05318v1",
          "locations": [
            "§3.1–3.3/Eq1–5",
            "§4 setup",
            "§5 limitations"
          ],
          "limitations": "只AIHWKit模拟，异常通道受保护perfect-I/O假设，未量测真实模拟芯片/能耗/通信或延迟。64校准batch固定统计，2000steps、固定512QA与100heldoutNLL；部分消融单点。不得宣称真实analog加速或工业部署。未找到论文官方代码入口。",
          "code_status": "not_found_in_paper; IBM AIHWKit is dependency not author release",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05318v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "冻结base用功能等价通道缩放，LoRA用校准异常通道拆分及数字残差累积保留亚阈值更新；可作为模拟硬件误差下的训练机制诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05308",
      "title": "RubricArmor: Adversarial Evolution Improves LLM-Based Rubric Generation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05308",
          "title": "RubricArmor: Adversarial Evolution Improves LLM-Based Rubric Generation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "RubricArmor独立质量判断确认满分但有缺陷的攻击，再经降分与独立review双验收迭代修补rubric；有2K WildChat、三policy真实GRPO验证。核心是可执行reward构造循环，须保留验证者非简单字符串rubric。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05308",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05308v1",
              "location": "§3.2–3.3 Algorithm1；§4.6/Table4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05306",
      "title": "Kinematics-Centric Continuous Sign Language Retrieval with Gloss-Guided Boundary-Aware Alignment",
      "published": "2026-10-04T15:28:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05306",
          "title": "Kinematics-Centric Continuous Sign Language Retrieval with Gloss-Guided Boundary-Aware Alignment",
          "published": "2026-10-04T15:28:52Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "手语运动学文本检索与gloss对齐，属于专用手语理解模型。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05306",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05305",
      "title": "Characterizing Parallelism Strategies in LLM Inference: Fundamental Compute-Communication Trade-offs",
      "published": "2026-10-04T15:28:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05305",
          "title": "Characterizing Parallelism Strategies in LLM Inference: Fundamental Compute-Communication Trade-offs",
          "published": "2026-10-04T15:28:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "主要是现有tensor/pipeline/hybrid并行的分析与8×A100测量，没有新的可执行训练/模型/调度算法，本轮不新增论文adapter，可作为系统性能背景。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05305",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05305v1",
              "location": "§2 TP/PP/HB analytical model; §3.1/3.4; Table2/Figure8–9"
            },
            {
              "url": "https://arxiv.org/html/2610.05305v1",
              "location": "§2 TP/PP/HB analytical model; §3.1/3.4; Table2/Figure8–9",
              "notes": "主要是现有tensor/pipeline/hybrid并行的分析与8×A100测量，没有新的可执行训练/模型/调度算法，本轮不新增论文adapter，可作为系统性能背景。"
            }
          ],
          "source": "https://arxiv.org/html/2610.05305v1",
          "locations": [
            "§2 TP/PP/HB analytical model",
            "§3.1/3.4",
            "Table2/Figure8–9"
          ],
          "limitations": "单机8GPU NVLink固定ISL1000/OSL200，无法在单卡A100证明同样并行收益；正文vLLM0.15.0与表0.15.1不一致。理论prefill/decode结论不能当作所有batch/网络的定律。",
          "code_status": "no new algorithm release identified",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05305v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "主要是现有tensor/pipeline/hybrid并行的分析与8×A100测量，没有新的可执行训练/模型/调度算法，本轮不新增论文adapter，可作为系统性能背景。"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05303",
      "title": "ASCENT: Online Test-Time Training of Long-Horizon Agents via Self-Distillation of Verified Experience",
      "published": "2026-10-04T15:27:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05303",
          "title": "ASCENT: Online Test-Time Training of Long-Horizon Agents via Self-Distillation of Verified Experience",
          "published": "2026-10-04T15:27:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ASCENT在线agent自蒸馏后训练，由agent/post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05303",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.05303",
          "title": "ASCENT: Online Test-Time Training of Long-Horizon Agents via Self-Distillation of Verified Experience",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "ASCENT单次在线episode仅对已验证成功轨迹更新LoRA，以固定初始模型读过滤的自身hindsight作为teacher、forward-KL训练不见hindsight的student；无外部gold答案，须严格prequential协议。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05303",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05303v1",
              "location": "§3.3 Eq.6–12；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05303",
          "title": "ASCENT: Online Test-Time Training of Long-Horizon Agents via Self-Distillation of Verified Experience",
          "published": "2026-10-04T15:27:20Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05303v1",
          "location": "§3.3 Eq.6–12；§4.1",
          "decision": "accepted",
          "reason": "ASCENT单次在线episode仅对已验证成功轨迹更新LoRA，以固定初始模型读过滤的自身hindsight作为teacher、forward-KL训练不见hindsight的student；无外部gold答案，须严格prequential协议。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05300",
      "title": "MESH-Harness: Self-Improving Agent Harnesses via Bandit-Guided Compositional Evolution",
      "published": "2026-10-04T15:22:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05300",
          "title": "MESH-Harness: Self-Improving Agent Harnesses via Bandit-Guided Compositional Evolution",
          "published": "2026-10-04T15:22:23Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05300v1",
          "location": "§3–5；Appendix B/C.1/C.3/C.5",
          "decision": "accepted",
          "reason": "MESH-Harness固定slot接口与容量池，缓存embedding、full-covariance LinUCB+混合起点coordinate search选择完整组合，每5评估trace驱动两slot变异与evict，保留surrogate统计。可接组合harness evolve。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05300",
          "limitations": "40次candidate evaluations，3次是同一冻结harness测试重跑而非训练种子；不同初始化影响增益。validation生成/选择后冻结test，LCB private tests仅评分，数学检索433926对须先去评测重复。mean仍加性，full covariance提供联合不确定度，不是任意非线性交互建模；未定位官方代码。",
          "code": "not found",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05295",
      "title": "Readable Before Actionable: Causal Tracing of Indirect Prompt Injection",
      "published": "2026-10-04T15:16:13Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05295",
          "title": "Readable Before Actionable: Causal Tracing of Indirect Prompt Injection",
          "published": "2026-10-04T15:16:13Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05295v1",
          "location": "§3–7；Appendix Q/V Table23",
          "decision": "accepted",
          "reason": "Readable Before Actionable用content/format反事实role probe、component activation patch和独立hijacked-resisted suite差分方向，检验pre-action/tool-span固定activation edit对AgentDojo攻击行为影响。可收录安全steering实验机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05295",
          "limitations": "role probe权重与edit direction不同，不得以高AUROC直接声称防御。方向由train估计、AgentDojo family-out测试；Llama adaptiveattackASR26.3→27.4无改善，crosschannel不迁移。随layer/context rebound、spanwide多次edit成本需记录；synthetic operating-point选择和正式heldout分开，未定位代码。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05292",
      "title": "Erased, Rerouted, or Rescaled? Post-Training and the Causal Quotient of a Language Model's Belief State",
      "published": "2026-10-04T15:11:16Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05292",
          "title": "Erased, Rerouted, or Rescaled? Post-Training and the Causal Quotient of a Language Model's Belief State",
          "published": "2026-10-04T15:11:16Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "后训练信息擦除/路由/缩放是机制理论与因果解释，未形成独立通用任务评测。",
          "review_level": "abstract",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05292",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.05292",
          "title": "Erased, Rerouted, or Rescaled? Post-Training and the Causal Quotient of a Language Model's Belief State",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "分析post-training对belief state的抹除/重路由/缩放及KL保护，非新训练算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05292",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05284",
      "title": "Fusion is the New Mutation: Bandit-Guided Evolution on Workflow Graphs",
      "published": "2026-10-04T15:04:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05284",
          "title": "Fusion is the New Mutation: Bandit-Guided Evolution on Workflow Graphs",
          "published": "2026-10-04T15:04:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05284v1",
          "location": "§3–5；Appendix B/C/E/F/G",
          "decision": "accepted",
          "reason": "DAGO将工作流搜索记录为generation lineage DAG，固定五parent组合arm，缓存concat embeddings，shared diagonal LinUCB从退火score-softmax提案中选择fusion；LLM从最强parent开始按总结做targeted融合，绝对子代validation成绩更新bandit。适合harness evolve算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05284",
          "limitations": "DAG是生成谱系不是workflow执行图；diagonal近似既改变coefficients也改变探索，非full-ridge等价或校准CI。100评估含10root与最多30child×3，3次测试是同一冻结harness重跑非搜索seed。六公共任务val/test隔离；81.7 vs 80.3及11.2%搜索成本降幅为macro/aggregate，QA任务成本反升。边仅记录suppliedparent不证明继承；理论受residual/proposal coverage假设约束，无一般sublinear regret保证。未定位官方源码。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05282",
      "title": "Red-TTT: Test-Time Training for Automated Jailbreaking Large Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05282",
          "title": "Red-TTT: Test-Time Training for Automated Jailbreaking Large Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Red-TTT按单目标test-time LoRA适应，softmax(beta reward)-uniform风险偏好优势、随轮增强beta与elite replay；固定120查询预算研究。仅列算法研究，不实施攻击。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05282",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05282v1",
              "location": "§3.2 Eq.8–11；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05274",
      "title": "Answer with Evidence: Consistency-Aware Grounded Visual Question Answering for Roadside Traffic Scenes",
      "published": "2026-10-04T14:48:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05274",
          "title": "Answer with Evidence: Consistency-Aware Grounded Visual Question Answering for Roadside Traffic Scenes",
          "published": "2026-10-04T14:48:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "EtA先box再answer的规范序列；ECPO Grollout跨样本IoU聚类≥max(2,ceil(.25G))形成consensus pseudobox，Hungarian覆盖reward+format+referenceanswer后GRPO，不用GTboxes于RL但非无标签。RoadSceneVQA/gRefCOCO/CARPK跨任务，结构一致性存在性证明不保证真实完整grounding。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05274",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05274v1",
              "location": "§IV-A式5–8；§IV-B式9–11/Algorithm 1；§V"
            },
            {
              "url": "https://arxiv.org/html/2610.05274v1",
              "location": "§IV-A式5–8；§IV-B式9–11/Algorithm 1；§V",
              "notes": "EtA先box再answer的规范序列；ECPO Grollout跨样本IoU聚类≥max(2,ceil(.25G))形成consensus pseudobox，Hungarian覆盖reward+format+referenceanswer后GRPO，不用GTboxes于RL但非无标签。RoadSceneVQA/gRefCOCO/CARPK跨任务，结构一致性存在性证明不保证真实完整grounding。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05274v1",
          "locations": [
            "§IV-A式5–8；§IV-B式9–11/Algorithm 1；§V"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "EtA先box再answer的规范序列；ECPO Grollout跨样本IoU聚类≥max(2,ceil(.25G))形成consensus pseudobox，Hungarian覆盖reward+format+referenceanswer后GRPO，不用GTboxes于RL但非无标签。RoadSceneVQA/gRefCOCO/CARPK跨任务，结构一致性存在性证明不保证真实完整grounding。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05273",
      "title": "When and What to Prune? Stage-Aware Visual Token Pruning for Efficient VLA",
      "published": "2026-10-04T14:47:27Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05273",
          "title": "When and What to Prune? Stage-Aware Visual Token Pruning for Efficient VLA",
          "published": "2026-10-04T14:47:27Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SAPrune无reward校准actionattention三depth稳定层，再QR解释度×attention集中度调top-attn/functionaldiversity双路径budget；只prunevisual保留text/action。三VLA LIBERO/SIMPLER+4实机，RTX5090 SDPA latency需保留与FA2区别，不借FLOPs替代实测。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05273",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05273v1",
              "location": "§3.2式5–9；§3.3式10–14起；§4.1–4.4；Appendix B.4.3"
            },
            {
              "url": "https://arxiv.org/html/2610.05273v1",
              "location": "§3.2式5–9；§3.3式10–14起；§4.1–4.4；Appendix B.4.3",
              "notes": "SAPrune无reward校准actionattention三depth稳定层，再QR解释度×attention集中度调top-attn/functionaldiversity双路径budget；只prunevisual保留text/action。三VLA LIBERO/SIMPLER+4实机，RTX5090 SDPA latency需保留与FA2区别，不借FLOPs替代实测。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05273v1",
          "locations": [
            "§3.2式5–9；§3.3式10–14起；§4.1–4.4；Appendix B.4.3"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "SAPrune无reward校准actionattention三depth稳定层，再QR解释度×attention集中度调top-attn/functionaldiversity双路径budget；只prunevisual保留text/action。三VLA LIBERO/SIMPLER+4实机，RTX5090 SDPA latency需保留与FA2区别，不借FLOPs替代实测。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05265",
      "title": "Loopy: Low-Bit Quantization Framework for Looped Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05265",
          "title": "Loopy: Low-Bit Quantization Framework for Looped Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "循环模型低bit PTQ及校准预算分配，无RL/OPD。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05265",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05249",
      "title": "ArticuTable: Generating Instance-Level Interactive Rigid-Articulated 3D Tabletop Scenes from a Single Image",
      "published": "2026-10-04T14:26:34Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05249",
          "title": "ArticuTable: Generating Instance-Level Interactive Rigid-Articulated 3D Tabletop Scenes from a Single Image",
          "published": "2026-10-04T14:26:34Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ArticuTable单图交互3D桌面场景重建，为专用场景资产生成系统。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05249",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05247",
      "title": "templar: agentic induction and evolution of standardized radiology reporting templates from large-scale clinical corpora",
      "published": "2026-10-04T14:25:10Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05247",
          "title": "templar: agentic induction and evolution of standardized radiology reporting templates from large-scale clinical corpora",
          "published": "2026-10-04T14:25:10Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05247v1",
          "location": "§3.1–3.4；§4；Appendix A/B/C.1/C.6/F",
          "decision": "accepted",
          "reason": "TEMPLAR把模板与anatomical/diagnostic provenance graph作持久状态，Span-Triple双视图BM25/embedding图Leiden聚类归纳slot，结构reducer约束修订，外证据grounding及train结构化反馈校准粒度。可作多模态/医疗Agent机制候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05247",
          "limitations": "训练findings归纳、training impressions建诊断图，test impressions只judge；重构当前z是唯一patient事实，训练检索句仅语言先验。四临床数据需复核可下载英文报告与许可，非临床安全有效性证明；diagnostic fidelity为LLM参考评分非真实诊断准确率。温度0仍有截断/重试与本地模型context失配；未定位源码。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05241",
      "title": "StateWise: Diagnosing and Repairing Persistent Operational State Before Agent Actions",
      "published": "2026-10-04T14:12:18Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05241",
          "title": "StateWise: Diagnosing and Repairing Persistent Operational State Before Agent Actions",
          "published": "2026-10-04T14:12:18Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05241v1",
          "location": "§3–5；§6；Data Availability",
          "decision": "pending",
          "reason": "StateWise固定其他context逐record反事实replan归因，read-only环境验证/开发者intent澄清+typed evidence binding纠正scoped持久记录，再独立state-action执行检查。方法清楚，但仅声明artifact repository，缓存正文无可定位URL；待公开150 executable cases/manifest/audit/source包后进入复现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05241",
          "limitations": "40dev与150test分离，跨模型独立20case；150为设计/既有研究启发coding cases，不是自然故障发生率。93.3%及零unsafe仅有限case结果，不能视安全保证；手写verifier/state接口需保留，gold只外部outcome judge，普通permissions仍独立生效。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05223",
      "title": "Look Before You Leap: Thermodynamic Arbitration of Parametric and Non-Parametric Knowledge in LLM Agents via Self-Regulating Memory Architectures",
      "published": "2026-10-04T13:43:24Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05223",
          "title": "Look Before You Leap: Thermodynamic Arbitration of Parametric and Non-Parametric Knowledge in LLM Agents via Self-Regulating Memory Architectures",
          "published": "2026-10-04T13:43:24Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MARTA agent检索记忆框架，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05223",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05223",
          "title": "Look Before You Leap: Thermodynamic Arbitration of Parametric and Non-Parametric Knowledge in LLM Agents via Self-Regulating Memory Architectures",
          "published": "2026-10-04T13:43:24Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05223v1",
          "location": "§3–4；Appendix A Algorithm1/2；B profiling",
          "decision": "pending",
          "reason": "MARTA以冻结LLM entropy/margin/hidden variance投影到BiGRU memory-header affordance，用Sparsemax含bypass gate，CEA硬负NCE只训练controller。核心可执行但自建procedural/semantic/episodic多模态suite、正负utility标签、checkpoint/split与代码未定位，暂缓待完整资源。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05223",
          "limitations": "gold-document acceptance只是oracle retrieval诊断，非answer质量；SQuAD unanswerable判定不等于一般epistemic awareness。12ms/3.7x取决于L4及450ms检索配置，熵下降不保证真值；多backbone不证明universal invariant，必须真实logit/hidden及heldout标定。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05220",
      "title": "Ranking Bandits for Carousel Interfaces with Observable Browsing Depth",
      "published": "2026-10-04T13:39:38Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.05220",
          "title": "Ranking Bandits for Carousel Interfaces with Observable Browsing Depth",
          "published": "2026-10-04T13:39:38Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "OD-ranking bandit 用 RecGaze 日志标定的模拟评价；正文明确真实在线评估为后续工作，不能把算法中的 online learning 当线上 A/B。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05220",
              "location": "§5 simulation; §6 conclusion"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.05220",
            "url": "https://arxiv.org/html/2610.05220v1",
            "sha256": "3a56cd156b9b82a03d77b6caaa7b0fed518b9df28c26e758f31b8f23e35c821c",
            "status": "downloaded",
            "characters": 83378,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05219",
      "title": "Safe Context Switching for Agents in the Wild: Mitigating Subspace Interference via Orthogonal Adaptation",
      "published": "2026-10-04T13:39:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05219",
          "title": "Safe Context Switching for Agents in the Wild: Mitigating Subspace Interference via Orthogonal Adaptation",
          "published": "2026-10-04T13:39:03Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05219v1",
          "location": "§3–5；Appendix A/C/D",
          "decision": "pending",
          "reason": "AURA顺序冻结旧LoRA，以B子空间projection/Frobenius惩罚分离新adapter，Chain-of-Pollution测试保留KV。正文代码/data loader仅upon acceptance发布；链式配对数据与cache/activation协议未公开明确，暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05219",
          "limitations": "正交soft penalty非hard安全保证，不支持无限扩展；TruthfulQA不是adversarial safety benchmark，logit cosine及KL非安全行为指标。rank64、λ.5需validation独立选择，论文忽略统计不确定性；共享cache跨adapter的真实一致性须执行验证，不能模拟正交矩阵冒充。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05200",
      "title": "Learning without Overwriting: A Theory of Self-Distillation and Supervised Fine-Tuning in Continual Reasoning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05200",
          "title": "Learning without Overwriting: A Theory of Self-Distillation and Supervised Fine-Tuning in Continual Reasoning",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "OPSD/SFT持续推理的DAG理论解释，摘要未给出新的训练方法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05200",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05190",
      "title": "FORGE: Verification-Gated Behavioral Repair for Generative Language Models",
      "published": "2026-10-04T12:55:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05190",
          "title": "FORGE: Verification-Gated Behavioral Repair for Generative Language Models",
          "published": "2026-10-04T12:55:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "FORGE通过prefix/LOO定位毒性，候选token分类后用lm_head低秩QP或MLP零空间编辑，重新生成验证再commit/rollback；可作可审计权重修复机制候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05190",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.05190v1",
              "location": "§III-C–F; §IV-A/G/H; §V limitations",
              "notes": "FORGE通过prefix/LOO定位毒性，候选token分类后用lm_head低秩QP或MLP零空间编辑，重新生成验证再commit/rollback；可作可审计权重修复机制候选。"
            }
          ],
          "source": "https://arxiv.org/html/2610.05190v1",
          "locations": [
            "§III-C–F",
            "§IV-A/G/H",
            "§V limitations"
          ],
          "limitations": "固定hidden下线性margin证书只覆盖参与修复的样本/位置，不能宣称heldout安全保证。毒性oracle非真实安全真值，QP与nullspace保证不同；同评估任务上反复修复不得用于泛化提升证据；全文未定位官方代码。",
          "code_status": "not_found_in_examined_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05190v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "FORGE通过prefix/LOO定位毒性，候选token分类后用lm_head低秩QP或MLP零空间编辑，重新生成验证再commit/rollback；可作可审计权重修复机制候选。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05185",
      "title": "Recurrent Latent Visual Search for GUI Grounding",
      "published": "2026-10-04T12:49:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05185",
          "title": "Recurrent Latent Visual Search for GUI Grounding",
          "published": "2026-10-04T12:49:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ReLaViS LVS latent slots递归spatial distribution/evidence向量回灌，CWC对每candidate质量下界+final截断Gaussian KL；三阶段warmup/GTlatentteacherforce/predictedselfcondition，test只screenshot+query，3×3峰邻域坐标。100ktrain/5kval隔离五GUIbench，grounding非端到端agent任务。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05185",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05185v1",
              "location": "§3.1–3.4式1–9；§4.1–4.3"
            },
            {
              "url": "https://arxiv.org/html/2610.05185v1",
              "location": "§3.1–3.4式1–9；§4.1–4.3",
              "notes": "ReLaViS LVS latent slots递归spatial distribution/evidence向量回灌，CWC对每candidate质量下界+final截断Gaussian KL；三阶段warmup/GTlatentteacherforce/predictedselfcondition，test只screenshot+query，3×3峰邻域坐标。100ktrain/5kval隔离五GUIbench，grounding非端到端agent任务。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05185v1",
          "locations": [
            "§3.1–3.4式1–9；§4.1–4.3"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "ReLaViS LVS latent slots递归spatial distribution/evidence向量回灌，CWC对每candidate质量下界+final截断Gaussian KL；三阶段warmup/GTlatentteacherforce/predictedselfcondition，test只screenshot+query，3×3峰邻域坐标。100ktrain/5kval隔离五GUIbench，grounding非端到端agent任务。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05176",
      "title": "AECG: Asymmetric Experience Consolidation and Governance In Multi-Agent Systems",
      "published": "2026-10-04T12:38:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05176",
          "title": "AECG: Asymmetric Experience Consolidation and Governance In Multi-Agent Systems",
          "published": "2026-10-04T12:38:03Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05176v1",
          "location": "§3–4；Appendix B.1–B.4/C",
          "decision": "accepted",
          "reason": "AECG按team/event/agent保留scope，成功与归因可信失败不对称入账，slow累积/fast折扣Beta-style信念检出退化并按downstream exposure有限预算review；narrow/repair版本仅paired failure+disjoint success replay通过再启用。适合Agent memory/RSI。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05176",
          "limitations": "Beta-style用于scoring非完整Bayesposterior，noise-corrected drift非校准显著性概率，reachability exposure非causal传播。独立AgentBoard dev参数，四publicbench三independentseed；controlled corruption是机制诊断，应另测自然漂移。失败局部归因质量是依赖，须报告未归因/误归因。",
          "code": "https://github.com/fenhg297/AECG",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05162",
      "title": "Memadapter: Counterfactual Adaptation Against Memory-induced Sycophancy",
      "published": "2026-10-04T12:12:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05162",
          "title": "Memadapter: Counterfactual Adaptation Against Memory-induced Sycophancy",
          "published": "2026-10-04T12:12:16Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05162v1",
          "location": "§3–4；Appendix A/B/D/G/H",
          "decision": "accepted",
          "reason": "MemAdapter对冻结retrieved memories先造counterfactual任务归纳条件使用边界，再当前context反思限定inferential角色，最终evidence-based回答；不改上游memory/retrieval。适合记忆可靠性机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05162",
          "limitations": "同一memorysystem同instance固定retrieval公平对照；gold/reference只官方judge，不能用于usage induction。75 controlled instances含人工重构只诊断，正式三publicbenchmark另报。PersistBench beneficial-memory failure部分上升，不能笼统所有metric提升；三stage额外calls/cost需记录，温度.2不等于独立多seed。",
          "code": "https://github.com/DEEP-JLU/MemAdapter",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05139",
      "title": "Hidden in the Comments: A Context-Injection Attack Surface in Code LLMs",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05139",
          "title": "Hidden in the Comments: A Context-Injection Attack Surface in Code LLMs",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公开安全评测：双条件Flask prompt、generation harness、5组件detector及comment position对照。Zenodo API已证实open/published、Manuscript_Codes.zip及校验和。非同scaffold配对且task类型混淆；detector以实验条件作参考非漏洞gold，不能当纯因果或真实漏洞准确率。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.05139v1",
              "location": "§4.1–4.2；§5；Data and Artifact Availability"
            },
            {
              "url": "https://doi.org/10.5281/zenodo.22662814",
              "location": "作者资源入口；当前可用性限制见reason"
            },
            {
              "url": "https://zenodo.org/api/records/22662814",
              "location": "published/open metadata；Manuscript_Codes.zip md5 7c8a1a03f5ed8e4a1f224b15f4aa88eb"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "代码注释上下文注入攻击评测，非训练算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05132",
      "title": "SpecAgent: Empowering Program Verification with Agentic Synthesis of Formal Program Specifications",
      "published": "2026-10-04T11:24:28Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05132",
          "title": "SpecAgent: Empowering Program Verification with Agentic Synthesis of Formal Program Specifications",
          "published": "2026-10-04T11:24:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05132v1",
          "location": "§3–5；Threats to Validity",
          "decision": "accepted",
          "reason": "SpecAgent用函数/loop dependency计划与ACSL知识RAG生成annotation，Frama-C/WP反馈可回修upstream contract，critique用双次同input调用return equality completeness probe辨弱spec并继续修订。public C/SV-COMP任务适合formal-method Agent候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05132",
          "limitations": "只许改annotation不能改实现；goldspec仅precision/recall judge，verification goals与工具证明不等于完整semantics。return唯一性probe覆盖有限，Frama-C/WP不完备可能false-negative；50程序14repo/811 targets非所有语言，需保持solver/version及超时公平，正式code未定位。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05131",
      "title": "RoMod: Temporal Routing Modulation via Mixture-of-Experts for Video Anomaly Detection",
      "published": "2026-10-04T11:23:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05131",
          "title": "RoMod: Temporal Routing Modulation via Mixture-of-Experts for Video Anomaly Detection",
          "published": "2026-10-04T11:23:14Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "RoMod利用MoE路由特征检测视频异常，主要是专用异常检测头。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05131",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05129",
      "title": "Representation--Behavior Alignment for Explainable Weakly-Supervised Video Anomaly Detection",
      "published": "2026-10-04T11:21:28Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05129",
          "title": "Representation--Behavior Alignment for Explainable Weakly-Supervised Video Anomaly Detection",
          "published": "2026-10-04T11:21:28Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "RBA少量注意力层适应专用视频异常检测，非通用基础模型能力路径。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05129",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05126",
      "title": "Selecting Repetition Counts Across Model Scales in Data-Constrained Pretraining",
      "published": "2026-10-04T11:16:04Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05126",
          "title": "Selecting Repetition Counts Across Model Scales in Data-Constrained Pretraining",
          "published": "2026-10-04T11:16:04Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "小尺度重复次数loss曲线经seedbootstrap+logN回归选top3、以及双项曲线argmin，是明确的预训练数据预算选择operator，target预测前冻结且测试独立。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05126",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05126v1",
              "location": "§3.1–3.2; §5.1–5.3 Eq6–8; §6.1–6.3; §7"
            },
            {
              "url": "https://arxiv.org/html/2610.05126v1",
              "location": "§3.1–3.2; §5.1–5.3 Eq6–8; §6.1–6.3; §7",
              "notes": "100Mtarget占80%，总D=125Mr，每r独立完整cosine；35/50/80M曲线去最低loss后logN拟合、clipnegative、1e-9round小r破tie；PubMed/Caselaw200M/520M预定top3含原7grid最低。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.05126v1",
          "locations": [
            "§3.1–3.2",
            "§5.1–5.3 Eq6–8",
            "§6.1–6.3",
            "§7"
          ],
          "limitations": "r同时改genericexposure/训练长度不是纯重复因果；65.6%省6ND是只跑retained假设成本，实际全7grid验证；later80M/520M pointcheck/9,11探索非prospective；预测offset未知，不能称绝对loss无需大模型数据。",
          "code_status": "未在已核官方正文中找到作者源码入口；算法/实验描述可复核，未宣称源码已发布",
          "kind": "data_budget_selection",
          "implementation_status": "not_implemented",
          "fulltext_notes": "100Mtarget占80%，总D=125Mr，每r独立完整cosine；35/50/80M曲线去最低loss后logN拟合、clipnegative、1e-9round小r破tie；PubMed/Caselaw200M/520M预定top3含原7grid最低。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05125",
      "title": "Bayesian Entropy-based Reordering for Calibrated Diffusion Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05125",
          "title": "Bayesian Entropy-based Reordering for Calibrated Diffusion Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "BayesER为后验不确定性引导扩散推理token提交，无adapter训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05125",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05124",
      "title": "Memory Canonicalization: A Framework and Benchmark for Cross-Model Drift in Persistent LLM Memory",
      "published": "2026-10-04T11:09:27Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05124",
          "title": "Memory Canonicalization: A Framework and Benchmark for Cross-Model Drift in Persistent LLM Memory",
          "published": "2026-10-04T11:09:27Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05124v1",
          "location": "§IV pipeline；§IV-I three-arm；§VI statistics；conclusion/Code Availability",
          "decision": "accepted",
          "reason": "写入记忆时做结构消歧、情绪字段提取与独立验证，CMSC-E以统一自然语言渲染隔离内容改写和JSON格式因素，适合作为记忆漂移诊断。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05124",
          "fulltext_review_completed": true,
          "locations": [
            "§IV pipeline",
            "§IV-I three-arm",
            "§VI statistics",
            "conclusion/Code Availability"
          ],
          "limitations": "四次写时LLM调用及store-aware冲突检索成本未量；pilot多重校正后未建立显著收益，不能标改进能力。保留raw与canonical不破坏证据，情绪字段不应冒充真实人的心理诊断。",
          "code_url": "https://github.com/aishwaryalonarkar/cross-model-memory-canonicalization",
          "code_status": "official repository reachable, pilot evidence only",
          "reviewer": "root",
          "code": "https://github.com/aishwaryalonarkar/cross-model-memory-canonicalization"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05119",
      "title": "LexiHorizon: Stabilizing Reinforcement Learning for Long-Horizon Deep Search",
      "published": "2026-10-04T10:53:20Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05119",
          "title": "LexiHorizon: Stabilizing Reinforcement Learning for Long-Horizon Deep Search",
          "published": "2026-10-04T10:53:20Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05119v1",
          "location": "§3.2–3.3；§4；Appendix A.2–A.3",
          "decision": "pending",
          "reason": "LexiHorizon以128K context、完整reason/action trace但旧toolobservations换marker，非零answer reward门控30call饱和effort bonus，GSPO G16 live webrollout；aux reset丢弃片段仍计成本。训练数据与live backend/代码checkpoint未定位，等待可重放public契约。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05119",
          "limitations": "8轨迹平均accuracy非pass@8或8train seeds；policytokens不含tooltokens。99.88valid answer非correct；金答案只外部judge。samebenchmark sweep/90%上下文压缩需validation隔离，live web变化无法以cachedfixture当原算法真实训练；9B128K GPU预算需真验证。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05114",
      "title": "Belief-Trajectory Energy: Measuring the Path to a Prediction",
      "published": "2026-10-04T10:44:18Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05114",
          "title": "Belief-Trajectory Energy: Measuring the Path to a Prediction",
          "published": "2026-10-04T10:44:18Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "BTE层间信念轨迹能量用于难度和生成来源识别，主要解释性度量。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05114",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05111",
      "title": "InstMoE: Adaptive Multimodal Routing with Specialized Experts",
      "published": "2026-10-04T10:40:07Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05111",
          "title": "InstMoE: Adaptive Multimodal Routing with Specialized Experts",
          "published": "2026-10-04T10:40:07Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "InstMoE以预抽BERT/COVAREP等特征在CMU-MOSEI/CH-SIMS情感任务训练轻量Transformer，InfoNCE+五个T/A/V/TA/TV dense加权专家，centroid bias初始化。核心是监督情感fusion模型，未适配基础生成模型/通用agent或独立公共评测协议；与本轮foundation算法范围不符。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05111",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05111v1",
              "location": "§3.2–3.3式1–9；§4.1–4.2"
            },
            {
              "url": "https://arxiv.org/html/2610.05111v1",
              "location": "§3.2–3.3式1–9；§4.1–4.2",
              "notes": "InstMoE以预抽BERT/COVAREP等特征在CMU-MOSEI/CH-SIMS情感任务训练轻量Transformer，InfoNCE+五个T/A/V/TA/TV dense加权专家，centroid bias初始化。核心是监督情感fusion模型，未适配基础生成模型/通用agent或独立公共评测协议；与本轮foundation算法范围不符。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05111v1",
          "locations": [
            "§3.2–3.3式1–9；§4.1–4.2"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "InstMoE以预抽BERT/COVAREP等特征在CMU-MOSEI/CH-SIMS情感任务训练轻量Transformer，InfoNCE+五个T/A/V/TA/TV dense加权专家，centroid bias初始化。核心是监督情感fusion模型，未适配基础生成模型/通用agent或独立公共评测协议；与本轮foundation算法范围不符。"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05107",
      "title": "SearchJev: A Fast and Calibrated System-1 Model for Search Agents",
      "published": "2026-10-04T10:30:40Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05107",
          "title": "SearchJev: A Fast and Calibrated System-1 Model for Search Agents",
          "published": "2026-10-04T10:30:40Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05107v1",
          "location": "§2–5；SearchDecision-Bench split；SLCD Eq；BrowseComp-Plus protocol",
          "decision": "accepted",
          "reason": "SearchJev对schema legal-option token logits直接readout，CE+Brier softlabel按来源weight训练LoRA，再独立validation按outputtype温度校准；uncertain decisions交System2。可作Jev/Agent search跨轨算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05107",
          "limitations": "公开原始任务可构建语义等价评测，但SearchDecision-Bench完整bundle与官方代码未定位，勿宣称复刻其数据成绩；100BrowseCompPlus一run有限sample。AR baseline未经taskSFT有训练混淆须另matchedSFT；OOD calibration并非普遍提升，latency只batch1 decision非完整系统成本，gold仅训练标签/外部judge。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05103",
      "title": "VulValidate: Auditing Function-Level Vulnerability Labels with Executable Evidence",
      "published": "2026-10-04T10:21:53Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05103",
          "title": "VulValidate: Auditing Function-Level Vulnerability Labels with Executable Evidence",
          "published": "2026-10-04T10:21:53Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05103v1",
          "location": "§2.1–2.5；§3.1/3.5；§5 threats",
          "decision": "pending",
          "reason": "VulValidate对漏洞函数标签建立历史源码绑定、脆弱/修复版本同条件动态证据、函数级归因和cold replay，方法可用于防御评测审计，但完整官方镜像/索引未定位，暂缓直接接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05103",
          "fulltext_review_completed": true,
          "locations": [
            "§2.1–2.5",
            "§3.1/3.5",
            "§5 threats"
          ],
          "limitations": "必须隔离历史脆弱程序，只在授权本地fixture执行；构建成功不代表源码保真，崩溃不自动证明被标函数漏洞，触发失败不等于安全。35,849审计实例含未解决项和人工裁决，不能以合成返回值替代真实包。",
          "code_status": "paper describes Docker evidence release but no canonical verified registry/index URL located",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05100",
      "title": "METRO: Metric-Enhanced Token Routing Operator",
      "published": "2026-10-04T10:14:46Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05100",
          "title": "METRO: Metric-Enhanced Token Routing Operator",
          "published": "2026-10-04T10:14:46Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "METRO神经算子网格/PDE的Mahalanobis路由，非当前基础模型范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05100",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05099",
      "title": "Small Agents with Semantic Search: Efficient Multilingual Code Localization",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.05099",
          "title": "Small Agents with Semantic Search: Efficient Multilingual Code Localization",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "代码定位使用既有质量加权SFT、Dr.GRPO/DAPO和领域F1/轮数奖励，主要新贡献semantic-search harness及数据，不是新核心训练算法；gold只用于训练权重。 该决定仅限后训练核心track，Agent方法/数据公共入口由Agent track独立判断，不能据此全局拒绝。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05099",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05099v1",
              "location": "§4.1–4.2 Eq.1–2；Table 2"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.05099",
          "title": "Small Agents with Semantic Search: Efficient Multilingual Code Localization",
          "published": "2026-10-04T10:13:41Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05099v1",
          "location": "§3–5；§6 Limitations；Appendix A.5–A.7",
          "decision": "accepted",
          "reason": "Compact code-localization agent用colgrep late-interaction CPU index，goldonlytrain turnweights SFT再DrGRPO/DAPO dynamicfilter异步rollout训练；publicSWE-Lite/MultiSWE-Flash按basecommit定位文件，可接Agent后训练候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05099",
          "limitations": "referencepatch位置仅一种解，fileF1非issue resolution。goldoracle top10 subset仅retrievalupperbound，推理agent不能见patch。train排除benchmarkrepo/sharedhistory，teacherquery前state固定；fiveevalseed非five训练。CPU/GPU latency排除预建index成本，工具接口训练对照均须重造demonstration；官方源码未定位。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05097",
      "title": "ReMAP: Restoring the Perceptual Cycle with Reasoning-Time Latent Visual Memory",
      "published": "2026-10-04T10:00:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05097",
          "title": "ReMAP: Restoring the Perceptual Cycle with Reasoning-Time Latent Visual Memory",
          "published": "2026-10-04T10:00:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ReMAP使用全局/局部latent视觉memory、region定位器和分阶段形成/访问训练，再用RL学习何时取证；十基准，必须保留真实视觉memory而非文本oracle。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05097",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05097v1",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）; §3.1–3.2；§4"
            },
            {
              "url": "https://arxiv.org/abs/2610.05097",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05097v1",
              "location": "§3.1–3.2；§4"
            }
          ],
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "review_provenance": "post_training_review正文审查复用；foundation核对交叉记录",
          "official_url": "https://arxiv.org/html/2610.05097v1",
          "locations": [
            "Abstract（输入检索工件中的完整摘要已逐条审阅）",
            "§3.1–3.2；§4"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": [
            {
              "url": "https://arxiv.org/abs/2610.05097",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05097v1",
              "location": "§3.1–3.2；§4"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.05097",
          "title": "ReMAP: Restoring the Perceptual Cycle with Reasoning-Time Latent Visual Memory",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "ReMAP使用全局/局部latent视觉memory、region定位器和分阶段形成/访问训练，再用RL学习何时取证；十基准，必须保留真实视觉memory而非文本oracle。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05097",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.05097v1",
              "location": "§3.1–3.2；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05066",
      "title": "Salvation Lies Within: Eliciting Inherent Style Transfer in Step-Distilled Diffusion Models",
      "published": "2026-10-04T09:06:57Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05066",
          "title": "Salvation Lies Within: Eliciting Inherent Style Transfer in Step-Distilled Diffusion Models",
          "published": "2026-10-04T09:06:57Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "StyleForge无训练agent提render/color-light/composition/referencecontent四状态，统计色/亮度约束后按固定编译顺序保留style弱化composition排除referencecontent，再交few-stepFLUX2Klein；31style×16prompt及三Qwenjudge对照，非新扩散模型/蒸馏loss。可复用structuredprompt operator，judge自动分不当human偏好或生产AB。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05066",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05066v1",
              "location": "§3.1–3.4；§4.1–4.3"
            },
            {
              "url": "https://arxiv.org/html/2610.05066v1",
              "location": "§3.1–3.4；§4.1–4.3",
              "notes": "StyleForge无训练agent提render/color-light/composition/referencecontent四状态，统计色/亮度约束后按固定编译顺序保留style弱化composition排除referencecontent，再交few-stepFLUX2Klein；31style×16prompt及三Qwenjudge对照，非新扩散模型/蒸馏loss。可复用structuredprompt operator，judge自动分不当human偏好或生产AB。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05066v1",
          "locations": [
            "§3.1–3.4；§4.1–4.3"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "StyleForge无训练agent提render/color-light/composition/referencecontent四状态，统计色/亮度约束后按固定编译顺序保留style弱化composition排除referencecontent，再交few-stepFLUX2Klein；31style×16prompt及三Qwenjudge对照，非新扩散模型/蒸馏loss。可复用structuredprompt operator，judge自动分不当human偏好或生产AB。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05047",
      "title": "Beyond Task Completion: Measuring Interaction Cost in Terminal User Interfaces",
      "published": "2026-10-04T08:30:26Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05047",
          "title": "Beyond Task Completion: Measuring Interaction Cost in Terminal User Interfaces",
          "published": "2026-10-04T08:30:26Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05047v1",
          "location": "§2.2 Eq3–5；§3.2–3.4；§6.3",
          "decision": "accepted",
          "reason": "TUINaut用Docker+Tmux共享真实TUI输入输出，独立状态oracle检验完成度；Agent-KLM分报推理token与原子按键数，适合交互Agent成本诊断。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05047",
          "fulltext_review_completed": true,
          "locations": [
            "§2.2 Eq3–5",
            "§3.2–3.4",
            "§6.3"
          ],
          "limitations": "84任务15仓库，30任务有指纹，不能仅凭屏幕含某词宣告完成。token与按键单位不同不相加、不等同人类认知时间；必须真实TUI而非返回预期状态fixture。仓库网页读取失败待用API复核，不影响独立机制定义。",
          "code_url": "https://github.com/kinesiatricssxilm14/Agent-as-a-User",
          "code_status": "paper-listed repository, webpage read unavailable",
          "reviewer": "root",
          "code": "https://github.com/kinesiatricssxilm14/Agent-as-a-User"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05041",
      "title": "Communication Shapes Collective Inference in Self-Adapting LLM Societies: Evidence from Mafia",
      "published": "2026-10-04T08:19:20Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05041",
          "title": "Communication Shapes Collective Inference in Self-Adapting LLM Societies: Evidence from Mafia",
          "published": "2026-10-04T08:19:20Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05041",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Mafia自适应LLM群体通信行为研究，非通用新算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05039",
      "title": "Causal Improvement Graph for Agentic Harness Optimization",
      "published": "2026-10-04T08:15:37Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05039",
          "title": "Causal Improvement Graph for Agentic Harness Optimization",
          "published": "2026-10-04T08:15:37Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05039v1",
          "location": "§3–4；Appendix A.3–A.8",
          "decision": "accepted",
          "reason": "CIG以Evidence–Hypothesis–Intervention–Outcome typed graph作persistent improvement state，Observe/Plan/PlanSelect/Implement/Evaluate/Update局部proposer调用，由外部validation结果修订hypothesis assessments再portfolio选择。可接Agent harness RSI/evolve。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05039",
          "limitations": "Causal名称并不识别统计因果；七ordinal criteria及pairwise redundancy是LLM评估。固定预算val选择后heldouttest，testoracle regret仅外部诊断不可进入selector；8candidate/3或5runs短搜索不证明跨任务长期迁移，wide/deep schedule需匹配，code未定位。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05037",
      "title": "SparseCraft: Agentic Hardware-Software Co-Optimization for Sparse Computing",
      "published": "2026-10-04T08:06:35Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05037",
          "title": "SparseCraft: Agentic Hardware-Software Co-Optimization for Sparse Computing",
          "published": "2026-10-04T08:06:35Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05037v1",
          "location": "§II–IV Algorithm1；Gate ladder；Workload",
          "decision": "pending",
          "reason": "SparseCraft用LLM受限MCP变异Gemmini Chisel RTL/memory/schedule，经hash immutable harness、legality/elaboration/Verilator bitwise gold/synthesis/Pareto admission与bounded repair形成15轮闭环。source-code仅标链接名，完整bundle未定位，且需Chipyard/EDA验证边界，暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.05037",
          "limitations": "单512×512GraphChallenge INT8 workload、一个328min run，无heldoutworkloadgeneralization或searchseedvariance。5.61 perf/W与11.8EDP含counter-based energy/SRAM面积模型非硅实测，2ns固定clock；gold在外部检查不能LLM写改，必须真实EDA gate不可用伪性能替代。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05036",
      "title": "Characterizing Security Effects of OSS Vulnerabilities in Agent Systems",
      "published": "2026-10-04T08:06:34Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05036",
          "title": "Characterizing Security Effects of OSS Vulnerabilities in Agent Systems",
          "published": "2026-10-04T08:06:34Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05036",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "OSS漏洞在Agent层传播的安全影响诊断，非Agent能力方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05030",
      "title": "EVISKILL: Grounding Skill Evolution in Replayable Evidence",
      "published": "2026-10-04T07:50:39Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05030",
          "title": "EVISKILL: Grounding Skill Evolution in Replayable Evidence",
          "published": "2026-10-04T07:50:39Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.05030v1",
          "location": "§3–4；Appendix B/E/F prompt templates",
          "decision": "accepted",
          "reason": "EviSkill由train trajectory span构建Replayable Evidence Cards链接局部edits，恢复prefix状态重执行验证/反思，globalvalidation更新ValidatedSkill；全局拒绝时仅replay支持edits留WorkingSkill ledger跨epoch再检验。适合Agent skill RSI。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.05030",
          "limitations": "真实env恢复和rerun是定义性机制，不能LLMjudge静态旧trace替代；local replay acceptance不等于globalpromotion。训练/validation/test独立，最终只ValidatedSkill冻结test；跨epochcontrast仅train。局部evidence及edit需防case memorization，card数量/extra replaycalls/cost应报告，六backbone不等于独立训练seed。",
          "code": "https://github.com/Zhouyaner/eviskill",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05029",
      "title": "SPACE-CLIPv2: Decoding Local Geometry from Frozen CLIP for Monocular Depth Estimation",
      "published": "2026-10-04T07:50:10Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05029",
          "title": "SPACE-CLIPv2: Decoding Local Geometry from Frozen CLIP for Monocular Depth Estimation",
          "published": "2026-10-04T07:50:10Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "SPACE-CLIPv2专用冻结CLIP深度解码器，非通用视觉基础模型训练。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05029",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05026",
      "title": "GeoBridge-VLA: Geometry-Aware Residual Adaptation for Vision-Language-Action Models",
      "published": "2026-10-04T07:42:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05026",
          "title": "GeoBridge-VLA: Geometry-Aware Residual Adaptation for Vision-Language-Action Models",
          "published": "2026-10-04T07:42:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "GeoBridge-VLA nativevisual中间feature→bridge/K4邻域geometrydecoder，stage1 simdepth或实机DA3pseudodepth监督；stage2冻结geometry+VLM，zero-init1×1residual gate≈.002对nativepatch相加，flow+RMSresidual罚。SmolVLA LIBERO/OMY，仅保持tokencount非零新增decoder计算；跨backbone未验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05026",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05026v1",
              "location": "§III-A式1–2；§III-B式3–4；§IV-A–C；§V"
            },
            {
              "url": "https://arxiv.org/html/2610.05026v1",
              "location": "§III-A式1–2；§III-B式3–4；§IV-A–C；§V",
              "notes": "GeoBridge-VLA nativevisual中间feature→bridge/K4邻域geometrydecoder，stage1 simdepth或实机DA3pseudodepth监督；stage2冻结geometry+VLM，zero-init1×1residual gate≈.002对nativepatch相加，flow+RMSresidual罚。SmolVLA LIBERO/OMY，仅保持tokencount非零新增decoder计算；跨backbone未验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05026v1",
          "locations": [
            "§III-A式1–2；§III-B式3–4；§IV-A–C；§V"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "GeoBridge-VLA nativevisual中间feature→bridge/K4邻域geometrydecoder，stage1 simdepth或实机DA3pseudodepth监督；stage2冻结geometry+VLM，zero-init1×1residual gate≈.002对nativepatch相加，flow+RMSresidual罚。SmolVLA LIBERO/OMY，仅保持tokencount非零新增decoder计算；跨backbone未验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05025",
      "title": "Triggering Generalist Reasoning via Predictive Uncertainty for Dual-System VLA",
      "published": "2026-10-04T07:39:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05025",
          "title": "Triggering Generalist Reasoning via Predictive Uncertainty for Dual-System VLA",
          "published": "2026-10-04T07:39:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "TUD将π0拆heavyPaliGemma generalistcache与currentSigLIP/Qformer/actionexpert，同anchor跨观测重预测固定slot std衡量plan变化；runningmean阈值online百分位p70+maxskip触发刷新，执行仍committedchunk非每次probeaction。VLA-Arena/CALVIN/实机，variance是stalenessproxy非校准epistemic uncertainty，额外probe成本需计。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05025",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05025v1",
              "location": "§3.1–3.3式2–6；§4.1–4.4；Appendix B/C"
            },
            {
              "url": "https://arxiv.org/html/2610.05025v1",
              "location": "§3.1–3.3式2–6；§4.1–4.4；Appendix B/C",
              "notes": "TUD将π0拆heavyPaliGemma generalistcache与currentSigLIP/Qformer/actionexpert，同anchor跨观测重预测固定slot std衡量plan变化；runningmean阈值online百分位p70+maxskip触发刷新，执行仍committedchunk非每次probeaction。VLA-Arena/CALVIN/实机，variance是stalenessproxy非校准epistemic uncertainty，额外probe成本需计。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05025v1",
          "locations": [
            "§3.1–3.3式2–6；§4.1–4.4；Appendix B/C"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "TUD将π0拆heavyPaliGemma generalistcache与currentSigLIP/Qformer/actionexpert，同anchor跨观测重预测固定slot std衡量plan变化；runningmean阈值online百分位p70+maxskip触发刷新，执行仍committedchunk非每次probeaction。VLA-Arena/CALVIN/实机，variance是stalenessproxy非校准epistemic uncertainty，额外probe成本需计。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05024",
      "title": "LightVLN: Efficient Aerial Vision-and-Language Navigation with Compact Memory and History-Guided Local Aggregation",
      "published": "2026-10-04T07:37:44Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05024",
          "title": "LightVLN: Efficient Aerial Vision-and-Language Navigation with Compact Memory and History-Guided Local Aggregation",
          "published": "2026-10-04T07:37:44Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "LightVLN每historicalframe learnedquery单token FIFO，historyselectinstruction指导current16×16grid固定32局部区域attention汇聚，保留空间覆盖。OpenFly/AerialVLN分开训及未见campus，完整模型1.276B非仅.5B，4090profile/闭环路径应分别记；无额外memoryencoder不等于无visionbackbone。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05024",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05024v1",
              "location": "§III-B/C式1–5；§III-D/E；§IV-A–D"
            },
            {
              "url": "https://arxiv.org/html/2610.05024v1",
              "location": "§III-B/C式1–5；§III-D/E；§IV-A–D",
              "notes": "LightVLN每historicalframe learnedquery单token FIFO，historyselectinstruction指导current16×16grid固定32局部区域attention汇聚，保留空间覆盖。OpenFly/AerialVLN分开训及未见campus，完整模型1.276B非仅.5B，4090profile/闭环路径应分别记；无额外memoryencoder不等于无visionbackbone。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05024v1",
          "locations": [
            "§III-B/C式1–5；§III-D/E；§IV-A–D"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "LightVLN每historicalframe learnedquery单token FIFO，historyselectinstruction指导current16×16grid固定32局部区域attention汇聚，保留空间覆盖。OpenFly/AerialVLN分开训及未见campus，完整模型1.276B非仅.5B，4090profile/闭环路径应分别记；无额外memoryencoder不等于无visionbackbone。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05023",
      "title": "Look Where You Say You're Looking: Self-Grounded Attention for Visual Reasoning",
      "published": "2026-10-04T07:37:27Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.05023",
          "title": "Look Where You Say You're Looking: Self-Grounded Attention for Visual Reasoning",
          "published": "2026-10-04T07:37:27Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Self-Grounded Attention以GroundingDINO为每个CoT观察步骤定位，选定attentionheads的区域显著性得分加答案exactmatch/judge与format奖励后GRPO；head选择依VisualCoT相关性，不能将attention当因果忠实性。SaliencyR1-8k训练与25个VQA lmms-eval评测；需保留真实定位器/辅助judge和8H100训练预算，不能用答案窥视fixture代替。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.05023",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.05023v1",
              "location": "§3.2–3.5（saliency reward、GRPO、head selection）；§4.1–4.2/Table1"
            },
            {
              "url": "https://arxiv.org/html/2610.05023v1",
              "location": "§3.2–3.5（saliency reward、GRPO、head selection）；§4.1–4.2/Table1",
              "notes": "Self-Grounded Attention以GroundingDINO为每个CoT观察步骤定位，选定attentionheads的区域显著性得分加答案exactmatch/judge与format奖励后GRPO；head选择依VisualCoT相关性，不能将attention当因果忠实性。SaliencyR1-8k训练与25个VQA lmms-eval评测；需保留真实定位器/辅助judge和8H100训练预算，不能用答案窥视fixture代替。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.05023v1",
          "locations": [
            "§3.2–3.5（saliency reward、GRPO、head selection）；§4.1–4.2/Table1"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Self-Grounded Attention以GroundingDINO为每个CoT观察步骤定位，选定attentionheads的区域显著性得分加答案exactmatch/judge与format奖励后GRPO；head选择依VisualCoT相关性，不能将attention当因果忠实性。SaliencyR1-8k训练与25个VQA lmms-eval评测；需保留真实定位器/辅助judge和8H100训练预算，不能用答案窥视fixture代替。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.05009",
      "title": "Rethinking Tool Design for Agentic RCA: A Controlled Empirical Study",
      "published": "2026-10-04T07:04:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.05009",
          "title": "Rethinking Tool Design for Agentic RCA: A Controlled Empirical Study",
          "published": "2026-10-04T07:04:41Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.05009",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "RCA工具抽象/组合受控对照研究，非新算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04991",
      "title": "CIPO: Counterfactual Imagination Policy Optimization for Adaptive Tool Granularity Selection",
      "published": "2026-10-04T06:20:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04991",
          "title": "CIPO: Counterfactual Imagination Policy Optimization for Adaptive Tool Granularity Selection",
          "published": "2026-10-04T06:20:50Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04991v1",
          "location": "§3–4；Appendix D/E/L.1/O/P",
          "decision": "accepted",
          "reason": "CIPO用预算BPE挖成功train工具链并实例化可binding/trace/interrupt技能，G4 rollout中两base各在first eligible state替换atomic/skill并同policy继续，bounded outcome difference补充reward再GRPO。适合Agent RL/toolgenome。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04991",
          "limitations": "branch只训练，test不见goldchain；须复制真实envstate而非读最终答案。主TSR将partial计success、五judge重复不是五训练；L.1另yesonly及ToolAthlon三训练seed实环境验证须分别展示。Comp/Raw减policydecisions不等于tokens/latency，基线是同simulator改写非原实现，code未定位。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04977",
      "title": "Do LLMs Understand Sequential Structure? A Controlled Study of Inference and Generation",
      "published": "2026-10-04T05:45:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04977",
          "title": "Do LLMs Understand Sequential Structure? A Controlled Study of Inference and Generation",
          "published": "2026-10-04T05:45:41Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04977",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "RPS/n-gram序列结构能力受控研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04976",
      "title": "Priced Guidance: Can Language Models Generate Future Research Ideas?",
      "published": "2026-10-04T05:45:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04976",
          "title": "Priced Guidance: Can Language Models Generate Future Research Ideas?",
          "published": "2026-10-04T05:45:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Priced Guidance评估器可见目标，最多研究想法机制诊断，不能作evolve能力提升证据。",
          "review_level": "abstract",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04976",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04973",
      "title": "TrajLong: Co-Designing Agentic and Long-Context Supervision for Mid-Training",
      "published": "2026-10-04T05:42:22Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04973",
          "title": "TrajLong: Co-Designing Agentic and Long-Context Supervision for Mid-Training",
          "published": "2026-10-04T05:42:22Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04973v1",
          "location": "§3–4；Appendix A.2/A.3/C/D.1",
          "decision": "pending",
          "reason": "TrajLong把agenttrajectory清洗重排成Retrieval/MultidocQA/StateTracking，context+multipleQA全tokenCPT，10Bcompiled与30Bbackground固定mixture，之后统一SFT。未定位完整compiled/contextsource及background数据/checkpoint，暂缓原方法规模复现，编译器可另作小规模研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.04973",
          "limitations": "256K40BtokenCPT须保持原loss/背景mix契约，玩具QA不等于原复现；sourcelevel去benchmark污染，任一derivedQA命中全源移除。ρ1仅四settings相关非因果；Avg@3/BoN@3要分开且不是trainingseed，finaltest不用于挑checkpoint。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04961",
      "title": "Building LLM Agent Systems the Deep Learning Way: From Modular Design to Architecture Search",
      "published": "2026-10-04T05:11:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04961",
          "title": "Building LLM Agent Systems the Deep Learning Way: From Modular Design to Architecture Search",
          "published": "2026-10-04T05:11:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "深度学习式agent架构搜索和prompt优化，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04961",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04961",
          "title": "Building LLM Agent Systems the Deep Learning Way: From Modular Design to Architecture Search",
          "published": "2026-10-04T05:11:20Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04961v1",
          "location": "§3–4；Appendix B/C/D Optuna ranges",
          "decision": "accepted",
          "reason": "LLM building blocks将单调用/历史递归/ToT/GoT/多queryRAG组合为可执行harness，自反思更新metaprompt，Optuna在train30%搜索max tokens/head/retrieve参数后70%test冻结。publicGSM8K/StrategyQA/TSP可实现模块化架构搜索。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04961",
          "limitations": "Transformer/RNN等是workflow类比不是训练新神经架构；feedback propagation是prompt文本编辑非梯度。Related-multi只afterreviewrelease，不能宣称已有原完整结果；检索F1对citationreference不等于related-work质量，外部gold仅评分，120trial成本与randombaselinebudget匹配。",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04957",
      "title": "Trinity: One Differentiable Physics for Training, Refining and Scoring Generative Floorplanners",
      "published": "2026-10-04T05:07:16Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04957",
          "title": "Trinity: One Differentiable Physics for Training, Refining and Scoring Generative Floorplanners",
          "published": "2026-10-04T05:07:16Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Trinity芯片floorplanning生成/精化，专用工程优化。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04957",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04950",
      "title": "How Should Teachers Be Prepared? RL on Student-Induced States for On-Policy Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04950",
          "title": "How Should Teachers Be Prepared? RL on Student-Induced States for On-Policy Distillation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Prep-OPD先让teacher在固定初始student产生的prefix状态上RL，再冻结teacher做OPD，实测DeepMath及8数学基准；无gold解法灌入teacher，需保留两阶段状态分布。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04950",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04950v1",
              "location": "§3；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04940",
      "title": "Software World Models: From Consequence Prediction to Decision Value",
      "published": "2026-10-04T04:34:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04940",
          "title": "Software World Models: From Consequence Prediction to Decision Value",
          "published": "2026-10-04T04:34:44Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04940v1",
          "location": "§3.1–3.3/Algorithm1; §4; Appendix D.5–D.13",
          "decision": "accepted",
          "reason": "SWM 从恢复的训练世界执行反事实变化，SFT warmup+GRPO 学习 downstream blast set，再以采样概率决策迁移和付费检查；真实开源库与独立 synthetic world 可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04940v1",
          "limitations": "不是静态图可达性替代：结构与学习互补；expert exploration 用特权图，仅训练对照；预测 F1 与决策 regret 不能混成同一优势；公开软件环境重放仍需核验。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "SWM 从恢复的训练世界执行反事实变化，SFT warmup+GRPO 学习 downstream blast set，再以采样概率决策迁移和付费检查；真实开源库与独立 synthetic world 可验证。",
          "data_verifiability": "不是静态图可达性替代：结构与学习互补；expert exploration 用特权图，仅训练对照；预测 F1 与决策 regret 不能混成同一优势；公开软件环境重放仍需核验。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04927",
      "title": "Assembling Insights for Agentic Machine Learning Engineering Systems",
      "published": "2026-10-04T04:10:28Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04927",
          "title": "Assembling Insights for Agentic Machine Learning Engineering Systems",
          "published": "2026-10-04T04:10:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04927v1",
          "location": "§3–5; normalized p33,44–55",
          "decision": "accepted",
          "reason": "MLE-InsightForge 从源竞赛 gold 解法提炼 competition/domain/improvement insight，按触发-动作条件注入 ReAct 解法树；160 Kaggle 任务/12域的源-目标隔离协议可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04927v1",
          "limitations": "绝不能读目标任务 winning solution；私有测试输入在最终选中后外部重跑；Kaggle 登录/许可与下载资格要逐项核验；预训练污染仍不被源任务隔离消除。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "MLE-InsightForge 从源竞赛 gold 解法提炼 competition/domain/improvement insight，按触发-动作条件注入 ReAct 解法树；160 Kaggle 任务/12域的源-目标隔离协议可验证。",
          "data_verifiability": "绝不能读目标任务 winning solution；私有测试输入在最终选中后外部重跑；Kaggle 登录/许可与下载资格要逐项核验；预训练污染仍不被源任务隔离消除。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04921",
      "title": "Complex Agents, Shallow Tests: Demystifying and Enhancing Test Adequacy of Agent Harness in the Wild",
      "published": "2026-10-04T04:03:10Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04921",
          "title": "Complex Agents, Shallow Tests: Demystifying and Enhancing Test Adequacy of Agent Harness in the Wild",
          "published": "2026-10-04T04:03:10Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04921v1",
          "location": "§6 HarnessTester；§7 coverage/mutants；§8 H-Bench；threats/artifact statement",
          "decision": "accepted",
          "reason": "HarnessTester用coverage找未覆盖LLM依赖代码，AST精确检索构造器/fixture/mock绑定，指导保留调用契约并生成不同分支测试，适合harness工程测试候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04921",
          "fulltext_review_completed": true,
          "locations": [
            "§6 HarnessTester",
            "§7 coverage/mutants",
            "§8 H-Bench",
            "threats/artifact statement"
          ],
          "limitations": "同模型120分钟预算，scope与general基线需分开；mock必须符合真实provider结构与注入点。覆盖率或mutant kill不能替代真实模型能力，历史bug评测要隔离已知patch，官方artifact链接未从提取文本恢复。",
          "code_status": "paper declares artifact, canonical release URL not yet resolved",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04918",
      "title": "Residual Visual Credit Optimization: Conserved Evidence Routing for Multimodal Reinforcement Learning",
      "published": "2026-10-04T03:56:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04918",
          "title": "Residual Visual Credit Optimization: Conserved Evidence Routing for Multimodal Reinforcement Learning",
          "published": "2026-10-04T03:56:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "RVCO多模态RL token信用分配，由post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04918",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.04918",
          "title": "Residual Visual Credit Optimization: Conserved Evidence Routing for Multimodal Reinforcement Learning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "RVCO用图像patch干预似然构建证据分数、IQR/entropy路由及residual校正精确保留响应credit质量；ViRL39K四VLM家族训练，需真视觉干预而非固定token启发式。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04918",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04918v1",
              "location": "§3.1–3.3；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04916",
      "title": "PreAct-Nav: Agentic Reasoning Before Action for Urban Navigation",
      "published": "2026-10-04T03:50:39Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04916",
          "title": "PreAct-Nav: Agentic Reasoning Before Action for Urban Navigation",
          "published": "2026-10-04T03:50:39Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04916v1",
          "location": "Method action-review loop; normalized p36–55; Appendix D/F/G",
          "decision": "accepted",
          "reason": "PreAct-Nav 用 Navigation Memory 的中期子目标和按需 Predictive Sandbox 生成行动未来线索，冻结 VLM 先审后行动，证据未决或修订无效则回退原 policy。UrbanNav/CityWalker 可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04916v1",
          "limitations": "预测只由当前观测与拟议动作产生，不可查真实未来；统一行动格式/决策预算；预测工具、记忆、审查成本须全部计入；seen/unseen 分开。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "PreAct-Nav 用 Navigation Memory 的中期子目标和按需 Predictive Sandbox 生成行动未来线索，冻结 VLM 先审后行动，证据未决或修订无效则回退原 policy。UrbanNav/CityWalker 可验证。",
          "data_verifiability": "预测只由当前观测与拟议动作产生，不可查真实未来；统一行动格式/决策预算；预测工具、记忆、审查成本须全部计入；seen/unseen 分开。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04915",
      "title": "Are We Measuring Scientific Intelligence? Rethinking the Evaluation of AI Scientists",
      "published": "2026-10-04T03:50:36Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04915",
          "title": "Are We Measuring Scientific Intelligence? Rethinking the Evaluation of AI Scientists",
          "published": "2026-10-04T03:50:36Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04915v1",
          "location": "§4.1–4.3 Eq2–5；§5；Appendix B/D；Limitations",
          "decision": "accepted",
          "reason": "以null/withdrawal/flip三类经统计量验证的反事实数据评估科学Agent是否依证据作答，并用EGA区别答对旧key与响应新证据，可接研究完整性评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04915",
          "fulltext_review_completed": true,
          "locations": [
            "§4.1–4.3 Eq2–5",
            "§5",
            "Appendix B/D",
            "Limitations"
          ],
          "limitations": "18单细胞题+4合成遗传统计题，人工反事实与少量模型；统一清理文件名/gzipheader/raw层等避免答案泄漏。参考统计与gold仅verifier可见，证据响应不等于完整科学质量，不能用旧答案评分flip。",
          "code_status": "protocol and examples in paper; complete author package URL not located",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04914",
      "title": "Monitorability Disposition in Large Reasoning Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04914",
          "title": "Monitorability Disposition in Large Reasoning Models",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "monitorability disposition是独立自报告/关闭监控工具协议：两channel topology×四directive、三类150条既有任务与外部judge。附录有prompt，但未找到作者可执行runner/结果数据公开入口；需要公共执行资源核实，不因无新loss拒绝。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04914v1",
              "location": "§2.1–2.5；§3；Appendix A–B"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "监控自报告意愿评测与工具选择测量，没有后训练方法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "monitorability disposition是独立自报告/关闭监控工具协议：两channel topology×四directive、三类150条既有任务与外部judge。附录有prompt，但未找到作者可执行runner/结果数据公开入口；需要公共执行资源核实，不因无新loss拒绝。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04899",
      "title": "Rewrite What Matters: Adaptive Multilingual Query Rewriting for Reasoning via Agentic Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04899",
          "title": "Rewrite What Matters: Adaptive Multilingual Query Rewriting for Reasoning via Agentic Reinforcement Learning",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "mRewriter-R1以冻结下游准确率奖励训练query重写，正文明确使用标准GRPO；aspect/operator规划属于应用框架而非核心优化器创新。 该决定仅限后训练核心track，Agent方法/数据公共入口由Agent track独立判断，不能据此全局拒绝。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04899",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04899v1",
              "location": "§2.3；§3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04899",
          "title": "Rewrite What Matters: Adaptive Multilingual Query Rewriting for Reasoning via Agentic Reinforcement Learning",
          "published": "2026-10-04T03:19:46Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04899v1",
          "location": "§3/GRPO; Appendix A/D/F; normalized p16,29,82–106",
          "decision": "accepted",
          "reason": "mRewriter-R1 顺序执行 language/structural/semantic 三类有限算子，由 GRPO 优化冻结下游模型结果。MGSM/BELEBELE/XCOPA 明确训练和标准语言测试可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04899v1",
          "limitations": "不是无约束自由 rewrite；语义/数字/实体保持并非完美，需测变坏实例；三次推理平均不是独立训练种子；下游正确答案只能奖励训练/测试评分。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "mRewriter-R1 顺序执行 language/structural/semantic 三类有限算子，由 GRPO 优化冻结下游模型结果。MGSM/BELEBELE/XCOPA 明确训练和标准语言测试可验证。",
          "data_verifiability": "不是无约束自由 rewrite；语义/数字/实体保持并非完美，需测变坏实例；三次推理平均不是独立训练种子；下游正确答案只能奖励训练/测试评分。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04893",
      "title": "SFlexRCA: Lightweight, Scalable, and Flexible Root Cause Analysis for IIoT Edge Systems",
      "published": "2026-10-04T03:01:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04893",
          "title": "SFlexRCA: Lightweight, Scalable, and Flexible Root Cause Analysis for IIoT Edge Systems",
          "published": "2026-10-04T03:01:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "SFlexRCA工业IoT传感器根因分析，非基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04893",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04889",
      "title": "ForkPilot: Self-Evolving Policy for Retrospective Search in Long-Horizon Agents",
      "published": "2026-10-04T02:53:58Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04889",
          "title": "ForkPilot: Self-Evolving Policy for Retrospective Search in Long-Horizon Agents",
          "published": "2026-10-04T02:53:58Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.04889v1",
          "location": "PDF pp3–6; Algorithm1 p21; Appendix D.3/Table6",
          "decision": "accepted",
          "reason": "ForkPilot 使用恢复同状态的 search-vs-skip 成对完成轨迹训练 task-bootstrap ensemble，结合成本、支持度与校准边际决定 commit/probe/skip，任务内冻结、跨已完成源任务更新。六个公开 benchmark 可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/pdf/2610.04889v1",
          "limitations": "必须真正恢复环境且隔离并行写入；经验只在任务完成后更新，不使用当前未来结果；source-only 选 λ/阈值；conformal 覆盖针对 realized paired target 而非保证闭环均值。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "ForkPilot 使用恢复同状态的 search-vs-skip 成对完成轨迹训练 task-bootstrap ensemble，结合成本、支持度与校准边际决定 commit/probe/skip，任务内冻结、跨已完成源任务更新。六个公开 benchmark 可验证。",
          "data_verifiability": "必须真正恢复环境且隔离并行写入；经验只在任务完成后更新，不使用当前未来结果；source-only 选 λ/阈值；conformal 覆盖针对 realized paired target 而非保证闭环均值。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04888",
      "title": "No Hindsight for LLM Fact-Checkers: Measuring Leakage Channels in Misinformation Detection",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04888",
          "title": "No Hindsight for LLM Fact-Checkers: Measuring Leakage Channels in Misinformation Detection",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "point-in-time fact-checking分离检索未来证据和参数结果泄漏，有日期trust-tier、时间split、冻结LLM瓶颈/MI head；正文明确date cache、split、K文本与code将在camera-ready发布。当前不能确认公共重现入口；K含label信息与未知日期丢弃是已知限制。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04888v1",
              "location": "§3.3–3.5；§4；Table 8；Limitations"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "fact-checking未来证据/参数泄漏测量与表示瓶颈控制，非RL/OPD新算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "point-in-time fact-checking分离检索未来证据和参数结果泄漏，有日期trust-tier、时间split、冻结LLM瓶颈/MI head；正文明确date cache、split、K文本与code将在camera-ready发布。当前不能确认公共重现入口；K含label信息与未知日期丢弃是已知限制。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04882",
      "title": "ResOPD: Tail Residualization for Sparse On-Policy Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04882",
          "title": "ResOPD: Tail Residualization for Sparse On-Policy Distillation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "ResOPD完整top-k质量加tail bucket基线，每步coarse梯度与稀有tail残差组成无偏估计（仅全支持祖先采样）；主数学实验top-p=.95/top-k20不满足该无偏条件，必须分别报告机制与成绩。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04882",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04882v1",
              "location": "§3.2–3.3 Eq.8–15；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04878",
      "title": "Bounded Reasoning: Cognitive Hierarchy in Human-versus-AI Cyber Defense",
      "published": "2026-10-04T02:29:26Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04878",
          "title": "Bounded Reasoning: Cognitive Hierarchy in Human-versus-AI Cyber Defense",
          "published": "2026-10-04T02:29:26Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04878",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "人/DQN网络防御认知层次实验，无LLM策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04868",
      "title": "From Memory to Guide: Spatio-Temporal Composer for Procedural Coding Memory",
      "published": "2026-10-04T02:15:24Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04868",
          "title": "From Memory to Guide: Spatio-Temporal Composer for Procedural Coding Memory",
          "published": "2026-10-04T02:15:24Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04868v1",
          "location": "Method/Algorithm1; normalized p28–51; Experiments p52–63",
          "decision": "accepted",
          "reason": "Composer 由 Selector 选择 Skill 并保留 whyNow，将规则绑定当前实体形成 Runtime Guide，按完成/失效条件终止并重新进入任务要求。固定 Skill Bank 的程序记忆适配机制可实施。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04868v1",
          "limitations": "论文13项 EngramBench/8小时级私有长任务包的下载和权限未核验；7.2pp/32.2% 数字不能挪用为公开通用 benchmark 结果；guide 不能包含未来正确修复。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "Composer 由 Selector 选择 Skill 并保留 whyNow，将规则绑定当前实体形成 Runtime Guide，按完成/失效条件终止并重新进入任务要求。固定 Skill Bank 的程序记忆适配机制可实施。",
          "data_verifiability": "论文13项 EngramBench/8小时级私有长任务包的下载和权限未核验；7.2pp/32.2% 数字不能挪用为公开通用 benchmark 结果；guide 不能包含未来正确修复。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04867",
      "title": "Greedy Local Learning for Language Model Pretraining: Gaps and Objective Design",
      "published": "2026-10-04T02:10:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04867",
          "title": "Greedy Local Learning for Language Model Pretraining: Gaps and Objective Design",
          "published": "2026-10-04T02:10:52Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "rejected",
          "reason": "正文明确定位为局部学习测量研究而非具体新方法；不单独新增算法adapter，可保留为局部预测/JEV目标设计对照文献。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04867",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04867v1",
              "location": "§3.1–3.4; §4.1–4.5 Tables1–4; §5 Limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.04867v1",
              "location": "§3.1–3.4; §4.1–4.5 Tables1–4; §5 Limitations",
              "notes": "stopgrad等深分块+MLP/Transformer辅助头；first-block双offsetMTP，最终head标准NTP；125/400M、FineWebEdu2.7/7.5Btoken；400M K4 peak29.2→15.8GiB而训练FLOPs+48%、NLL劣于E2E。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04867v1",
          "locations": [
            "§3.1–3.4",
            "§4.1–4.5 Tables1–4",
            "§5 Limitations"
          ],
          "limitations": "单seed且token非compute匹配，单GPU模拟stage不能证明分布式吞吐；论文称release但已查正文未见可核官方repo入口；不把memory机制诊断当能力改进。",
          "code_url": null,
          "kind": "analysis",
          "implementation_status": "not_implemented",
          "fulltext_notes": "stopgrad等深分块+MLP/Transformer辅助头；first-block双offsetMTP，最终head标准NTP；125/400M、FineWebEdu2.7/7.5Btoken；400M K4 peak29.2→15.8GiB而训练FLOPs+48%、NLL劣于E2E。",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04862",
      "title": "GitSwarm: Decentralized Compounding Inference",
      "published": "2026-10-04T02:03:24Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04862",
          "title": "GitSwarm: Decentralized Compounding Inference",
          "published": "2026-10-04T02:03:24Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "GitSwarm持久git记忆多agent推理，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04862",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04851",
      "title": "CURIO: Curiosity-Driven Test-Time Learning for Open-Ended Discovery",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04851",
          "title": "CURIO: Curiosity-Driven Test-Time Learning for Open-Ended Discovery",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "CURIO训练hidden-state transition预测器并缓存更新前残差，epoch归一后只在非top-k采样token加bonus；它不是语义新颖性保证，encoder/predictor仍可能collapse；有科学发现任务实测。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04851",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04851v1",
              "location": "§3.2–3.3 Eq.5–14；实验"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04845",
      "title": "Which Preferences to Train On? End-to-End Multi-Objective Alignment with an Adversarial Preference Distribution",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04845",
          "title": "Which Preferences to Train On? End-to-End Multi-Objective Alignment with an Adversarial Preference Distribution",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "MAESTRO用Dirichlet对抗偏好分布DirUEG更新，独立adversary/policy批次、向量reward GAE后偏好标量化；多目标HH/Beaver与摘要faithfulness实验。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04845",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04845v1",
              "location": "§3 Algorithm 1；§3.2；实验"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04832",
      "title": "Agent Skill Evolution: How Revisions Affect Coding Agents",
      "published": "2026-10-04T00:33:46Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04832",
          "title": "Agent Skill Evolution: How Revisions Affect Coding Agents",
          "published": "2026-10-04T00:33:46Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04832",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "SKILL修订对Agent遵守/成本的经验研究，无新算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04824",
      "title": "Agent Behavior as Code: Efficient and Robust LLM Agents with Programmatic Specifications",
      "published": "2026-10-04T00:14:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04824",
          "title": "Agent Behavior as Code: Efficient and Robust LLM Agents with Programmatic Specifications",
          "published": "2026-10-04T00:14:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ABCAgent符号程序规定agent行为，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04824",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04824",
          "title": "Agent Behavior as Code: Efficient and Robust LLM Agents with Programmatic Specifications",
          "published": "2026-10-04T00:14:33Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04824v1",
          "location": "ABCAgent design/execution separation; Experiments; Appendix C/D; normalized p15,22,24–27",
          "decision": "accepted",
          "reason": "ABCAgent 以有未绑定输入变量的程序规定 agent 行为，代码 executor 管理作用域和类型状态，LM 负责设计/修改。GAIA、WorkArena、GSM-Symbolic、tau2 的公开基础任务可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04824v1",
          "limitations": "原作者实现与 augmented GAIA/WorkArena-CF 称接收后发布，不能声称已复现扩展18题；GAIA dev 是原文评测集需防后验修改程序；不同实例不允许固化答案。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "ABCAgent 以有未绑定输入变量的程序规定 agent 行为，代码 executor 管理作用域和类型状态，LM 负责设计/修改。GAIA、WorkArena、GSM-Symbolic、tau2 的公开基础任务可验证。",
          "data_verifiability": "原作者实现与 augmented GAIA/WorkArena-CF 称接收后发布，不能声称已复现扩展18题；GAIA dev 是原文评测集需防后验修改程序；不同实例不允许固化答案。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04805",
      "title": "ExStereo: Lifting 2D Vision-Language-Action Models to 3D with Explicit Stereo Representations",
      "published": "2026-10-03T23:21:18Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04805",
          "title": "ExStereo: Lifting 2D Vision-Language-Action Models to 3D with Explicit Stereo Representations",
          "published": "2026-10-03T23:21:18Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ExStereo由冻结FastFoundationStereo、标定fxB/d和桌面RANSAC构造4方向正交depth/xyz/valid显式表示，以actionquery crossattention残差接入VLA；不替换prefix/VLM。7个3500episodes midtraining与10个评测任务/对象不交叠，post每任务100episodes；RoboTwin和三实机任务20次各验证。上游深度计算和标定必须计成本，不能把平均成功率百分点改写相对提升。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04805",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04805v1",
              "location": "§IV-A–C；§V-A–C/TableI；§VI/TableIII"
            },
            {
              "url": "https://arxiv.org/html/2610.04805v1",
              "location": "§IV-A–C；§V-A–C/TableI；§VI/TableIII",
              "notes": "ExStereo由冻结FastFoundationStereo、标定fxB/d和桌面RANSAC构造4方向正交depth/xyz/valid显式表示，以actionquery crossattention残差接入VLA；不替换prefix/VLM。7个3500episodes midtraining与10个评测任务/对象不交叠，post每任务100episodes；RoboTwin和三实机任务20次各验证。上游深度计算和标定必须计成本，不能把平均成功率百分点改写相对提升。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04805v1",
          "locations": [
            "§IV-A–C；§V-A–C/TableI；§VI/TableIII"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "ExStereo由冻结FastFoundationStereo、标定fxB/d和桌面RANSAC构造4方向正交depth/xyz/valid显式表示，以actionquery crossattention残差接入VLA；不替换prefix/VLM。7个3500episodes midtraining与10个评测任务/对象不交叠，post每任务100episodes；RoboTwin和三实机任务20次各验证。上游深度计算和标定必须计成本，不能把平均成功率百分点改写相对提升。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04802",
      "title": "Multi-Agent Spectrum Sharing",
      "published": "2026-10-03T23:04:54Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04802",
          "title": "Multi-Agent Spectrum Sharing",
          "published": "2026-10-03T23:04:54Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04802",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "认知雷达多Agent频谱meta-RL，非LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04794",
      "title": "Knowing the Store: What a Memory Backend Must Write Down Before an Agent Can Read It",
      "published": "2026-10-03T22:39:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04794",
          "title": "Knowing the Store: What a Memory Backend Must Write Down Before an Agent Can Read It",
          "published": "2026-10-03T22:39:33Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.04794",
          "location": "§3 pp.2–3 lifecycle / coverage；§4–8 controls；§9 p.8 limitations；Reproducibility p.9",
          "decision": "accepted",
          "reason": "可接入记忆治理诊断基础设施：区分 active/superseded/retracted/expired 与 current/past/change 意图，比较无值的状态摘要、返回记录 tags、简单名称 lookup，含444条同问题反事实存储版本。正文明确公开代码与数据，可忠实实现监测协议。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04794",
          "limitations": "这是监测诊断而非新 Agent 能力算法；gold 构造 oracle tags 仅作上界，不得在能力路径读入。仅40个合成人物，部分子组30条；匹配 AUROC 为事后分析且71比较未校正。提及检测未收集人工标签，没有证据说明判断改善答案，未实现 backend 写入维护机制。",
          "code": "https://github.com/ansh348/knowing-the-store",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04792",
      "title": "Do More Modalities Always Help? A Geometric Perspective on Missing-Modality Robustness",
      "published": "2026-10-03T22:34:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04792",
          "title": "Do More Modalities Always Help? A Geometric Perspective on Missing-Modality Robustness",
          "published": "2026-10-03T22:34:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "GU针对缺失图像的Grassmann子空间编辑可作为多模态稳健算子。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04792",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04792v1",
              "location": "§3–4; §5 Eq1–5; §6.1–6.5 Tables2–4; App D/E"
            },
            {
              "url": "https://arxiv.org/html/2610.04792v1",
              "location": "§3–4; §5 Eq1–5; §6.1–6.5 Tables2–4; App D/E",
              "notes": "同参数化的多模态TI与nullimage训练Treference；开发集meanprincipalangle+errorharm zscore选单层。保留UΣ及残差，只把topk输入V沿Grassmann到参考旋转η。HatefulMemes/SNLI-VE/IUXRay二分类，AOKVQA扩展；同时报告缺失模态恢复与完整保持，3run。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04792v1",
          "locations": [
            "§3–4",
            "§5 Eq1–5",
            "§6.1–6.5 Tables2–4",
            "App D/E"
          ],
          "limitations": "需要额外训练matchedT模型，不能仅宣称编辑毫秒总成本；Table4含reference cost。geodesic最短距离不是任务最优证明。k/η/层仅development挑选，test隔离；未找到作者代码。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "同参数化的多模态TI与nullimage训练Treference；开发集meanprincipalangle+errorharm zscore选单层。保留UΣ及残差，只把topk输入V沿Grassmann到参考旋转η。HatefulMemes/SNLI-VE/IUXRay二分类，AOKVQA扩展；同时报告缺失模态恢复与完整保持，3run。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04779",
      "title": "Asymmetric Repository Lineage Modeling and Verifier-Guided Coordination in Concurrent AI Coding Agents",
      "published": "2026-10-03T21:37:15Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04779",
          "title": "Asymmetric Repository Lineage Modeling and Verifier-Guided Coordination in Concurrent AI Coding Agents",
          "published": "2026-10-03T21:37:15Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04779v1",
          "location": "MergeGym T1/T2/T3; lineage replay; normalized p24–41,59",
          "decision": "accepted",
          "reason": "MergeGym 区分 open-time authored-file overlap、真实 git merge-tree 冲突与调度重放；229 heldout repositories 的 T1、5936 可重放 T2 与97仓库调度任务是可执行基础设施候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04779v1",
          "limitations": "T3 固定历史标签、duration 和非反应 agent，不是因果生产试验；oracle gate 不是可部署策略；31不能重建的 patch 不得计为干净；语义冲突仍未解决。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "MergeGym 区分 open-time authored-file overlap、真实 git merge-tree 冲突与调度重放；229 heldout repositories 的 T1、5936 可重放 T2 与97仓库调度任务是可执行基础设施候选。",
          "data_verifiability": "T3 固定历史标签、duration 和非反应 agent，不是因果生产试验；oracle gate 不是可部署策略；31不能重建的 patch 不得计为干净；语义冲突仍未解决。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04777",
      "title": "ARISE: Adaptive Agentic Reasoning with Image-grounded Self-Evaluation for Interpretable IBD Assessment",
      "published": "2026-10-03T21:35:55Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04777",
          "title": "ARISE: Adaptive Agentic Reasoning with Image-grounded Self-Evaluation for Interpretable IBD Assessment",
          "published": "2026-10-03T21:35:55Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ARISE炎症性肠病诊断agent，专用医疗工作流。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04777",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04777",
          "title": "ARISE: Adaptive Agentic Reasoning with Image-grounded Self-Evaluation for Interpretable IBD Assessment",
          "published": "2026-10-03T21:35:55Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04777v1",
          "location": "ARISE state/refinement/Z3; normalized p13–22,30–32",
          "decision": "pending",
          "reason": "ARISE 从训练图像标签和专家视觉词汇构造可检查临床假设，validation 精炼后转 FOL/Z3 修复冲突；已读定义算法及 CrohnIPI/C-TRUS 评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "source_url": "https://arxiv.org/html/2610.04777v1",
          "limitations": "审后延期：专家 finding annotations 与13患者切分、全提示/实现发布尚未核验；临床 satisfiable 不等于医学正确；不得在诊断测试阶段向 agent 提供病变标签。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "ARISE 从训练图像标签和专家视觉词汇构造可检查临床假设，validation 精炼后转 FOL/Z3 修复冲突；已读定义算法及 CrohnIPI/C-TRUS 评测。",
          "data_verifiability": "审后延期：专家 finding annotations 与13患者切分、全提示/实现发布尚未核验；临床 satisfiable 不等于医学正确；不得在诊断测试阶段向 agent 提供病变标签。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04753",
      "title": "More Value per Key: Asymmetric Sparse Attention for Faster LLM Decoding",
      "published": "2026-10-03T20:38:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04753",
          "title": "More Value per Key: Asymmetric Sparse Attention for Faster LLM Decoding",
          "published": "2026-10-03T20:38:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SAGA 解耦key/value头数，结合周期刷新阈值的近似top-N；预训练GQA转换通过数据加权key合并、最小权匹配和KL+CE蒸馏，而非简单删头。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04753",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04753v1",
              "location": "§3.1–3.2; §4.1 Eq13–18; §5.1–5.3 Tables1–2; §6; official repository"
            },
            {
              "url": "https://arxiv.org/html/2610.04753v1",
              "location": "§3.1–3.2; §4.1 Eq13–18; §5.1–5.3 Tables1–2; §6; official repository",
              "notes": ""
            }
          ],
          "kind": "asymmetric_attention_architecture",
          "locations": [
            "§3.1–3.2",
            "§4.1 Eq13–18",
            "§5.1–5.3 Tables1–2",
            "§6",
            "official repository"
          ],
          "limitations": "初始化推导忽略RoPE；长上下文速度不能外推短序列，且质量确有下降。原文H200/B200 timing、约23K蒸馏迭代，A100需重新测；Atop-N不是固定恰好N项。",
          "code_url": "https://github.com/noamelata/SAGA",
          "code_status": "official PyTorch attention, merge_heads, distill, train_scratch and eval scripts accessible; license not displayed",
          "official_url": "https://arxiv.org/html/2610.04753v1",
          "review_provenance": "root 独立正文审查；foundation读取整合",
          "implementation_status": "not_implemented",
          "fulltext_notes": "",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04740",
      "title": "Toward a Locally Deployable Agentic Co-Scientist: Small-Model Planning for Early-Stage Drug Discovery",
      "published": "2026-10-03T20:09:34Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04740",
          "title": "Toward a Locally Deployable Agentic Co-Scientist: Small-Model Planning for Early-Stage Drug Discovery",
          "published": "2026-10-03T20:09:34Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04740v1",
          "location": "System/UMS/Planner; normalized p11–20,103,130–131; Appendix A/B",
          "decision": "pending",
          "reason": "小模型 Co-Scientist 以 UMS 分块状态和18科学工具构造依赖合法计划，用路径先行的1263 query-plan 对 LoRA，再由 rule evaluator 反馈重规划。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "source_url": "https://arxiv.org/html/2610.04740v1",
          "limitations": "审后延期：自建 query-plan 数据与内部工具/外部服务完整可执行链未公开核验；query-level split 不是 workflow-type 隔离；schema-valid-only 分母指标不能当端到端科学成功率。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "小模型 Co-Scientist 以 UMS 分块状态和18科学工具构造依赖合法计划，用路径先行的1263 query-plan 对 LoRA，再由 rule evaluator 反馈重规划。",
          "data_verifiability": "审后延期：自建 query-plan 数据与内部工具/外部服务完整可执行链未公开核验；query-level split 不是 workflow-type 隔离；schema-valid-only 分母指标不能当端到端科学成功率。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04721",
      "title": "Knossos and Ariadne: Benchmarking and Learning Complete Diagram Topology Extraction with Vision-Language Models",
      "published": "2026-10-03T19:20:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04721",
          "title": "Knossos and Ariadne: Benchmarking and Learning Complete Diagram Topology Extraction with Vision-Language Models",
          "published": "2026-10-03T19:20:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Meta合著Ariadne先预测nodeinventory，再每组3active source对全predicted nodes输出typed edges，确定性并集后单独trace；推理不读GTinventory。Knossos六域18k/1200不同seed，另TopoBench162图外测；模板内seed隔离非未见grammar泛化。公开dataset/repo链接明确，方法与图结构评测皆有独立价值。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04721",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04721v1",
              "location": "§2.3–2.5；§3.1–3.3式1–2；§4.1–4.4；Appendix B.5; README Quickstart/Ariadne/Code and Assets；adapter weights not included"
            },
            {
              "url": "https://arxiv.org/html/2610.04721v1",
              "location": "§2.3–2.5；§3.1–3.3式1–2；§4.1–4.4；Appendix B.5; README Quickstart/Ariadne/Code and Assets；adapter weights not included",
              "notes": "Meta合著Ariadne先预测nodeinventory，再每组3active source对全predicted nodes输出typed edges，确定性并集后单独trace；推理不读GTinventory。Knossos六域18k/1200不同seed，另TopoBench162图外测；模板内seed隔离非未见grammar泛化。公开dataset/repo链接明确，方法与图结构评测皆有独立价值。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04721v1",
          "locations": [
            "§2.3–2.5；§3.1–3.3式1–2；§4.1–4.4；Appendix B.5",
            "README Quickstart/Ariadne/Code and Assets；adapter weights not included"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "Meta合著Ariadne先预测nodeinventory，再每组3active source对全predicted nodes输出typed edges，确定性并集后单独trace；推理不读GTinventory。Knossos六域18k/1200不同seed，另TopoBench162图外测；模板内seed隔离非未见grammar泛化。公开dataset/repo链接明确，方法与图结构评测皆有独立价值。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04716",
      "title": "Towards Automatically Pruning Logging Code with Coding Agents: How Far Are We?",
      "published": "2026-10-03T19:11:19Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04716",
          "title": "Towards Automatically Pruning Logging Code with Coding Agents: How Far Are We?",
          "published": "2026-10-03T19:11:19Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.04716",
          "location": "§3–5 pp.3–6、Tables4–11 pp.8–11、§8 p.12",
          "decision": "pending",
          "reason": "LogRem从真实合入的Python/Java日志删除历史，经静态识别和人工核验构造387任务；给agent改前源文件和不暴露目标行的描述，比较日志删除集合、无关代码保留及完整轨迹。可选历史讨论与10类模式/11类原因提示用于上下文消融。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "可解析输出不等于功能正确；RWCA仅对齐历史开发者补丁，不是唯一正确解。最终输出validity95.6–100%但RWCA11.1–19.6%。历史commit/discussion可能含未来意图，应与无历史条件分开并防补丁泄漏；同一任务不得供evolve选参。正文未定位LogRem387标注/原始执行轨迹公开下载，暂缓精确benchmark复现，不能用自造日志case冒充。",
          "code": "正文未定位LogRem原始数据/实现仓库；Codex/OpenHands/mini-SWE框架链接不是论文数据释放",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/pdf/2610.04716",
              "location": "§3–5 pp.3–6、Tables4–11 pp.8–11、§8 p.12",
              "access_method": "web_fulltext_fallback"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04699",
      "title": "Not Self-Decidable: LLMs Cannot Draw the Boundary of What an Agent Verifier Can Check",
      "published": "2026-10-03T18:25:12Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04699",
          "title": "Not Self-Decidable: LLMs Cannot Draw the Boundary of What an Agent Verifier Can Check",
          "published": "2026-10-03T18:25:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04699v1",
          "location": "§6/CoVer Algorithm1; normalized p53–60; Appendix A/E",
          "decision": "accepted",
          "reason": "CoVer 将模型 corroboration 只用于提名，生成 fact-slot+规则并用 structure/groundedness/invariance/sensitivity 四门验证；使用基础设施 attested 字段、缺失或异常则 fail closed。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04699v1",
          "limitations": "73规则/36合成记录狭窄；precision 不比同消除率 unanimity 更优，不能宣传解决 decidability；LLM 自己填写 consent 字段不是外部授权证据；人工/LLM ground truth 分开。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "CoVer 将模型 corroboration 只用于提名，生成 fact-slot+规则并用 structure/groundedness/invariance/sensitivity 四门验证；使用基础设施 attested 字段、缺失或异常则 fail closed。",
          "data_verifiability": "73规则/36合成记录狭窄；precision 不比同消除率 unanimity 更优，不能宣传解决 decidability；LLM 自己填写 consent 字段不是外部授权证据；人工/LLM ground truth 分开。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04687",
      "title": "Understanding Errors in LLM-Based Question Answering over Imperfect Tables",
      "published": "2026-10-03T18:03:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04687",
          "title": "Understanding Errors in LLM-Based Question Answering over Imperfect Tables",
          "published": "2026-10-03T18:03:41Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04687v1",
          "location": "GBDI workflow; normalized p11,29,39,45,55–61; Appendix A/B/E/F",
          "decision": "accepted",
          "reason": "GBDI 对表格随机行排列做五个独立发现 context，映射回原行合并 union ledger，再按可验证证据 Edit/Drop/No-op。RADAR-T313例/53任务/27表可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04687v1",
          "limitations": "已人工修复表仅 oracle 上界，实际 agent 必须自行验证；行顺序依赖题不适用；source-table clustered 区间；读取 observed table 而非 clean source/gold repair。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "GBDI 对表格随机行排列做五个独立发现 context，映射回原行合并 union ledger，再按可验证证据 Edit/Drop/No-op。RADAR-T313例/53任务/27表可验证。",
          "data_verifiability": "已人工修复表仅 oracle 上界，实际 agent 必须自行验证；行顺序依赖题不适用；source-table clustered 区间；读取 observed table 而非 clean source/gold repair。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04672",
      "title": "MASBench: Benchmarking LLM-based Multi-Agent Collaboration under Partial Observability",
      "published": "2026-10-03T17:40:24Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04672",
          "title": "MASBench: Benchmarking LLM-based Multi-Agent Collaboration under Partial Observability",
          "published": "2026-10-03T17:40:24Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04672v1",
          "location": "§3.1–3.2；§4.1–4.3；§5.1",
          "decision": "pending",
          "reason": "MASBench将Hotpot证据、日程约束和资源地图拆给部分可观察的不同Agent，检验记忆/协议/路由组合；官方数据和执行包尚未验证，暂缓同名benchmark接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.04672",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.2",
            "§4.1–4.3",
            "§5.1"
          ],
          "limitations": "通信成本只统计跨Agent消息不含本地推理；信息隔离必须在运行时保持，不能把联合gold或完整约束交给每个Agent。不同任务归一分数与每千token效率应分报。",
          "code_status": "paper declares benchmark release, canonical verified task package not located",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04658",
      "title": "RETRACE: From Entangled Repair Histories to Reusable Experience for CI Repair",
      "published": "2026-10-03T17:08:17Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04658",
          "title": "RETRACE: From Entangled Repair Histories to Reusable Experience for CI Repair",
          "published": "2026-10-03T17:08:17Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04658v1",
          "location": "RETRACE bidirectional attribution/three abstraction levels; normalized p55–57,67–68; Appendix A",
          "decision": "accepted",
          "reason": "RETRACE 从 CI 完成修复历史做 endpoint 向后与开发历史向前的变更归因，生成 problem-level 三层可复用经验。CI-Repair-Bench565 PR/101仓库、最早30%历史与408后续目标可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04658v1",
          "limitations": "历史目标时间隔离必须维持；CI 依赖/custom actions 有不可本地复现项；轻量局部检查不等于完整 CI 修复成功；不读取目标未来 endpoint。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "RETRACE 从 CI 完成修复历史做 endpoint 向后与开发历史向前的变更归因，生成 problem-level 三层可复用经验。CI-Repair-Bench565 PR/101仓库、最早30%历史与408后续目标可验证。",
          "data_verifiability": "历史目标时间隔离必须维持；CI 依赖/custom actions 有不可本地复现项；轻量局部检查不等于完整 CI 修复成功；不读取目标未来 endpoint。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04651",
      "title": "GS-Codec: A Gaussian-Splatting Bottleneck for Neural Audio Coding",
      "published": "2026-10-03T16:49:17Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04651",
          "title": "GS-Codec: A Gaussian-Splatting Bottleneck for Neural Audio Coding",
          "published": "2026-10-03T16:49:17Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "GS-Codec以连续1D Gaussian内循环拟合潜变量+stopgradient/commitment训练编解码，再训练latent重建预测器替代300步Adam，训练后heldout校准的kmeans scalar量化参数；固定centers不传位置，bitrate仍离散。LibriTTS/LJSpeech/LibriSpeech评测需区分2339h与54kh配置，部分基线引文非重跑；L40S7.9ms仅encoder且3秒非因果片段，不是流式端到端延迟。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04651",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04651v1",
              "location": "§3.1–3.2；§4.1–4.3/Table4；limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.04651v1",
              "location": "§3.1–3.2；§4.1–4.3/Table4；limitations",
              "notes": "GS-Codec以连续1D Gaussian内循环拟合潜变量+stopgradient/commitment训练编解码，再训练latent重建预测器替代300步Adam，训练后heldout校准的kmeans scalar量化参数；固定centers不传位置，bitrate仍离散。LibriTTS/LJSpeech/LibriSpeech评测需区分2339h与54kh配置，部分基线引文非重跑；L40S7.9ms仅encoder且3秒非因果片段，不是流式端到端延迟。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04651v1",
          "locations": [
            "§3.1–3.2；§4.1–4.3/Table4；limitations"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "GS-Codec以连续1D Gaussian内循环拟合潜变量+stopgradient/commitment训练编解码，再训练latent重建预测器替代300步Adam，训练后heldout校准的kmeans scalar量化参数；固定centers不传位置，bitrate仍离散。LibriTTS/LJSpeech/LibriSpeech评测需区分2339h与54kh配置，部分基线引文非重跑；L40S7.9ms仅encoder且3秒非因果片段，不是流式端到端延迟。"
        },
        {
          "track": "post-training",
          "id": "2610.04651",
          "title": "GS-Codec: A Gaussian-Splatting Bottleneck for Neural Audio Coding",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "GS-Codec神经音频编码瓶颈与高斯splatting，关键词post-training是bitrate控制。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04651",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04646",
      "title": "SEIS: Self-Evolving Inference Systems",
      "published": "2026-10-03T16:36:48Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04646",
          "title": "SEIS: Self-Evolving Inference Systems",
          "published": "2026-10-03T16:36:48Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04646v1",
          "location": "SEIS session/harness gates; §5–6; normalized p16–22,36–54; Appendix B/F",
          "decision": "accepted",
          "reason": "SEIS 给 agent 私有代码 worktree、固定 correctness/throughput scorer 和预算，成功核验继承实际推理引擎/kernels；公开 Qwen 与真实 GPU 工作负载可验证代码自进化。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04646v1",
          "limitations": "不是仅 registry 接入；解码/自然 EOS 和生成能力必须核验，原文14次终止失败被拒；MMLU prefill 一致不能证明 decode 等价；单请求吞吐不是并发 serving。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "SEIS 给 agent 私有代码 worktree、固定 correctness/throughput scorer 和预算，成功核验继承实际推理引擎/kernels；公开 Qwen 与真实 GPU 工作负载可验证代码自进化。",
          "data_verifiability": "不是仅 registry 接入；解码/自然 EOS 和生成能力必须核验，原文14次终止失败被拒；MMLU prefill 一致不能证明 decode 等价；单请求吞吐不是并发 serving。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04641",
      "title": "Back to the Future: Regressing Readability Features from LLMs",
      "published": "2026-10-03T16:31:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04641",
          "title": "Back to the Future: Regressing Readability Features from LLMs",
          "published": "2026-10-03T16:31:50Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04641v1",
          "location": "§2.1–2.2、Table1、§3.2–3.4、§4.6、AppendixA/B、§8",
          "decision": "accepted",
          "reason": "BTTF将AST-tagged片段embedding几何/聚类、冻结codeLM的构造级surprisal与32/256token上下文差及传统代码特征组合；跨模型稳定性共识选11特征，再以数据集等权的Ridge(alpha200)回归分位化可读性，输出具符号的特征贡献。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "公开1100人评分样本以Java为主；feature选择使用所有六数据集，因此LODO只验证固定表示后的预测迁移，不验证完整选择过程的无泄漏迁移。插补/裁剪/标准化必须fold内训练。13变换是可读性方向诊断，解析合法不证明语义保持/功能正确；可作为coding-agent质量辅助评估，不能当执行正确奖励。",
          "code": "https://github.com/WangTairan/BTTF",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04641v1",
              "location": "§2.1–2.2、Table1、§3.2–3.4、§4.6、AppendixA/B、§8",
              "access_method": "web_fulltext_fallback"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04639",
      "title": "When Talk Isn't Code: Comparing LLM Agents That Simulate and Develop Software",
      "published": "2026-10-03T16:29:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04639",
          "title": "When Talk Isn't Code: Comparing LLM Agents That Simulate and Develop Software",
          "published": "2026-10-03T16:29:42Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04639",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "LLM仿真/开发协议安全受控比较，非新方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04636",
      "title": "Does Neural Complexity Improve Health Misinformation Detection? A Leakage-Controlled Cross-Corpus Benchmark",
      "published": "2026-10-03T16:26:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04636",
          "title": "Does Neural Complexity Improve Health Misinformation Detection? A Leakage-Controlled Cross-Corpus Benchmark",
          "published": "2026-10-03T16:26:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "健康虚假信息架构比较benchmark，非基础模型新算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04636",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04616",
      "title": "PerturBot: Breaking Shortcut Priors in Vision-Language-Action Models with Perturbative Training",
      "published": "2026-10-03T15:57:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04616",
          "title": "PerturBot: Breaking Shortcut Priors in Vision-Language-Action Models with Perturbative Training",
          "published": "2026-10-03T15:57:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "PerturBot的V/C/R分别保持任务的视角干扰、状态/技能语言重标、已执行偏差运动重标，按原flow loss混合，不虚构失败目标恢复。配对GroundFscore以共享noise前向分别测null不变和causal敏感，需两条同状态expert记录标定Δaction，分母floor与过滤明确；这是诊断非任务能力证书。50种真实PnP布局与RoboTwin50任务含等预算/全因子消融，84%成功率非只离线分数。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04616",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04616v1",
              "location": "§3.1–3.3 Eq3–4；§4.1–4.3/Table1；AppendixA/F"
            },
            {
              "url": "https://arxiv.org/html/2610.04616v1",
              "location": "§3.1–3.3 Eq3–4；§4.1–4.3/Table1；AppendixA/F",
              "notes": "PerturBot的V/C/R分别保持任务的视角干扰、状态/技能语言重标、已执行偏差运动重标，按原flow loss混合，不虚构失败目标恢复。配对GroundFscore以共享noise前向分别测null不变和causal敏感，需两条同状态expert记录标定Δaction，分母floor与过滤明确；这是诊断非任务能力证书。50种真实PnP布局与RoboTwin50任务含等预算/全因子消融，84%成功率非只离线分数。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04616v1",
          "locations": [
            "§3.1–3.3 Eq3–4；§4.1–4.3/Table1；AppendixA/F"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "PerturBot的V/C/R分别保持任务的视角干扰、状态/技能语言重标、已执行偏差运动重标，按原flow loss混合，不虚构失败目标恢复。配对GroundFscore以共享noise前向分别测null不变和causal敏感，需两条同状态expert记录标定Δaction，分母floor与过滤明确；这是诊断非任务能力证书。50种真实PnP布局与RoboTwin50任务含等预算/全因子消融，84%成功率非只离线分数。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04611",
      "title": "Practical Runtime Enforcement of First-Order Temporal Requirements",
      "published": "2026-10-03T15:52:08Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04611",
          "title": "Practical Runtime Enforcement of First-Order Temporal Requirements",
          "published": "2026-10-03T15:52:08Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04611v1",
          "location": "§4/EF Algorithm2; §5; normalized p50–53,139–148",
          "decision": "accepted",
          "reason": "EnfFlash 将 MFOTL 可执行片段编译为表式 EF 因果/抑制运行时，用参考解释器及真实 trace 比较，是 agent 外部强制策略后端候选。40 formula/Agent 环境有可验证基线。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04611v1",
          "limitations": "只支持声明 fragment，未来/过去嵌套需要改写；实时 enforce 不是 LLM 语义授权判断；MonPoly 只 monitor 不是完全同任务；必须保留 timeout 和最大延迟。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "EnfFlash 将 MFOTL 可执行片段编译为表式 EF 因果/抑制运行时，用参考解释器及真实 trace 比较，是 agent 外部强制策略后端候选。40 formula/Agent 环境有可验证基线。",
          "data_verifiability": "只支持声明 fragment，未来/过去嵌套需要改写；实时 enforce 不是 LLM 语义授权判断；MonPoly 只 monitor 不是完全同任务；必须保留 timeout 和最大延迟。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04607",
      "title": "ForeAct3D: Policy-Grounded Future World Modeling for VLA Policies",
      "published": "2026-10-03T15:49:04Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04607",
          "title": "ForeAct3D: Policy-Grounded Future World Modeling for VLA Policies",
          "published": "2026-10-03T15:49:04Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ForeAct3D从policy features的6queries解码当前/未来depth/3classmask/pose，未来仅接policy-generated action，训练用background staticity、按GTinstance的Kabsch rigidity、kinematics，推理不需要未来或GT。samepixel对应只是短时近似，强监督与刚体假设是实质限制；LIBERO98.3/CALVIN3.73与实机37.8%有消融。几何预测对照horizon不同且预测mask定位仍使用GTinstance，不可称无GT实例检测。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04607",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04607v1",
              "location": "§3.1–3.4 Eq3–5；§4/Tables1–2；AppendixA.1–A.4/Table8；limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.04607v1",
              "location": "§3.1–3.4 Eq3–5；§4/Tables1–2；AppendixA.1–A.4/Table8；limitations",
              "notes": "ForeAct3D从policy features的6queries解码当前/未来depth/3classmask/pose，未来仅接policy-generated action，训练用background staticity、按GTinstance的Kabsch rigidity、kinematics，推理不需要未来或GT。samepixel对应只是短时近似，强监督与刚体假设是实质限制；LIBERO98.3/CALVIN3.73与实机37.8%有消融。几何预测对照horizon不同且预测mask定位仍使用GTinstance，不可称无GT实例检测。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04607v1",
          "locations": [
            "§3.1–3.4 Eq3–5；§4/Tables1–2；AppendixA.1–A.4/Table8；limitations"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "ForeAct3D从policy features的6queries解码当前/未来depth/3classmask/pose，未来仅接policy-generated action，训练用background staticity、按GTinstance的Kabsch rigidity、kinematics，推理不需要未来或GT。samepixel对应只是短时近似，强监督与刚体假设是实质限制；LIBERO98.3/CALVIN3.73与实机37.8%有消融。几何预测对照horizon不同且预测mask定位仍使用GTinstance，不可称无GT实例检测。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04604",
      "title": "Anticipating the Consequences of Curriculum Decisions with Large Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04604",
          "title": "Anticipating the Consequences of Curriculum Decisions with Large Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "LLM指导Craftax学习课程，但训练对象为环境RL learner而非LLM后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04604",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04604",
          "title": "Anticipating the Consequences of Curriculum Decisions with Large Language Models",
          "published": "2026-10-03T15:45:17Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04604v1",
          "location": "§3–4/curriculum; Appendix C.1; normalized p28,37,47,87–90",
          "decision": "accepted",
          "reason": "LLM curriculum 根据完整 Craftax256目标文本构建跨任务关系/可行性图，与历史 learning progress 联合决定训练任务。公开环境和完整目标成功判定可训练验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04604v1",
          "limitations": "LLM图先验不是实际因果迁移测量；只能使用当前训练表现；公开全目标表不等于允许使用测试回报选 curriculum；同样训练/eval成本和种子。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "LLM curriculum 根据完整 Craftax256目标文本构建跨任务关系/可行性图，与历史 learning progress 联合决定训练任务。公开环境和完整目标成功判定可训练验证。",
          "data_verifiability": "LLM图先验不是实际因果迁移测量；只能使用当前训练表现；公开全目标表不等于允许使用测试回报选 curriculum；同样训练/eval成本和种子。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04596",
      "title": "DiffGate: Difficulty-Gated Teacher Guidance for On-Policy Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04596",
          "title": "DiffGate: Difficulty-Gated Teacher Guidance for On-Policy Distillation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "DiffGate将teacher-student logratio以2tanh(delta/2)有界映射，并按组成功率只对失败轨迹调节teacher指导；固定8B teacher、0.6/1.7B学生数学代码训练。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04596",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04596v1",
              "location": "§4 Eq.方法；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04589",
      "title": "StegoMemory: Agentic Memory Acts as Covert Steganographic Channel",
      "published": "2026-10-03T15:23:18Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04589",
          "title": "StegoMemory: Agentic Memory Acts as Covert Steganographic Channel",
          "published": "2026-10-03T15:23:18Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04589",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "StegoMemory多种隐写scheme跨会话风险测量，无新能力策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04580",
      "title": "Strong Helps Weak: Directional Cross-Modal Alignment Transfer in Multi-modal LLMs",
      "published": "2026-10-03T15:15:27Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04580",
          "title": "Strong Helps Weak: Directional Cross-Modal Alignment Transfer in Multi-modal LLMs",
          "published": "2026-10-03T15:15:27Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DCAT是有清晰闭式求解与公开项目代码入口的跨模态对齐迁移候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04580",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04580v1",
              "location": "§4 Eq5–11; §5; App C.3–C.5/D/F; 官方项目页"
            },
            {
              "url": "https://arxiv.org/html/2610.04580v1",
              "location": "§4 Eq5–11; §5; App C.3–C.5/D/F; 官方项目页",
              "notes": "同LLM架构donor/recipient任务向量，文本双anchor损失+模态投影谱重塑normpreserving target；AVQAtrain256校准。依序层及{qkv},{o},{up,gate},{down}重收激活，fp64Cholesky+trace ridge，k128/256。Vicuna/Llama3.1 vision→audio/video，10校准seed差异.33/.14。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04580v1",
          "locations": [
            "§4 Eq5–11",
            "§5",
            "App C.3–C.5/D/F",
            "官方项目页"
          ],
          "limitations": "不是任意跨架构合并或所有模态都益处；alignment是理论假设下proxy非真实MI测量。逐组重收数据和fp64solve计成本，η/β设置须在独立validation固定；test收益不能反选donor。",
          "code_url": "https://github.com/Hyun1A/DCAT",
          "implementation_status": "not_implemented",
          "fulltext_notes": "同LLM架构donor/recipient任务向量，文本双anchor损失+模态投影谱重塑normpreserving target；AVQAtrain256校准。依序层及{qkv},{o},{up,gate},{down}重收激活，fp64Cholesky+trace ridge，k128/256。Vicuna/Llama3.1 vision→audio/video，10校准seed差异.33/.14。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04575",
      "title": "From Probe Scores to Alarm Policies: Operational Validity of Activation Monitors for Language-Model Agents",
      "published": "2026-10-03T15:11:21Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04575",
          "title": "From Probe Scores to Alarm Policies: Operational Validity of Activation Monitors for Language-Model Agents",
          "published": "2026-10-03T15:11:21Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/pdf/2610.04575",
          "location": "§3 pp.3–4 Eq4–6、§4 pp.5–6 Fig2/Table4、§5、§6.3 p.8",
          "decision": "accepted",
          "reason": "按语义task/case聚合any-alarm maxima，fit/calibration/test严格分离；由独立负单位次序统计量Beta上界选择最大可认证rank并strict-exceedance报警，支持不足则abstain。observable/activation/joint同horizon比较，哈希绑定模型、阈值与一次性test，fail-closed claim compiler避免AUROC被升级成部署保证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "这是评测/校准合同，不是新detector或新定理；公开artifact仅score-level replay，不能声称重生轨迹/激活或端到端训练。ST-Web23negative不足59/29，零报警属机械abstain；AgentDojo38positive不足40，10%预算testFPR18.67%显示shift。Qwen14B对照非compute-match，人审/拦截/干预收益未测；证书依赖独立同分布负单位，不是适应攻击或familywise保证。",
          "code": "正文描述冻结score/claim artifact但未定位直接公开URL；AgentDojo/MUP/LASR公共来源需分别核验",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/pdf/2610.04575",
              "location": "§3 pp.3–4 Eq4–6、§4 pp.5–6 Fig2/Table4、§5、§6.3 p.8",
              "access_method": "web_fulltext_fallback"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04569",
      "title": "From Transformers to Weighted Automata: Towards the Verification of Large Language Models",
      "published": "2026-10-03T15:04:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04569",
          "title": "From Transformers to Weighted Automata: Towards the Verification of Large Language Models",
          "published": "2026-10-03T15:04:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Transformer到加权自动机的形式验证理论，不是能力训练或推理效率算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04569",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04555",
      "title": "$\\mathrm{TRIZ}^{a}$: Guiding Agent Evolution from Pattern Recognition to Solution Invention",
      "published": "2026-10-03T14:44:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04555",
          "title": "$\\mathrm{TRIZ}^{a}$: Guiding Agent Evolution from Pattern Recognition to Solution Invention",
          "published": "2026-10-03T14:44:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04555v1",
          "location": "TRIZ typed mutation/functional information; Eq/Appendix B; normalized p14–21,38–39,81",
          "decision": "accepted",
          "reason": "TRIZ-a 先冻结矛盾与比较协议，声明40类 typed mutation 的契约，再执行候选并根据固定参考群体的 useful/harmful 功能信息选择。公开三网络安全数据可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04555v1",
          "limitations": "FI 依赖预定义群体和预算，不保证单调进化；hash/split/preprocessing必须匹配；V17/V18不是正式V2证据；安全高风险动作仍需人授权。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "TRIZ-a 先冻结矛盾与比较协议，声明40类 typed mutation 的契约，再执行候选并根据固定参考群体的 useful/harmful 功能信息选择。公开三网络安全数据可验证。",
          "data_verifiability": "FI 依赖预定义群体和预算，不保证单调进化；hash/split/preprocessing必须匹配；V17/V18不是正式V2证据；安全高风险动作仍需人授权。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04544",
      "title": "Label Agreement Does Not Measure Authorization",
      "published": "2026-10-03T14:17:25Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04544",
          "title": "Label Agreement Does Not Measure Authorization",
          "published": "2026-10-03T14:17:25Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04544",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "label ontology管线授权/输出完整性审计案例研究，非通用算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04541",
      "title": "Autonomous Structuring of Radiology Reports Across Modalities at Archive Scale Using an Open-Weight Large Language Model",
      "published": "2026-10-03T14:15:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04541",
          "title": "Autonomous Structuring of Radiology Reports Across Modalities at Archive Scale Using an Open-Weight Large Language Model",
          "published": "2026-10-03T14:15:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "放射报告档案模板化流水线，专用医疗部署。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04541",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04528",
      "title": "Quantifying Collusion Among Autonomous LLM Agents: A Statistical Analysis of the Collusion Wiki Incident",
      "published": "2026-10-03T13:46:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04528",
          "title": "Quantifying Collusion Among Autonomous LLM Agents: A Statistical Analysis of the Collusion Wiki Incident",
          "published": "2026-10-03T13:46:42Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04528",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Collusion Wiki事件统计分析，非算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04518",
      "title": "Length Generalization Needs Proper Regularization",
      "published": "2026-10-03T13:31:00Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04518",
          "title": "Length Generalization Needs Proper Regularization",
          "published": "2026-10-03T13:31:00Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "VPAD为每token非中心化激活计算保均值/方差的affine dropout，明确作用于RMSNorm后共享mask，具公开训练/评测/权重，可列长度泛化训练算子候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04518",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04518v1",
              "location": "§4.2–4.4 Eq12–13; §5.1–5.5; App C.1/C.2; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.04518v1",
              "location": "§4.2–4.4 Eq12–13; §5.1–5.5; App C.1/C.2; official README",
              "notes": "alpha=sigma/sqrt((1-p)(sigma²+p mu²)) beta=mu(1-alpha(1-p))，用token维经验统计；同norm输出只一次mask共享QKV/门控up，eval禁用。400MNAPE40B三seed，SmolLM3stage3 RoPE层改4kSW/NoPEglobal 1B CPT，Mamba85M/1.3B验证。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04518v1",
          "locations": [
            "§4.2–4.4 Eq12–13",
            "§5.1–5.5",
            "App C.1/C.2",
            "official README"
          ],
          "limitations": "方差只按坐标匹配，projection covariance有残差，不声称完全保真分布。Fig1按RULER4–8k选bestseed，正式报告三seedFig4；SmolLMBase额外100B训练不可当同数据因果对照。投影各独立mask是官方额外功能非paper路径，8k版本还改attention scaling须拆消融。",
          "code_url": "https://github.com/deep-spin/len-gen-regularization",
          "implementation_status": "not_implemented",
          "fulltext_notes": "alpha=sigma/sqrt((1-p)(sigma²+p mu²)) beta=mu(1-alpha(1-p))，用token维经验统计；同norm输出只一次mask共享QKV/门控up，eval禁用。400MNAPE40B三seed，SmolLM3stage3 RoPE层改4kSW/NoPEglobal 1B CPT，Mamba85M/1.3B验证。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04517",
      "title": "EvoCast: Reliable Autonomous Research Agents for Iterative Forecasting Architecture Evolution",
      "published": "2026-10-03T13:30:53Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04517",
          "title": "EvoCast: Reliable Autonomous Research Agents for Iterative Forecasting Architecture Evolution",
          "published": "2026-10-03T13:30:53Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04517v1",
          "location": "EvoCast Algorithm1; normalized p28–39,53–59",
          "decision": "accepted",
          "reason": "EvoCast 将 LLM 的机制假设/源码修改与确定性 evaluator/晋升权威分开；先基线+可执行 ablation，再每轮有界源程序结构变异。TFB 公开预测任务支持真实实验。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04517v1",
          "limitations": "必须只改模型边界、不能改评估路径；训练统计拟合不看 val/test；最终模型用 validation 选，论文结果是特定预测任务不是通用科学能力。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "EvoCast 将 LLM 的机制假设/源码修改与确定性 evaluator/晋升权威分开；先基线+可执行 ablation，再每轮有界源程序结构变异。TFB 公开预测任务支持真实实验。",
          "data_verifiability": "必须只改模型边界、不能改评估路径；训练统计拟合不看 val/test；最终模型用 validation 选，论文结果是特定预测任务不是通用科学能力。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04512",
      "title": "Correctness Is a Direction: Geometric Answer Selection in Language Models",
      "published": "2026-10-03T13:21:04Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04512",
          "title": "Correctness Is a Direction: Geometric Answer Selection in Language Models",
          "published": "2026-10-03T13:21:04Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Geometric Answer Selection用50个标注校准问题的正确减错误平均归一hidden形成方向，对每候选一次前向投影选答案；适合冻结模型读出算子。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04512",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.04512v1",
              "location": "§3.1 Eq1–4; §5.1/Table4; §6.3; Limitations",
              "notes": "Geometric Answer Selection用50个标注校准问题的正确减错误平均归一hidden形成方向，对每候选一次前向投影选答案；适合冻结模型读出算子。"
            }
          ],
          "source": "https://arxiv.org/html/2610.04512v1",
          "locations": [
            "§3.1 Eq1–4",
            "§5.1/Table4",
            "§6.3",
            "Limitations"
          ],
          "limitations": "非零样本，20%验证选择层；TQA校准必须和测试隔离。固定候选任务不能直接扩展自由生成，跨任务方向并不通用；配对比较不应照搬独立两比例z检验；未找到作者代码。",
          "code_status": "not_found_in_examined_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04512v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Geometric Answer Selection用50个标注校准问题的正确减错误平均归一hidden形成方向，对每候选一次前向投影选答案；适合冻结模型读出算子。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04507",
      "title": "LoRA's Second Descent Extends Beyond Parameter Parity",
      "published": "2026-10-03T13:10:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04507",
          "title": "LoRA's Second Descent Extends Beyond Parameter Parity",
          "published": "2026-10-03T13:10:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "LoRA rank与双下降噪声实验，主要是经验诊断而非新方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04507",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.04507",
          "title": "LoRA's Second Descent Extends Beyond Parameter Parity",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "LoRA rank和label noise下double descent现象研究，不是新后训练算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04507",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04506",
      "title": "EgoExo-Next:Benchmarking Vision-Language Models on Visual-Option Next-State and Cross-View Reasoning",
      "published": "2026-10-03T13:09:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04506",
          "title": "EgoExo-Next:Benchmarking Vision-Language Models on Visual-Option Next-State and Cross-View Reasoning",
          "published": "2026-10-03T13:09:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "EgoExo-Next提供2503视觉4选1题、四个ego/exo当前匹配与未来状态任务，后续干扰帧防最远未来捷径；candidate-only/打乱序列/mismatch及CLIP/DINO检查支持诊断价值。官方HF有输入图、input_meta、分离answers与加载契约；仅输入元信息/图给模型，gold/time不给模型。注意论文§4.1两方向平均与HF样例both-directions-correct表述不一致，接入须固定评分版本并报告；源图继承六套许可、注释限非商业研究，不是统一开放商用。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04506",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04506v1",
              "location": "§3.1–3.2；§4.1–4.3/Table2–3；官方HF Data format/Loading/Licensing; Datasetcard Subtasks/Repository structure/Data format/Loading/Licensing（已访问）；论文评分契约与card的方向聚合表述需区分"
            },
            {
              "url": "https://arxiv.org/html/2610.04506v1",
              "location": "§3.1–3.2；§4.1–4.3/Table2–3；官方HF Data format/Loading/Licensing; Datasetcard Subtasks/Repository structure/Data format/Loading/Licensing（已访问）；论文评分契约与card的方向聚合表述需区分",
              "notes": "EgoExo-Next提供2503视觉4选1题、四个ego/exo当前匹配与未来状态任务，后续干扰帧防最远未来捷径；candidate-only/打乱序列/mismatch及CLIP/DINO检查支持诊断价值。官方HF有输入图、input_meta、分离answers与加载契约；仅输入元信息/图给模型，gold/time不给模型。注意论文§4.1两方向平均与HF样例both-directions-correct表述不一致，接入须固定评分版本并报告；源图继承六套许可、注释限非商业研究，不是统一开放商用。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04506v1",
          "locations": [
            "§3.1–3.2；§4.1–4.3/Table2–3；官方HF Data format/Loading/Licensing",
            "Datasetcard Subtasks/Repository structure/Data format/Loading/Licensing（已访问）；论文评分契约与card的方向聚合表述需区分"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": "EgoExo-Next提供2503视觉4选1题、四个ego/exo当前匹配与未来状态任务，后续干扰帧防最远未来捷径；candidate-only/打乱序列/mismatch及CLIP/DINO检查支持诊断价值。官方HF有输入图、input_meta、分离answers与加载契约；仅输入元信息/图给模型，gold/time不给模型。注意论文§4.1两方向平均与HF样例both-directions-correct表述不一致，接入须固定评分版本并报告；源图继承六套许可、注释限非商业研究，不是统一开放商用。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04504",
      "title": "The Same Zero: Why Identical ASR Can Imply Different Guarantees in LLM-Agent Security",
      "published": "2026-10-03T13:09:22Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04504",
          "title": "The Same Zero: Why Identical ASR Can Imply Different Guarantees in LLM-Agent Security",
          "published": "2026-10-03T13:09:22Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04504v1",
          "location": "§6.1/6.5; Appendix A.4/A.6; normalized p11,53–54,93",
          "decision": "pending",
          "reason": "The Same Zero 提供 VAL 保证来源分类、攻击升级下的 zero-stability 与 agent 真实效应评测；正文有 AgentDojo 全 banking 比较及失败机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "source_url": "https://arxiv.org/html/2610.04504v1",
          "limitations": "审后延期：主要测试床与 action级原始 receipts 发布未核验；banking per-task traces 丢失、shipped gate已修字段不能复刻旧统计；同0 ASR不能宣称同安全，25%utility崩溃要明确。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "The Same Zero 提供 VAL 保证来源分类、攻击升级下的 zero-stability 与 agent 真实效应评测；正文有 AgentDojo 全 banking 比较及失败机制。",
          "data_verifiability": "审后延期：主要测试床与 action级原始 receipts 发布未核验；banking per-task traces 丢失、shipped gate已修字段不能复刻旧统计；同0 ASR不能宣称同安全，25%utility崩溃要明确。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04502",
      "title": "Localization Lens for Improving Medical Vision-Language Models",
      "published": "2026-10-03T13:04:15Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04502",
          "title": "Localization Lens for Improving Medical Vision-Language Models",
          "published": "2026-10-03T13:04:15Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "医学解剖定位表示、pixel shuffle和DCL改进Med-VQA，专用医疗适应。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04502",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04499",
      "title": "Homogeneous Semantic Alignment and Hierarchical Expert Routing for Radiology Report Generation",
      "published": "2026-10-03T12:57:35Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04499",
          "title": "Homogeneous Semantic Alignment and Hierarchical Expert Routing for Radiology Report Generation",
          "published": "2026-10-03T12:57:35Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "HSA-HER专用放射报告生成网络。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04499",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04494",
      "title": "DreamTest: World-Model Surrogates for Search-Based Testing of Deep Reinforcement Learning Agents",
      "published": "2026-10-03T12:51:02Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04494",
          "title": "DreamTest: World-Model Surrogates for Search-Based Testing of Deep Reinforcement Learning Agents",
          "published": "2026-10-03T12:51:02Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04494",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "DreamTest传统DRL world model测试代理，无语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04488",
      "title": "Can LLM Agents Automate Reinforcement Learning for Text-to-Speech?",
      "published": "2026-10-03T12:44:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04488",
          "title": "Can LLM Agents Automate Reinforcement Learning for Text-to-Speech?",
          "published": "2026-10-03T12:44:09Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04488v1",
          "location": "RL design space/data-proxy-algorithm; §4.2–4.3; Tables1–3",
          "decision": "accepted",
          "reason": "TTS agent 在 CosyVoice2 上搜索 LM-carrier DPO 与 flow-carrier GRPO，再组合互补策略。AISHELL3/LibriTTS固定5000条件与 Seed-TTS-Eval 提供真实训练和外部观察指标。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04488v1",
          "limitations": "原文报告测试集通过合同未读通道泄露、pivot proxy未受合同保护和 reward inflation，不能复用这些受污染迭代为正式改进；merge scale人为选择；保留独立最终test。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "TTS agent 在 CosyVoice2 上搜索 LM-carrier DPO 与 flow-carrier GRPO，再组合互补策略。AISHELL3/LibriTTS固定5000条件与 Seed-TTS-Eval 提供真实训练和外部观察指标。",
          "data_verifiability": "原文报告测试集通过合同未读通道泄露、pivot proxy未受合同保护和 reward inflation，不能复用这些受污染迭代为正式改进；merge scale人为选择；保留独立最终test。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04441",
      "title": "LocusRL: Diagnosing LLM Reward and Policy Interventions in Competitive Games",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04441",
          "title": "LocusRL: Diagnosing LLM Reward and Policy Interventions in Competitive Games",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "LocusRL的学习者/奖励/执行/证据5层审计与terminal replay certificate可作诊断入口，单次修复仅证明该state充分修正，20证书不是20独立局面。作者LocusRL-Pub链接两次不可读，待公开代码核实。 补充直接HTTP检查返回404。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04441v1",
              "location": "§3.1–3.2；Appendix H"
            },
            {
              "url": "https://github.com/luancy0423/LocusRL-Pub",
              "location": "作者资源入口；当前可用性限制见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "LocusRL为奖励/策略干预的可审计诊断框架，不以新优化算法为贡献。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "LocusRL的学习者/奖励/执行/证据5层审计与terminal replay certificate可作诊断入口，单次修复仅证明该state充分修正，20证书不是20独立局面。作者LocusRL-Pub链接两次不可读，待公开代码核实。 补充直接HTTP检查返回404。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04433",
      "title": "What Does a Harness Buy? Tokens, Mostly",
      "published": "2026-10-03T10:47:10Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04433",
          "title": "What Does a Harness Buy? Tokens, Mostly",
          "published": "2026-10-03T10:47:10Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04433",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "固定模型harness随机重跑/成本效应研究，无新算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04432",
      "title": "Video2World: Benchmarking Coding Agents for Interactive World Modeling from Embodied Videos",
      "published": "2026-10-03T10:46:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04432",
          "title": "Video2World: Benchmarking Coding Agents for Interactive World Modeling from Embodied Videos",
          "published": "2026-10-03T10:46:52Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04432v1",
          "location": "§3.2–3.3；§4.1；official README Data/Usage",
          "decision": "accepted",
          "reason": "Video2World将视频重建交互仿真作为coding-agent任务，分离可执行性、几何、动力学和功能oracle，公开222实例数据与评分接口可作为多模态Agent候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04432",
          "fulltext_review_completed": true,
          "locations": [
            "§3.2–3.3",
            "§4.1",
            "official README Data/Usage"
          ],
          "limitations": "189视频39任务族，180分钟单构建无统一token预算，比较完整系统而非裸模型。gt_pkg/hidden仅verifier可见，禁止直接写状态伪造动力学；HAR含源标注非公平Agent。三类sim依赖与GPU/Vulkan需真实环境验证，单纯读HAR日志不算接入。",
          "code_url": "https://github.com/AetherLabsAI/Video2World",
          "code_status": "official scorer, agent interface and AetherLabs-AI/Video2World dataset links available; not run",
          "reviewer": "root",
          "code": "https://github.com/AetherLabsAI/Video2World"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04429",
      "title": "Asking Earns Nothing: Scoring the Decision to Act in BFCL Multi-Turn",
      "published": "2026-10-03T10:42:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04429",
          "title": "Asking Earns Nothing: Scoring the Decision to Act in BFCL Multi-Turn",
          "published": "2026-10-03T10:42:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04429v1",
          "location": "§3、§4.1–4.3 Eq1、§5.3–5.4、AppendixC–F",
          "decision": "accepted",
          "reason": "将BFCL base与miss_func/miss_param配对，机械定位唯一empty-gold anchor；从结构化rollout辨别world-changing尝试而非lookup，计完整信息下act与缺失信息下hold的balanced accuracy。过滤坏key/多anchor/不匹配并人工认证成223pairs，strict与独立授权步骤credited分开。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "不读取gold给actor；gold只离线定位/评分。该指标不是任务完成率或通用安全率，50%无信息基线；拒绝执行的尝试也计act，缺失function幻觉仍计，prose不算调用。134只读pair不混入避免always-hold满分；31坏key及8构造错误明确记录。Gemma默认系统prompt与native工具模型不是clean capability对照；判断回复内容的LLM仅诊断不进入主score。",
          "code": "https://github.com/YangzeLiu/asking-earns-nothing",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04429v1",
              "location": "§3、§4.1–4.3 Eq1、§5.3–5.4、AppendixC–F",
              "access_method": "web_fulltext_fallback"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04425",
      "title": "AgroGround: Multi-Granularity Grounded Recognition in Agriculture",
      "published": "2026-10-03T10:27:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04425",
          "title": "AgroGround: Multi-Granularity Grounded Recognition in Agriculture",
          "published": "2026-10-03T10:27:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "AgroGround农业grounding数据与任务训练，主要专用数据benchmark。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04425",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04424",
      "title": "On the Trade-off Between Information Loss and Generalization in Sparse Attention",
      "published": "2026-10-03T10:27:29Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04424",
          "title": "On the Trade-off Between Information Loss and Generalization in Sparse Attention",
          "published": "2026-10-03T10:27:29Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "稀疏注意力JS误差/泛化界理论，无提出新能力实现算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04424",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04418",
      "title": "CORE-RL: Confidence-Oriented Reliability Evaluation of Black-Box Reinforcement Learning Policies",
      "published": "2026-10-03T10:15:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04418",
          "title": "CORE-RL: Confidence-Oriented Reliability Evaluation of Black-Box Reinforcement Learning Policies",
          "published": "2026-10-03T10:15:09Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04418",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "CORE-RL黑盒连续控制可靠性评估，不是LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04413",
      "title": "Specific Algorithmic Interpretability of Neural Networks: A Case Study on Textures",
      "published": "2026-10-03T10:03:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04413",
          "title": "Specific Algorithmic Interpretability of Neural Networks: A Case Study on Textures",
          "published": "2026-10-03T10:03:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "散射纹理分类的可解释初始化及PAC-Bayes理论，非基础模型。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04413",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04412",
      "title": "Large Language Models and Augmented Democracy",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04412",
          "title": "Large Language Models and Augmented Democracy",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "数字孪生增强民主的学位综合研究，非明确独立RL/OPD核心算法候选。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04412",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04412",
          "title": "Large Language Models and Augmented Democracy",
          "published": "2026-10-03T10:02:14Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04412v1",
          "location": "Thesis chapters preference prediction/digital twins; normalized p17,25–33,60–61,69–120",
          "decision": "out_of_scope",
          "reason": "Augmented Democracy 是社会政治偏好建模/议会数字孪生领域的论文集合，以开放投票/人口学特征微调和观点代理讨论。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04412v1",
          "limitations": "没有本候选池所需的通用 Agent 核心算子/可执行能力改进；政治偏好预测不等于工具/规划/self-evolve 实现，不能为扩大范围硬收录。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "Augmented Democracy 是社会政治偏好建模/议会数字孪生领域的论文集合，以开放投票/人口学特征微调和观点代理讨论。",
          "data_verifiability": "没有本候选池所需的通用 Agent 核心算子/可执行能力改进；政治偏好预测不等于工具/规划/self-evolve 实现，不能为扩大范围硬收录。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04409",
      "title": "Understanding and Mitigating Hallucination Escape in Tool-Using LLM Agents",
      "published": "2026-10-03T09:57:35Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04409",
          "title": "Understanding and Mitigating Hallucination Escape in Tool-Using LLM Agents",
          "published": "2026-10-03T09:57:35Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04409v1",
          "location": "EscapeGuard §5.1–5.3; normalized p39–49; Appendix A–H",
          "decision": "accepted",
          "reason": "EscapeGuard 从冻结 LLM hidden state 学冲突 probe，按 selection/argument 阶段对当前 tool name/description/schema token 加 conflict强度 attention bias。BFCL/Seal/Glaive 有公开测评来源。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04409v1",
          "limitations": "核心是实际注意力干预，不能替代关键词 heuristic；probe/阈值要训练/validation隔离；正文 code/data承诺发表后发布；攻击/冲突配置不能用gold选介入。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "EscapeGuard 从冻结 LLM hidden state 学冲突 probe，按 selection/argument 阶段对当前 tool name/description/schema token 加 conflict强度 attention bias。BFCL/Seal/Glaive 有公开测评来源。",
          "data_verifiability": "核心是实际注意力干预，不能替代关键词 heuristic；probe/阈值要训练/validation隔离；正文 code/data承诺发表后发布；攻击/冲突配置不能用gold选介入。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04403",
      "title": "Saying, Not Knowing: Aggressively GGUF-Quantized Small Language Models Still Write Rare Words They Can No Longer Define",
      "published": "2026-10-03T09:50:16Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04403",
          "title": "Saying, Not Knowing: Aggressively GGUF-Quantized Small Language Models Still Write Rare Words They Can No Longer Define",
          "published": "2026-10-03T09:50:16Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "GGUF小语言模型词汇能力量化审计，无新量化算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04403",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.04403",
          "title": "Saying, Not Knowing: Aggressively GGUF-Quantized Small Language Models Still Write Rare Words They Can No Longer Define",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "GGUF低bit模型词义能力测量，属于量化评测。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04403",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04381",
      "title": "Beyond Plausibility: Verifiable Fine-Grained Image Editing on Structured Assets",
      "published": "2026-10-03T08:48:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04381",
          "title": "Beyond Plausibility: Verifiable Fine-Grained Image Editing on Structured Assets",
          "published": "2026-10-03T08:48:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "VeriEdit-Bench用可编辑SVG/chart/HTML源渲染确定目标与保护区，Lab距离分解fidelity/preservation/localization/magnitude及逐例调和分，可补图像编辑可执行评估。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04381",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.04381v1",
              "location": "§3.1–3.2 Eq1–5; §4/Table1; Appendix B.1/B.2",
              "notes": "VeriEdit-Bench用可编辑SVG/chart/HTML源渲染确定目标与保护区，Lab距离分解fidelity/preservation/localization/magnitude及逐例调和分，可补图像编辑可执行评估。"
            }
          ],
          "source": "https://arxiv.org/html/2610.04381v1",
          "locations": [
            "§3.1–3.2 Eq1–5",
            "§4/Table1",
            "Appendix B.1/B.2"
          ],
          "limitations": "编辑器只看图和指令，目标/mask仅verifier可见；1740例22cell等权与逐例均值分别报告，no-op应0/100/0/0。渲染噪声门与一像素膨胀是具体协议，不是通用图像美学评价。",
          "code_url": "https://github.com/flare200020/VeriEdit-Bench",
          "code_status": "official release linked; not executed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04381v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "VeriEdit-Bench用可编辑SVG/chart/HTML源渲染确定目标与保护区，Lab距离分解fidelity/preservation/localization/magnitude及逐例调和分，可补图像编辑可执行评估。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04379",
      "title": "AgentPersonaBench: Benchmarking Persona-Driven User Simulation",
      "published": "2026-10-03T08:45:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04379",
          "title": "AgentPersonaBench: Benchmarking Persona-Driven User Simulation",
          "published": "2026-10-03T08:45:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04379v1",
          "location": "§3.2–3.3；§4；Appendix E/F；official repository",
          "decision": "accepted",
          "reason": "AgentPersonaBench用2460任务跨survey/chat/web/app检验persona约束是否转化成行为，自动泄漏检查加独立人审、确定性与LLM判据分报，适合用户模拟Agent评测候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04379",
          "fulltext_review_completed": true,
          "locations": [
            "§3.2–3.3",
            "§4",
            "Appendix E/F",
            "official repository"
          ],
          "limitations": "只是指定特征的可控性，不是现实人群分布/真实个人预测；主榜单单次、部分arms三次重跑。78.5%确定性判据外仍有judge；web/app须真实环境而非文本假执行。机构按论文一作归属，资助Meta/OpenAI不能作作者归属。",
          "code_url": "https://github.com/MatrAIx-ai/AgentPersonaBench",
          "code_status": "official code/data repository accessible; exact release and GUI setup need pin",
          "reviewer": "root",
          "code": "https://github.com/MatrAIx-ai/AgentPersonaBench"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04378",
      "title": "COPEX: Benchmarking LLM Robustness to Adversarial Context Across Model Context Protocol Layers",
      "published": "2026-10-03T08:44:20Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04378",
          "title": "COPEX: Benchmarking LLM Robustness to Adversarial Context Across Model Context Protocol Layers",
          "published": "2026-10-03T08:44:20Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04378v1",
          "location": "§3 observation boundary；§4.1–4.3；§5.1；§6 limitations",
          "decision": "pending",
          "reason": "COPEX固定MCP stack隔离25类攻击在Agent/client/server/transport的入口，含125场景和独立oracle；完整官方场景包尚未定位，暂缓正式benchmark接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.04378",
          "fulltext_review_completed": true,
          "locations": [
            "§3 observation boundary",
            "§4.1–4.3",
            "§5.1",
            "§6 limitations"
          ],
          "limitations": "response扫描发生在调用之后不能撤销副作用；schema仅注册扫描，失败fail-open；15类LLMjudge非客观ground truth，防御每变体一run。仅授权隔离的虚构canary/本地测试，ASR不代表现实可利用率。",
          "code_status": "no verified official scenario/evaluator release located",
          "reviewer": "root"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04375",
      "title": "Do Tool Calls Execute as Intended? Measuring and Repairing Intent-Execution Correspondence in LLM Agents",
      "published": "2026-10-03T08:38:35Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04375",
          "title": "Do Tool Calls Execute as Intended? Measuring and Repairing Intent-Execution Correspondence in LLM Agents",
          "published": "2026-10-03T08:38:35Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04375v1",
          "location": "IEC/IntAct Algorithm1/Table1; §experiments; normalized p15,30,45,66–67",
          "decision": "accepted",
          "reason": "IEC 以各跳接收器 parser 检测 intent-to-execution 第一个变异 hop，并单跳修复重放确认；IntAct 为对应 wrapper/process 边界生成不被改写的传递形式或拒绝。公开合成payload/CLI路径可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04375v1",
          "limitations": "私有历史 shell corpus不能公开伪重建；观察 witness 不再次执行危险命令，修复实验应隔离且授权；exit0/stdout不是参数一致证据；Windows/Linux边界分别测。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "IEC 以各跳接收器 parser 检测 intent-to-execution 第一个变异 hop，并单跳修复重放确认；IntAct 为对应 wrapper/process 边界生成不被改写的传递形式或拒绝。公开合成payload/CLI路径可验证。",
          "data_verifiability": "私有历史 shell corpus不能公开伪重建；观察 witness 不再次执行危险命令，修复实验应隔离且授权；exit0/stdout不是参数一致证据；Windows/Linux边界分别测。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04371",
      "title": "Functionally Equivalent or Not? Graph-Grounded Differential Surrogate Execution for Code Equivalence",
      "published": "2026-10-03T08:19:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04371",
          "title": "Functionally Equivalent or Not? Graph-Grounded Differential Surrogate Execution for Code Equivalence",
          "published": "2026-10-03T08:19:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04371v1",
          "location": "FEAgent five phases; §assessment/Eq1; normalized p20–29,67–79,111",
          "decision": "accepted",
          "reason": "FEAgent 基于 repository图义务与盲化双程序 surrogate 轨迹提出可执行反例，由确定性对账返回 Equivalent/Inequivalent/Unclear。EquiBench/SWE-bench Verified 可做二次审计。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04371v1",
          "limitations": "不是形式证明；所有报告 divergence 必须直接执行确认；额外行为是否可取需issue要求；固定输入域/环境/observable，不可见反例后改scope。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "FEAgent 基于 repository图义务与盲化双程序 surrogate 轨迹提出可执行反例，由确定性对账返回 Equivalent/Inequivalent/Unclear。EquiBench/SWE-bench Verified 可做二次审计。",
          "data_verifiability": "不是形式证明；所有报告 divergence 必须直接执行确认；额外行为是否可取需issue要求；固定输入域/环境/observable，不可见反例后改scope。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04366",
      "title": "Human Behavior-Informed Crash Scenario Generation with Real-World Crash Priors for Autonomous Vehicle Safety Evaluation",
      "published": "2026-10-03T08:04:39Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04366",
          "title": "Human Behavior-Informed Crash Scenario Generation with Real-World Crash Priors for Autonomous Vehicle Safety Evaluation",
          "published": "2026-10-03T08:04:39Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04366",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "CrashSim多Agent交通生成，LLM仅辅助诊断，核心不是语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04344",
      "title": "Hierarchical Credit Assignment for RLVR on Fused Gromov-Wasserstein Geometry",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04344",
          "title": "Hierarchical Credit Assignment for RLVR on Fused Gromov-Wasserstein Geometry",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "HarA用正确/错误轨迹各自hidden-state位置图FGW重心，按span到重心贡献赋予正/负不同幂credit再乘GRPO优势；真实多模型多基准，不能以欧氏token分数替换FGW。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04344",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04344v1",
              "location": "§3.1–3.2 Eq.7–8；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04328",
      "title": "Bidirectional Preference Synthesis: Learning Prompt-Conditioned Preferences from Boundary Failures",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04328",
          "title": "Bidirectional Preference Synthesis: Learning Prompt-Conditioned Preferences from Boundary Failures",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "BPS是独立离线偏好构造算法而非新loss：从部分失败生成student修正与安全/非泄漏achieved prompt，cycle-consistency验证后同一response pair在两prompt反向成crossed anchor，再标准DPO。IFBench及function-call有机制/下游实验；不把teacher同源的ranking诊断误当独立泛化。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04328",
              "location": "Method：boundary selection、forward/reverse anchors、validation；Experimental setup；Function-calling instantiation；Diagnostic analysis"
            },
            {
              "url": "https://arxiv.org/html/2610.04328v1",
              "location": "Method/DPO Training on Mixed BPS Dataset；实验Table1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "candidate_kind": "preference_data_algorithm",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04328",
          "title": "Bidirectional Preference Synthesis: Learning Prompt-Conditioned Preferences from Boundary Failures",
          "published": "2026-10-03T06:48:35Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04328v1",
          "location": "BPS crossed-anchor construction; normalized p17–34,37–42,73–83",
          "decision": "accepted",
          "reason": "BPS 将部分正确输出在原prompt作为 rejected，又为其构造真实已达成prompt成为 chosen，经独立teacher cycle-consistency筛选，混合forward/reverse pair做标准DPO。公开指令/工具bench可验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04328v1",
          "limitations": "这是偏好数据算法，应归后训练交叉主题；不改DPO loss；reverse不得把事实/数学错误洗成正确；Gemini同teacher probe非teacher-independent泛化；rho约.195来自282验证通过。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "BPS 将部分正确输出在原prompt作为 rejected，又为其构造真实已达成prompt成为 chosen，经独立teacher cycle-consistency筛选，混合forward/reverse pair做标准DPO。公开指令/工具bench可验证。",
          "data_verifiability": "这是偏好数据算法，应归后训练交叉主题；不改DPO loss；reverse不得把事实/数学错误洗成正确；Gemini同teacher probe非teacher-independent泛化；rho约.195来自282验证通过。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04318",
      "title": "Rethinking Long-Video Efficiency: A Joint Allocation Perspective on Frames, Pixels, and Front-End Latency",
      "published": "2026-10-03T06:13:46Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04318",
          "title": "Rethinking Long-Video Efficiency: A Joint Allocation Perspective on Frames, Pixels, and Front-End Latency",
          "published": "2026-10-03T06:13:46Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "LoHi把一次解码的同一帧池分成低分辨率视频和少量高分辨率图像，统一token与前端解码预算；SemDiv用query相关性加DPP挑高分帧。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04318",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04318v1",
              "location": "§4.1–4.4 Eq2–6; §5 setup; Appendix C.6/E"
            },
            {
              "url": "https://arxiv.org/html/2610.04318v1",
              "location": "§4.1–4.4 Eq2–6; §5 setup; Appendix C.6/E",
              "notes": "LoHi把一次解码的同一帧池分成低分辨率视频和少量高分辨率图像，统一token与前端解码预算；SemDiv用query相关性加DPP挑高分帧。"
            }
          ],
          "source": "https://arxiv.org/html/2610.04318v1",
          "locations": [
            "§4.1–4.4 Eq2–6",
            "§5 setup",
            "Appendix C.6/E"
          ],
          "limitations": "同预算5760视觉token仍不同解码帧数，应拆decode/encode/prefill；现代动态分辨率VLM适用，旧LLaVA未证实。熵门限在benchmark10%heldout调只属探索，需固定切分；双流靠文本cue而非新训练跨流模块。未找到官方代码链接。",
          "code_status": "not_found_in_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04318v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "LoHi把一次解码的同一帧池分成低分辨率视频和少量高分辨率图像，统一token与前端解码预算；SemDiv用query相关性加DPP挑高分帧。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04303",
      "title": "What to Preserve in Recursive Computation: A Local Predictive Sufficiency Principle",
      "published": "2026-10-03T05:33:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04303",
          "title": "What to Preserve in Recursive Computation: A Local Predictive Sufficiency Principle",
          "published": "2026-10-03T05:33:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "局部预测充分性用完整协方差平衡的ridge有限测试估计压缩缺损，并将真实optimizer proposal投影到分组预测约束半空间；覆盖语言记忆、TGN、VLA及递归策略，具备新可训练机制与对应控制。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04303",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04303v1",
              "location": "§3.1–3.4/Algorithm2/Propositions2–3; §4/Table1–2; Limitations; Appendix E/Tables18–19"
            },
            {
              "url": "https://arxiv.org/html/2610.04303v1",
              "location": "§3.1–3.4/Algorithm2/Propositions2–3; §4/Table1–2; Limitations; Appendix E/Tables18–19",
              "notes": "CCM同骨干memorydepth协议、MemoryVLA同LIBERO-MemT3、Metan同搜索预算；task-only/additive/global-constraint消融。optimizer state每window只能advance一次，投影只改compressor。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04303v1",
          "locations": [
            "§3.1–3.4/Algorithm2/Propositions2–3",
            "§4/Table1–2",
            "Limitations",
            "Appendix E/Tables18–19"
          ],
          "limitations": "理论population保证须独立样本/测试覆盖条件，不能把经验surrogate等同保证。TGN训练epoch1.9–2.2倍、参数+10.1%，推理±3%；VLA只heldout初始化非广泛OOD；SRI主表选择modifiedtask需另报全六任务。未来能力测试仍需匹配总训练算力。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "CCM同骨干memorydepth协议、MemoryVLA同LIBERO-MemT3、Metan同搜索预算；task-only/additive/global-constraint消融。optimizer state每window只能advance一次，投影只改compressor。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04302",
      "title": "From Valid to Useful: Post-Verification Acquisition for Recursive Self-Improving Recommendation",
      "published": "2026-10-03T05:31:09Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.04302",
          "title": "From Valid to Useful: Post-Verification Acquisition for Recursive Self-Improving Recommendation",
          "published": "2026-10-03T05:31:09Z",
          "repository_status": "new",
          "decision": "deferred",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "DA-RSIR 对验证后策略用 MC dropout 与分歧分桶获取数据，四数据集三模型离线对比；§7 明确在线评估未做。保留 RSI 线索，工业推荐实现需例外批准。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04302",
              "location": "§6 evaluations; §7 limitations"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.04302",
            "url": "https://arxiv.org/html/2610.04302v1",
            "sha256": "0fa61161318ea2d51f33ead70ea97d8fdf760c201c49abd6d2b660263910acaa",
            "status": "downloaded",
            "characters": 58928,
            "errors": []
          }
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04299",
      "title": "Questioning the Questions: Sustaining Self-Evolution in Reasoning Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04299",
          "title": "Questioning the Questions: Sustaining Self-Evolution in Reasoning Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "R-Quest有效性初始化与采样成对新颖性门控改变questioner–solver自演化反馈；真实两家族实验。但正文按每域最高测试benchmark均值选checkpoint，复现必须另设validation，不能继承该选择为无偏正式成绩。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04299",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04299v1",
              "location": "§3.1–3.3；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04292",
      "title": "LMBuild: Evaluating LLM Agents for Generating Buildable and Functional Structures",
      "published": "2026-10-03T04:55:57Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04292",
          "title": "LMBuild: Evaluating LLM Agents for Generating Buildable and Functional Structures",
          "published": "2026-10-03T04:55:57Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04292v1",
          "location": "§2.2–2.3；§3.1/3.4；official repository",
          "decision": "accepted",
          "reason": "LMBuild用可检索/生成零件的交互工具生成3D结构，按结构、功能、设计和物理实现分层评测，适合多模态coding-agent能力候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04292",
          "fulltext_review_completed": true,
          "locations": [
            "§2.2–2.3",
            "§3.1/3.4",
            "official repository"
          ],
          "limitations": "全部实验只200Core而非2549Full；三轮修订仅小幅改善，显式功能规格提升不能当自进化发现。物理可行评分是代理而非真的生产/装配，CAD来源许可证不同应逐件保留，不把医学器械设计当可用产品。",
          "code_url": "https://github.com/Lumos-Jiateng/LMBuild",
          "code_status": "official repository accessible; core/full availability and per-asset licenses must be pinned",
          "reviewer": "root",
          "code": "https://github.com/Lumos-Jiateng/LMBuild"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04278",
      "title": "Do RUL explanations hold up? Faithfulness and stability of attributions on C-MAPSS",
      "published": "2026-10-03T04:10:39Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04278",
          "title": "Do RUL explanations hold up? Faithfulness and stability of attributions on C-MAPSS",
          "published": "2026-10-03T04:10:39Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "设备剩余寿命解释性方法审计，专用预测维护应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04278",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04272",
      "title": "Rethinking Self-Distillation for Multi-Teacher Capability Merging",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04272",
          "title": "Rethinking Self-Distillation for Multi-Teacher Capability Merging",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "控制数据和超参比较MOPD/SFT/soft-label及已有merge方法，贡献为公平基线诊断。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04272",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04269",
      "title": "Self-Reflection Fine-Tuning: Enhancing Agent Security against Prompt Injection Attacks from Failure Experience",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04269",
          "title": "Self-Reflection Fine-Tuning: Enhancing Agent Security against Prompt Injection Attacks from Failure Experience",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "SRFT将失败动作分析成安全思考+动作样本，正文标准负loglikelihood LoRA SFT；数据/安全框架有价值但无新增核心后训练算法。 该决定仅限后训练核心track，Agent方法/数据公共入口由Agent track独立判断，不能据此全局拒绝。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04269",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04269v1",
              "location": "§4.5；§5.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04263",
      "title": "Multimodal Dual-Encoder Retrieval for Automated ICD Coding",
      "published": "2026-10-03T03:39:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04263",
          "title": "Multimodal Dual-Encoder Retrieval for Automated ICD Coding",
          "published": "2026-10-03T03:39:56Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ICD医疗编码双编码检索及LLM rerank，专用临床应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04263",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04261",
      "title": "Playing social deduction games with reinforcement fine-tuned large language models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04261",
          "title": "Playing social deduction games with reinforcement fine-tuned large language models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "社交推理/影响reward与同侧共享策略的GRPO应用；正文标准group normalization/PPOclip/KL，无新增优化器，归Agent环境研究。 该决定仅限后训练核心track，Agent方法/数据公共入口由Agent track独立判断，不能据此全局拒绝。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04261",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04261v1",
              "location": "§5.2.1–5.2.5 Eq.6–12；§2"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04261",
          "title": "Playing social deduction games with reinforcement fine-tuned large language models",
          "published": "2026-10-03T03:37:15Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04261v1",
          "location": "AgentEvolver Game Arena methods; normalized p110–133; social cognition RFT; Limitations",
          "decision": "accepted",
          "reason": "社交推理 RFT 在狼人/Avalon 对同阵营共享policy训练，私有可见角色+公共历史形成prompt；用隐藏角色预测和后续投票影响奖励，终局win作外部观察。明确游戏引擎可构建验证。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "source_url": "https://arxiv.org/html/2610.04261v1",
          "limitations": "隐藏state只reward计算，不能给玩家完整gold角色；固定对手不能证明非平稳多智能体泛化；影响奖励非严格因果说服；模型盲评非真实人类交互，后者后续。",
          "fulltext_review_completed": true,
          "algorithm_verifiability": "社交推理 RFT 在狼人/Avalon 对同阵营共享policy训练，私有可见角色+公共历史形成prompt；用隐藏角色预测和后续投票影响奖励，终局win作外部观察。明确游戏引擎可构建验证。",
          "data_verifiability": "隐藏state只reward计算，不能给玩家完整gold角色；固定对手不能证明非平稳多智能体泛化；影响奖励非严格因果说服；模型盲评非真实人类交互，后者后续。",
          "upstream_access_verified": false,
          "reviewer": "foundation_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04255",
      "title": "Grounded in Time: A Multi-Source Dataset and Benchmark for Temporal Grounding in Robotic Manipulation",
      "published": "2026-10-03T03:25:24Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04255",
          "title": "Grounded in Time: A Multi-Source Dataset and Benchmark for Temporal Grounding in Robotic Manipulation",
          "published": "2026-10-03T03:25:24Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "Grounded-in-Time用前episode视频与反事实A/B场景定义历史语义操作，ManiSkill3与真机双源评测；未定位官方数据/环境任务包，无法忠实重放。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04255",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.04255v1",
              "location": "§III-A–D; §IV-A/C/D; TableV",
              "notes": "Grounded-in-Time用前episode视频与反事实A/B场景定义历史语义操作，ManiSkill3与真机双源评测；未定位官方数据/环境任务包，无法忠实重放。"
            }
          ],
          "source": "https://arxiv.org/html/2610.04255v1",
          "locations": [
            "§III-A–D",
            "§IV-A/C/D",
            "TableV"
          ],
          "limitations": "基线π0.5无前历史输入，低SR并不直接证明记忆结构劣；模拟每task60次，真机10次，pair只逐例分数。未来接入须真正环境执行并报告SR与阶段PSR，不能用历史答案标签生成动作。",
          "code_status": "official_environment_and_dataset_not_located",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.04255v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Grounded-in-Time用前episode视频与反事实A/B场景定义历史语义操作，ManiSkill3与真机双源评测；未定位官方数据/环境任务包，无法忠实重放。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04246",
      "title": "Benchmarking Psychological Dynamics in Generative Agents",
      "published": "2026-10-03T03:08:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04246",
          "title": "Benchmarking Psychological Dynamics in Generative Agents",
          "published": "2026-10-03T03:08:42Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04246v1",
          "location": "§3.1–3.3；§4；§6/reproducibility",
          "decision": "pending",
          "reason": "PsyDyBench将300合成人格六天同一事件叙事交给不同模型，比较个体内外方差、关联与人类规范，适合作为persona诊断；官方仓库读取失败，暂缓正式基准接入。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "id": "2610.04246",
          "fulltext_review_completed": true,
          "locations": [
            "§3.1–3.3",
            "§4",
            "§6/reproducibility"
          ],
          "limitations": "仅6天AR估计有短panel偏差、四指标单因子未识别而改特征谱；共享LLM叙事不是实际人类纵向数据。方向一致不表示定量心理保真，不能用于现实个人心理诊断/预测。",
          "code_url": "https://github.com/sumervaid/PsyDyBench",
          "code_status": "paper-listed release, webpage read unavailable",
          "reviewer": "root",
          "code": "https://github.com/sumervaid/PsyDyBench"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04225",
      "title": "FlashGaze: Training-Free Multi-Scale Patch Pruning For Efficient Video Understanding",
      "published": "2026-10-03T02:33:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04225",
          "title": "FlashGaze: Training-Free Multi-Scale Patch Pruning For Efficient Video Understanding",
          "published": "2026-10-03T02:33:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "FlashGaze 在视觉编码前按运动补偿误差选择 Drop/Merge/Keep，以三层四叉树动态规划满足像素预算。Qwen3-VL/NVILA 与公开视频基准可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04225",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.04225v1",
              "location": "§3.1–3.3/Eq1–6/Algorithm1; §4.1; Appendix A/B",
              "notes": "FlashGaze 在视觉编码前按运动补偿误差选择 Drop/Merge/Keep，以三层四叉树动态规划满足像素预算。Qwen3-VL/NVILA 与公开视频基准可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04225v1",
          "locations": [
            "§3.1–3.3/Eq1–6/Algorithm1; §4.1; Appendix A/B"
          ],
          "limitations": "首帧完整保留且豁免预算；端到端 TTFT 必须包含预处理与视觉编码；H200 速度不可直接视为 A100 结果。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "FlashGaze 在视觉编码前按运动补偿误差选择 Drop/Merge/Keep，以三层四叉树动态规划满足像素预算。Qwen3-VL/NVILA 与公开视频基准可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04204",
      "title": "Clean: Second-order LLM Training at Linear Memory Cost via Nyström Sketching",
      "published": "2026-10-03T01:37:36Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04204",
          "title": "Clean: Second-order LLM Training at Linear Memory Cost via Nyström Sketching",
          "published": "2026-10-03T01:37:36Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Clean/Q-Clean以Nyström双侧薄因子及四互补块moment降低优化器状态，定义足够明确且有LLM预训练实测，可作为新optimizer候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04204",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04204v1",
              "location": "§3 Eq6–16/Alg1; §4; §6 Table3/Fig5; AppA/B/D"
            },
            {
              "url": "https://arxiv.org/html/2610.04204v1",
              "location": "§3 Eq6–16/Alg1; §4; §6 Table3/Fig5; AppA/B/D",
              "notes": "Main双moment，A/B完整first+轴sumsecond，C无first仅标量second；basisrefresh传first和A/B平方overlap，MainV不旋转；T10 r256/512，C4 350M/1.3B相同tokenbatch；1.3BPPL11.65vsAdam12.12，64h到Adam81h末loss。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04204v1",
          "locations": [
            "§3 Eq6–16/Alg1",
            "§4",
            "§6 Table3/Fig5",
            "AppA/B/D"
          ],
          "limitations": "线性仅固定r的state非parameter/gradient/activation，r随d增长不保证渐近线性；13B展示fitmemory非完成13B能力训练；bestval和缩短sweep需冻结选择协议，无报告trainingseedCI；QClean12.10并非优于所有baseline。",
          "code_status": "未在已核官方正文中找到作者源码入口；算法/实验描述可复核，未宣称源码已发布",
          "kind": "core_algorithm",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Main双moment，A/B完整first+轴sumsecond，C无first仅标量second；basisrefresh传first和A/B平方overlap，MainV不旋转；T10 r256/512，C4 350M/1.3B相同tokenbatch；1.3BPPL11.65vsAdam12.12，64h到Adam81h末loss。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04196",
      "title": "Asynchronous Is Nearly Free for Evolution Strategies on Long-Horizon Agentic Tasks",
      "published": "2026-10-03T01:18:02Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04196",
          "title": "Asynchronous Is Nearly Free for Evolution Strategies on Long-Horizon Agentic Tasks",
          "published": "2026-10-03T01:18:02Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04196v1",
          "location": "§2–5、Appendix A/B",
          "decision": "accepted",
          "reason": "AsyncES 以参数版本记录 rollout lag，接受 bounded-staleness 回报、按 accepted cohort 标准化奖励并更新中央 ES 参数；worker 恢复无扰动权重并重放更新后再扰动。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "Qwen2.5-7B/ALFWorld，2083 train/100 validation/300 test；三 evaluation seeds 仅为同一训练 checkpoint，不是三训练 seeds。异步 lag=1 接近同步、lag=4/8退化；ES FLOPs 约 GRPO 3.99倍，不能只比墙钟。需真实模型扰动、丢弃与版本日志，不可 fixture 奖励替代。",
          "code": "https://github.com/Bhoy1/async-es",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04196v1",
              "location": "§2–5、Appendix A/B"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04178",
      "title": "SHarP: Saliency-based Pruning of Agent Harnesses",
      "published": "2026-10-03T00:41:14Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04178",
          "title": "SHarP: Saliency-based Pruning of Agent Harnesses",
          "published": "2026-10-03T00:41:14Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04178v1",
          "location": "§3–4、saliency definition and pruning procedure",
          "decision": "accepted",
          "reason": "SHarP 对手工定义 harness 模块逐一禁用，以 dev 任务分数/成本的相对中位数及 paired t-test 判断 saliency；保护显著性能贡献模块，按效率信号剪枝后独立评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "四公开任务组；held-out 三次运行/任务。模块边界与耦合先定义，selection 仅 dev；p-value不是因果重要性或效应量。需真正禁用工具/指令/模块并匹配预算；成本公式 mean 与图 median 分开。",
          "code": "https://github.com/UCSB-NLP-Chang/SHarP",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04178v1",
              "location": "§3–4、saliency definition and pruning procedure"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04168",
      "title": "Agentic Cognitive Depth: Operational Criteria for Evaluating LLM Agents",
      "published": "2026-10-03T00:19:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04168",
          "title": "Agentic Cognitive Depth: Operational Criteria for Evaluating LLM Agents",
          "published": "2026-10-03T00:19:23Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04168",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Agent认知深度操作标准/诊断提案，无已执行新算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04158",
      "title": "How RL Reshapes LLM Reasoning: Transferability, Coverage, and Scaling Laws",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04158",
          "title": "How RL Reshapes LLM Reasoning: Transferability, Coverage, and Scaling Laws",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "RL策略选择、transfer/coverage/scaling理论与测量，未提出新的训练机制。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04158",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04156",
      "title": "Trajectory-Derived Confidence for Reliable, Resource-Aware Clinical Text-to-SQL Agents",
      "published": "2026-10-02T23:57:25Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04156",
          "title": "Trajectory-Derived Confidence for Reliable, Resource-Aware Clinical Text-to-SQL Agents",
          "published": "2026-10-02T23:57:25Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04156v1",
          "location": "§3.1–3.4、§4.1、Limitations、Appendix I",
          "decision": "pending",
          "reason": "Sentinel 两 ModernBERT heads 从问题及轨迹前缀预测 answerability/correctness；calibration 定退出门、isotonic map 和 early-stop，交付时用 Chow λ/(1+λ) 拒答规则。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "EHRSQL/MIMIC-III需受控数据访问，原始训练轨迹/heads仓库未定位。按模板切6179/2160/2101，官方test未碰；26%困难case judge分歧、单训练seed、heads每agent重训；接近满分answerability部分来自短模板。等待可用数据/轨迹，不用虚构SQL奖励。",
          "code": "正文未定位公开实现；MIMIC-III有访问要求",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04156v1",
              "location": "§3.1–3.4、§4.1、Limitations、Appendix I"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04152",
      "title": "Kepler4D: Controllable Future Video Generation via 4D Scene State Evolution",
      "published": "2026-10-02T23:53:00Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04152",
          "title": "Kepler4D: Controllable Future Video Generation via 4D Scene State Evolution",
          "published": "2026-10-02T23:53:00Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Kepler4D 通过 DA3、SAM2 和 VLM 获取观测对象代理，Chain-of-Motion 产生结构化运动并渲染 3D 控制给 VerseCrafter。DL3DV/DAVIS 可做条件化延续实验。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04152",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.04152v1",
              "location": "§3.1–3.4; §4; Appendix B",
              "notes": "Kepler4D 通过 DA3、SAM2 和 VLM 获取观测对象代理，Chain-of-Motion 产生结构化运动并渲染 3D 控制给 VerseCrafter。DL3DV/DAVIS 可做条件化延续实验。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04152v1",
          "locations": [
            "§3.1–3.4; §4; Appendix B"
          ],
          "limitations": "评测使用由完整视频估计的未来相机轨迹作为给定条件；禁止宣传为无条件预测，禁止未来帧进入初始状态；Dynamic Degree 不是运动正确率。",
          "code_url": "https://brack-wang.github.io/kepler4d/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Kepler4D 通过 DA3、SAM2 和 VLM 获取观测对象代理，Chain-of-Motion 产生结构化运动并渲染 3D 控制给 VerseCrafter。DL3DV/DAVIS 可做条件化延续实验。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04140",
      "title": "ExpertMuon-Compass: Alignment-Guided Step Sizes for Mixture-of-Experts Training",
      "published": "2026-10-02T23:27:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04140",
          "title": "ExpertMuon-Compass: Alignment-Guided Step Sizes for Mixture-of-Experts Training",
          "published": "2026-10-02T23:27:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ExpertMuon-Compass保持Muon矩阵方向，以familyalignment和rowalignment标量半径调整expert步长，独立tuningseed与配对评测充分定义训练operator。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04140",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04140v1",
              "location": "§3.1–3.4 Eq1–8; §4.1–4.4 Tables1–4; §5; AppA/C"
            },
            {
              "url": "https://arxiv.org/html/2610.04140v1",
              "location": "§3.1–3.4 Eq1–8; §4.1–4.4 Tables1–4; §5; AppA/C",
              "notes": "NesterovNS5，cos(O,G)+ family归一cap1再归一，rowfactor随LR衰减转单alpha而非逐row改方向；零tokenexpert不更新；3LR×2tuningseed，8evalseed，matchedweightdecay；languageblocked额外8seed复验。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04140v1",
          "locations": [
            "§3.1–3.4 Eq1–8",
            "§4.1–4.4 Tables1–4",
            "§5",
            "AppA/C"
          ],
          "limitations": "4–7%wallclock额外；短8.2Mtoken明显未充分训练，262M/1.05B接近NorMuon，最有力是变化数据顺序；N/H与N/N必须区分避免把momentum更改归因Compass；FP32结果不直接外推BF16/大型MoE。",
          "code_status": "未在已核官方正文中找到作者源码入口；算法/实验描述可复核，未宣称源码已发布",
          "kind": "core_algorithm",
          "implementation_status": "not_implemented",
          "fulltext_notes": "NesterovNS5，cos(O,G)+ family归一cap1再归一，rowfactor随LR衰减转单alpha而非逐row改方向；零tokenexpert不更新；3LR×2tuningseed，8evalseed，matchedweightdecay；languageblocked额外8seed复验。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04139",
      "title": "From Sight to Foresight: Predictive Spatial Reasoning in Vision-Language Models",
      "published": "2026-10-02T23:27:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04139",
          "title": "From Sight to Foresight: Predictive Spatial Reasoning in Vision-Language Models",
          "published": "2026-10-02T23:27:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SpatialMind 以有界对数深度修正、度量和运动编码对齐视觉 token，分 GROUND/CURRENT/DYNAMICS/FUTURE 训练状态链与答案。外部 VSI/OSI/VLM4D 支持迁移检验。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04139",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.04139v1",
              "location": "§3; §4/Eq4–6; §5.1–5.3; Appendix A–C",
              "notes": "SpatialMind 以有界对数深度修正、度量和运动编码对齐视觉 token，分 GROUND/CURRENT/DYNAMICS/FUTURE 训练状态链与答案。外部 VSI/OSI/VLM4D 支持迁移检验。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04139v1",
          "locations": [
            "§3; §4/Eq4–6; §5.1–5.3; Appendix A–C"
          ],
          "limitations": "自建 30677 训练 QA/2000 benchmark 的实际发布需后续核验；未来状态只能作为训练目标和离线评分，推理只读观测前缀。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "SpatialMind 以有界对数深度修正、度量和运动编码对齐视觉 token，分 GROUND/CURRENT/DYNAMICS/FUTURE 训练状态链与答案。外部 VSI/OSI/VLM4D 支持迁移检验。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04138",
      "title": "Dual-Scale Relational Graph Transformers for Ecosystem-Aware Fraud Detection",
      "published": "2026-10-02T23:21:05Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04138",
          "title": "Dual-Scale Relational Graph Transformers for Ecosystem-Aware Fraud Detection",
          "published": "2026-10-02T23:21:05Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "HERMES银行反欺诈图模型，属于工业风险业务而非基础模型track；生产证据应专门审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04138",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04134",
      "title": "Agentic Resource Allocation for Batch Multi-Objective Bayesian Optimization in Autonomous Materials Discovery",
      "published": "2026-10-02T23:08:20Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04134",
          "title": "Agentic Resource Allocation for Batch Multi-Objective Bayesian Optimization in Autonomous Materials Discovery",
          "published": "2026-10-02T23:08:20Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04134v1",
          "location": "§2.2–2.6、optimization campaigns、Data availability",
          "decision": "accepted",
          "reason": "MultiTaskGP 在每轮 qEHVI 与 diversified qUCB 六种配比之间分配实验batch；LLM根据近期HV/MI、历史和预算事件选择option，Adaptive还选β。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "25配对seed，但ground truth是数据拟合random forest而非真实材料实验；HV reference使用全枚举oracle空间，只能作为离线评分，不给决策器未来真值。预算变化预告一轮、离散空间与每组q=5固定；不声称现实发现因果提升。",
          "code": "https://github.com/Tripp5118/resource-allocation ; https://doi.org/10.5281/zenodo.23111493",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.04134v1",
              "location": "§2.2–2.6、optimization campaigns、Data availability"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04133",
      "title": "Auditing Pairwise Equivalence Judgments: Self-Critique Effects and Diversity Measurement in Multi-Agent Hypothesis Generation",
      "published": "2026-10-02T23:07:36Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04133",
          "title": "Auditing Pairwise Equivalence Judgments: Self-Critique Effects and Diversity Measurement in Multi-Agent Hypothesis Generation",
          "published": "2026-10-02T23:07:36Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04133",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "假设等价判定、自我批评和多样性measurement研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04132",
      "title": "PB-GRPO: Learning Socially Adaptive LLM Agents from Persona-Driven Simulation with Preference-Batched GRPO",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.04132",
          "title": "PB-GRPO: Learning Socially Adaptive LLM Agents from Persona-Driven Simulation with Preference-Batched GRPO",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "PB-GRPO保持prompt-local均值，但在同潜在偏好bucket内合并方差作为分母；128训练persona/100未见persona真实Qwen7B，初步单设置证据需保守。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04132",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.04132v1",
              "location": "§3公式；§4/Table1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.04132",
          "title": "PB-GRPO: Learning Socially Adaptive LLM Agents from Persona-Driven Simulation with Preference-Batched GRPO",
          "published": "2026-10-02T23:07:24Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04132v1",
          "location": "§3公式；§4/Table1",
          "decision": "accepted",
          "reason": "PB-GRPO保持prompt-local均值，但在同潜在偏好bucket内合并方差作为分母；128训练persona/100未见persona真实Qwen7B，初步单设置证据需保守。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04125",
      "title": "Representational Control over Self-Report & Behavior Coherence in LLM Risk-Taking",
      "published": "2026-10-02T22:54:43Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04125",
          "title": "Representational Control over Self-Report & Behavior Coherence in LLM Risk-Taking",
          "published": "2026-10-02T22:54:43Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04125",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "风险偏好自报告/行为activation表征对照，主要机制诊断。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04118",
      "title": "LongSocialBench: Do Long-Context LLMs Understand Online Discussion Threads?",
      "published": "2026-10-02T22:47:29Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04118",
          "title": "LongSocialBench: Do Long-Context LLMs Understand Online Discussion Threads?",
          "published": "2026-10-02T22:47:29Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "LongSocialBench公开1462题/94完整讨论及精确MCQ协议，长上下文结构化社会推理覆盖有价值；只纳入无gold推理评测，oracle单列diagnostic。",
          "review_level": "fulltext",
          "kind": "public_evaluation_infrastructure",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04118",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04118v1",
              "location": "§3; §4; §5.5–5.6; AppD.2/I; 官方HF README"
            },
            {
              "url": "https://arxiv.org/html/2610.04118v1",
              "location": "§3; §4; §5.5–5.6; AppD.2/I; 官方HF README",
              "notes": "94episode约6.63Mtoken，中位73K；20contributor独立验证1462题；18模型29setting其中22deployable7diagnostic。HF有questions/episodes parquet、join和字段schema，gold分离。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04118v1",
          "locations": [
            "§3",
            "§4",
            "§5.5–5.6",
            "AppD.2/I",
            "官方HF README"
          ],
          "limitations": "正文只对parsed responses计accuracy须同时报告coverage/invalid全分母结果；Gold-Scope和criterion-label带gold不得evolve优化能力；公开数据只有test需冻结episode级holdout避免泄漏；README旧Tracyyyy1997命名与页面xinyiliu-research应pin实际revision；未发现完整作者runner。",
          "code_url": "https://huggingface.co/datasets/xinyiliu-research/LongSocialBench",
          "implementation_status": "not_implemented",
          "fulltext_notes": "94episode约6.63Mtoken，中位73K；20contributor独立验证1462题；18模型29setting其中22deployable7diagnostic。HF有questions/episodes parquet、join和字段schema，gold分离。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04104",
      "title": "Where Does the Semantic Gain Come From? A Reproduction and Extension of Semantic Knowledge-driven Contrastive Learning for Long-Tailed Recognition",
      "published": "2026-10-02T22:17:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04104",
          "title": "Where Does the Semantic Gain Come From? A Reproduction and Extension of Semantic Knowledge-driven Contrastive Learning for Long-Tailed Recognition",
          "published": "2026-10-02T22:17:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "SKCL复现与预算混淆审计，未建立稳定新算法增益。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04104",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04083",
      "title": "Self-Propagating Misalignment in LLM Agents, and Why Auditing or Disabling Memory Is Not Enough",
      "published": "2026-10-02T21:46:13Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04083",
          "title": "Self-Propagating Misalignment in LLM Agents, and Why Auditing or Disabling Memory Is Not Enough",
          "published": "2026-10-02T21:46:13Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04083",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "memory/文件自传播失配目标的威胁评测，无新防御算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04053",
      "title": "The Cost of a Hop: Benchmarking NLIP and A2A",
      "published": "2026-10-02T21:04:30Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04053",
          "title": "The Cost of a Hop: Benchmarking NLIP and A2A",
          "published": "2026-10-02T21:04:30Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04053",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "NLIP/A2A通信协议延迟对照，不是Agent策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04047",
      "title": "Periscope: Extending Frozen Language Models Beyond Their Context Window",
      "published": "2026-10-02T20:52:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04047",
          "title": "Periscope: Extending Frozen Language Models Beyond Their Context Window",
          "published": "2026-10-02T20:52:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Periscope明确给出冻结模型的局部/跨距探测与证据图，可作为长上下文推理和retrieval算子候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04047",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04047v1",
              "location": "§3; §4.2–4.3 Tables1–4; §5–6; App A.1/A.2; 作者README"
            },
            {
              "url": "https://arxiv.org/html/2610.04047v1",
              "location": "§3; §4.2–4.3 Tables1–4; §5–6; App A.1/A.2; 作者README",
              "notes": "c=500 QA/100retrieval，K=ceil√N，2K行列probe，option logp−abstain，Direct各自max相加，Select图topK按原序再一次read。LongBenchV2 503题、InfiniteBench229题、BRIGHT7域350query全corpus；4B131k窗口41.9与Select9k最终read41.9。公开runner/core tests与top20logprob服务协议。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04047v1",
          "locations": [
            "§3",
            "§4.2–4.3 Tables1–4",
            "§5–6",
            "App A.1/A.2",
            "作者README"
          ],
          "limitations": "每token读两次，9k不是总处理量；W²/c是长度界非准确率保证。单probeKV不同于批量residentmemory；应计全部probe和embedding/readback模型。finite-choice单tokenreadout限制、多文档弱；top20缺选项fallback需代码单测。",
          "code_url": "https://github.com/mohammad2012191/Periscope",
          "implementation_status": "not_implemented",
          "fulltext_notes": "c=500 QA/100retrieval，K=ceil√N，2K行列probe，option logp−abstain，Direct各自max相加，Select图topK按原序再一次read。LongBenchV2 503题、InfiniteBench229题、BRIGHT7域350query全corpus；4B131k窗口41.9与Select9k最终read41.9。公开runner/core tests与top20logprob服务协议。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04040",
      "title": "Agent Policy-Value Audit: Separating Transition Composition from Event Selection in Financial LLM Agents",
      "published": "2026-10-02T20:46:34Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04040",
          "title": "Agent Policy-Value Audit: Separating Transition Composition from Event Selection in Financial LLM Agents",
          "published": "2026-10-02T20:46:34Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.04040",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "金融Agent收益的transition composition vs selection统计审计。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04009",
      "title": "SUAVE: Unified Video-Action Models via Masked Diffusion",
      "published": "2026-10-02T20:11:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04009",
          "title": "SUAVE: Unified Video-Action Models via Masked Diffusion",
          "published": "2026-10-02T20:11:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SUAVE统一离散视频/动作masked diffusion为真实新模型训练候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04009",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.04009v1",
              "location": "§III-A–D; §IV-A–C; §V Limitations",
              "notes": "MMaDA8B共享表/输出头新增256action，MAGViTfrozen，块内双向块间因果；独立cosmaskrate video/action，loss仅有标签maskedpositions，无动作video的mask不计loss。8historyfront/wrist，所有policy使用jointvideoaction，4steps exactprefixKV。训练最终ckpt单seed，LIBERO90与evaltaskdisjoint。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.04009v1",
          "locations": [
            "§III-A–D",
            "§IV-A–C",
            "§V Limitations"
          ],
          "limitations": "实际不生成语言/不测语义泛化；co-trainingvs仅pretrain统计不可分，single-seedbootstrap只是rollout不确定性。真实1.03schunk5action不等5Hz闭环，reported2.5actions/s。tokenizer限制FVD，未定位作者独立代码库。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "MMaDA8B共享表/输出头新增256action，MAGViTfrozen，块内双向块间因果；独立cosmaskrate video/action，loss仅有标签maskedpositions，无动作video的mask不计loss。8historyfront/wrist，所有policy使用jointvideoaction，4steps exactprefixKV。训练最终ckpt单seed，LIBERO90与evaltaskdisjoint。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04008",
      "title": "SkillScriptBench: Benchmarking Self-Evolution of Executable Agent Skill Packages Beyond Markdown",
      "published": "2026-10-02T20:10:12Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.04008",
          "title": "SkillScriptBench: Benchmarking Self-Evolution of Executable Agent Skill Packages Beyond Markdown",
          "published": "2026-10-02T20:10:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.04008v1",
          "location": "§2.1–2.4；§3.1–3.4；§4.1；Appendix A/D",
          "decision": "accepted",
          "reason": "SkillScriptBench评估SKILL.md和脚本一致性，AST-guided revision绑定需求到唯一语法节点，局部修改并显式保留正确行为，适合可执行skill/RSI迭代候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.04008",
          "fulltext_review_completed": true,
          "locations": [
            "§2.1–2.4",
            "§3.1–3.4",
            "§4.1",
            "Appendix A/D"
          ],
          "limitations": "350任务中300故障和50clean分开，Pass@3与三次全成功不同；surrogate verifier必须独立于隐藏官方test。基于原/初修版本的unique匹配失败应fail-closed，不能不受控覆盖用户代码；公开作者数据包仍需核验。",
          "code_status": "method and prompts specified; canonical official task-package URL not located in extracted text",
          "reviewer": "root"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.04002",
      "title": "Do Language Models Need a Trainable Input Embedding Table? Fixed Minimal Token Codes at 1.7B-Class Scale",
      "published": "2026-10-02T20:06:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.04002",
          "title": "Do Language Models Need a Trainable Input Embedding Table? Fixed Minimal Token Codes at 1.7B-Class Scale",
          "published": "2026-10-02T20:06:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "固定最小二进制token身份+确定lift可作为可执行架构/机制诊断变体，公开checkpoint；不作为质量或效率优胜算法。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.04002",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.04002v1",
              "location": "§3.2–3.5; §4.1–4.4; §5/Table2; §8/AppE"
            },
            {
              "url": "https://arxiv.org/html/2610.04002v1",
              "location": "§3.2–3.5; §4.1–4.4; §5/Table2; §8/AppE",
              "notes": "V49152用16bit重复128至d2048，GF2可逆recoding另一个配置，仍训练output head；固定表buffer786432，trainable少100.7M约5.56%；100Btoken同backbone recipe，HellaSwag57.79→52.40/51.44。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.04002v1",
          "locations": [
            "§3.2–3.5",
            "§4.1–4.4",
            "§5/Table2",
            "§8/AppE"
          ],
          "limitations": "只是无trainable input table非lookup-free或无embedding函数；参数/几何/输入尺度同改；单run且resume不恢复sampler游标，未等FLOPs；无测得系统优势，MMLU/CSQA近chance。",
          "code_url": "https://huggingface.co/Bochkov/ab_ext_binary16",
          "kind": "mechanism_diagnostic",
          "implementation_status": "not_implemented",
          "fulltext_notes": "V49152用16bit重复128至d2048，GF2可逆recoding另一个配置，仍训练output head；固定表buffer786432，trainable少100.7M约5.56%；100Btoken同backbone recipe，HellaSwag57.79→52.40/51.44。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03994",
      "title": "Solving VeriContest with a Lean-Backed Rust Verifier",
      "published": "2026-10-02T19:56:10Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03994",
          "title": "Solving VeriContest with a Lean-Backed Rust Verifier",
          "published": "2026-10-02T19:56:10Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03994v1",
          "location": "§3.1–3.4、§4、§4.5",
          "decision": "accepted",
          "reason": "Rust-Prover 将 Verus spec 转 Rust specification、由 Charon/Aeneas 转 Lean，proof agent给定不变代码/theorem迭代证明，干净clone复核byte identity与Lean axioms。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "1007problem/1325theorem是公共固定benchmark；349spec未经全量测试、translation仅部分差分覆盖，翻译器在信任边界。禁sorry/admit/native_decide/bv_decide；public Verus proof可能提供先验，未见Lean证明不等于无间接污染。不能以字符串proof成功代替Lean kernel。",
          "code": "正文未定位直接仓库URL；公共VeriContest与Aeneas工具链",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03994v1",
              "location": "§3.1–3.4、§4、§4.5"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03984",
      "title": "Teaching Agents to Code Reliably",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03984",
          "title": "Teaching Agents to Code Reliably",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "在mutation/sibling补丁上给测试断言按加权coverage Shapley credit，门控正轨迹优势再注入assertion token，属新credit机制；gold tests仅scorer可见。全500例先诊断后230训练270holdout，不应宣称完全未接触测试。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03984",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.03984v1",
              "location": "§2.3 Eq.2–5；§3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.03984",
          "title": "Teaching Agents to Code Reliably",
          "published": "2026-10-02T19:47:19Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03984v1",
          "location": "§2.3 Eq.2–5；§3",
          "decision": "accepted",
          "reason": "在mutation/sibling补丁上给测试断言按加权coverage Shapley credit，门控正轨迹优势再注入assertion token，属新credit机制；gold tests仅scorer可见。全500例先诊断后230训练270holdout，不应宣称完全未接触测试。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03972",
      "title": "Probabilistic Algorithms for Ising Machines from Optimization to Generative AI",
      "published": "2026-10-02T19:30:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03972",
          "title": "Probabilistic Algorithms for Ising Machines from Optimization to Generative AI",
          "published": "2026-10-02T19:30:02Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Ising概率算法与硬件协同设计综述。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03972",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.03972",
          "title": "Probabilistic Algorithms for Ising Machines from Optimization to Generative AI",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "Ising机器概率算法综述，不是新LLM后训练论文。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03972",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03969",
      "title": "How Do Coding Agents Optimize Software and Report Performance Validation? A Large-Scale Empirical Study of Open-Source Pull Requests",
      "published": "2026-10-02T19:23:43Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03969",
          "title": "How Do Coding Agents Optimize Software and Report Performance Validation? A Large-Scale Empirical Study of Open-Source Pull Requests",
          "published": "2026-10-02T19:23:43Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03969",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Agent性能PR实践/测量的大规模经验研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03938",
      "title": "MLLMs Fail to Refuse when Using Tools Agentically",
      "published": "2026-10-02T18:48:51Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03938",
          "title": "MLLMs Fail to Refuse when Using Tools Agentically",
          "published": "2026-10-02T18:48:51Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03938v1",
          "location": "§3.1–3.2、§4.1–4.3、§5、Appendix A–D",
          "decision": "accepted",
          "reason": "同一MLLM在no-tool与ReAct四视觉工具条件下配对，测拒绝失败；按tool次数诊断context dilution，并逐轮重注入原请求比较缓解。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "三公开视觉安全集、11模型，RFR是GPT-5.2judge拒绝代理而非真实危害结果；tool次数相关性不单独证明因果。Gemini native agent工具不可控制，另报。须真实图像/OCR/tagging/crop执行，re-injection不是完全防护。",
          "code": "正文未定位原始仓库URL；MM-SafetyBench/VLSBench/HoliSafe公开",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03938v1",
              "location": "§3.1–3.2、§4.1–4.3、§5、Appendix A–D"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03935",
      "title": "General Decision Models: Benchmarking and Insights Beyond Jev",
      "published": "2026-10-02T18:47:00Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03935",
          "title": "General Decision Models: Benchmarking and Insights Beyond Jev",
          "published": "2026-10-02T18:47:00Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "InnerJev的Reasoning-to-Readout Self-Distillation是实际新算法而非仅JEVal benchmark；已核两条自推理软目标、冻结输出层、一epoch训练与独立dev选checkpoint。但主对比混合不同规模/训练来源，未确认同训练预算替代蒸馏损失基线，需补资格证据而非按benchmark直接丢弃。",
          "review_level": "fulltext",
          "official_url": "https://arxiv.org/html/2610.03935v1",
          "locations": [
            "§4.1",
            "§6.1–6.3",
            "Appendix F.2/Table42",
            "Appendix F.3",
            "Appendix F.4/Table43"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03935",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03935v1",
              "location": "§4.1; §6.1–6.3; Appendix F.2/Table42; Appendix F.3; Appendix F.4/Table43"
            },
            {
              "url": "https://arxiv.org/html/2610.03935v1",
              "location": "§4.1; §6.1–6.3; Appendix F.2/Table42; Appendix F.3; Appendix F.4/Table43",
              "notes": "教师目标不使用gold标签；训练只收两条有效且顶选一致的推理结果；1epoch batch64，dev7506题；InnerJev27B39279训练题。4B/27B单H100中位延迟58.7/112.2ms，Jev hostedAPI含网络不可直接归因模型。"
            }
          ],
          "code_url": "https://github.com/amazingljy1206/InnerJev",
          "dataset_url": "https://huggingface.co/datasets/carlosxiang/JEVal",
          "institution": "Shanghai Innovation Institute / Fudan / Tongji / King's College London / CUHK",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "教师目标不使用gold标签；训练只收两条有效且顶选一致的推理结果；1epoch batch64，dev7506题；InnerJev27B39279训练题。4B/27B单H100中位延迟58.7/112.2ms，Jev hostedAPI含网络不可直接归因模型。",
          "review_status": "reviewed_deferred"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03923",
      "title": "Learning Robust Personalized Prompts for LLM-Driven Sequential Recommendation",
      "published": "2026-10-02T18:34:26Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.03923",
          "title": "Learning Robust Personalized Prompts for LLM-Driven Sequential Recommendation",
          "published": "2026-10-02T18:34:26Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "LRPRec 在 MovieLens/Steam/LastFM 时间切分上报告离线排名；文中 A/B 是提示更改的假设应用场景，并非已经执行的生产实验。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03923",
              "location": "§4.1; Tables 1–2"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.03923",
            "url": "https://arxiv.org/html/2610.03923v1",
            "sha256": "3834711f7d47dcee122b81cfb9f4f6740b326ba8e753d66617ba8a01bf500d24",
            "status": "downloaded",
            "characters": 114961,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03902",
      "title": "When Evidence Changes: Evaluating Memory Repair and Re-reading in Language-Model Agents",
      "published": "2026-10-02T18:13:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03902",
          "title": "When Evidence Changes: Evaluating Memory Repair and Re-reading in Language-Model Agents",
          "published": "2026-10-02T18:13:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03902v1",
          "location": "§3–5、§6.2–6.5、§8、Appendix A/B",
          "decision": "pending",
          "reason": "Versioned dependency memory以snapshot/readset事务commit处理撤销和替换；比较re-read/cache/rebuild/local repair/quarantine/no-propagation，源允许表约束回答。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "eICU demo公开，但冻结scenario/原始轨迹/代码均明确未公开、接受后释放。样本3–20patient/cell，posthoc词法scorer、同患者reuse、部分预注册遗漏；不是repair因果差。Gold support只评分，source-filtered重读是重要信息匹配对照。",
          "code": "Appendix B明确代码与archive当前非公开",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03902v1",
              "location": "§3–5、§6.2–6.5、§8、Appendix A/B"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03894",
      "title": "Proxy Confidence: Auditing Black-Box LLM Agents with a Surrogate's Log-Probabilities",
      "published": "2026-10-02T18:09:00Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03894",
          "title": "Proxy Confidence: Auditing Black-Box LLM Agents with a Surrogate's Log-Probabilities",
          "published": "2026-10-02T18:09:00Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03894v1",
          "location": "§3–7、§9、readout definitions",
          "decision": "accepted",
          "reason": "ProxyConfidence 用独立开放 surrogate 的 teacher-forced/PMI与YES-NO/tool竞争logprob为blackbox actor行动打分，按regime校准方向后融合，并用于audit/修正选择。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "BFCL/xLAM/AppWorld等可判定工具任务，外部事实不可从context判断时无保障。teacher-forcing符号会反转，orientation只能validation确定，不可跨regime复制；actor去标识影响复刻、≤8B scorer未测、多租户latency未测。",
          "code": "正文未定位直接开源URL；公开任务协议明确",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03894v1",
              "location": "§3–7、§9、readout definitions"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03830",
      "title": "Memory-State Critic for Asymmetric Actor-Critic with Application to Vision-Based Pursuit-Evasion",
      "published": "2026-10-02T11:58:56Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03830",
          "title": "Memory-State Critic for Asymmetric Actor-Critic with Application to Vision-Based Pursuit-Evasion",
          "published": "2026-10-02T11:58:56Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03830",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "memory-state critic传统视觉追逃RL，无语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03820",
      "title": "From Requirements to Attack Trees: Grounded LLM Agents for Design-Time Security Review",
      "published": "2026-10-02T03:52:31Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03820",
          "title": "From Requirements to Attack Trees: Grounded LLM Agents for Design-Time Security Review",
          "published": "2026-10-02T03:52:31Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03820v1",
          "location": "§3.2.1–3.2.6 grounding / attack-tree / validation；§4–6 evaluation",
          "decision": "accepted",
          "reason": "从需求与架构图抽取带信任边界的实体图，按目标分派攻击树 worker；联合验证后只重建受影响分支，保留稳定 ID，最多三次。公开 Microsoft IoT Edge 威胁模型可作为参考任务，核心流程可进入安全 Agent 实现队列。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "id": "2610.03820",
          "limitations": "合成 OLB/EHS 各12威胁与开放案例不可混为统一覆盖率；开放案例无完整 gold，一名专家评分无评审者一致性。相同 seed 重复调用不是独立训练种子；建议架构未证明已实现安全，PRD/图仍是可信输入，未验证提示注入防御。未定位原作者代码 URL。",
          "code": "未定位原作者代码；公共参考任务：https://github.com/microsoft/code-with-engineering-playbook/blob/main/docs/security/threat-modelling-example.md",
          "fulltext_review_completed": true,
          "reviewer": "agent_close"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03796",
      "title": "ProsaBuddy: Assisting Mechanized Real-Time Schedulability Analysis with LLM-based Agents",
      "published": "2026-10-01T03:29:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03796",
          "title": "ProsaBuddy: Assisting Mechanized Real-Time Schedulability Analysis with LLM-based Agents",
          "published": "2026-10-01T03:29:09Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.03796",
          "location": "§III-B–E；§IV-A–C；§V",
          "decision": "accepted",
          "reason": "ProsaBuddy primary两阶段lemma decomposition+领域guidelines/skills→隔离subagents，Rocq结果在独立OS进程AST审计：proofbody仅ProofStep/Query，外部只允许trustedimports，库readonly，禁止改theorem/axiom。17lemma成功、去skills12/去decomp14/去paperhints15；完整headline含人工proofhint必须分为hint-assisted不当无gold能力。Audit TCB超kernel未形式验证，难题弱模型省略非全矩阵。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03796v1",
              "location": "§III-B–E；§IV-A–C；§V"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03792",
      "title": "What Do Verifiable Rewards Teach Video-Language Models About Time? A Controlled Multi-Model Study",
      "published": "2026-09-30T21:42:57Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03792",
          "title": "What Do Verifiable Rewards Teach Video-Language Models About Time? A Controlled Multi-Model Study",
          "published": "2026-09-30T21:42:57Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "视频RLVR时间理解控制诊断，由post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03792",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03780",
      "title": "OceanMind: A multi-agent AI system for ocean diagnosis",
      "published": "2026-09-30T06:51:31Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03780",
          "title": "OceanMind: A multi-agent AI system for ocean diagnosis",
          "published": "2026-09-30T06:51:31Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03780v1",
          "location": "Methods: agent architecture、benchmark; Data/Code availability",
          "decision": "accepted",
          "reason": "OceanMind 六角色按 query routing→skill planning→确定性工具编排→证据综合分析海洋状态，缺工具由受限 CodingAgent 补充，数据 artifact 通过引用与 role-specific memory 传递。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "CMEMS公开但部分 in-situ CTD需申请；定量诊断不等于通用Agent提升，gold chain仅评分。first-pass、四门槛通过与step效率分别记录，效率惩罚少步骤也惩罚多步骤。案例单次web响应、默认采样不支持统计优势。",
          "code": "https://github.com/YangLabHKUST/OceanMind ; https://doi.org/10.5281/zenodo.21189249",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03759",
      "title": "BridgeCast: Bridging Ocean Wave Forecasts to Reanalysis via Flow Matching with Exogenous Variables",
      "published": "2026-09-27T00:43:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03759",
          "title": "BridgeCast: Bridging Ocean Wave Forecasts to Reanalysis via Flow Matching with Exogenous Variables",
          "published": "2026-09-27T00:43:54Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "BridgeCast海浪预测偏差流匹配校正，专用科学预测应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03759",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03741",
      "title": "Logit-Aware MIMO AirComp for Distributed Mixture-of-Experts LLM Inference over Wireless Edge Networks",
      "published": "2026-09-22T15:55:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03741",
          "title": "Logit-Aware MIMO AirComp for Distributed Mixture-of-Experts LLM Inference over Wireless Edge Networks",
          "published": "2026-09-22T15:55:56Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "以有限差分估计MoE聚合块对next-token logits敏感度，驱动有功率约束的MIMO AirComp收发器加权优化，可做无线噪声条件下的模型机制诊断。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03741",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03741v1",
              "location": "§III-A–C Eq17/34/35 Algorithm1; §IV-A/C/E"
            },
            {
              "url": "https://arxiv.org/html/2610.03741v1",
              "location": "§III-A–C Eq17/34/35 Algorithm1; §IV-A/C/E",
              "notes": "以有限差分估计MoE聚合块对next-token logits敏感度，驱动有功率约束的MIMO AirComp收发器加权优化，可做无线噪声条件下的模型机制诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.03741v1",
          "locations": [
            "§III-A–C Eq17/34/35 Algorithm1",
            "§IV-A/C/E"
          ],
          "limitations": "无线模拟器、隐藏状态高斯扰动回放和295例ARC闭环是三种不同证据；不能将500例GSM8K回放当真实无线部署。额外forward/CSI/敏感度刷新成本须计入，更多SNR/channel seed和完整基准未建立。",
          "code_status": "no author release located; OpenCompass link is dependency",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03741v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "以有限差分估计MoE聚合块对next-token logits敏感度，驱动有功率约束的MIMO AirComp收发器加权优化，可做无线噪声条件下的模型机制诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03713",
      "title": "What Should World Models Forget? Stratified Retention for Continual Adaptation",
      "published": "2026-10-02T17:58:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03713",
          "title": "What Should World Models Forget? Stratified Retention for Continual Adaptation",
          "published": "2026-10-02T17:58:14Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "世界模型按不变时间尺度分层保留的观点和度量提议，摘要未提供新训练算法实证。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03713",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03702",
      "title": "LESSER: Post-Training Data Selection with Output-Layer Gradients",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03702",
          "title": "LESSER: Post-Training Data Selection with Output-Layer Gradients",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现LESSER；记录为L1输出层梯度/选择诊断，不等于LLM训练benchmark。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03702",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12714：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.03695",
      "title": "Language Models that Play Chess and Explain Their Moves",
      "published": "2026-10-02T17:54:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03695",
          "title": "Language Models that Play Chess and Explain Their Moves",
          "published": "2026-10-02T17:54:22Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Queen 连接冻结 Leela 棋局编码器与 SmolLM3，先四阶段空间/时间课程，再依据 Stockfish 核验的递归子局解释进行七轮自进化 SFT。Lichess/公开棋引擎与持出棋题可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03695",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03695v1",
              "location": "§3.1–3.3/Algorithm1; §4.1–4.3; Appendix A/B",
              "notes": "Queen 连接冻结 Leela 棋局编码器与 SmolLM3，先四阶段空间/时间课程，再依据 Stockfish 核验的递归子局解释进行七轮自进化 SFT。Lichess/公开棋引擎与持出棋题可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03695v1",
          "locations": [
            "§3.1–3.3/Algorithm1; §4.1–4.3; Appendix A/B"
          ],
          "limitations": "Stockfish 是明确的训练与验证 oracle，不是无教师 RSI；语言裁判不能替代合法性/PV 错误检验；应隔离根局面和测试棋题。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Queen 连接冻结 Leela 棋局编码器与 SmolLM3，先四阶段空间/时间课程，再依据 Stockfish 核验的递归子局解释进行七轮自进化 SFT。Lichess/公开棋引擎与持出棋题可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03675",
      "title": "FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution",
      "published": "2026-10-02T17:44:05Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03675",
          "title": "FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution",
          "published": "2026-10-02T17:44:05Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03675",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "仓库已有FrugalEvo；本轮摘要与旧全文+代码审查一致，不重复登记实现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.03665",
      "title": "Pivot-SD: Efficient Self-Distillation for Masked Diffusion Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03665",
          "title": "Pivot-SD: Efficient Self-Distillation for Masked Diffusion Language Models",
          "repository_status": "new",
          "decision": "known",
          "reason": "ledger已全文审查Pivot-SD但尚未实现真实扩散轨迹训练，保留既有unresolved状态。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03665",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12821：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.03634",
      "title": "Credit Where It Matters: Dependency-Aware Policy Optimization for Terminal Agents",
      "published": "2026-10-02T17:24:48Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03634",
          "title": "Credit Where It Matters: Dependency-Aware Policy Optimization for Terminal Agents",
          "published": "2026-10-02T17:24:48Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03634",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "仓库已收录DepGPO command依赖图信用分配，不重复登记。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.03632",
      "title": "World Embedding Benchmark",
      "published": "2026-10-02T17:24:25Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03632",
          "title": "World Embedding Benchmark",
          "published": "2026-10-02T17:24:25Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "World Embedding Benchmark公开物理视频/文本检索、回归、pair判别及新模型评测入口，适合作为embedding物理理解公共评测基础设施。",
          "review_level": "fulltext",
          "kind": "public_evaluation_infrastructure",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03632",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03632v1",
              "location": "§2.1–2.2; §3.1–3.3; 官方README Evaluation"
            },
            {
              "url": "https://arxiv.org/html/2610.03632v1",
              "location": "§2.1–2.2; §3.1–3.3; 官方README Evaluation",
              "notes": "8000案例80物理族，流体700/固体2700/动力1900/光学2700；三任务区分检索对齐与物理量保留；ridge训练内标准化、nested CV，scaling固定100test；适配8k同族不同参数集，2/4/8k配置匹配step。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.03632v1",
          "locations": [
            "§2.1–2.2",
            "§3.1–3.3",
            "官方README Evaluation"
          ],
          "limitations": "同物理族参数迁移非完全新规律OOD；JEPA只做回归与MLLM直接pair不可跨任务排序；contrastive适配改善检索却损伤回归。需冻结family/split manifests，公开test不能evolve反复选参。",
          "code_url": "https://github.com/World-Representation-Lab/World-Embedding-Benchmark",
          "implementation_status": "not_implemented",
          "fulltext_notes": "8000案例80物理族，流体700/固体2700/动力1900/光学2700；三任务区分检索对齐与物理量保留；ridge训练内标准化、nested CV，scaling固定100test；适配8k同族不同参数集，2/4/8k配置匹配step。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03631",
      "title": "NeutronGym: Physics-Graded Neutron Instrument Design for LLM Agents",
      "published": "2026-10-02T17:23:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03631",
          "title": "NeutronGym: Physics-Graded Neutron Instrument Design for LLM Agents",
          "published": "2026-10-02T17:23:52Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03631v1",
          "location": "§3、§4–5、§6、Appendix B/G",
          "decision": "accepted",
          "reason": "NeutronGym 22 MCP tools管理McStas真实仪器、缓存编译后参数仿真；syntax/runtime/structure/science四级reward，程序化族经过无模型规则及固定答案shortcut admission，再GRPO训练。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "核心必须实际McStas仿真不能LLM judge；固定layout参数任务不等于topology设计。T3 unscored、两隐藏参考未公开，9reward failure披露；11→77为一族，第二seed69，其他族部分单seed，非设施实测证明。",
          "code": "https://github.com/ljding94/NeutronGym",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03631v1",
              "location": "§3、§4–5、§6、Appendix B/G"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03620",
      "title": "UniIntervene++: An Adaptive Intervention Agent for Efficient Real-World Reinforcement Learning",
      "published": "2026-10-02T17:18:12Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03620",
          "title": "UniIntervene++: An Adaptive Intervention Agent for Efficient Real-World Reinforcement Learning",
          "published": "2026-10-02T17:18:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03620v1",
          "location": "§III、Eq scheduler、§IV.C",
          "decision": "out_of_scope",
          "reason": "UniIntervene++ 是机器人SERL任务policy加availability-masked SMDP Double-DQN option调度，选择RL/示范轨迹correction/CodePolicy，并用Adaptive RL Probe估计能力。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "五真实机器人任务依赖硬件与示范；scheduler本身经典RL而非通用LLM/Agent学习算法。CodePolicy不足以把整项变成当前文本/软件Agent复现，未来机器人主题可重新评估。",
          "code": "正文未定位开源URL",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03620v1",
              "location": "§III、Eq scheduler、§IV.C"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03617",
      "title": "DEPICT: Scoring Text-to-Image Alignment by Answer Agreement",
      "published": "2026-10-02T17:13:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03617",
          "title": "DEPICT: Scoring Text-to-Image Alignment by Answer Agreement",
          "published": "2026-10-02T17:13:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "DEPICT图文一致性评价指标，非基础模型能力算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03617",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03604",
      "title": "Mastering Atari 2600 Games with Discovered Options",
      "published": "2026-10-02T17:05:46Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03604",
          "title": "Mastering Atari 2600 Games with Discovered Options",
          "published": "2026-10-02T17:05:46Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03604",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Wayfarer Atari深度RL options，无语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03598",
      "title": "When a Correct Reward Is Not Enough: Diagnosing and Guiding PPO in an Analytically Solved Broker-Trader Game",
      "published": "2026-10-02T17:03:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03598",
          "title": "When a Correct Reward Is Not Enough: Diagnosing and Guiding PPO in an Analytically Solved Broker-Trader Game",
          "published": "2026-10-02T17:03:29Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03598",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "连续金融broker PPO诊断，非LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03591",
      "title": "HazardWeaver: Scientific Route Selection for Hazard Analysis Agents",
      "published": "2026-10-02T16:59:19Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03591",
          "title": "HazardWeaver: Scientific Route Selection for Hazard Analysis Agents",
          "published": "2026-10-02T16:59:19Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03591v1",
          "location": "§3.1–3.4 Eq2–8、§4、Appendix A/C/E",
          "decision": "accepted",
          "reason": "HazardWeaver 从文献编译Satisfied/Violated/Unresolved科学条件，以typed capability graph找可执行route，LLM在两者交集选择/修复，独立hidden route/时点/provenance/预算评分。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "141 sealed科学任务及11track，模型/solver必须真实产物；未找到route≠证明无可行route。DCA与native科学误差分开，不把异质数字合一；gold route和cutoff后数据隐藏，领域图注册范围决定可验证性。",
          "code": "https://github.com/LabRAI/HazardWeaver",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03591v1",
              "location": "§3.1–3.4 Eq2–8、§4、Appendix A/C/E"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03585",
      "title": "Threat-Preserving Representation Sensitivity in Agent-Security Benchmarks",
      "published": "2026-10-02T16:55:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03585",
          "title": "Threat-Preserving Representation Sensitivity in Agent-Security Benchmarks",
          "published": "2026-10-02T16:55:50Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03585v1",
          "location": "§III methodology、Tables I–III、limitations",
          "decision": "accepted",
          "reason": "TPRS 固定任务、harm objective、policy、scorer与环境，仅替换tool representation，对ASB/MCPTox/AgentDojo分别量化ASR与benign utility。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "28904runs；ASB A2改任务仅diagnostic，部分名称变化不语义等价，不能归因为威胁词单因素。MCPTox form-matched neutral control解释多数变化；按benchmark独立比较，invoke与committed成功定义不可混。",
          "code": "正文未定位原始URL；三个公共benchmark",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03585v1",
              "location": "§III methodology、Tables I–III、limitations"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03574",
      "title": "HyperBrowseComp: A Multilingual and Multimodal Stress Test for Web-Browsing Agents",
      "published": "2026-10-02T16:48:49Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03574",
          "title": "HyperBrowseComp: A Multilingual and Multimodal Stress Test for Web-Browsing Agents",
          "published": "2026-10-02T16:48:49Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03574v1",
          "location": "§3.1–3.2、§4.1–4.4、Appendix B、Limitations",
          "decision": "accepted",
          "reason": "HyperBrowseComp 423人工多语/多模态证据链短答，以no-internet过滤容易题；统一ReAct25步与provider-native/Exa/OWL三条件，保存实际web trace和短答judge。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "13语stress-test非自然查询分布，live web时点/地域漂移。OWL distinct harness不能只归于model；2400s失败留denominator。encoded dataset deliberate解码，gold/solution trace不能给actor；same-model judge敏感性小但不无偏。",
          "code": "https://HyperBrowseComp.github.io/ （正文称data/code公开）",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03574v1",
              "location": "§3.1–3.2、§4.1–4.4、Appendix B、Limitations"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03567",
      "title": "Writerslogic at the CLEF 2026 SimpleText Track: Multi-Candidate LLM Simplification and Stacked Complexity Spotting",
      "published": "2026-10-02T16:44:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03567",
          "title": "Writerslogic at the CLEF 2026 SimpleText Track: Multi-Candidate LLM Simplification and Stacked Complexity Spotting",
          "published": "2026-10-02T16:44:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CLEF SimpleText系统参赛报告，领域prompt选择与NLI适应。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03567",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.03567",
          "title": "Writerslogic at the CLEF 2026 SimpleText Track: Multi-Candidate LLM Simplification and Stacked Complexity Spotting",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "SimpleText共享任务系统：候选重排与DeBERTa NLI微调，无新LLM策略算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03567",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03529",
      "title": "Divergence controls entropy in distillation",
      "published": "2026-10-02T16:15:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03529",
          "title": "Divergence controls entropy in distillation",
          "published": "2026-10-02T16:15:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "蒸馏散度控制熵的理论/实证分析，后训练track可审，不是新基础架构。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03529",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.03529",
          "title": "Divergence controls entropy in distillation",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "蒸馏divergence对entropy影响的理论与控制实验，未提出独立新训练方法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03529",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03525",
      "title": "Structured Composition of Verifiable Atomic Insights for Table-to-Report Generation",
      "published": "2026-10-02T16:14:18Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03525",
          "title": "Structured Composition of Verifiable Atomic Insights for Table-to-Report Generation",
          "published": "2026-10-02T16:14:18Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03525v1",
          "location": "§IV.A–D、§V、Appendix B",
          "decision": "pending",
          "reason": "ComInsight SQL grammar枚举atomic insights，校准统计filter及SFT+DPO interestingness judge，typed关系graph/Leiden社区与causal paths合成有SQL provenance报告。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "轻量judge依赖1200标注/600偏好对，原始训练包或checkpoint未定位；不能用通用judge/手写分数声称核心复现。Granger+LLM mechanism仅causal hypothesis非干预因果。290calibration/train实例应从bench test去重，top50与阈值validation冻结。",
          "code": "未定位原始训练数据与judge实现URL",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03525v1",
              "location": "§IV.A–D、§V、Appendix B"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03524",
      "title": "From Benchmarks to Production: A Text-to-SQL System for Complex Financial Data",
      "published": "2026-10-02T16:13:40Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03524",
          "title": "From Benchmarks to Production: A Text-to-SQL System for Complex Financial Data",
          "published": "2026-10-02T16:13:40Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03524v1",
          "location": "§3.1–3.6、evaluation、Appendix G、Limitations",
          "decision": "accepted",
          "reason": "FLINT lookup从reference表解析opaque ID，检索专家query bank结构示例，FK-chain schema linking→SQL→执行error reflection；多步骤并行。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "核心金融数据私有，但Appendix G四公共域可复现配置路径。查询bank与评测disjoint，人工规则成本实报；执行成功≠语义正确，AST/output/judge分级评分且read-only SQL。生产部署非量化A/B，不提升为工业搜广推证据。",
          "code": "https://github.com/kensho-technologies/flint",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03524v1",
              "location": "§3.1–3.6、evaluation、Appendix G、Limitations"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03516",
      "title": "XGenAct: Geometry-Enhanced World Action Models through Cross-Task Generation",
      "published": "2026-10-02T16:10:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03516",
          "title": "XGenAct: Geometry-Enhanced World Action Models through Cross-Task Generation",
          "published": "2026-10-02T16:10:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "XGenAct确定性几何codec与共享视频flow任务混合，可作world-action联合训练候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03516",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03516v1",
              "location": "§3.1–3.4 Eq1–6; §4.1–4.4; App B/C/E/G/H; Reproducibility",
              "notes": "ActionImages不改动作表示，Wan2.2TI2V5B只微调DiT、冻VAE；每sample单感知模态+两视角action，depthRGBpath/normallinear/rolepalette。joint/policy/inversedynamics不同mask，predictionpositionsflowloss。16RLBench3960+7ManiSkill1750，fixed4000stepbatch4，heldout任务20rollout。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03516v1",
          "locations": [
            "§3.1–3.4 Eq1–6",
            "§4.1–4.4",
            "App B/C/E/G/H",
            "Reproducibility"
          ],
          "limitations": "几何模态在训练具有sim标签，部署不可用未来GT；futureperception按本策略行动后sim状态评分，≥10mm执行偏差排除须另报coverage。最优menu依task，不能test挑menu；代码权重仅承诺将发布，未核到公开仓库。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "ActionImages不改动作表示，Wan2.2TI2V5B只微调DiT、冻VAE；每sample单感知模态+两视角action，depthRGBpath/normallinear/rolepalette。joint/policy/inversedynamics不同mask，predictionpositionsflowloss。16RLBench3960+7ManiSkill1750，fixed4000stepbatch4，heldout任务20rollout。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03515",
      "title": "Learning from Repaired Reasoning: Root-Cause-Guided On-Policy Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03515",
          "title": "Learning from Repaired Reasoning: Root-Cause-Guided On-Policy Distillation",
          "repository_status": "new",
          "decision": "known",
          "reason": "ledger已审查RC-OPD方法及作者评测仓库；真实repair-continuation与训练仍未实现。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03515",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12819：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.03502",
      "title": "Certified Mechanistic Edits: Behavioral Guarantees for Skill Removal and Preservation",
      "published": "2026-10-02T16:01:23Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03502",
          "title": "Certified Mechanistic Edits: Behavioral Guarantees for Skill Removal and Preservation",
          "published": "2026-10-02T16:01:23Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "小网络连续输入域技能删除形式验证，不属于基础模型规模能力算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03502",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03480",
      "title": "Metropolis-Hastings Dominates Importance Resampling for Policy Composition",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03480",
          "title": "Metropolis-Hastings Dominates Importance Resampling for Policy Composition",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "MH对比importance resampling的policy composition推理采样理论，不更新LM。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03480",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03476",
      "title": "MobiAgent: Dual-Loop Recursive Policy Self-Improvement for Long-Horizon Mobile Manipulation",
      "published": "2026-10-02T15:48:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03476",
          "title": "MobiAgent: Dual-Loop Recursive Policy Self-Improvement for Long-Horizon Mobile Manipulation",
          "published": "2026-10-02T15:48:23Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03476v1",
          "location": "§3.1–3.2、§4、Appendix prompt/case studies",
          "decision": "pending",
          "reason": "MobiAgent 内环VLM receding-horizon planner+shared VLM/skill-specific flow experts+visualcritic重试/重规划；外环分段verify、skill clustering与真实rollout finetune。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "BEHAVIOR-1K/RoboCasa仿真及Astribot硬件、π0.5完整action专家训练不可用文本fixture替代。代码URL存在但政策权重/curated startup数据尚未在正文定位；暂待确认可运行仿真资产。真实动作能力必须实测，不算普通Agent路线图改写即接入。",
          "code": "https://github.com/kaiknower/MobiAgent",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03476v1",
              "location": "§3.1–3.2、§4、Appendix prompt/case studies"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03468",
      "title": "A Vision-Language Model (VLM)-based Pipeline for End-to-End Procedural Modeling of Field-Grown Maize from Point Clouds",
      "published": "2026-10-02T15:41:28Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03468",
          "title": "A Vision-Language Model (VLM)-based Pipeline for End-to-End Procedural Modeling of Field-Grown Maize from Point Clouds",
          "published": "2026-10-02T15:41:28Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "玉米点云程序化重建，专用农业几何流水线。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03468",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03463",
      "title": "Generalization of Transformer-Based Neural Quantum States via In-Context Learning",
      "published": "2026-10-02T15:38:10Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03463",
          "title": "Generalization of Transformer-Based Neural Quantum States via In-Context Learning",
          "published": "2026-10-02T15:38:10Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Transformer量子态ICL泛化理论，非当前基础模型范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03463",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03454",
      "title": "Measure Less, Know More: Self-Supervised Test-Time Feature Acquisition",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03454",
          "title": "Measure Less, Know More: Self-Supervised Test-Time Feature Acquisition",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "RL用于测试时模态获取策略，目标为任意foundation表示，非LLM后训练机制。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03454",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03448",
      "title": "Passing the Test You Trained On: Re-evaluating Prompt-Injection Detectors for LLM Agents",
      "published": "2026-10-02T15:30:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03448",
          "title": "Passing the Test You Trained On: Re-evaluating Prompt-Injection Detectors for LLM Agents",
          "published": "2026-10-02T15:30:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03448v1",
          "location": "§4.1–4.4、§5、§6、Appendix C",
          "decision": "accepted",
          "reason": "重评15 injection detectors：差分replay构造clean/injected tool输出，按default阈值/lowFPR测TPR，审训练重叠，并用task-aware yes/no logprob judge诊断缺失任务语境。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "低1%FPR阈值在评测benign集选择仅乐观上界，部署须独立calibration；gold toolcall只为固定数据生成不供受测agent。合成YAML/JSON输出与真实web差异、固定template非adaptive attack，去重同权重InjecGuard/PIGuard。",
          "code": "https://github.com/lzwhehe/benign-instruction-bench",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03448v1",
              "location": "§4.1–4.4、§5、§6、Appendix C"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03445",
      "title": "Corrupted but Correct: Why Vision-Language Models Lie to Themselves Internally",
      "published": "2026-10-02T15:27:28Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03445",
          "title": "Corrupted but Correct: Why Vision-Language Models Lie to Themselves Internally",
          "published": "2026-10-02T15:27:28Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "VLM攻击训练/推理落差的机制诊断，无新的能力方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03445",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03421",
      "title": "CLIMB: Confidence-Guided Complementary Evidence for Multimodal Retrieval-Augmented Generation",
      "published": "2026-10-02T15:09:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03421",
          "title": "CLIMB: Confidence-Guided Complementary Evidence for Multimodal Retrieval-Augmented Generation",
          "published": "2026-10-02T15:09:06Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "CLIMB固定MMR证据池、R/E/C critic、至多3轮pool内重排且置信严格增加才接受；方法有价值，但视觉critic与正文指定text-only Llama3.1-8B的具体接口未交代且无作者实现可核。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03421",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03421v1",
              "location": "§3.2–3.4 Eq1–4; §4 implementation; Limitations; Appendix prompts",
              "notes": "CLIMB固定MMR证据池、R/E/C critic、至多3轮pool内重排且置信严格增加才接受；方法有价值，但视觉critic与正文指定text-only Llama3.1-8B的具体接口未交代且无作者实现可核。"
            }
          ],
          "source": "https://arxiv.org/html/2610.03421v1",
          "locations": [
            "§3.2–3.4 Eq1–4",
            "§4 implementation",
            "Limitations",
            "Appendix prompts"
          ],
          "limitations": "置信是相对自评分而非校准正确概率；须单独计critic/facet多次调用预算，不能拿多轮对单次检索直接声称效率。InfoSeek validation作为报告集须另划开发集，冻结split；明确视觉接口后再实现。",
          "code_status": "not_found_in_examined_paper",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.03421v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "CLIMB固定MMR证据池、R/E/C critic、至多3轮pool内重排且置信严格增加才接受；方法有价值，但视觉critic与正文指定text-only Llama3.1-8B的具体接口未交代且无作者实现可核。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03389",
      "title": "From Patching to Pruning Visual Computation in Vision Language Models",
      "published": "2026-10-02T14:37:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03389",
          "title": "From Patching to Pruning Visual Computation in Vision Language Models",
          "published": "2026-10-02T14:37:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "P2P 用视觉投影缓存均值替换分析，前缀/后缀敏感度扫描选择安全层，真实跳过视觉 attention/MLP，可结合 patched-graph LoRA。公开七基准与独立 proxy/validation/test 可复现。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03389",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03389v1",
              "location": "§3; §4.1–4.5; §5.1; Appendix A.6",
              "notes": "P2P 用视觉投影缓存均值替换分析，前缀/后缀敏感度扫描选择安全层，真实跳过视觉 attention/MLP，可结合 patched-graph LoRA。公开七基准与独立 proxy/validation/test 可复现。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03389v1",
          "locations": [
            "§3; §4.1–4.5; §5.1; Appendix A.6"
          ],
          "limitations": "必须真实绕过算子才可声称加速，不能 dense 计算后替换；保留两个连续失效边界与 3% 容忍协议。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "P2P 用视觉投影缓存均值替换分析，前缀/后缀敏感度扫描选择安全层，真实跳过视觉 attention/MLP，可结合 patched-graph LoRA。公开七基准与独立 proxy/validation/test 可复现。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03369",
      "title": "Mixture-of-Experts for Cryptocurrency Order Execution: Training Stability, Tail Risk, and Failure Modes",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03369",
          "title": "Mixture-of-Experts for Cryptocurrency Order Execution: Training Stability, Tail Risk, and Failure Modes",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "加密货币订单DDQL/MoE多seed控制研究，无语言模型训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03369",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03361",
      "title": "Follow the Winners: Conservative Policy Improvement with the Cross-Entropy Method for Critic-Free RFT",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03361",
          "title": "Follow the Winners: Conservative Policy Improvement with the Cross-Entropy Method for Critic-Free RFT",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现FTW；L1 FIFO/top-K/KL CPU机制诊断，尚无Search-R1/Sokoban训练证据。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03361",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12745：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.03361",
          "title": "Follow the Winners: Conservative Policy Improvement with the Cross-Entropy Method for Critic-Free RFT",
          "published": "2026-10-02T14:24:06Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03361",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "FTW已收录，critic-free cross-entropy replay ordinal filter。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.03356",
      "title": "ReFract: Benchmarking Perspective Awareness in Language Model Agents with Text World Models",
      "published": "2026-10-02T14:21:26Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03356",
          "title": "ReFract: Benchmarking Perspective Awareness in Language Model Agents with Text World Models",
          "published": "2026-10-02T14:21:26Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03356v1",
          "location": "§3.1–3.3、§4–5、Appendix A/F",
          "decision": "pending",
          "reason": "ReFract 用专家domain Pred/Cap/Know及consume/produce关系构造工业maintenance text worlds；区分authority与knowledge，QTS/FTS测试perspective-aware action可执行性。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "150条expert transcript task与domain/goal完整公开包未定位；不能把手写通关路径伪装为原benchmark。Gold goal仅judge，工具data dependency/role gate每步检查。小样本五工业角色非general agent，也非真实工业效益。",
          "code": "正文未定位数据/代码仓库URL",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03356v1",
              "location": "§3.1–3.3、§4–5、Appendix A/F"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03324",
      "title": "To Jev or Not? Evaluating the Accuracy and Efficiency of Structured Decision Models for Hate-Speech Moderation",
      "published": "2026-10-02T13:59:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03324",
          "title": "To Jev or Not? Evaluating the Accuracy and Efficiency of Structured Decision Models for Hate-Speech Moderation",
          "published": "2026-10-02T13:59:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "HateDecide不是新JEV训练算法，但其定义依从、去重分组与阈值校准控制可作为决策评测基础设施；正文列出完整prompt/数据协议，未找到官方公开可执行代码或冻结评测artifact，基础设施接入资格待公开材料核实。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "official_url": "https://arxiv.org/html/2610.03324v1",
          "locations": [
            "§3.1–3.4",
            "§5",
            "Appendix prompts",
            "Appendix threshold-tuned control/Table11"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03324",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03324v1",
              "location": "§3.1–3.4; §5; Appendix prompts; Appendix threshold-tuned control/Table11"
            },
            {
              "url": "https://arxiv.org/html/2610.03324v1",
              "location": "§3.1–3.4; §5; Appendix prompts; Appendix threshold-tuned control/Table11",
              "notes": "既有模型推理工作流对照，分解token成本增加64–139%；无新的可训练decision-model机制。"
            }
          ],
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "limitations": "评测四个已有英文数据集且预训练曝光未知；必须保留Dynamic跨split扰动分组去重，阈值只在200validation题选择，不得使用测试gold供模型读取。",
          "fulltext_notes": "既有模型推理工作流对照，分解token成本增加64–139%；无新的可训练decision-model机制。",
          "review_status": "reviewed_deferred"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03315",
      "title": "Lightweight, Rubric-Guided Trajectory Evaluation for Production AI Agents",
      "published": "2026-10-02T13:51:06Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03315",
          "title": "Lightweight, Rubric-Guided Trajectory Evaluation for Production AI Agents",
          "published": "2026-10-02T13:51:06Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03315v1",
          "location": "§II.A–D、Eq1–3、Algorithm1、evaluation",
          "decision": "accepted",
          "reason": "LiteTrajEval 离线domain rule profiles，在线规范化trace/弱failure hints，格式compaction+重复引用、tier waterfall预算与MMR证据选取，单rubric judge输出故障诊断。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "公共Magentic-One/τ-retail轨迹；规则与预算仅dev构建，human failure annotations仅评分。字符budget非token数；hardtruncate保留路径可能损失证据。成本减少不等于task能力提升，弱heuristic hints不是groundtruth rootcause。",
          "code": "正文未定位原始代码URL；公开轨迹任务",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03315v1",
              "location": "§II.A–D、Eq1–3、Algorithm1、evaluation"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03289",
      "title": "Architecture-Dependent Fusion Pathways in MLLMs",
      "published": "2026-10-02T13:32:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03289",
          "title": "Architecture-Dependent Fusion Pathways in MLLMs",
          "published": "2026-10-02T13:32:45Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MLLM跨层融合表征诊断，未提出新能力算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03289",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03252",
      "title": "COSMI: COmpositional Synthesis of Multi-object Interactions",
      "published": "2026-10-02T12:59:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03252",
          "title": "COSMI: COmpositional Synthesis of Multi-object Interactions",
          "published": "2026-10-02T12:59:59Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "COSMI 将带接触的单物体人体动作组合、镜像和几何筛选，训练共享物体槽的文本条件扩散模型，按未见物体和五种未见组合评测。定义算法可读，但特定组合数据与模型仅承诺发布。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03252",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03252v1",
              "location": "§3–5; Appendix C/D",
              "notes": "COSMI 将带接触的单物体人体动作组合、镜像和几何筛选，训练共享物体槽的文本条件扩散模型，按未见物体和五种未见组合评测。定义算法可读，但特定组合数据与模型仅承诺发布。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.03252v1",
          "locations": [
            "§3–5; Appendix C/D"
          ],
          "limitations": "审后延期：222k 组合序列、发布流水线与检查点尚未核验公开；不能用随意拼接或 toy 动作替代官方接触筛选与组合隔离；源人体数据受许可限制。",
          "code_url": "https://ptrvilya.github.io/cosmi/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "审后延期：222k 组合序列、发布流水线与检查点尚未核验公开；不能用随意拼接或 toy 动作替代官方接触筛选与组合隔离；源人体数据受许可限制。",
          "upstream_access_verified": false,
          "fulltext_notes": "COSMI 将带接触的单物体人体动作组合、镜像和几何筛选，训练共享物体槽的文本条件扩散模型，按未见物体和五种未见组合评测。定义算法可读，但特定组合数据与模型仅承诺发布。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03226",
      "title": "D2K-Bench: Can LLM Agents Turn Expert Designs into Efficient GPU Kernels?",
      "published": "2026-10-02T12:42:12Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03226",
          "title": "D2K-Bench: Can LLM Agents Turn Expert Designs into Efficient GPU Kernels?",
          "published": "2026-10-02T12:42:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03226v1",
          "location": "§2.1–2.3、§3.1–3.3、§4、Appendix evaluator",
          "decision": "accepted",
          "reason": "D2K-Bench 配对26task/85workload有无专家L1–3设计guidance，agent iterative Triton编辑/compile/profile/submit；数值与stateupdate、implement validity全通过才按geomean speedup选候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "B200实测原结果不能移植为A100性能；本项目若实现CUDA必须A100/A30 receipt。专家source隐藏、source judge隐藏timing，指导不含tuning参数。生成期间workload feedback不是heldout泛化；objective score与LLM design rubric分开。",
          "code": "https://github.com/QwenLM/D2K-Bench",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03226v1",
              "location": "§2.1–2.3、§3.1–3.3、§4、Appendix evaluator"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03223",
      "title": "AdaStep: Adaptive Step Credit Weighting for Agentic Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03223",
          "title": "AdaStep: Adaptive Step Credit Weighting for Agentic Reinforcement Learning",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现AdaStep；L1合成returns方差算子，没有agent policy训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03223",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12746：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.03223",
          "title": "AdaStep: Adaptive Step Credit Weighting for Agentic Reinforcement Learning",
          "published": "2026-10-02T12:38:53Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03223",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "AdaStep已收录，step credit信号/方差shrinkage。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.03220",
      "title": "Evolving Hybrid Quantum-Classical Architectures for Image Classification",
      "published": "2026-10-02T12:37:10Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03220",
          "title": "Evolving Hybrid Quantum-Classical Architectures for Image Classification",
          "published": "2026-10-02T12:37:10Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "量子经典电路架构搜索图像分类，不属当前基础模型范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03220",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03215",
      "title": "StanceEval 2026: The Second Stance Detection Shared Task",
      "published": "2026-10-02T12:32:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03215",
          "title": "StanceEval 2026: The Second Stance Detection Shared Task",
          "published": "2026-10-02T12:32:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "StanceEval阿语立场检测共享任务概览。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03215",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03213",
      "title": "Toward SLM-based agentic task-tool intent matching",
      "published": "2026-10-02T12:31:01Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03213",
          "title": "Toward SLM-based agentic task-tool intent matching",
          "published": "2026-10-02T12:31:01Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03213v1",
          "location": "§2.1–2.3、§3、§4",
          "decision": "accepted",
          "reason": "Gemma task-tool relevance 以Base→GEPA→LoRA SFT→DrGRPO curriculum，deterministic格式/标签/长度reward，候选逐工具Boolean判断。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "12 MCP servers分server-disjoint；selection validation F1，test冻结。parse失败计E2E失败，成功parse分类指标另报。数据从tool description合成且curator筛选，不证明真实多工具执行能力；95%为人工门槛，非安全保障。",
          "code": "https://github.com/outshift-open/outshift-casa-slm",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03213v1",
              "location": "§2.1–2.3、§3、§4"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03199",
      "title": "Predicting and Repairing Merge Collapse in Large Language Models",
      "published": "2026-10-02T12:11:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03199",
          "title": "Predicting and Repairing Merge Collapse in Large Language Models",
          "published": "2026-10-02T12:11:43Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Prism对norm缩放后平均taskvector按跨专家方差softthreshold，并用cancellation/dispersion门避免删独有知识；确定性数据自由repair定义完整。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03199",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03199v1",
              "location": "§3.1–3.3 Eq1–3; §4.1–4.3 Eq4–5; §5.1–5.5/Table4; §6"
            },
            {
              "url": "https://arxiv.org/html/2610.03199v1",
              "location": "§3.1–3.3 Eq1–3; §4.1–4.3 Eq4–5; §5.1–5.5/Table4; §6",
              "notes": "默认只MLP，attention保持base；平均后再乘c=1/K，rho<.1回退TA；22merge中7破坏15无害，14前瞻预测12对。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.03199v1",
          "locations": [
            "§3.1–3.3 Eq1–3",
            "§4.1–4.3 Eq4–5",
            "§5.1–5.5/Table4",
            "§6"
          ],
          "limitations": "通用阈值1.9e-3只在考察family规模，不能当架构不变量；repair常回base水平不代表融合全部能力；安全未评。须保留显式系数双缩放与normmatched控制，不能误当standard平均。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "默认只MLP，attention保持base；平均后再乘c=1/K，rho<.1回退TA；22merge中7破坏15无害，14前瞻预测12对。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03198",
      "title": "KV$^2$: A Self-Refining KV Cache",
      "published": "2026-10-02T12:11:35Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03198",
          "title": "KV$^2$: A Self-Refining KV Cache",
          "published": "2026-10-02T12:11:35Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "KV²用KeyDiff跨层/头均值选chunk内稀疏重构query，append在完整cache后做真实因果前向；局部max-attention评分合成全局保留，也可迭代替换proxy。已在原队列，补全证据不重复计新文。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03198",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03198v1",
              "location": "§3 Eq1–4; §4.1; §5.1–5.4; Limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.03198v1",
              "location": "§3 Eq1–4; §4.1; §5.1–5.4; Limitations",
              "notes": "KV²用KeyDiff跨层/头均值选chunk内稀疏重构query，append在完整cache后做真实因果前向；局部max-attention评分合成全局保留，也可迭代替换proxy。已在原队列，补全证据不重复计新文。"
            }
          ],
          "source": "https://arxiv.org/html/2610.03198v1",
          "locations": [
            "§3 Eq1–4",
            "§4.1",
            "§5.1–5.4",
            "Limitations"
          ],
          "limitations": "重构query位置是context之后，不是原位置；global-conditioning/local-scoring需保留。作者kvpress实现仅mask并未物理compact，因此只证压缩阶段runtime/memory，不能宣称decode缓存节省。多轮refinement可能更慢，完整evolve未接入。",
          "code_url": "https://anonymous.4open.science/r/KVsquared-0B97/",
          "code_status": "official anonymous source declared; preexisting review queue",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03198v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "KV²用KeyDiff跨层/头均值选chunk内稀疏重构query，append在完整cache后做真实因果前向；局部max-attention评分合成全局保留，也可迭代替换proxy。已在原队列，补全证据不重复计新文。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03195",
      "title": "Source Preference in the Wild: How LLM Agents Favor Items by Source, and How to Reduce It",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03195",
          "title": "Source Preference in the Wild: How LLM Agents Favor Items by Source, and How to Reduce It",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "请求满足度匹配+循环Latin-square位置控制+BT-Davidson source preference形成独立Agent诊断协议；URL显隐/置换实验。正文Reproducibility明确code/dataset待publication发布，当前不视为公共执行入口，转Agent待跟进。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03195v1",
              "location": "§2–3；§5.1–5.2；Reproducibility statement"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "搜索代理来源偏好及提示消偏的测量研究，没有新的训练优化器。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "请求满足度匹配+循环Latin-square位置控制+BT-Davidson source preference形成独立Agent诊断协议；URL显隐/置换实验。正文Reproducibility明确code/dataset待publication发布，当前不视为公共执行入口，转Agent待跟进。"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.03195",
          "title": "Source Preference in the Wild: How LLM Agents Favor Items by Source, and How to Reduce It",
          "published": "2026-10-02T12:10:03Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03195",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "搜索来源偏好因果操作与prompt干预经验研究，非独立新算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03193",
      "title": "Bridging Research and Practice: A Systematic Evaluation of Generalist and Dermatology-Specific Models in Clinical Skin Lesion Classification",
      "published": "2026-10-02T12:09:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03193",
          "title": "Bridging Research and Practice: A Systematic Evaluation of Generalist and Dermatology-Specific Models in Clinical Skin Lesion Classification",
          "published": "2026-10-02T12:09:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "皮肤病模型的系统临床benchmark，无新方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03193",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03190",
      "title": "Not Until the Evidence Says So: Teaching LLM Investigators When to Close a Case",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03190",
          "title": "Not Until the Evidence Says So: Teaching LLM Investigators When to Close a Case",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Nautil提供证据索引/request工具、close/open任务、来源内balanced accuracy及删关键证据对照；官方MIT代码/数据/模型公开。RLVR checkpoint选择用过64测试中22条，必须改验证集隔离，不能照搬其headline为无泄漏泛化。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03190v1",
              "location": "§3–6；§7；官方README Main results"
            },
            {
              "url": "https://github.com/etigerstudio/Nautil",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "Nautil数据与closure行为评测，训练采用SFT与现成closure reward RL，主要贡献不是新算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03187",
      "title": "Lightweight and Resource-Efficient Perception for Robotic Guide Dogs",
      "published": "2026-10-02T12:01:55Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03187",
          "title": "Lightweight and Resource-Efficient Perception for Robotic Guide Dogs",
          "published": "2026-10-02T12:01:55Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "机器导盲犬360相机/LiDAR感知系统，专用应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03187",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03185",
      "title": "Gains and Collapse in On-Policy Distillation:A Reinforcement Learning Perspective",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03185",
          "title": "Gains and Collapse in On-Policy Distillation:A Reinforcement Learning Perspective",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "OPD收益/崩溃机制分析，缓解为截断响应loss mask和既有SFT warmup，保持原优化配方；不是独立新核心算法，但是ResOPD等复现的重要风险证据。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03185",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.03185v1",
              "location": "§2.3；§5.2/Table3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03153",
      "title": "EvoRiskBench: An Evolving Benchmark for Runtime Security Risks in Workspace Agents",
      "published": "2026-10-02T11:22:36Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03153",
          "title": "EvoRiskBench: An Evolving Benchmark for Runtime Security Risks in Workspace Agents",
          "published": "2026-10-02T11:22:36Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03153v1",
          "location": "§3.1–3.3、§4、§5、artifact statement",
          "decision": "pending",
          "reason": "EvoRiskBench 9entry×5effect的执行case构建/refinement，sandbox agent与外部系统event/state共同佐证技术risk，冻结450case跨9model-harness。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "cases/platform明确要artifact safety后才释放；当前无法复现完整450。合成business/mockcredentials仅sandbox，ASR与TSR并列；judge严重度≠真实系统危害，不拿trace文字代替side-effect证据。",
          "code": "正文称待安全与复现检查后公开，无仓库URL",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03153v1",
              "location": "§3.1–3.3、§4、§5、artifact statement"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03141",
      "title": "Behavior Pack Optimization for Video MLLM Post-Training",
      "published": "2026-10-02T11:06:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03141",
          "title": "Behavior Pack Optimization for Video MLLM Post-Training",
          "published": "2026-10-02T11:06:56Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "BPO视频MLLM反事实行为包RL，由post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03141",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03136",
      "title": "Investigating the Role of Reasoning-Language Alignment in Monolingual Retrieval-Augmented Generation",
      "published": "2026-10-02T11:02:04Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03136",
          "title": "Investigating the Role of Reasoning-Language Alignment in Monolingual Retrieval-Augmented Generation",
          "published": "2026-10-02T11:02:04Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03136",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "德语RAG推理语言对照，非新核心算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03135",
      "title": "Page-EntroKV: Hardware-Aligned, Entropy-Weighted KV-Cache Eviction under Grouped-Query Attention",
      "published": "2026-10-02T11:01:39Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03135",
          "title": "Page-EntroKV: Hardware-Aligned, Entropy-Weighted KV-Cache Eviction under Grouped-Query Attention",
          "published": "2026-10-02T11:01:39Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "Page-EntroKV用去sink的Renyi-2熵加权GQA组内注意力，再按物理页分配预算，机制可辨认，但公开证据与正文关键系统结论不一致，暂不列成熟实现候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03135",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03135v1",
              "location": "§4.1–4.2; §7–8; official README evidence scope"
            },
            {
              "url": "https://arxiv.org/html/2610.03135v1",
              "location": "§4.1–4.2; §7–8; official README evidence scope",
              "notes": "Page-EntroKV用去sink的Renyi-2熵加权GQA组内注意力，再按物理页分配预算，机制可辨认，但公开证据与正文关键系统结论不一致，暂不列成熟实现候选。"
            }
          ],
          "source": "https://arxiv.org/html/2610.03135v1",
          "locations": [
            "§4.1–4.2",
            "§7–8",
            "official README evidence scope"
          ],
          "limitations": "官方仓库称结构N180全部jaccard0/UOR1，不支持4.75倍bloat；sink只有layer0十头；NIAH只有958/1474/1990长度；LongBench仅4完成、11空行且无dense基线；无8/32/64页大小扫描和serving表。需对齐论文版本与原始证据后再评估，不把缓存mask诊断当端到端收益。",
          "code_url": "https://github.com/bruce12-glitch/PageEntro-KV",
          "code_status": "core code accessible; README explicitly limits published evidence",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.03135v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Page-EntroKV用去sink的Renyi-2熵加权GQA组内注意力，再按物理页分配预算，机制可辨认，但公开证据与正文关键系统结论不一致，暂不列成熟实现候选。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03123",
      "title": "Foresight: planning future perception in streaming VLMs without retraining",
      "published": "2026-10-02T10:44:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03123",
          "title": "Foresight: planning future perception in streaming VLMs without retraining",
          "published": "2026-10-02T10:44:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Foresight 将共享冻结模型分为写入视频的 Ingest 与只读快照的 Think；规划采样率、保留类别、压缩和响应时间。StreamingBench/OVO 允许真实因果流式验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03123",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03123v1",
              "location": "§3.1–3.2/Algorithm1; §4.1; Appendix H/Table10",
              "notes": "Foresight 将共享冻结模型分为写入视频的 Ingest 与只读快照的 Think；规划采样率、保留类别、压缩和响应时间。StreamingBench/OVO 允许真实因果流式验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03123v1",
          "locations": [
            "§3.1–3.2/Algorithm1; §4.1; Appendix H/Table10"
          ],
          "limitations": "匿名补充实现/完整 harness 尚未公开核验；必须只读当前视频前缀、计入异步墙钟时间；20% 校准与 80% 持出不能混用。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Foresight 将共享冻结模型分为写入视频的 Ingest 与只读快照的 Think；规划采样率、保留类别、压缩和响应时间。StreamingBench/OVO 允许真实因果流式验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03112",
      "title": "Building Interpretable Feature Representations for Resume-Vacancy Matching by Distilling Production LLM Signals",
      "published": "2026-10-02T10:30:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03112",
          "title": "Building Interpretable Feature Representations for Resume-Vacancy Matching by Distilling Production LLM Signals",
          "published": "2026-10-02T10:30:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "招聘匹配蒸馏上线系统，属recommendation工业应用，非foundation；生产反馈一致率不是AB。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03112",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03109",
      "title": "Emergent Structure in the Marginal Attention Space of Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03109",
          "title": "Emergent Structure in the Marginal Attention Space of Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "marginal attention结构与KV eviction预算，属于推理/基础模型。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03109",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03102",
      "title": "Ask, Relax, or Act? Evaluating Actionable Indeterminacy in LLM Preference Reasoning",
      "published": "2026-10-02T10:22:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03102",
          "title": "Ask, Relax, or Act? Evaluating Actionable Indeterminacy in LLM Preference Reasoning",
          "published": "2026-10-02T10:22:42Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03102v1",
          "location": "§2.1–2.2、§3–5、Appendix M/O",
          "decision": "accepted",
          "reason": "Ask/Relax/Act 以admissible preferences/objectives下accepted action交集判定可行动/需问，infeasible则最小允许repair；四finite结构exact solver生成matched intervention pairs。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "4320prompts/36cells，exactchecker而非LLM judge；gold completions/solutions隐藏。单source不解决多源priority。BareJSON/Markdown拒绝与reasoning失败分开，FC与decision/IFC分报；工具调用不是必需且不能声称现实决策效果。",
          "code": "正文无直接仓库URL；Appendix M/O含builder与checker规则",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03102v1",
              "location": "§2.1–2.2、§3–5、Appendix M/O"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03099",
      "title": "Beyond Single Videos: Benchmarking and Active Evidence Seeking for E-Commerce Cross-Video Reasoning",
      "published": "2026-10-02T10:19:49Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03099",
          "title": "Beyond Single Videos: Benchmarking and Active Evidence Seeking for E-Commerce Cross-Video Reasoning",
          "published": "2026-10-02T10:19:49Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03099v1",
          "location": "§3、§4.1–4.3、§5、Appendix B",
          "decision": "accepted",
          "reason": "AdsCVR/AdSeek 多视频frame/audio选择逐轮证据，GRPO correctness+.1format，过滤no-tool/zero-var group并最多三次resample；teacher诊断missing evidence/reasoning→定向rectify→assistant-mask SFT。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "训练gold可reward/teacher使用，测试actor只metadata与真实perception。需要原视频和真实Qwen-VL/ASR工具，fixture文字不是多模态能力。Teacher成功条件筛选有额外成本，corrected append仅train；73.57与混合源74.30分开。",
          "code": "正文未定位直接仓库URL；AdsCVR原始视频可用性须实施前核实",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03099v1",
              "location": "§3、§4.1–4.3、§5、Appendix B"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03098",
      "title": "Predictor-Guided Latent Space Codon Optimization for Maximizing Protein Expression",
      "published": "2026-10-02T10:18:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03098",
          "title": "Predictor-Guided Latent Space Codon Optimization for Maximizing Protein Expression",
          "published": "2026-10-02T10:18:50Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "mRNA密码子潜空间优化专用生命科学设计。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03098",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03089",
      "title": "Securing Computer-Use Agents Against Branch Steering Attacks",
      "published": "2026-10-02T10:08:39Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03089",
          "title": "Securing Computer-Use Agents Against Branch Steering Attacks",
          "published": "2026-10-02T10:08:39Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03089v1",
          "location": "§3–5、Appendix A/D/E/F",
          "decision": "accepted",
          "reason": "COBRA trusted-input预规划并承诺程序，BRH以先定branch/field约束解析观察，HTTP/MCP代理强制operation、参数、approved schema hash；fused5plans保留合法alternative。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "恶意观察仍能选合法branch但不能扩权限；无approved sitemap仅domain allowlist弱约束，非HTTP GUI effect在边界外。真实browser/proxy必须运行；OSWorld matched86与MCP全套不混，multiple-attempt预算与单plan区分。",
          "code": "https://github.com/giuliozing/securing-cuas-against-branch-steering",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03089v1",
              "location": "§3–5、Appendix A/D/E/F"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03084",
      "title": "NegT2IBench: When Negation Changes the Picture. A Polarity Benchmark for Text-to-Image Models",
      "published": "2026-10-02T10:03:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03084",
          "title": "NegT2IBench: When Negation Changes the Picture. A Polarity Benchmark for Text-to-Image Models",
          "published": "2026-10-02T10:03:56Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "NegT2IBench以六类4800个正负属性/关系prompt和对象存在性先决条件，用detector/SAM/depth/SigLIP2逐条判分；可补图像生成的否定遵循评估。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03084",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03084v1",
              "location": "§3.1; §4 human validation; §5; Appendix C.1/C.3/E.2",
              "notes": "NegT2IBench以六类4800个正负属性/关系prompt和对象存在性先决条件，用detector/SAM/depth/SigLIP2逐条判分；可补图像生成的否定遵循评估。"
            }
          ],
          "source": "https://arxiv.org/html/2610.03084v1",
          "locations": [
            "§3.1",
            "§4 human validation",
            "§5",
            "Appendix C.1/C.3/E.2"
          ],
          "limitations": "模糊dead-zone时正关系失败、负关系通过，是协议选择不能当严格逻辑真值。image accuracy与4图任一成功prompt accuracy分开；140明确人评图参与阈值比较需另留独立评估。六类等权不是所有模型普适视觉能力。",
          "code_url": "https://github.com/Fatairy/NegT2IBench",
          "code_status": "official code linked; not executed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03084v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "NegT2IBench以六类4800个正负属性/关系prompt和对象存在性先决条件，用detector/SAM/depth/SigLIP2逐条判分；可补图像生成的否定遵循评估。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03063",
      "title": "HARPO: Hallucination-Aware Reinforcement Learning for Faithful and Creative Language Generation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.03063",
          "title": "HARPO: Hallucination-Aware Reinforcement Learning for Faithful and Creative Language Generation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "HARPO训练hallucination-span reward model，只有预测零幻觉才激活写作reward，并配创作到忠实cosine课程；属层级多目标reward机制，不是新的GRPO；gate不保证真实无幻觉。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03063",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.03063v1",
              "location": "§2.2 Eq.6–7；§3–4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03057",
      "title": "When Does Synthetic Relational Data Teach Models to Use Relations? Tracing Predictive Structure from Pretraining Data to Model Behavior",
      "published": "2026-10-02T09:37:48Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03057",
          "title": "When Does Synthetic Relational Data Teach Models to Use Relations? Tracing Predictive Structure from Pretraining Data to Model Behavior",
          "published": "2026-10-02T09:37:48Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "四种合成关系数据对模型行为的归因诊断，未提出新核心训练方法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03057",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03056",
      "title": "MOF-VERIFY: A Failure-Aware Agentic Harness for MOF Hypothesis Verification",
      "published": "2026-10-02T09:36:55Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03056",
          "title": "MOF-VERIFY: A Failure-Aware Agentic Harness for MOF Hypothesis Verification",
          "published": "2026-10-02T09:36:55Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03056v1",
          "location": "§3、§4.1–4.2、Appendix A.5",
          "decision": "pending",
          "reason": "MOF-Verify identity/CIF digest grounded lookup、verified local DOI全文抽取、evidence sufficiency与deterministic verdict routing；需计算时真实SevenNet执行含精度/seed/convergence。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "公开benchmark存在，但trusted实验CIF/CSD可能许可限制、expert-local全文与curated alias corpus尚未定位完整释放；T4不能用返回固定property替代MLIP。oracle证据是上界非检索能力，Yes/Re-run/Human-review与文学Yes/No/Uncertain分开。",
          "code": "https://github.com/IMMS-Ewha/MOF-Verify-Benchmark （dataset；核心完整资产待核）",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03056v1",
              "location": "§3、§4.1–4.2、Appendix A.5"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03055",
      "title": "hacktrace: behavior-supervised detection of reward hacking during code generation",
      "published": "2026-10-02T09:35:59Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03055",
          "title": "hacktrace: behavior-supervised detection of reward hacking during code generation",
          "published": "2026-10-02T09:35:59Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03055v1",
          "location": "§3.1–3.4、§4.4、§5、release statement",
          "decision": "pending",
          "reason": "HackTrace 按problem-disjoint act/outcome labels监督generation residual读数，problem-group CV选88linear readouts与layers18/24 top8 MultiMax，结合final AST特征；GRPO penalty抑制shortcut。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "公开URL是https://github.com/XXXX/HackTrace占位，heads/activation/GRPOlabels声明后续加，不能视已可用。隐藏oracle只评价；partialprefix预测completedlabel不是当前已发生危害。可编辑test阳性98.2%修改test，强penalty与honest-correct/成本同报。",
          "code": "https://github.com/XXXX/HackTrace （占位不可当已发布）",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03055v1",
              "location": "§3.1–3.4、§4.4、§5、release statement"
            }
          ]
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03039",
      "title": "HyperThink: Text-to-Parameter Hypernetworks for Efficient Reasoning",
      "published": "2026-10-02T09:19:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03039",
          "title": "HyperThink: Text-to-Parameter Hypernetworks for Efficient Reasoning",
          "published": "2026-10-02T09:19:59Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "HyperThink以查询生成冻结LLM层bias并经VQ约束，保留独立算法候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03039",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03039v1",
              "location": "§3; §4 Tables1–2/Fig4; App C; Reproducibility Statement"
            },
            {
              "url": "https://arxiv.org/html/2610.03039v1",
              "location": "§3; §4 Tables1–2/Fig4; App C; Reproducibility Statement",
              "notes": "冻结textencoder+3block128 MM-DiT hypernetwork，256码/512latent VQ+STE，last8 Qwen q/v/o/up/gate/down生成bias。只正确teacher response训练CE，不向inference给CoT/gold；λVQ100/usageKL.1。GSM8K训练/MATH500 OOD，5samplesAcc/Pass5，H200端到端latency；Qwen .6B MATH48.76 vs非思考46.84，但低于全thinking52.64。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.03039v1",
          "locations": [
            "§3",
            "§4 Tables1–2/Fig4",
            "App C",
            "Reproducibility Statement"
          ],
          "limitations": "不是完全零附加compute；需包含queryencoder/hypernetwork和5samples，不能与单sample混比。训练2H200、测试1H200未替代本仓A100验证。代码声明未来发布，未找到公开实现；epoch/commitment细项接入前固定，选超参不可用MATH500测试。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "冻结textencoder+3block128 MM-DiT hypernetwork，256码/512latent VQ+STE，last8 Qwen q/v/o/up/gate/down生成bias。只正确teacher response训练CE，不向inference给CoT/gold；λVQ100/usageKL.1。GSM8K训练/MATH500 OOD，5samplesAcc/Pass5，H200端到端latency；Qwen .6B MATH48.76 vs非思考46.84，但低于全thinking52.64。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03036",
      "title": "WebFovea: When the Model Is Right but the Click Is Wrong -- Reliable Round Trips for Vision-Based Web Agents on Live Websites",
      "published": "2026-10-02T09:18:28Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03036",
          "title": "WebFovea: When the Model Is Right but the Click Is Wrong -- Reliable Round Trips for Vision-Based Web Agents on Live Websites",
          "published": "2026-10-02T09:18:28Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "WebFovea网页agent harness加固，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03036",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.03036",
          "title": "WebFovea: When the Model Is Right but the Click Is Wrong -- Reliable Round Trips for Vision-Based Web Agents on Live Websites",
          "published": "2026-10-02T09:18:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03036v1",
          "location": "§4.1–4.6、§5.1–5.5、§6.2、Appendix A",
          "decision": "accepted",
          "reason": "WebFovea hardens视觉action roundtrip：解析特殊token、坐标space映射、select/fill实际读回、反馈状态、五截图history与bounded DOM text通道，executor约束动作预算。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "核心是真实browser执行可观测结果，不fixture点击。仅ClaudeOpus4.6，dev70/holdout30，16site不可达后25scorable不能静默删 denominator。31→57四官方提交不是同模型随机A/B；每组件1–24小样本，liveweb重复波动。CAPTCHA工具不在本轮执行范围。",
          "code": "公开WebRetriever reference；正文未定位WebFovea完整仓库",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03036v1",
              "location": "§4.1–4.6、§5.1–5.5、§6.2、Appendix A"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03034",
      "title": "Adaptive Second-Order Solvers for Fast Stochastic Diffusion Sampling",
      "published": "2026-10-02T09:17:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03034",
          "title": "Adaptive Second-Order Solvers for Fast Stochastic Diffusion Sampling",
          "published": "2026-10-02T09:17:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "PI 扩散求解器基于 stochastic Heun 一二阶误差和前次误差调步，将自适应轨迹聚合为静态模态专用时间表。FFHQ/ImageNet64、LM1B 与公开 EDM 检查点可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03034",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.03034v1",
              "location": "§4/Algorithm1; §5; §6.1–6.4; Appendix B–D",
              "notes": "PI 扩散求解器基于 stochastic Heun 一二阶误差和前次误差调步，将自适应轨迹聚合为静态模态专用时间表。FFHQ/ImageNet64、LM1B 与公开 EDM 检查点可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.03034v1",
          "locations": [
            "§4/Algorithm1; §5; §6.1–6.4; Appendix B–D"
          ],
          "limitations": "需保留拒绝步骤与随机过程处理；公平比较平均 NFE 而非只看步数；LM PPL 改善伴随熵下降；时间表不能跨模态无条件复用。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "PI 扩散求解器基于 stochastic Heun 一二阶误差和前次误差调步，将自适应轨迹聚合为静态模态专用时间表。FFHQ/ImageNet64、LM1B 与公开 EDM 检查点可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03033",
      "title": "When Numbers Start Talking: Numerical Signalling and Strategic Behaviour Among LLMs",
      "published": "2026-10-02T09:15:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03033",
          "title": "When Numbers Start Talking: Numerical Signalling and Strategic Behaviour Among LLMs",
          "published": "2026-10-02T09:15:44Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03033",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "数值消息/自然语言战略博弈行为研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03025",
      "title": "Verifiable, Articulable, and Tacit Components of Preference",
      "published": "2026-10-02T09:01:07Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.03025",
          "title": "Verifiable, Articulable, and Tacit Components of Preference",
          "published": "2026-10-02T09:01:07Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "VAT/Creative Preferences 关注后训练偏好算法，已转后训练审查，不在工业推荐轨作无线上拒绝。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03025",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.03025",
          "title": "Verifiable, Articulable, and Tacit Components of Preference",
          "pool": "cross_track_extra",
          "decision": "reviewed_deferred",
          "reason": "已读v2主文pp1–16及数据inventory p32并对照v1方法。v2将verifiability gap由v1摘要/引言的VAT−V明确改为VA−V，articulability仍VAT−VA；训练/评估流程仍是四路metric发现、fidelity优化、capture-recapture上界及nuisance审计。42任务/2.8M文本/317M preference acts，其中仅16M逐条决策/评论/投票，其余聚合engagement；不是317M独立标注者。LoRA单seed/任务、grouped 80/10/10、generated-text部分只是cross-model ranking无RL运行。公共数据/runner仍未找到可核验作者下载入口；正文有release声明但不足确认当前公共执行，故全文已审后deferred。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "fulltext_scope": "v1方法/关键附录；v2主文pp1–16、数据库存p32与方法页视觉核验，定向版本差异审查；未逐字通读全部附录",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03025v1",
              "location": "v1 §2–3.1；§4–5；Appendix D/H分组split与nuisance audit；abs Version history"
            },
            {
              "url": "https://arxiv.org/abs/2610.03025",
              "location": "官方资源/版本状态"
            },
            {
              "url": "https://arxiv.org/pdf/2610.03025v2",
              "location": "pp1–4 gap definitions；pp4–6 methods/split；p11 generated-ranking而非RL；pp15–16 limitations；p32 A.1 acts composition"
            }
          ],
          "review_status": "reviewed_deferred",
          "version_change": "v1：verifiability=VAT−V；v2 pp1–4：verifiability=VA−V；articulability=VAT−VA不变。主要流程与单seed等限制保持；非声称逐字比对136页全部附录。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03020",
      "title": "DyadMem: A Long-Term Memory Benchmark of How Agents Work with Users",
      "published": "2026-10-02T08:57:43Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03020",
          "title": "DyadMem: A Long-Term Memory Benchmark of How Agents Work with Users",
          "published": "2026-10-02T08:57:43Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03020v1",
          "location": "§3.1–3.3、§4、Appendix G",
          "decision": "accepted",
          "reason": "DyadMem 分Capture/Update/Recall与full pipeline，six memory types含agent-user协作URAM，chronological delete/add/dedup，terminal valid-bank recall与grounded QA并测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "standalone Update/Recall和GoldMemory QA显式gold-conditioned diagnostic，不得当无goldagent；能力需模型自建bank。no-change排除Update score另报，empty/parsefailed不删。QA文本0/1表述有不一致须以公式/code核定；judge与semanticmatcher阈值冻结。",
          "code": "https://github.com/RenaissanceT/DyadMem ; https://renaissancet.github.io/DyadMem/",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03020v1",
              "location": "§3.1–3.3、§4、Appendix G"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03016",
      "title": "From Expression to Reaction: Role-aware Visual Transfer and Stimulus-guided Reasoning for Interlocutor Emotion Recognition",
      "published": "2026-10-02T08:50:26Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03016",
          "title": "From Expression to Reaction: Role-aware Visual Transfer and Stimulus-guided Reasoning for Interlocutor Emotion Recognition",
          "published": "2026-10-02T08:50:26Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "对话情绪识别比赛专用视觉迁移/边界推理。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03016",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03014",
      "title": "Beyond Predefined Sinks: Security-Aware Dependency Analysis for LLM Agents",
      "published": "2026-10-02T08:48:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03014",
          "title": "Beyond Predefined Sinks: Security-Aware Dependency Analysis for LLM Agents",
          "published": "2026-10-02T08:48:09Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.03014v1",
          "location": "§3.1–3.4、§4、§5.3、Data availability",
          "decision": "accepted",
          "reason": "AgentSecGraph permissive sensitive-op anchor→framework normalization→typed Security-ADG，Python AST backward trace识别覆盖constant切断，JS lexical trace，保留guard/trust-boundary provenance。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "may_guard不是安全证明、matchedsink不是漏洞；local dependency有限、alias/dynamic/TS type不完全；敏感case待披露部分不公开。真实source snapshots冻结，precision/coverage与attackability分开，不输出自动漏洞保证。",
          "code": "https://github.com/A1LinLin1/AgentSecBench",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.03014v1",
              "location": "§3.1–3.4、§4、§5.3、Data availability"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03010",
      "title": "Engineering Sustainable Agents: A Systematic Comparison of Agentic LLMs for Developer Workflows",
      "published": "2026-10-02T08:41:46Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.03010",
          "title": "Engineering Sustainable Agents: A Systematic Comparison of Agentic LLMs for Developer Workflows",
          "published": "2026-10-02T08:41:46Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.03010",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "开发Agent能耗/延迟/效果配置对照研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.03002",
      "title": "Recursive Self-Improvement in Unified Multimodal Models",
      "published": "2026-10-02T08:34:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.03002",
          "title": "Recursive Self-Improvement in Unified Multimodal Models",
          "published": "2026-10-02T08:34:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "统一多模态RSI以执行验证的绘图程序产生训练真值，诊断仅决定数据分布，分别更新生成/理解专家再合并，具备同训练步数与同verified数量控制，可作为多模态自改进研究候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.03002",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.03002v1",
              "location": "§2.1–2.5 Eq1–4; §3; §4.1–4.5 Tables1–3"
            },
            {
              "url": "https://arxiv.org/html/2610.03002v1",
              "location": "§2.1–2.5 Eq1–4; §3; §4.1–4.5 Tables1–3",
              "notes": "BasicChartBench不参与diagnosis/selection且内容不重叠；固定U0裁判与外部Qwen裁判均改善。首轮同15320请求400步自选图+0.5点、程序验证+8.6；四轮L0 45.7→60.2，continued46.3。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.03002v1",
          "locations": [
            "§2.1–2.5 Eq1–4",
            "§3",
            "§4.1–4.5 Tables1–3"
          ],
          "limitations": "新bench仍由同模型家族U0评分需独立外部审计；StructT2I11.0→11.9很小且continued11.7，BizGen约4%；MMBench -2.6/MMMU -3.0。不能把对chart的改善推广通用自改进。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "BasicChartBench不参与diagnosis/selection且内容不重叠；固定U0裁判与外部Qwen裁判均改善。首轮同15320请求400步自选图+0.5点、程序验证+8.6；四轮L0 45.7→60.2，continued46.3。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02994",
      "title": "Sentry: Learning to Recover from LLM Agent Failures at Test Time",
      "published": "2026-10-02T08:26:47Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02994",
          "title": "Sentry: Learning to Recover from LLM Agent Failures at Test Time",
          "published": "2026-10-02T08:26:47Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02994",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "Sentry已收录且旧审查为全文+仓库；reward-blind故障恢复，不重复。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02986",
      "title": "OLMo-Detect: A Multi-Stage, Confounder-Controlled Benchmark for Membership Inference on Large Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02986",
          "title": "OLMo-Detect: A Multi-Stage, Confounder-Controlled Benchmark for Membership Inference on Large Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "OLMo-Detect是跨pre/mid/post训练membership审计任务，member/nonmember按质量、时间、词汇匹配，15无监督/3监督MIA与dev/test分离；官方仓库有数据和评分pipeline。评估成员识别/污染风险，不等同提升LLM推理。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02986v1",
              "location": "§3；§4.3–4.7；§5.1"
            },
            {
              "url": "https://github.com/LuckyDaydreamer/OLMo-Detect",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "OLMo-Detect membership inference benchmark，非训练改进。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02974",
      "title": "From Language Priors to Field Adaptation: Preference Learning for Traversability Estimation",
      "published": "2026-10-02T08:07:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02974",
          "title": "From Language Priors to Field Adaptation: Preference Learning for Traversability Estimation",
          "published": "2026-10-02T08:07:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "机器人可通行性偏好学习，专用地形估计。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02974",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02970",
      "title": "A Guideline-Augmented Multi-Agent Framework for Schema-as-Code Biomedical Named Entity Recognition",
      "published": "2026-10-02T08:06:20Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02970",
          "title": "A Guideline-Augmented Multi-Agent Framework for Schema-as-Code Biomedical Named Entity Recognition",
          "published": "2026-10-02T08:06:20Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02970v1",
          "location": "§III.A–E、§IV experiments",
          "decision": "accepted",
          "reason": "GAMA 从train gold归纳annotation rules并按train支持验证，TopN/type guideline memory→ranked span/type plan→schema-as-code→grounding/type/structure双环修复。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "五公共BioNER数据，testgold绝不用于规则或修复，N/attempts validation冻结。结构有效不等于NER正确，exactspan/type F1同预算比较；无新增trainableparameter但LLM calls/induction成本要计。",
          "code": "正文未定位原始代码URL；NCBI/BC5CDR等公共任务",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02970v1",
              "location": "§III.A–E、§IV experiments"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02957",
      "title": "Understanding Trajectory Heterogeneity in Federated World Model Learning",
      "published": "2026-10-02T07:55:25Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02957",
          "title": "Understanding Trajectory Heterogeneity in Federated World Model Learning",
          "published": "2026-10-02T07:55:25Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "联邦临床世界模型轨迹异质性benchmark，专用诊断。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02957",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02952",
      "title": "GTDD: Generative Test-Driven Development for AI Coding Agents with Adversarial Testing",
      "published": "2026-10-02T07:45:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02952",
          "title": "GTDD: Generative Test-Driven Development for AI Coding Agents with Adversarial Testing",
          "published": "2026-10-02T07:45:33Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02952v1",
          "location": "§3.1–3.3、§4、§5–6、Appendix B",
          "decision": "accepted",
          "reason": "GTDD candidate/config先commit，source-informed或blind tester生成valid input不生成期望输出，可信reference差分、最短prefix/operation删减、最多k反馈；fresh审计与开发tests分离。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "新审计是条件独立随机样本且protected材料restore，population结果不给coder/tester。600历史候选freshaudit分析是精确概率计算非真实gate执行试验；known-test通过不证明generalization。jointrepository与simultaneous-family multiplicity不同，acceptance规则不可混。",
          "code": "正文未定位直接仓库URL；protocol/样本计算完整",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02952v1",
              "location": "§3.1–3.3、§4、§5–6、Appendix B"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02951",
      "title": "Dynamic Expert Pruning for Multi-Agent Systems",
      "published": "2026-10-02T07:45:30Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02951",
          "title": "Dynamic Expert Pruning for Multi-Agent Systems",
          "published": "2026-10-02T07:45:30Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "DEP已在既有队列：请求级文本encoder+MLP预测逐层expert topK，影响标签BCE与softmask自蒸馏KL联合训练，CPU专家池向GPU槽位差量加载；维持候选不重复新增。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02951",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02951v1",
              "location": "§3.1–3.4 Eq1–6; §4; Appendix H",
              "notes": "DEP已在既有队列：请求级文本encoder+MLP预测逐层expert topK，影响标签BCE与softmask自蒸馏KL联合训练，CPU专家池向GPU槽位差量加载；维持候选不重复新增。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02951v1",
          "locations": [
            "§3.1–3.4 Eq1–6",
            "§4",
            "Appendix H"
          ],
          "limitations": "K>=router k且tie须精确预算；shared experts不剪。路由mask不等于省显存，需真实host expert residency/delta transfer；每retention训练一个predictor，输入只当前可得prompt/context，不看未来agent生成。原文pruned仍落后dense，不能宣传免费压缩。",
          "code_status": "no verified author release in examined paper; existing implementation queue retained",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02951v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "DEP已在既有队列：请求级文本encoder+MLP预测逐层expert topK，影响标签BCE与softmask自蒸馏KL联合训练，CPU专家池向GPU槽位差量加载；维持候选不重复新增。"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02951",
          "title": "Dynamic Expert Pruning for Multi-Agent Systems",
          "published": "2026-10-02T07:45:30Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02951v1",
          "location": "§3.1–3.4、§4、Appendix H",
          "decision": "accepted",
          "reason": "DEP prompt+input小encoder/MLP预测逐层topK expert mask，REAP impact BCE与dense→softmasked self-KL联合训练；router -inf约束、delta-load host tensors只换差集。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "训练calibration transcripts与evaluation隔离，K≥routerk，ties需确保恰K。masked routing≠显存节省，必须真实resident buffers与delta-transfer测量；prefetch仅已知workflow topology。accuracy比dense仍下降、每retention训练一predictor，CUDA路径需A100/A30实跑。",
          "code": "正文未定位原始代码URL；实施须核实可用MoE checkpoint",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02951v1",
              "location": "§3.1–3.4、§4、Appendix H"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02928",
      "title": "Discriminating Fixture Coverage in Agent-Infrastructure Verification Suites",
      "published": "2026-10-02T07:17:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02928",
          "title": "Discriminating Fixture Coverage in Agent-Infrastructure Verification Suites",
          "published": "2026-10-02T07:17:41Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02928v1",
          "location": "§3–5、Table1、§6",
          "decision": "accepted",
          "reason": "Discriminating Fixture Coverage 冻结projection suite/hash后对外部mutants测kill，instrument区分未激活与污染未可见，按预测七input维度加fixture、原oracle不改复测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "5/10 challenge-set不是自然fault检测率，repair10/10同challenge不是第二heldout。optionalhook skip需单列、first/higher-order mutants分开；能力是软件verifier覆盖审计非Agent task提升。",
          "code": "正文未定位artifactURL；完整构造与survivor说明已给出",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02928v1",
              "location": "§3–5、Table1、§6"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02925",
      "title": "Positive-Unlabeled Learning for Agent Safety False Alarm Auditing",
      "published": "2026-10-02T07:16:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02925",
          "title": "Positive-Unlabeled Learning for Agent Safety False Alarm Auditing",
          "published": "2026-10-02T07:16:33Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02925v1",
          "location": "§3.1–3.3 Eq1–8、§4.1、Appendix A/B/C",
          "decision": "accepted",
          "reason": "Safe-alarm PU ranking以OOF role boundary transfer TN、mass-constrained soft-protection减弱误警负梯度；frozen references median rank/reliability-gated distillation，hierarchical TN与cross-alarm约束KL rank refinement。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "targetfeatures transductive可用但safetylabels sealed，40TN/510targetalarm小样本；softmass非全局FP prevalence，安全monitor冻结。不是自动取消警报，Topbudget仅human审查排序；reference共享bias不由agreement消除，所有三个stage需真实训练非heuristic替换。",
          "code": "https://anonymous.4open.science/r/safe-alarm-ranking-c4d2/",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02925v1",
              "location": "§3.1–3.3 Eq1–8、§4.1、Appendix A/B/C"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02910",
      "title": "Frequency Is Not Sensitivity Identifying Safety-Sensitive Experts in Sparse MoE LLM",
      "published": "2026-10-02T07:00:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02910",
          "title": "Frequency Is Not Sensitivity Identifying Safety-Sensitive Experts in Sparse MoE LLM",
          "published": "2026-10-02T07:00:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "安全敏感MoE专家抑制攻击/诊断，非能力增强算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02910",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02887",
      "title": "Revealing Epistemic Uncertainty in MLLMs via Causal-Invariant Masking",
      "published": "2026-10-02T06:29:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02887",
          "title": "Revealing Epistemic Uncertainty in MLLMs via Causal-Invariant Masking",
          "published": "2026-10-02T06:29:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CIM 对保留问题相关 ROI 的遮罩输入比较语义分布，以 EED 期望嵌入漂移估计不确定性。VQAv2/OKVQA/AdVQA/POPE/MME 有公开数据与等采样预算对照。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02887",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02887v1",
              "location": "§3.2–3.4; §4.1–4.2; Appendix C.8/E",
              "notes": "CIM 对保留问题相关 ROI 的遮罩输入比较语义分布，以 EED 期望嵌入漂移估计不确定性。VQAv2/OKVQA/AdVQA/POPE/MME 有公开数据与等采样预算对照。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02887v1",
          "locations": [
            "§3.2–3.4; §4.1–4.2; Appendix C.8/E"
          ],
          "limitations": "因果不变性依赖 ROI 质量，不能视为已证明的因果识别；保留遮罩生成、校准与 AUROC，而非仅合成分数。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "CIM 对保留问题相关 ROI 的遮罩输入比较语义分布，以 EED 期望嵌入漂移估计不确定性。VQAv2/OKVQA/AdVQA/POPE/MME 有公开数据与等采样预算对照。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02886",
      "title": "Misinformation Without Triggers: From Factual Answers to Downstream Decisions",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02886",
          "title": "Misinformation Without Triggers: From Factual Answers to Downstream Decisions",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "无trigger数据投毒对事实与下游决策影响的控制评测，不是后训练方法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02886",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02885",
      "title": "PsyEvo: A Personalized Counseling Agent That Self-Evolves at Test Time",
      "published": "2026-10-02T06:23:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02885",
          "title": "PsyEvo: A Personalized Counseling Agent That Self-Evolves at Test Time",
          "published": "2026-10-02T06:23:23Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02885v1",
          "location": "§2.1–2.4 Eq2–9、Algorithm1、§3、Appendix G/H/I",
          "decision": "accepted",
          "reason": "PsyEvo HBSP固定population skill prior加client Gaussian posterior采样，SOCA双顺序agreement DAG选回复与mean-preserving ordinal delayedcredit；session间group-normalized weighted DPO更新shared LoRA。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "shared cohort在线适配是test-time training条件，不是冻结heldout；client memory私有、adapter session内固定且更新仅影响新session。external judge不回馈learning，内部反馈与报告分离。模拟counseling偏好不等于临床疗效，human小样本不能宣称治疗安全；需实际adapter loss更新。",
          "code": "https://github.com/Lingxi-mental-health/PsyEvo",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02885v1",
              "location": "§2.1–2.4 Eq2–9、Algorithm1、§3、Appendix G/H/I"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02880",
      "title": "Found but Not Read: When Extracted Text Closes the Retrieval-Reading Gap in Document Vision-Language Models",
      "published": "2026-10-02T06:16:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02880",
          "title": "Found but Not Read: When Extracted Text Closes the Retrieval-Reading Gap in Document Vision-Language Models",
          "published": "2026-10-02T06:16:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "FoveDoc-Bench固定ColQwen2 top16页，对比同页图像与图像+CPU OCR/PDF text，lexical top16块各300字符；适合区分检索与读取瓶颈的受控诊断。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02880",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02880v1",
              "location": "§2 paired protocol; §4–6",
              "notes": "FoveDoc-Bench固定ColQwen2 top16页，对比同页图像与图像+CPU OCR/PDF text，lexical top16块各300字符；适合区分检索与读取瓶颈的受控诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02880v1",
          "locations": [
            "§2 paired protocol",
            "§4–6"
          ],
          "limitations": "PDF真文本是上界，gold evidence crop/recall只是诊断不能作为常规检索输入。FoveDoc收益13–16pp而MMLongBench总收益约0.004，图表可能受损；1173文档与训练/验证QA隔离，按模态和recall分层。",
          "code_url": "https://github.com/atoz03/fovedoc-sup",
          "code_status": "paper links official reproduction; not run",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02880v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "FoveDoc-Bench固定ColQwen2 top16页，对比同页图像与图像+CPU OCR/PDF text，lexical top16块各300字符；适合区分检索与读取瓶颈的受控诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02878",
      "title": "Evaluating VQA in Vision Language Models using Cooperative Principles",
      "published": "2026-10-02T06:13:15Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02878",
          "title": "Evaluating VQA in Vision Language Models using Cooperative Principles",
          "published": "2026-10-02T06:13:15Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "Grice视觉/关系modifier构造语义不变VQA对照，有三人投票纠错，但开放回答主评分依赖新增AMT人评，匿名数据发布与自动判分范围尚未核实。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02878",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02878v1",
              "location": "§3/3.1; §4–5; §7",
              "notes": "Grice视觉/关系modifier构造语义不变VQA对照，有三人投票纠错，但开放回答主评分依赖新增AMT人评，匿名数据发布与自动判分范围尚未核实。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02878v1",
          "locations": [
            "§3/3.1",
            "§4–5",
            "§7"
          ],
          "limitations": "正文995总题与438+42+493分类计数不一致；不能以原答案自动判开放回答替代原人类偏好指标。改写者和答题者同模型的独立会话、多次采样不确定性需控制；先暂缓作为统一evolve evaluator。",
          "code_url": "https://anonymous.4open.science/r/Question-Modifier--8672/",
          "code_status": "anonymous dataset link declared; full runnable scorer not verified",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.02878v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Grice视觉/关系modifier构造语义不变VQA对照，有三人投票纠错，但开放回答主评分依赖新增AMT人评，匿名数据发布与自动判分范围尚未核实。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02876",
      "title": "Seeing, Saying, but Not Using: From Reportable Spatial Facts to Usable States in Multimodal Large Language Models",
      "published": "2026-10-02T06:12:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02876",
          "title": "Seeing, Saying, but Not Using: From Reportable Spatial Facts to Usable States in Multimodal Large Language Models",
          "published": "2026-10-02T06:12:56Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "OSS 对同一空间事实规范化并跨上下文对齐，以答案、状态对齐、状态轨迹三池标准自回归训练。派生样本继承 observation world 的原始切分，可验证 SpaceConflict 三类与成对评分。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02876",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02876v1",
              "location": "§2.1–2.3; §4.1–4.3; §5.1–5.4; Appendix D.3/D.4",
              "notes": "OSS 对同一空间事实规范化并跨上下文对齐，以答案、状态对齐、状态轨迹三池标准自回归训练。派生样本继承 observation world 的原始切分，可验证 SpaceConflict 三类与成对评分。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02876v1",
          "locations": [
            "§2.1–2.3; §4.1–4.3; §5.1–5.4; Appendix D.3/D.4"
          ],
          "limitations": "注入真实状态仅 oracle 诊断；训练状态目标不能来自验证/测试世界；公开仓库链接为论文给出，尚未本轮核验可访问性。",
          "code_url": "https://github.com/changcv2021/Seeing-Saying-but-Not-Using-From-Reportable-Spatial-Facts-to-Usable-States-in-Multimodal-Models",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "OSS 对同一空间事实规范化并跨上下文对齐，以答案、状态对齐、状态轨迹三池标准自回归训练。派生样本继承 observation world 的原始切分，可验证 SpaceConflict 三类与成对评分。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02856",
      "title": "Adaptive Mutual Distillation for Balanced Multi-Task Post-Training of Large Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02856",
          "title": "Adaptive Mutual Distillation for Balanced Multi-Task Post-Training of Large Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "AMD对MFT/平滑SFT两分支互蒸馏，三类全局短probe从相同状态试增减/保持权重，丢弃probe参数后按各任务方向validation选择；6基准多骨干实测，probe成本必须计入。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02856",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02856v1",
              "location": "§3.1–3.2 Algorithm1；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02847",
      "title": "Turnover-Orthogonal Credit Assignment for Open-Team Multi-Agent Reinforcement Learning",
      "published": "2026-10-02T05:35:04Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02847",
          "title": "Turnover-Orthogonal Credit Assignment for Open-Team Multi-Agent Reinforcement Learning",
          "published": "2026-10-02T05:35:04Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02847",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "TOCA开放团队传统MARL信用分解，无语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02841",
      "title": "How Robust Is Multimodal Claim Verification to LLM Rewriting?",
      "published": "2026-10-02T05:31:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02841",
          "title": "How Robust Is Multimodal Claim Verification to LLM Rewriting?",
          "published": "2026-10-02T05:31:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SciClaimEval同claim配支持/反驳图像，比较自然改写和单词注入引起的verdict变化，可作为多模态判别与reward鲁棒性诊断。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02841",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02841v1",
              "location": "§3 rewrite strategies; §4.1–4.4; §7/Appendix B/H",
              "notes": "SciClaimEval同claim配支持/反驳图像，比较自然改写和单词注入引起的verdict变化，可作为多模态判别与reward鲁棒性诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02841v1",
          "locations": [
            "§3 rewrite strategies",
            "§4.1–4.4",
            "§7/Appendix B/H"
          ],
          "limitations": "704dev/872test配对后样本，10条推理采样得到0.1步长support概率，不是logprob校准。改写可能改变语义，CT数值hedging须审核；仅一语料一主rewrite模型，不能宣称通用事实验证器升级。",
          "code_url": "https://github.com/yunangwu/llm-rewrite-claim-verification",
          "code_status": "official code/data linked, SciClaimEval CC-BY4; not run",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02841v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "SciClaimEval同claim配支持/反驳图像，比较自然改写和单词注入引起的verdict变化，可作为多模态判别与reward鲁棒性诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02840",
      "title": "PointWAM: 3D World Action Modeling for Dexterous Robotic Manipulation",
      "published": "2026-10-02T05:31:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02840",
          "title": "PointWAM: 3D World Action Modeling for Dexterous Robotic Manipulation",
          "published": "2026-10-02T05:31:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "PointWAM统一场景/手3D轨迹预训练再动作retargeting，符合机器人基础模型候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02840",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02840v1",
              "location": "§3.1–3.4 Eq1–7; §4.1–4.4; App B/C; 官方项目页",
              "notes": "Mosaic3Dfrozen，10keypoints/hand，1cmvoxel+patch，global3DRoPEtransformer+scene/handMLP轨迹头；retargeter只handtraj+state，不吃sceneGT。EgoDex/VITRA1.15Mepisodes预训练，robot traj+L1action。DexJoCo排42/100失败replay的unlock任务，剩10task3evalseed×50rollout。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02840v1",
          "locations": [
            "§3.1–3.4 Eq1–7",
            "§4.1–4.4",
            "App B/C",
            "官方项目页"
          ],
          "limitations": "3evalseed不是3训练seed；RoboDojo单seed。人视频CoTracker/VGGTdepth预处理成本与噪声不可省；point细节/透明物失败。项目明确Code soon，未发布代码；不宣称语言泛化（DexJoCo每任务固定指令）。",
          "code_url": "https://chrockey.github.io/PointWAM",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Mosaic3Dfrozen，10keypoints/hand，1cmvoxel+patch，global3DRoPEtransformer+scene/handMLP轨迹头；retargeter只handtraj+state，不吃sceneGT。EgoDex/VITRA1.15Mepisodes预训练，robot traj+L1action。DexJoCo排42/100失败replay的unlock任务，剩10task3evalseed×50rollout。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02839",
      "title": "To Explore The Strange New World Beyond Data Distribution: System Behavior, Causality Tax, and Non-causal Base Model",
      "published": "2026-10-02T05:29:03Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02839",
          "title": "To Explore The Strange New World Beyond Data Distribution: System Behavior, Causality Tax, and Non-causal Base Model",
          "published": "2026-10-02T05:29:03Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "SBD/GSH目前是lazy-training NTK谱的理论概念验证，作者明确无端到端语言模型能力实证；不新增基础模型/evolve算法adapter。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02839",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02839v1",
              "location": "§5.2–5.3; §6.1–6.2",
              "notes": "SBD/GSH目前是lazy-training NTK谱的理论概念验证，作者明确无端到端语言模型能力实证；不新增基础模型/evolve算法adapter。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02839v1",
          "locations": [
            "§5.2–5.3",
            "§6.1–6.2"
          ],
          "limitations": "非因果shell依赖启发式重归一与block执行；NTK谱SNR不能代替语言建模准确率或证明普遍causality tax。保留理论背景，不把未来backprop-free设想写成已验证训练算法。",
          "code_status": "no usable end-to-end base model implementation established",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02839v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "SBD/GSH目前是lazy-training NTK谱的理论概念验证，作者明确无端到端语言模型能力实证；不新增基础模型/evolve算法adapter。"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02835",
      "title": "All Work And No Play Makes Jack a Dull Boy: Understanding and Preventing Catastrophic Strategy Collapse in RLVR",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02835",
          "title": "All Work And No Play Makes Jack a Dull Boy: Understanding and Preventing Catastrophic Strategy Collapse in RLVR",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "MeshLearning固定离线coach策略前缀（无中间计算和答案）探索，对正确轨迹相对pre-RLVR reference的策略logprob增长做uniform-KL均衡；推理时无coach，真实数学科学代码训练。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02835",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02835v1",
              "location": "§4.1–4.2 Eq.6；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02832",
      "title": "FastOPD: On-Policy Distillation for Lightweight VLA Deployment",
      "published": "2026-10-02T05:24:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02832",
          "title": "FastOPD: On-Policy Distillation for Lightweight VLA Deployment",
          "published": "2026-10-02T05:24:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "FastOPD单次学生flow-map跳跃采样on-policy状态匹配teacher对角velocity，并用中点自一致传播到有限步map；LIBERO/RoboTwin及真机器人，单步action-expert训练必须真checkpoint。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02832",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02832v1",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）; §3 Eq.3；§4.1–4.2"
            },
            {
              "url": "https://arxiv.org/abs/2610.02832",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02832v1",
              "location": "§3 Eq.3；§4.1–4.2"
            }
          ],
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "review_provenance": "post_training_review正文审查复用；foundation核对交叉记录",
          "official_url": "https://arxiv.org/html/2610.02832v1",
          "locations": [
            "Abstract（输入检索工件中的完整摘要已逐条审阅）",
            "§3 Eq.3；§4.1–4.2"
          ],
          "implementation_status": "not_implemented",
          "fulltext_notes": [
            {
              "url": "https://arxiv.org/abs/2610.02832",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02832v1",
              "location": "§3 Eq.3；§4.1–4.2"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.02832",
          "title": "FastOPD: On-Policy Distillation for Lightweight VLA Deployment",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "FastOPD单次学生flow-map跳跃采样on-policy状态匹配teacher对角velocity，并用中点自一致传播到有限步map；LIBERO/RoboTwin及真机器人，单步action-expert训练必须真checkpoint。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02832",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02832v1",
              "location": "§3 Eq.3；§4.1–4.2"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02828",
      "title": "FSPO: Policy-Consistent Risk and Pareto-Feasible Control for Budgeted LLM RL Post-Training",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02828",
          "title": "FSPO: Policy-Consistent Risk and Pareto-Feasible Control for Budgeted LLM RL Post-Training",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "FSPO policy-consistent risk-to-go ensemble、decision-conditioned calibration与Pareto continuation证书控制训练动作；正文区分24case ledger机制与Qwen3B真实GRPO trainer研究。接纳机制，不能把固定ledger效率当LLM能力提升。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02828",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02828v1",
              "location": "§3.4–3.6；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02819",
      "title": "Text-Centric Post-Training for Omni-Modal Reasoning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02819",
          "title": "Text-Centric Post-Training for Omni-Modal Reasoning",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "Text-centric Omni是文本/多模态数据与SFT/RL配方系统研究，梯度正交仅诊断，未提出新核心optimizer；保留训练范式结论而不新增适配器。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02819",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02819v1",
              "location": "§3.2；§4.1–4.2；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02814",
      "title": "VeriPy Source-Preserving Verification and Compatibility Checking for Python Components",
      "published": "2026-10-02T05:02:06Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02814",
          "title": "VeriPy Source-Preserving Verification and Compatibility Checking for Python Components",
          "published": "2026-10-02T05:02:06Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02814v1",
          "location": "§3.1–3.3、§4、§7、Appendix G",
          "decision": "accepted",
          "reason": "VeriPy 保留Python executable AST，显式admission/environment将spec直接降Dafny或Lean，proof sidecar与axiom gate、hash-bound guards、原body/model differential tests及scoped compatibility。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "支持片段/精确builtin/Unicode scalar/snapshot信任边界明确；basedpyright不是功能证明，guard可生成不代表proof。ambientFalse sidecar历史漏洞说明需精确proposition及假设审计；兼容历史关系目前Dafny，Lean覆盖不同。必须实际compiler/solver执行。",
          "code": "https://github.com/astrio-labs/veripy",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02814v1",
              "location": "§3.1–3.3、§4、§7、Appendix G"
            }
          ]
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02781",
      "title": "OPD Before RL: Warm-Starting Rubric-Based RL with On-Policy Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02781",
          "title": "OPD Before RL: Warm-Starting Rubric-Based RL with On-Policy Distillation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "RP-OPD先用rubric特权teacher top256 forward-KL暖启动，再切换rubric reward GRPO；三rubric领域多学生。HealthBench正文另列重叠/不重叠评价，正式复现须使用完全隔离数据。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02781",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02781v1",
              "location": "§3 Eq.4；§4–5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02766",
      "title": "Exact Memory-Time Optimization for Prefix-Cached Language Model Serving",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02766",
          "title": "Exact Memory-Time Optimization for Prefix-Cached Language Model Serving",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "prefix缓存timeout最小割/closure优化，纯serving系统算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02766",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02755",
      "title": "FiberGeoText: A Vision-Language Model for Population- Level Organization of Superficial White Matter",
      "published": "2026-10-02T03:31:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02755",
          "title": "FiberGeoText: A Vision-Language Model for Population- Level Organization of Superficial White Matter",
          "published": "2026-10-02T03:31:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "FiberGeoText脑白质纤维聚类专用医疗模型。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02755",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02744",
      "title": "EpiWorld: Grounding LLM Policy Agents in Epidemiological World Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02744",
          "title": "EpiWorld: Grounding LLM Policy Agents in Epidemiological World Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "EpiWorld模拟器counterfactual与技能经验记忆，不是明确LLM参数后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02744",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02744",
          "title": "EpiWorld: Grounding LLM Policy Agents in Epidemiological World Models",
          "published": "2026-10-02T03:16:28Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02744",
          "location": "§3.2–3.5；§4.1–4.2；§5.2；Limitations",
          "decision": "out_of_scope",
          "reason": "EpiWorld图流行病worldmodel+protocol/skill/lesson库，teacher按失败事件提炼并supersession替换，非参数RL；51州真实回顾数据与两SEIR模拟，所有policy共用同worldmodel，独立mechanistic重执行仍非真实干预因果证据。跨疫情lesson不可迁移、ensemble区间欠离散。新增模型/规则高度疾病域特定，未形成通用Agent核心机制或公共通用评测新增。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02744v1",
              "location": "§3.2–3.5；§4.1–4.2；§5.2；Limitations"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02740",
      "title": "Prospective Hindsight: Self-Calibrating Reinforcement Learning via Prediction-Reality Gaps",
      "published": "2026-10-02T03:12:00Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02740",
          "title": "Prospective Hindsight: Self-Calibrating Reinforcement Learning via Prediction-Reality Gaps",
          "published": "2026-10-02T03:12:00Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02740",
          "location": "§3.1–3.4 Eq4–5；§4.1/4.3；AppendixC",
          "decision": "accepted",
          "reason": "PH同policy共享参数自评只见state/action不可见privilegedfuture，ternary多数票与实际结果不一致则stopgrad(1+alpha)乘base RL/OPD/Combined loss；未知类中性。OLMo3-7B单轮verifier/多轮PRM+用户模拟、随机同质量reweight控制。校准解释非保证，alpha2可坍缩成预测失败；额外M forward训练开销必须计，不能让测试gold流入自评。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "post_training_cross_track": true,
          "cross_tracks": [
            "agent",
            "post_training"
          ],
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02740v1",
              "location": "§3.1–3.4 Eq4–5；§4.1/4.3；AppendixC"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02718",
      "title": "Revisiting Visual Representation Enhancement of VLMs via Kernel Canonical Correlation Analysis",
      "published": "2026-10-02T02:54:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02718",
          "title": "Revisiting Visual Representation Enhancement of VLMs via Kernel Canonical Correlation Analysis",
          "published": "2026-10-02T02:54:59Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "3vKCCA将CLIP视觉、冻结DINO与文本作三视图投影训练，可作为带理论限制的视觉对齐候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02718",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02718v1",
              "location": "§3 Eq1–3; §4 Table1; App A/C Eq18–21"
            },
            {
              "url": "https://arxiv.org/html/2610.02718v1",
              "location": "§3 Eq1–3; §4 Table1; App A/C Eq18–21",
              "notes": "实际特征sampleL2+batchcenter，最小sqrt(J²+1e−8)+原CLIP输出L2；每步V/D投影列归一化，T投影不约束。r8ρ5γ1η78.125，ImageNet1k40kstepsbatch64，CLIPL14/DINOv2L14。MMVP17.8→25.9、retrieval72.7→73.3。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.02718v1",
          "locations": [
            "§3 Eq1–3",
            "§4 Table1",
            "App A/C Eq18–21"
          ],
          "limitations": "零值是KKT必要非充分，实做列归一化避免全W=0但不能声称解了原KCCA/eigenproblem；必须保留归一化并监控投影rank/相关性。2×5090训练非A100验证，单表无seed方差/独立调参说明；未找到作者代码。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "实际特征sampleL2+batchcenter，最小sqrt(J²+1e−8)+原CLIP输出L2；每步V/D投影列归一化，T投影不约束。r8ρ5γ1η78.125，ImageNet1k40kstepsbatch64，CLIPL14/DINOv2L14。MMVP17.8→25.9、retrieval72.7→73.3。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02713",
      "title": "WakeKV: Reactive, Reversible KV Residency for Heads That Change Their Minds",
      "published": "2026-10-02T02:48:25Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02713",
          "title": "WakeKV: Reactive, Reversible KV Residency for Heads That Change Their Minds",
          "published": "2026-10-02T02:48:25Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "WakeKV保存完整CPU reservoir，GPU按头LRU驻留并在需求变化时可逆取回，适合缓存迁移实验候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02713",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02713v1",
              "location": "§3; §4–5; §6 limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.02713v1",
              "location": "§3; §4–5; §6 limitations",
              "notes": "WakeKV保存完整CPU reservoir，GPU按头LRU驻留并在需求变化时可逆取回，适合缓存迁移实验候选。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02713v1",
          "locations": [
            "§3",
            "§4–5",
            "§6 limitations"
          ],
          "limitations": "大部分cache-miss对照来自完整attention轨迹oracle，不等于在线延迟；真实FlexiCache/vLLM桥接单一模型硬件，R16增益同时减少attention工作。需保持因果需求预测、计入PCIe取回和CPU全量存储，不能复制oracle命中率冒充能力。",
          "code_status": "not_found_in_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02713v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "WakeKV保存完整CPU reservoir，GPU按头LRU驻留并在需求变化时可逆取回，适合缓存迁移实验候选。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02710",
      "title": "Self-Supervised Scaling of Terminal Environments for Scientific Domains",
      "published": "2026-10-02T02:44:46Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02710",
          "title": "Self-Supervised Scaling of Terminal Environments for Scientific Domains",
          "published": "2026-10-02T02:44:46Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02710",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "SWR将500真实workflow包装成3000任务，public IO/hidden judge隔离；typed scenario、replay反例与hidden完美一致筛SFT，重复采样只是重权重非新轨迹。SWR100是同workflow的新task不是unseen-workflow；35k开发校验与独立200case冻结后audit分开，2%误接/误拒；oracle public-output选择仅反捷径诊断，不能供agent。方法可复用，正文未给可定位作者完整释放入口。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02710v1",
              "location": "§3.1–3.4 Eq1–4；§4.1–4.5；AppendixI/J"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02702",
      "title": "Silent Dissent: LLM Agents That Yield to the Majority Still Represent Their Original Premise",
      "published": "2026-10-02T02:37:05Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02702",
          "title": "Silent Dissent: LLM Agents That Yield to the Majority Still Represent Their Original Premise",
          "published": "2026-10-02T02:37:05Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02702",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "从众后隐藏bridge仍存在的J-lens表征诊断，非成熟新策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02700",
      "title": "Learning from Evolving Errors: Adaptive Iterative Repair for On-Policy Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02700",
          "title": "Learning from Evolving Errors: Adaptive Iterative Repair for On-Policy Distillation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "AIR-OPD按首个错误anchor开始，保留1-epsilon纠正概率质量的块边界repair区域；多轮指导teacher特权蒸馏和gamma深度/rho即时成功归一权重；参考答案只训练分支，实际DAPO训练。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02700",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02700v1",
              "location": "§4.1–4.3 Eq.6–10；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02697",
      "title": "GeoScaffold: Learning Compact Geometric Latents via Reconstruction for Efficient Vision-Language Navigation",
      "published": "2026-10-02T02:24:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02697",
          "title": "GeoScaffold: Learning Compact Geometric Latents via Reconstruction for Efficient Vision-Language Navigation",
          "published": "2026-10-02T02:24:02Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "GeoScaffold 先训练冻结深度 VQ-VAE，再用八个几何 query 重建深度码/深度图/连通性/可通行性，联合模仿学习；部署移除重建头与 tokenizer。R2R-CE/RxR-CE 可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02697",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02697v1",
              "location": "§3.2–3.3/Eq5–9; §4.1–4.4",
              "notes": "GeoScaffold 先训练冻结深度 VQ-VAE，再用八个几何 query 重建深度码/深度图/连通性/可通行性，联合模仿学习；部署移除重建头与 tokenizer。R2R-CE/RxR-CE 可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02697v1",
          "locations": [
            "§3.2–3.3/Eq5–9; §4.1–4.4"
          ],
          "limitations": "Matterport 数据有访问许可；深度和 oracle 轨迹仅训练使用；混合 attention mask 与 query 保留在推理；完整论文训练约 1500 A100 小时不可当轻量验证。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "GeoScaffold 先训练冻结深度 VQ-VAE，再用八个几何 query 重建深度码/深度图/连通性/可通行性，联合模仿学习；部署移除重建头与 tokenizer。R2R-CE/RxR-CE 可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02695",
      "title": "Test-time Calibration Learning for Large Language Model Reasoning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02695",
          "title": "Test-time Calibration Learning for Large Language Model Reasoning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "TTCL按答案一致性构造pseudo正确性/置信目标，reasoning-answer和confidence token分离优势，逐epoch冻结EMA目标cache；同benchmark无标签适应再评测，属于transductive TTT非独立未见测试。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02695",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02695v1",
              "location": "§3.2–3.3 Eq.4–12；§5.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02687",
      "title": "Decoupling Memory from Context: Structured Memory for Token-Efficient Test-Time Continual Learning",
      "published": "2026-10-02T02:07:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02687",
          "title": "Decoupling Memory from Context: Structured Memory for Token-Efficient Test-Time Continual Learning",
          "published": "2026-10-02T02:07:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "GraphMemory agent上下文记忆优化，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02687",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02687",
          "title": "Decoupling Memory from Context: Structured Memory for Token-Efficient Test-Time Continual Learning",
          "published": "2026-10-02T02:07:32Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02687",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "GraphMemory对ACE新增compact index entry选择与有向证据图，2hop/12nodes/2500tokens BFS，Beta(1+help,1+harm)均值排序，生成归因仅允许已载入节点，Curator显式创建/删除边。不是端到端O(1)，index随库增长；FiNER/Formula val选memory、heldout test，省token但query约1.8倍慢且部分准确率低，不能宣称全面优越。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02687v1",
              "location": "§3；§4 Tables1–2；AppendixB.1–B.2 Eq17–21/Algorithm1"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02683",
      "title": "RAOA: Alternating-Operator Neural Computation with Programmable Radio Propagation",
      "published": "2026-10-02T02:04:34Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02683",
          "title": "RAOA: Alternating-Operator Neural Computation with Programmable Radio Propagation",
          "published": "2026-10-02T02:04:34Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "RAOA交替归一化能量梯度problem步和Hadamard mixer步，重复共享两个控制参数；零初始化残差adapter可在冻结LLM中研究递归结构。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02683",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02683v1",
              "location": "§3 Eq1–4; §4 design; §6 scope; Appendix H"
            },
            {
              "url": "https://arxiv.org/html/2610.02683v1",
              "location": "§3 Eq1–4; §4 design; §6 scope; Appendix H",
              "notes": "RAOA交替归一化能量梯度problem步和Hadamard mixer步，重复共享两个控制参数；零初始化残差adapter可在冻结LLM中研究递归结构。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02683v1",
          "locations": [
            "§3 Eq1–4",
            "§4 design",
            "§6 scope",
            "Appendix H"
          ],
          "limitations": "只算子与传播模拟，无真实RF速度能耗或量子优势；4B主实验depth1不是深度scaling。Qwen深度收益平、768token GSM8K配对bootstrap未区分RAOA/MLP/frozen，应保留负结果并匹配计算量。",
          "code_status": "no canonical author release URL located in examined text",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02683v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "RAOA交替归一化能量梯度problem步和Hadamard mixer步，重复共享两个控制参数；零初始化残差adapter可在冻结LLM中研究递归结构。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02670",
      "title": "LEAP: Learning Efficient Action Proposals For LLM Agents",
      "published": "2026-10-02T01:44:03Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02670",
          "title": "LEAP: Learning Efficient Action Proposals For LLM Agents",
          "published": "2026-10-02T01:44:03Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "LEAP学习agent动作proposal，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02670",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02670",
          "title": "LEAP: Learning Efficient Action Proposals For LLM Agents",
          "published": "2026-10-02T01:44:03Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02670",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "LEAP target canonical-action LoRA NLL训练tinydraft，无targetlogits；克隆环境先proposal，再同GPU并行targetverify、只提交匹配前缀并移交克隆状态不重复工具。OpenAGI/TaskBench无工具执行，tau2/BFCL为localbackend；1.10–1.63x whole-task speedup有任务配对bootstrap。真实外部副作用不能安全clone则不适用，targetauthorship不保证并发下trajectoryidentity。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02670v1",
              "location": "§3.1–3.3；§4.1/Table1；§5/AppendixM"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02666",
      "title": "CHASE-VLA: Post-Training Quantization Framework for Vision-Language-Action Models with Chunk-Aware Scale Estimation",
      "published": "2026-10-02T01:34:55Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02666",
          "title": "CHASE-VLA: Post-Training Quantization Framework for Vision-Language-Action Models with Chunk-Aware Scale Estimation",
          "published": "2026-10-02T01:34:55Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CHASE-VLA以先前生成action chunk预测逐层/去噪step组的激活尺度分布，分位损失与方差联合训练尺度估计器，保持W4A4 action expert。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02666",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02666v1",
              "location": "§3.2–3.3; §4.1/4.4"
            },
            {
              "url": "https://arxiv.org/html/2610.02666v1",
              "location": "§3.2–3.3; §4.1/4.4",
              "notes": "CHASE-VLA以先前生成action chunk预测逐层/去噪step组的激活尺度分布，分位损失与方差联合训练尺度估计器，保持W4A4 action expert。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02666v1",
          "locations": [
            "§3.2–3.3",
            "§4.1/4.4"
          ],
          "limitations": "输入必须是之前实际生成的chunk而非GT未来动作；首chunk使用基础校准。LIBERO每任务20episode；A100延迟只量action expert而不是整个视觉语言动作流水线，部署还需真实packed低比特验证。",
          "code_status": "not_found_in_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02666v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "CHASE-VLA以先前生成action chunk预测逐层/去噪step组的激活尺度分布，分位损失与方差联合训练尺度估计器，保持W4A4 action expert。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02659",
      "title": "Distributed Learning with Selective State Space Models: Architecture-Aware Convergence Analysis",
      "published": "2026-10-02T01:28:31Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02659",
          "title": "Distributed Learning with Selective State Space Models: Architecture-Aware Convergence Analysis",
          "published": "2026-10-02T01:28:31Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "SSM联邦学习收敛理论与现有算法比较，无新训练算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02659",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02657",
      "title": "Context-Tower Conversion Preserves Generation While Freezing Retains Knowledge: Low-Budget AR-to-Diffusion Conversion of MoE LLMs",
      "published": "2026-10-02T01:26:57Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02657",
          "title": "Context-Tower Conversion Preserves Generation While Freezing Retains Knowledge: Low-Budget AR-to-Diffusion Conversion of MoE LLMs",
          "published": "2026-10-02T01:26:57Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "低预算AR转diffusion通过frozencontexttower和layerKVconcat有匹配token/参数协议与公开任务证据，作为研究型转换operator而非serving加速接入。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02657",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02657v1",
              "location": "§3; §4/Table2; §5; §6; §7/Limitations"
            },
            {
              "url": "https://arxiv.org/html/2610.02657v1",
              "location": "§3; §4/Table2; §5; §6; §7/Limitations",
              "notes": "Qwen30BA3B、1B监督token、同manifest/0.919Btrainable，tower以postRoPEKV接入canvas，无新增trainable；frozenexpertsalias仅额外1.9GBweights；HumanEvalpass10 committed71.60vs6.19，samehost3decode67.47vs4.61。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.02657v1",
          "locations": [
            "§3",
            "§4/Table2",
            "§5",
            "§6",
            "§7/Limitations"
          ],
          "limitations": "arms还改loss/block/corruption不能只归因freezing；trainabletowergeneration无显著差但MMLU差13pt；BS1吞吐只有servedAR .134/.168，工程2x是自身基线；+150Mtoken S16 confounded；seed2仅tower，250M中途复验失败。",
          "code_url": null,
          "kind": "core_algorithm",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Qwen30BA3B、1B监督token、同manifest/0.919Btrainable，tower以postRoPEKV接入canvas，无新增trainable；frozenexpertsalias仅额外1.9GBweights；HumanEvalpass10 committed71.60vs6.19，samehost3decode67.47vs4.61。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02654",
      "title": "Coherence-Driven Belief Formation and Population Dynamics of Contagion in LLM Agents",
      "published": "2026-10-02T01:20:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02654",
          "title": "Coherence-Driven Belief Formation and Population Dynamics of Contagion in LLM Agents",
          "published": "2026-10-02T01:20:52Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02654",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "LLM社会信念传播kernel/群体动力学分析。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02638",
      "title": "Batched Speech Decisions Without Decoding: Single-Token Supervision Lets a Frozen LLM Hear Beyond the Transcript",
      "published": "2026-10-02T00:54:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02638",
          "title": "Batched Speech Decisions Without Decoding: Single-Token Supervision Lets a Frozen LLM Hear Beyond the Transcript",
          "published": "2026-10-02T00:54:52Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02638",
          "location": "§2.1–2.4；§3；§4.1/4.3",
          "decision": "accepted",
          "reason": "DuplexJev冻结ASR/LLM只训connector，内容transcriptKL与决策单letterCE混合；typed选项随机位置；共享prefix KV+blockdiagonal suffix mask+restartposition精确批量logits读出。A多层fusion不胜B末层，speaker-disjoint真人语音，情绪训练ZJUcontent仍降6–17点、混loss非全解决。流式160–200ms仅部署构想未测。可纳语音决策/批量readout基础算子非完整duplexagent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "cross_tracks": [
            "agent",
            "foundation"
          ],
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02638v1",
              "location": "§2.1–2.4；§3；§4.1/4.3"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02626",
      "title": "Imagine the Future, Internalize the Gist: Efficient VLA Reasoning via Internalized Spatiotemporal Imagination",
      "published": "2026-10-02T00:31:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02626",
          "title": "Imagine the Future, Internalize the Gist: Efficient VLA Reasoning via Internalized Spatiotemporal Imagination",
          "published": "2026-10-02T00:31:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "IG-VLA未来latent差分推理再SceneGist蒸馏形成明确低成本动作策略候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02626",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02626v1",
              "location": "§3.1–3.2 Eq1–10; §4.1–4.4 Tables1–5; App A"
            },
            {
              "url": "https://arxiv.org/html/2610.02626v1",
              "location": "§3.1–3.2 Eq1–10; §4.1–4.4 Tables1–5; App A",
              "notes": "K10预测SigLIP未来−当前差分，MSE+cosλ.1；冻结reasoner后训练MLPbottleneck以actionmatching形成gisttarget，再prefixKV层maskedmean/std→两层MLP单gist，repr+actiondistill。部署bypassrollout/compressor但保留视觉prefix与explicitactionexpert。LIBERO100ksteps、VLABench同61k128batch。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.02626v1",
          "locations": [
            "§3.1–3.2 Eq1–10",
            "§4.1–4.4 Tables1–5",
            "App A"
          ],
          "limitations": "K/λ/层数由LIBERO消融选择，接入必须独立validation；6.38x针对引用基线，A6000 169.5ms不是独立同机baseline复测。UR3仅77demos×16trial，62.5%比56.2%仅一例差，不当稳健胜出。未找到作者代码。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "K10预测SigLIP未来−当前差分，MSE+cosλ.1；冻结reasoner后训练MLPbottleneck以actionmatching形成gisttarget，再prefixKV层maskedmean/std→两层MLP单gist，repr+actiondistill。部署bypassrollout/compressor但保留视觉prefix与explicitactionexpert。LIBERO100ksteps、VLABench同61k128batch。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02617",
      "title": "WebUIProof: Benchmarking WebUI Code Generators with UI-Agent Execution Harness",
      "published": "2026-10-02T00:17:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02617",
          "title": "WebUIProof: Benchmarking WebUI Code Generators with UI-Agent Execution Harness",
          "published": "2026-10-02T00:17:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02617",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "WebUIProof以DOM+视觉UI agent执行测试，build failure计零、Full+0.5Partial聚合，判定依赖grounding/stepbudget，100例人工一致率约80%非确定oracle；VisRL组合截图/交互/analyzer reward PPO。官方公开149general任务和build/eval/compute_acc代码，但论文219含70个3D任务未见repo对应，复现先限定149，RL/3D不能默认已开源。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02617v1",
              "location": "§3.1–3.4；§4/Table2；§5.1；官方README RepositoryStructure/EvaluationPipeline"
            },
            {
              "url": "https://github.com/yunyuntsai/webuiproof-benchmark",
              "location": "README公开149任务和src/ui_test_llama；未见论文70个3D任务，未执行"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02616",
      "title": "VERSE: Verified Self-Evolving Optimizer for Agent Harnesses",
      "published": "2026-10-02T00:16:30Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02616",
          "title": "VERSE: Verified Self-Evolving Optimizer for Agent Harnesses",
          "published": "2026-10-02T00:16:30Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02616",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "VERSE在固定权重harnessoptimizer上增加trace minimization、draft验证双通过、replay/perturb、失败模式audit与optimizer自身prompt/tool/hook更新。110train50val108Marchtest与107JulyOOD隔离；每行一次evolution、test重复3次，不是3个独立搜索seed，compute不完全相同。静态验证器/预算及val选择要保留；不能把单次flip当修复。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02616v1",
              "location": "§2.1–2.2；§3.1；§4.1–4.4 Tables2–3"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02614",
      "title": "What Is Lost in Post-Training? Default Collapse and the Loss of In-Context Steerability Across Diverse Perspectives",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02614",
          "title": "What Is Lost in Post-Training? Default Collapse and the Loss of In-Context Steerability Across Diverse Perspectives",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "SDM以相关性judge筛prompt、stance judge分桶，在维度群体分布上惩罚目标偏离并PPO；Llama8B两设置初步训练，不能把群体分布约束说成逐prompt保证。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02614",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02614v1",
              "location": "§4.2；Appendix E；§3.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02611",
      "title": "Scale-Recursive Rectified Flows for Few-Step Precipitation Ensembles",
      "published": "2026-10-02T00:11:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02611",
          "title": "Scale-Recursive Rectified Flows for Few-Step Precipitation Ensembles",
          "published": "2026-10-02T00:11:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "降雨场尺度递归flow采样，专用气象模型。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02611",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02610",
      "title": "Seer: Maximum Likelihood Regression for Learning-Speed Curves",
      "published": "2026-10-02T00:09:10Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.02610",
          "title": "Seer: Maximum Likelihood Regression for Learning-Speed Curves",
          "published": "2026-10-02T00:09:10Z",
          "repository_status": "new",
          "decision": "out_of_scope",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "Seer 是 1995 年 UIUC 博士论文的晚上传，研究经典分类器学习曲线；不能按 2026 arXiv 编号称为新 LLM 方法。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02610",
              "location": "PDF pp1–3 title, copyright and abstract"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.02610",
            "url": "https://arxiv.org/pdf/2610.02610v1",
            "sha256": "e5a592b8ecb7ab2d9c774aff708e2cd3ef4c844d7bcaa20e34a3f2b6921ff591",
            "status": "downloaded",
            "characters": 166262,
            "errors": [
              {
                "url": "https://arxiv.org/html/2610.02610v1",
                "error": "HTTP Error 404: Not Found"
              }
            ]
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02600",
      "title": "When History Misleads: Asymmetric Margin Supervision for Instruction-Guided LLM Generative Recommendation",
      "published": "2026-10-01T23:53:42Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.02600",
          "title": "When History Misleads: Asymmetric Margin Supervision for Instruction-Guided LLM Generative Recommendation",
          "published": "2026-10-01T23:53:42Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "Meta AIMS 保留完整历史，以删除反事实形成仅更新竞争项的非对称 margin 监督。六 backbone、私有日志与 Qilin/KuaiSearch-Lite 的 Recall/NDCG 全为离线；生产 SID/生产日志不是线上部署实验。已读方法、结果、结论和附录，未找到 A/B 或全量发布效果，故不满足工业准入。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02600",
              "location": "§4.1–4.4; §6; Appendix B.1–B.2 and E"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.02600",
            "url": "https://arxiv.org/html/2610.02600v1",
            "sha256": "3a915a5b81fa1332a716982b2326a85aa212531a68c1d9268137a00a5178007f",
            "status": "downloaded",
            "characters": 109264,
            "errors": []
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02597",
      "title": "GRAFT: Growing Agglomerative Foundation Models via Continual Teacher Distillation",
      "published": "2026-10-01T23:49:56Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02597",
          "title": "GRAFT: Growing Agglomerative Foundation Models via Continual Teacher Distillation",
          "published": "2026-10-01T23:49:56Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "GRAFT以历史student单anchor保存旧教师功能，TSRT与image-text关系KL接纳新视觉teacher，是定义清晰的持续蒸馏operator。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02597",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02597v1",
              "location": "§3.1–3.3 Eq1–10; §4.1–4.3 Tables1–2; AppA"
            },
            {
              "url": "https://arxiv.org/html/2610.02597v1",
              "location": "§3.1–3.3 Eq1–10; §4.1–4.3 Tables1–2; AppA",
              "notes": "每轮只incomingteacher+frozenprevstudent+active，TSRT联合prepend并保留各projector；新teacheracquisition+旧readoutsanchor；DINOv2→MultiHMR→MASt3R→SigLIP2，ViTB448，matchingteacher/data/scheduleablation。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.02597v1",
          "locations": [
            "§3.1–3.3 Eq1–10",
            "§4.1–4.3 Tables1–2",
            "AppA"
          ],
          "limitations": "main表异构teacher/data非公平排名，warmstartDUNE成本未重付；LoRA retention移除adapter恢复base与共享student不等价；下游需新head/decoderfinetune不是零shot；未查到正文官方源码入口，复现需补完整schedule/source。",
          "code_url": null,
          "kind": "core_algorithm",
          "implementation_status": "not_implemented",
          "fulltext_notes": "每轮只incomingteacher+frozenprevstudent+active，TSRT联合prepend并保留各projector；新teacheracquisition+旧readoutsanchor；DINOv2→MultiHMR→MASt3R→SigLIP2，ViTB448，matchingteacher/data/scheduleablation。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02593",
      "title": "Fisher-Guided Submodular Data Selection for Continual Pre-Training of Large Language Models",
      "published": "2026-10-01T23:44:09Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02593",
          "title": "Fisher-Guided Submodular Data Selection for Continual Pre-Training of Large Language Models",
          "published": "2026-10-01T23:44:09Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Fisher双几何与流式submodular数据选择是明确的CPT算法候选，不以工业上线结果接入。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02593",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02593v1",
              "location": "§3; §4.1–4.4 Tables1–2; App A/B/E"
            },
            {
              "url": "https://arxiv.org/html/2610.02593v1",
              "location": "§3; §4.1–4.4 Tables1–2; App A/B/E",
              "notes": "LoRA r128/α512 warmup θ*处固定Adam状态候选梯度，anchor=√F g与frontier=g/√F，先F加权后随机投影，双正logdet，流式sieve；50k独立参考doc估F，TinyLlama1.1B4Btoken及Llama3.1-8B10Btoken，3seed。候选PMC/PubMed按源ID、13gram和MinHash去污染，剔2.68%。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.02593v1",
          "locations": [
            "§3",
            "§4.1–4.4 Tables1–2",
            "App A/B/E"
          ],
          "limitations": "不是用F惩罚更新；LoRA对角F、warmup/投影皆近似，1/2−ε仅surrogate。相同token预算另计候选梯度/参考F成本；医学域两backbone结果不外推通用。未找到作者代码，不能用PPL启发式代替双logdet。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "LoRA r128/α512 warmup θ*处固定Adam状态候选梯度，anchor=√F g与frontier=g/√F，先F加权后随机投影，双正logdet，流式sieve；50k独立参考doc估F，TinyLlama1.1B4Btoken及Llama3.1-8B10Btoken，3seed。候选PMC/PubMed按源ID、13gram和MinHash去污染，剔2.68%。",
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.02593",
          "title": "Fisher-Guided Submodular Data Selection for Continual Pre-Training of Large Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "Fisher/submodular数据选择用于continual pretraining，转基础模型track。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02593",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02588",
      "title": "Open-Endedness Bench: Measuring Epistemic Process from Agent Records",
      "published": "2026-10-01T23:34:37Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02588",
          "title": "Open-Endedness Bench: Measuring Epistemic Process from Agent Records",
          "published": "2026-10-01T23:34:37Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02588",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "OEB将轨迹转act/proposition证据卡，substring核验引用、三次closed-question投票建epistemic图、确定性聚合；无机会abstain且<5机会不计。四能力轴与persona分离，不能总分混加。90人工audit、119已有runs/12tasks，相关非因果；median652judgecalls不宜伪称低价在线reward。官方MIT pipeline/converters及HF scored runs已核。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02588v1",
              "location": "§3–4；§5 audit；§6实验；§8限制"
            },
            {
              "url": "https://github.com/ARA-Labs/oeb",
              "location": "官方作者仓库；释放状态仅在reason明确标注已核者才声明可运行"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02569",
      "title": "Pincer: Resource Authorization for Agents using a Digital Twin",
      "published": "2026-10-01T23:03:12Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02569",
          "title": "Pincer: Resource Authorization for Agents using a Digital Twin",
          "published": "2026-10-01T23:03:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02569",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "Pincer以OS完整资源中介与隔离twin为TCB；可信用户state+PRF逐路径段去语义accesspattern、content与precommittedpolicy三票合取。PRF保护只针对资源名优势，非全系统注入免疫；历史access不等于用户授权。合成两persona各单模型、条件ASR/BGR是资源gate非终局任务成功，implementation/data正文称即将发布，算法可候选但数据集不可声称已公开可运行。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02569v1",
              "location": "§3威胁模型；§5.1–5.6；§6；§7.1–7.2/Table2"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02554",
      "title": "Test-time Multi-agent Coordination by Decomposed Value Gradient Flow",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02554",
          "title": "Test-time Multi-agent Coordination by Decomposed Value Gradient Flow",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "SCOUT为offline MARL生成先验和SVGD action refinement，不是语言模型后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02554",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02554",
          "title": "Test-time Multi-agent Coordination by Decomposed Value Gradient Flow",
          "published": "2026-10-01T22:38:27Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02554",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "SCOUT flow prior/SVGD传统offline MARL，不是LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02549",
      "title": "Evaluating Multi-Dimensional Generalization of Large Language Models in Temporal Extraction Tasks",
      "published": "2026-10-01T22:35:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02549",
          "title": "Evaluating Multi-Dimensional Generalization of Large Language Models in Temporal Extraction Tasks",
          "published": "2026-10-01T22:35:22Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "TimeBank/i2b2 timex/eventx跨域、扰动及长度泛化诊断与Hungarian-LCS分数有价值，但临床数据受限且作者完整变体、划分和评分包未定位，不能直接接统一评测。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02549",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02549v1",
              "location": "§2.1–2.4; §3 model architecture; Limitations",
              "notes": "TimeBank/i2b2 timex/eventx跨域、扰动及长度泛化诊断与Hungarian-LCS分数有价值，但临床数据受限且作者完整变体、划分和评分包未定位，不能直接接统一评测。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02549v1",
          "locations": [
            "§2.1–2.4",
            "§3 model architecture",
            "Limitations"
          ],
          "limitations": "仅保留含目标句，不能代表含空输出分布；Dense与MoE active参数8B/17B等不匹配，架构因果结论不足。少样本实例与测试文档需隔离，表面span提取并非高级时序推理。",
          "code_status": "official_variants_and_evaluator_not_located; clinical source requires data access",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.02549v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "TimeBank/i2b2 timex/eventx跨域、扰动及长度泛化诊断与Hungarian-LCS分数有价值，但临床数据受限且作者完整变体、划分和评分包未定位，不能直接接统一评测。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02542",
      "title": "How To Train Your World Model: Fine-tuning vs RAG for LM-based World Modeling",
      "published": "2026-10-01T22:30:08Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02542",
          "title": "How To Train Your World Model: Fine-tuning vs RAG for LM-based World Modeling",
          "published": "2026-10-01T22:30:08Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02542",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "LM worldmodel研究FT与RAG并提出HWM：同episode排除的历史transition检索条件NTP，query用observation/action分层检索可选；frozenpolicy统一规划流程。五模型环境20组合17胜是作者实验；oracle实际环境与top20后验gold重排只diagnostic，不能给部署策略。非constructedWM在9/20胜说明外推有限，transitionfidelity与taskutility必须分报。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02542v1",
              "location": "§3.1–3.3；§4；§5；§6/Fig4"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02525",
      "title": "Learning What to Investigate Next: Meta-Reasoning for Long-Horizon Research Agents",
      "published": "2026-10-01T21:54:47Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02525",
          "title": "Learning What to Investigate Next: Meta-Reasoning for Long-Horizon Research Agents",
          "published": "2026-10-01T21:54:47Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02525",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "MIRA固定curation/executor仅训练外层workorder/terminate研究决策；共享actorcritic以单token离散return分布KL、决策级GAE与跨版本bootstrap bridge，ratio范围外mask policygradient但保留logratio²penalty，actor/critic独立buffer及optimizer顺序更新。四研究环境、proxy/gold分开；shared初始化来自critic故消融不隔离参数共享本身，内层tool/实验token不训练。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02525v1",
              "location": "§3；§4.1–4.3 Eq1；§5.1–5.4 Eq2–3；§6.3"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02523",
      "title": "Hypothesis-guided discovery of cognitive algorithms via program refinement",
      "published": "2026-10-01T21:53:21Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02523",
          "title": "Hypothesis-guided discovery of cognitive algorithms via program refinement",
          "published": "2026-10-01T21:53:21Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02523",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "从人写FlipPy认知程序出发，Game提出behavioral revision、Coding实现、Audit最多5修复、Inference算行为likelihood；846候选733可执行后语义cluster选24代表，不是全自主理论发现。heldout trial未参与生成/选择，72/137改善；synthetic recovery仅8.4%回收75%预测差距，限制明显。特定领域应用，但受约束程序改进与heldout likelihood选择可形成通用evolve算子；匿名OSF未提供可定位链接，不能声称材料已核实。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02523v1",
              "location": "§4.2–4.3；§5.2–5.4；Reproducibility statement"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02521",
      "title": "Spatial Memory Intelligence: Endowing World Models with Understanding-Driven Long-Term Memory",
      "published": "2026-10-01T21:50:57Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02521",
          "title": "Spatial Memory Intelligence: Endowing World Models with Understanding-Driven Long-Term Memory",
          "published": "2026-10-01T21:50:57Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "Spatial Memory Intelligence 训练 MLLM 的空间聚类、稀疏化、动作检索和可靠性过滤，控制 HY1.5/Wan2.2 长视频生成记忆。正文读完但操作监督与 benchmark 仅承诺发布。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02521",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02521v1",
              "location": "§4.3–4.4; §5.1–5.5; §7; Appendix F",
              "notes": "Spatial Memory Intelligence 训练 MLLM 的空间聚类、稀疏化、动作检索和可靠性过滤，控制 HY1.5/Wan2.2 长视频生成记忆。正文读完但操作监督与 benchmark 仅承诺发布。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.02521v1",
          "locations": [
            "§4.3–4.4; §5.1–5.5; §7; Appendix F"
          ],
          "limitations": "审后延期：100 示范及约千条清洗 rollout 未确认公开；不能将人工规则当作已训练记忆策略；VBench/GPT 裁判与重访重建不是完整生成能力证明。",
          "code_url": "https://spatial-memory-intelligence.github.io/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "审后延期：100 示范及约千条清洗 rollout 未确认公开；不能将人工规则当作已训练记忆策略；VBench/GPT 裁判与重访重建不是完整生成能力证明。",
          "upstream_access_verified": false,
          "fulltext_notes": "Spatial Memory Intelligence 训练 MLLM 的空间聚类、稀疏化、动作检索和可靠性过滤，控制 HY1.5/Wan2.2 长视频生成记忆。正文读完但操作监督与 benchmark 仅承诺发布。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02513",
      "title": "From Fragments to Global Maps: Learning Vectorized Map Aggregation with Large Language Models",
      "published": "2026-10-01T21:35:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02513",
          "title": "From Fragments to Global Maps: Learning Vectorized Map Aggregation with Large Language Models",
          "published": "2026-10-01T21:35:52Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MapMergeLLM道路矢量图聚合，专用自动驾驶地图任务。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02513",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02507",
      "title": "MeshQuery: Agentic Seam Planning for UV Parametrization",
      "published": "2026-10-01T21:30:36Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02507",
          "title": "MeshQuery: Agentic Seam Planning for UV Parametrization",
          "published": "2026-10-01T21:30:36Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MeshQuery三维网格UV展开agent，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02507",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02497",
      "title": "LiteEMG-FM: An Efficient and Deployable Foundation Model for Robust EMG Sensing",
      "published": "2026-10-01T21:19:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02497",
          "title": "LiteEMG-FM: An Efficient and Deployable Foundation Model for Robust EMG Sensing",
          "published": "2026-10-01T21:19:51Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "LiteEMG-FM 是 8M EMG 频谱掩码自编码 CNN/Transformer，覆盖跨用户电信号任务与 ESP32 部署；并非本次基础 LLM/VLM 范围。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02497",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02497v1",
              "location": "§4.1–4.3; §5.1–5.9; §6",
              "notes": "LiteEMG-FM 是 8M EMG 频谱掩码自编码 CNN/Transformer，覆盖跨用户电信号任务与 ESP32 部署；并非本次基础 LLM/VLM 范围。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02497v1",
          "locations": [
            "§4.1–4.3; §5.1–5.9; §6"
          ],
          "limitations": "不因名字含 foundation 就纳入通用大模型；其训练统计与零校准指标是专用传感器任务。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "LiteEMG-FM 是 8M EMG 频谱掩码自编码 CNN/Transformer，覆盖跨用户电信号任务与 ESP32 部署；并非本次基础 LLM/VLM 范围。"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02486",
      "title": "From Retrieval to Typed Decisions: Calibrated System One Models from Biomedical Sentence Encoders",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02486",
          "title": "From Retrieval to Typed Decisions: Calibrated System One Models from Biomedical Sentence Encoders",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "生物sentence encoder转typed-decision模型和RLCD诊断，主要架构/校准研究。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02486",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02480",
      "title": "MEA: A Reward-Driven Multi-Agent System for Faithful Model Explanations",
      "published": "2026-10-01T20:57:29Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02480",
          "title": "MEA: A Reward-Driven Multi-Agent System for Faithful Model Explanations",
          "published": "2026-10-01T20:57:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02480",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "MEA共享backbone Proposer工具策略/Actor解释，以遮挡再query原classifier衡量faithfulness，两段统一terminalGRPO advantage；vision mask面积λ.3与toolcountλ.05抑制gaming，text/tabular top25%约束。三模态及未训练Q8/Q9；遮挡是模型行为诊断非现实因果证明，必须保留真实classifier/XAI调用，不用LLM自评代替。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02480v1",
              "location": "§3.1–3.5 Eq5–9；§4.1；§5"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02478",
      "title": "Tropical Reinforcement Learning",
      "published": "2026-10-01T20:56:11Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02478",
          "title": "Tropical Reinforcement Learning",
          "published": "2026-10-01T20:56:11Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02478",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "Tropic对deterministic resettable环境维护已观测状态/片段图，每轮冻结actor重评分，max-plus prefix/suffix求最佳verified可达路径，frontier补采样与topL拼接必须整路径重放验证；best+低覆盖archive路径per-tokenNLL更新，无rewardbaseline/负向项。四环境两backbone三trainingseeds、heldout实例；不能用gold路径或不具可重置性真实API冒充。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02478v1",
              "location": "§4.1–4.3 Eq11–14；§6/Table2/AppendixC"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02472",
      "title": "APDMem: Agent-Controlled Progressive Disclosure for Query-Adaptive Long-Term Memory",
      "published": "2026-10-01T20:51:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02472",
          "title": "APDMem: Agent-Controlled Progressive Disclosure for Query-Adaptive Long-Term Memory",
          "published": "2026-10-01T20:51:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02472",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "APDMem L0摘要索引/L3原文先建，L1事实/L2turnnotes按需缓存；hybrid+RRF search与agent自主drill，reflection无新证据或20步停，draft→organizednotes→answer。LongMemEvalS500，baseline从文献取非全重跑；onlinecost只本方法有且排除共享answergenerator，不能宣称等预算优于全baseline。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02472v1",
              "location": "§3.1–3.3；§4.1–4.2/Table2"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02466",
      "title": "SD-DPC: Sparse Dictionary Differentiable Predictive Control",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02466",
          "title": "SD-DPC: Sparse Dictionary Differentiable Predictive Control",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "SINDy字典稀疏非线性控制policy，不涉及LM。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02466",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02462",
      "title": "Capability Scaling-Down Laws for LLM Compression",
      "published": "2026-10-01T20:35:12Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02462",
          "title": "Capability Scaling-Down Laws for LLM Compression",
          "published": "2026-10-01T20:35:12Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "按能力分别预测剪枝、量化和蒸馏损失：共享剪枝密度形状、位宽/组大小网格插值，以及独立数据量和训练曝光的蒸馏关系，可用于evolve的预算分配。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02462",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02462v1",
              "location": "§3–4 Eq3–4; §5.1/Table1; §5.2/Table2; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.02462v1",
              "location": "§3–4 Eq3–4; §5.1/Table1; §5.2/Table2; official README",
              "notes": "按能力分别预测剪枝、量化和蒸馏损失：共享剪枝密度形状、位宽/组大小网格插值，以及独立数据量和训练曝光的蒸馏关系，可用于evolve的预算分配。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02462v1",
          "locations": [
            "§3–4 Eq3–4",
            "§5.1/Table1",
            "§5.2/Table2",
            "official README"
          ],
          "limitations": "系数跨模型家族不可直接迁移；Table2带†规则是在看测试后选择，必须新val冻结；测量节省≠能力提升。官方提供分析/测量镜像但不含原教师文本及adapter权重，V47freeze缺失以V70替代明确披露；不得将分析旧日志算新训练。",
          "code_url": "https://github.com/LabRAI/scaling_down_law",
          "code_status": "official pipeline and audit artifacts available; some original inputs explicitly absent",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02462v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "按能力分别预测剪枝、量化和蒸馏损失：共享剪枝密度形状、位宽/组大小网格插值，以及独立数据量和训练曝光的蒸馏关系，可用于evolve的预算分配。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02460",
      "title": "CUEing User Simulators: Calibrated User Embeddings for Multi-Turn Benchmarking",
      "published": "2026-10-01T20:34:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02460",
          "title": "CUEing User Simulators: Calibrated User Embeddings for Multi-Turn Benchmarking",
          "published": "2026-10-01T20:34:16Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02460",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "CUE将userturn与前序assistant attention编码、slotcommanddecoder及latentdiffusion采样，content抑制不保证去除任务/结果信息。completed-human-trajectory条件replay是回顾校准而非未来预测；无目标轨迹的sampledpersona才新用户模拟，sessionmixture不等于人群分布。483tauUSI及heldout SimulatorArena/PRISM；官方Apache2 runtime/training和HF模型/annotation/examplepool入口可用，未执行代码。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02460v1",
              "location": "§3.1–3.2；§4.1–4.2；§7；官方README Quickstart/Training"
            },
            {
              "url": "https://github.com/Handshake-AI-Research/CUE-user-simulator",
              "location": "README public Apache2 runtime src/cue,training,CLI,HuggingFace model/data links"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02452",
      "title": "Reinforcement Learning Techniques for the Optimization of Target Polarization in Nuclear Physics Scattering Experiments",
      "published": "2026-10-01T20:22:54Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02452",
          "title": "Reinforcement Learning Techniques for the Optimization of Target Polarization in Nuclear Physics Scattering Experiments",
          "published": "2026-10-01T20:22:54Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02452",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "核物理极化GP surrogate与传统RL控制，无语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02451",
      "title": "A Simulation-Grounded Agentic VLM Framework for Wildfire Monitoring and Reporting",
      "published": "2026-10-01T20:22:10Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02451",
          "title": "A Simulation-Grounded Agentic VLM Framework for Wildfire Monitoring and Reporting",
          "published": "2026-10-01T20:22:10Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "野火监控仿真与多模态记忆agent，专用应用由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02451",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02444",
      "title": "Counterexample Generation via Per-Theorem Symbolic Verifiers: When Imitation Hurts and Reinforcement Repairs",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02444",
          "title": "Counterexample Generation via Per-Theorem Symbolic Verifiers: When Imitation Hurts and Reinforcement Repairs",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "SymCE公开反例任务/逐定理Python verifier/结构schema和dense/sparse reward，可作RLVR/evolve评测；作者仓库含corpus/splits、oracle/sandbox、runner及逐条结果。schema由canonical witness构造，需审查是否泄漏答案形状，隔离任意Python执行。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02444v1",
              "location": "§3.1–3.5；§5.2；§6"
            },
            {
              "url": "https://github.com/ce-rlvr/SymCE",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "SymCE counterexample语料/verifier与SFT、GRPO对照，主要数据及现象研究，未提出新训练算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02442",
      "title": "AI-driven Thermal-aware Data Center Capacity Planning",
      "published": "2026-10-01T20:09:25Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02442",
          "title": "AI-driven Thermal-aware Data Center Capacity Planning",
          "published": "2026-10-01T20:09:25Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "数据中心热感知容量规划CFD替代器，非基础模型核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02442",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02432",
      "title": "Evaluating and Improving the Robustness of Large Language Models to Input Sequence Variations",
      "published": "2026-10-01T19:57:56Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02432",
          "title": "Evaluating and Improving the Robustness of Large Language Models to Input Sequence Variations",
          "published": "2026-10-01T19:57:56Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02432",
          "location": "Title and complete abstract",
          "decision": "rejected",
          "reason": "Agent相关正文是MCPSec/MCPBench与AttestMCP固定权限表+HMAC、CommitBoundary容器/静态检查/输出验证，§5.3明确沿用2025前作[11]（arXiv2601.17549）。847案例及ASR53.7→12.4为组合安全工程评估，无本轮独立新Agent算法/新公共入口；HMAC只保完整性不授权，允许参数内恶用仍通过。按重复综合工程而非仅benchmark无loss排除。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02432v1",
              "location": "§5.3.4–5.3.5 Algorithms3–4；§5.4/Table5.3；Reference11"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02425",
      "title": "Finding the Move Is Not Winning the Game: XiangqiBench for Closed-Loop Evaluation of LLM Agents",
      "published": "2026-10-01T19:48:08Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02425",
          "title": "Finding the Move Is Not Winning the Game: XiangqiBench for Closed-Loop Evaluation of LLM Agents",
          "published": "2026-10-01T19:48:08Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02425",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "XiangqiBench119搜索+人工验证残局（非形式证明），gold解法不入agent工具；40ply/depth18固定defender、三次连续非法失败、简化重复规则。8568轨迹12模型2设置3trial，pass@3与全部成功分报；Sighted/Restricted提示也不同。官方MIT run/score与数据卡公开，PikafishGPL另计，原NNUE被替换须冻结engine+network不可直接换新版。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02425v1",
              "location": "§3任务/工具；§4协议；§5结果/限制"
            },
            {
              "url": "https://github.com/floatai/xiangqibench",
              "location": "官方作者仓库；释放状态仅在reason明确标注已核者才声明可运行"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02404",
      "title": "Trained Agentic Context Management",
      "published": "2026-10-01T19:32:12Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02404",
          "title": "Trained Agentic Context Management",
          "published": "2026-10-01T19:32:12Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "自调用与上下文管理训练属于agent track。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02404",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02404",
          "title": "Trained Agentic Context Management",
          "published": "2026-10-01T19:32:12Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02404",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "训练agenticcontextmanagement：最小read_chunk/spawn工具，SFT oracle合成tree-reduce/sequential-fold/边界扩读策略，非成功RL方法（RL退化）。RULER每type5、OOLONG每family10且nativebaselinecontext不同，8kagentbudget可扩展但未正式量化成本；temperature经验选需另设validation，不能把oracle训练脚本开放给评测agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02404v1",
              "location": "§1.1；§3/Fig2–4；§4；AppendicesB/C"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02396",
      "title": "Inherit-MAS: Test-Time Evolution of Multi-Agent Systems through Workflow and Execution Inheritance",
      "published": "2026-10-01T19:23:32Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02396",
          "title": "Inherit-MAS: Test-Time Evolution of Multi-Agent Systems through Workflow and Execution Inheritance",
          "published": "2026-10-01T19:23:32Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02396",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "InheritMAS对latest-incumbent DAG先prune再一次edit，最终单独judgelexicographic排名；继承仅exact resolvedrequest含模型/参数/上游/环境指纹且recordhash有效的只读节点，statechanging sink每次live。WorkBench/HotpotQA，部分baseline retrievalbudget非完全同，inheritedtoken只是等价历史量不是实际消耗；judge最高不保证真实utility单调。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02396v1",
              "location": "§4.1–4.5 Eq3–7；§5.1–5.2"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02388",
      "title": "Octrees as an Explicit 3D Language",
      "published": "2026-10-01T19:10:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02388",
          "title": "Octrees as an Explicit 3D Language",
          "published": "2026-10-01T19:10:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "OctLLM 以稀疏六级 octree、独立 3D 分支和 3D RoPE 共用冻结 Qwen2.5-VL，另训占据补全并接 TRELLIS 解码。Objaverse-XL/HSSD/ABO/ShapeNet 与 Toys4K/PointLLM200 可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02388",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02388v1",
              "location": "§3.1–3.4; §4.1–4.3; Appendix A/B/D/E",
              "notes": "OctLLM 以稀疏六级 octree、独立 3D 分支和 3D RoPE 共用冻结 Qwen2.5-VL，另训占据补全并接 TRELLIS 解码。Objaverse-XL/HSSD/ABO/ShapeNet 与 Toys4K/PointLLM200 可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02388v1",
          "locations": [
            "§3.1–3.4; §4.1–4.3; Appendix A/B/D/E"
          ],
          "limitations": "195k 资产排除 PointLLM200；12 分支约 2.8B 可训练参数，非微小 adapter；TRELLIS 外部解码和许可必须保留；正文称已发布但本轮未核验链接。",
          "code_url": "https://plurato.github.io/OctLLM-page/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "OctLLM 以稀疏六级 octree、独立 3D 分支和 3D RoPE 共用冻结 Qwen2.5-VL，另训占据补全并接 TRELLIS 解码。Objaverse-XL/HSSD/ABO/ShapeNet 与 Toys4K/PointLLM200 可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02386",
      "title": "Social bot detection in the age of ChatGPT: Challenges and opportunities",
      "published": "2026-10-01T19:08:58Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02386",
          "title": "Social bot detection in the age of ChatGPT: Challenges and opportunities",
          "published": "2026-10-01T19:08:58Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "社交机器人检测综述，无新基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02386",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02376",
      "title": "Coco: An Agentic Copilot for the Hardware--Software Co-Design Lifecycle",
      "published": "2026-10-01",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02376",
          "title": "Coco: An Agentic Copilot for the Hardware--Software Co-Design Lifecycle",
          "published": "2026-10-01",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02376v1",
          "location": "全文§1–6；§3四层stack；§4 Early experience；§5.1–5.2两个案例",
          "decision": "rejected",
          "reason": "Google/Google DeepMind与MIT的Coco已有TPU架构师日常部署，但正文仅系统设计和两个case study，未提供可复核算法benchmark/量化对照；不通过本轮独立复现门槛，保留高优先部署研究线索。",
          "reviewer": "agent_review",
          "evidence": "§3 normalized SQL datastore、typed API、iso-sharding/iso-batch执行比较、按latency并行subagent与reviewer及导航状态上下文；§4 daily use。",
          "limitations": "2× time-to-simulation/time-to-insight是明确headline target，不是实测提升；无A/B、无对照实验表，未发现代码或数据发布链接。",
          "institution": "Google; Google DeepMind; MIT",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02375",
      "title": "EviDent-CBCT: Evidence-Bottlenecked Report Generation from Dental CBCT under Non-Exhaustive Report Supervision",
      "published": "2026-10-01T18:54:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02375",
          "title": "EviDent-CBCT: Evidence-Bottlenecked Report Generation from Dental CBCT under Non-Exhaustive Report Supervision",
          "published": "2026-10-01T18:54:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "牙科CBCT报告离散证据瓶颈，专用医疗应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02375",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02369",
      "title": "Automating the Application of HCI Principles: Skills for On-Demand UI Construction, the Human-AI Space to Think, and the Future of HCI",
      "published": "2026-10-01T18:45:43Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02369",
          "title": "Automating the Application of HCI Principles: Skills for On-Demand UI Construction, the Human-AI Space to Think, and the Future of HCI",
          "published": "2026-10-01T18:45:43Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02369",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "HCI原则作为skills的研究议程/概念框架，无实际新算法评测。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02361",
      "title": "SEDIMA: Cross-Run Hierarchical Insight Memory for Evolutionary Search Agents",
      "published": "2026-10-01T18:38:31Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02361",
          "title": "SEDIMA: Cross-Run Hierarchical Insight Memory for Evolutionary Search Agents",
          "published": "2026-10-01T18:38:31Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02361",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "SEDIMA每evaluation写raw→LLMinsight→attentioncentroid cluster，mutation前cluster/insight检索与证据trace→3建议，不改evolve搜索器。AlgoTune/ALE私有评分与publicfitness分离、memory由disjoint问题建；cold也在线写记忆。100候选匹配不等token/calls，主表单run，ablation/transfer才3seeds；boundedcontext非总检索常数成本。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02361v1",
              "location": "§3；§4.1；§4.4/Table3；AppendixA"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02359",
      "title": "Lexicographic Multi-Objective On-Policy Distillation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02359",
          "title": "Lexicographic Multi-Objective On-Policy Distillation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "LMOPD按最高优先未满足reward路由expert，再对centered log-policy correction一次顺序投影成virtual teacher；真实多expert实验，但专有训练语料、单次非正交投影不保证全部约束或reward级无退化。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02359",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02359v1",
              "location": "§3.3–3.4 Eq.5/8–10；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02351",
      "title": "DeReAct: Decomposed Reasoning and Acting for Reliable AI Agents",
      "published": "2026-10-01T18:25:07Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02351",
          "title": "DeReAct: Decomposed Reasoning and Acting for Reliable AI Agents",
          "published": "2026-10-01T18:25:07Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02351",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "DeReAct Brain提intent/command、独立Critic按约束failclosed gate、CM只保环境支持state并判完成，Brain另见首5+recentwindow。GAIA165/SWE489 native非LLM成功评分，3attempt pass1与pass3，groundingjudge另算；CM是模型判定非形式验证，Claudecritic/CM固定且非真实外部副作用验证，不能把successflag替换真实benchmarktest。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02351v1",
              "location": "§3/Algorithm1；§4.1；§4.5；§6"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02349",
      "title": "MIRROR: Multipath Quorum Integrity for LLM Multi-Agent Communication",
      "published": "2026-10-01T18:22:22Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02349",
          "title": "MIRROR: Multipath Quorum Integrity for LLM Multi-Agent Communication",
          "published": "2026-10-01T18:22:22Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02349",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "MIRROR发送端一次生成canonicalbytes，5逻辑路由3payload2digest majority恢复；unkeyedhash非认证，安全完全依诚实endpoint且受控routes<半数/二次原像。AutoGen/CAMEL/MetaGPT和Gemma/Gemini评测只logicalroutes同backend、无真实独立故障域/时延测量；只抗in-transit篡改，不抗已被注入sender，须保留此条件。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02349v1",
              "location": "§3.1–3.6；§4.1/4.4；§5"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02344",
      "title": "Drive vs. Decay: On the Training Dynamics of Joint-Embedding Predictive Architectures",
      "published": "2026-10-01T18:16:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02344",
          "title": "Drive vs. Decay: On the Training Dynamics of Joint-Embedding Predictive Architectures",
          "published": "2026-10-01T18:16:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ResidualPred以残差预测器和对角注意力初始化抑制JEPA塌缩；表5五种子、同ImageNet1K30epoch预算控制支持新机制。",
          "review_level": "fulltext",
          "official_url": "https://arxiv.org/html/2610.02344v1",
          "locations": [
            "§4",
            "§5",
            "§6.1–6.2/Table4/Table5",
            "§7–8"
          ],
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02344",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02344v1",
              "location": "§4; §5; §6.1–6.2/Table4/Table5; §7–8"
            },
            {
              "url": "https://arxiv.org/html/2610.02344v1",
              "location": "§4; §5; §6.1–6.2/Table4/Table5; §7–8",
              "notes": "ImageNet1K30epoch depth6：I-JEPA25.22±0.80，SIGReg29.19±0.54，ResPred31.69±0.22，组合32.23±0.54；冻结预测器仍塌缩，需真正训练。"
            }
          ],
          "limitations": "线性drive/decay理论不直接证明非线性网络；90epoch优势缩小；未跑完整官方I-JEPA规模。",
          "code_url": "https://github.com/jose-melo/drive-vs-decay",
          "institution": "Université Paris-Saclay / CNRS / CentraleSupélec / LISN",
          "implementation_status": "not_implemented",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "fulltext_notes": "ImageNet1K30epoch depth6：I-JEPA25.22±0.80，SIGReg29.19±0.54，ResPred31.69±0.22，组合32.23±0.54；冻结预测器仍塌缩，需真正训练。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02330",
      "title": "Choosing Before Acting: Comparative Value Estimation for Long-Horizon Tool-Use Agents",
      "published": "2026-10-01T18:04:04Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02330",
          "title": "Choosing Before Acting: Comparative Value Estimation for Long-Horizon Tool-Use Agents",
          "published": "2026-10-01T18:04:04Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02330",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "CITA/CIM由observed同context成功率、Bayesian图synthetic无真实API、LLM模拟比较三源训练valueBCE+gapMSE+transitivity/confidence，Vc排名nexttool，confidenceweightedvalue与taskreward混合GRPO。Toolathlon/TOUCAN/TRAJECT、Qwen7B/Llama8B；value不是因果反事实真值，sandbox必须标synthetic，真实闭环评估不可由自身CIM评分替代。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02330v1",
              "location": "§3.2–3.5 Eq3–13；§4.1；§5"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02324",
      "title": "Slow-Fast Multi-Teacher On-Policy Distillation for Capability Preservation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02324",
          "title": "Slow-Fast Multi-Teacher On-Policy Distillation for Capability Preservation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "SF-MOPD维持EMA慢学生，以slow-fast logprob方向去除teacher冲突部分并JSD蒸馏+原MOPD正则；QwenVL2/4/8B多domain实测，需真实EMA参数而非固定reference替代。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02324",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02324v1",
              "location": "§2.2–2.4 Eq.4–10；§3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02323",
      "title": "World-Calibrated Proposal-to-Action Flow for Vision-Language-Action Models",
      "published": "2026-10-01T18:00:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02323",
          "title": "World-Calibrated Proposal-to-Action Flow for Vision-Language-Action Models",
          "published": "2026-10-01T18:00:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ProAct具有完整公开训练核心，proposal/world-calibration/anisotropic flow可进入候选，先限LIBERO可执行路径。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02323",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02323v1",
              "location": "§2.2–2.4 Eq2–11; §3; App A/E/F; 官方README"
            },
            {
              "url": "https://arxiv.org/html/2610.02323v1",
              "location": "§2.2–2.4 Eq2–11; §3; App A/E/F; 官方README",
              "notes": "已执行actionhistory EMA动量→6层proposal与18层VLM三层KV可靠性fusion；VJEPA2-AC仅未来trainingtarget，worldquery同时预测未来和proposalresidual extent/covshape。trace归一低秩B并约束norm²≤5，σ控制幅度，anisotropic source经actionflow。LIBERO98.4/500rolloutpersuite；官方core/train/server/LIBEROeval公开。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.02323v1",
          "locations": [
            "§2.2–2.4 Eq2–11",
            "§3",
            "App A/E/F",
            "官方README"
          ],
          "limitations": "非counterfactualworldmodel，专家未来而非proposal执行未来。公开无trainedProActweights/完整RoboTwinrollout；π0.5初始化不能冒称复现权重。规范化Da已在pipeline吸收不可双乘，history只已执行并episode重置；cacheframe latency不含传输/仿真不等闭环速度。",
          "code_url": "https://github.com/JiuTian-VL/ProAct",
          "implementation_status": "not_implemented",
          "fulltext_notes": "已执行actionhistory EMA动量→6层proposal与18层VLM三层KV可靠性fusion；VJEPA2-AC仅未来trainingtarget，worldquery同时预测未来和proposalresidual extent/covshape。trace归一低秩B并约束norm²≤5，σ控制幅度，anisotropic source经actionflow。LIBERO98.4/500rolloutpersuite；官方core/train/server/LIBEROeval公开。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02320",
      "title": "DeskForge: Dense Supervision from Desktop Environments for Computer-Use Agents",
      "published": "2026-10-01T18:00:05Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02320",
          "title": "DeskForge: Dense Supervision from Desktop Environments for Computer-Use Agents",
          "published": "2026-10-01T18:00:05Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "DeskForge桌面交互数据与benchmark，agent track范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02320",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02304",
      "title": "SimuVerity: Benchmarking Agents for Engineering-Grade Simulink Model Generation",
      "published": "2026-10-01T17:58:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02304",
          "title": "SimuVerity: Benchmarking Agents for Engineering-Grade Simulink Model Generation",
          "published": "2026-10-01T17:58:03Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02304",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "SimuVerity101任务10工程域，publicspec/profile与hidden场景阈值隔离；交付/执行/工程qualification三gate后六维评分，非交付/候选故障计失败、基础设施故障重跑。6agent每任务3次，10强任务消融为选择性子集非总体因果。官方Apache2仓库公开101任务/scenarios/scorers/reference或importrecipe与结果验证；运行依赖逐任务MATLAB/Simulink商业产品和第三方资产许可。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02304v1",
              "location": "§3.1–3.4；§4.1/4.6；官方README Repository Contents/License"
            },
            {
              "url": "https://github.com/SimuVerity/SimuVerity",
              "location": "官方README已读：公开内容/执行条件/许可"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02298",
      "title": "EditHero: A Benchmark for Long-Horizon Part-Level 3D Editing and Vibe Modeling",
      "published": "2026-10-01T17:50:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02298",
          "title": "EditHero: A Benchmark for Long-Horizon Part-Level 3D Editing and Vibe Modeling",
          "published": "2026-10-01T17:50:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "EditHero由part library与操作日志重建457链2755turn的精确3D目标，self-rollout分开编辑区/保持区与no-op/regeneration对照，可补多轮生成评价。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02298",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02298v1",
              "location": "§3 construction; §4 protocol; §5.1; Appendix9/12/18",
              "notes": "EditHero由part library与操作日志重建457链2755turn的精确3D目标，self-rollout分开编辑区/保持区与no-op/regeneration对照，可补多轮生成评价。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02298v1",
          "locations": [
            "§3 construction",
            "§4 protocol",
            "§5.1",
            "Appendix9/12/18"
          ],
          "limitations": "被测方法可见当轮目标render但不可见操作日志/GT3D；VoxHammer另给gold mask，属不同信息条件。只完成turn平均会受失败删失影响，须分报完成率；conditioning/heldout views分开，资产许可证逐源核。",
          "code_url": "https://github.com/AlayaLab/EditHero",
          "code_status": "official project/repository linked; not executed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02298v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "EditHero由part library与操作日志重建457链2755turn的精确3D目标，self-rollout分开编辑区/保持区与no-op/regeneration对照，可补多轮生成评价。"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02298",
          "title": "EditHero: A Benchmark for Long-Horizon Part-Level 3D Editing and Vibe Modeling",
          "published": "2026-10-01T17:50:53Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02298",
          "location": "Title and complete abstract",
          "decision": "pending",
          "reason": "EditHero457链2755编辑252hosts，exact日志隔离；自rollout、1conditioning+3heldout视图，IF/CC分别编辑/未编辑区域。Agent仅55链416turn可见编辑选择子集，均值按已完成turn故须同时报coverage。已读方法/实验，但官方README中benchmark engine/eval code及HF edit-chain发布仍未勾选，无法接公共执行入口，暂缓不是未读。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02298v1",
              "location": "§3–4；§5.4；Appendix16；官方README Roadmap"
            },
            {
              "url": "https://github.com/AlayaLab/EditHero",
              "location": "官方作者仓库；释放状态仅在reason明确标注已核者才声明可运行"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02284",
      "title": "Effects of interpulse-interval variation on deep-learning classification of bat vocalizations",
      "published": "2026-10-01T14:01:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02284",
          "title": "Effects of interpulse-interval variation on deep-learning classification of bat vocalizations",
          "published": "2026-10-01T14:01:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "蝙蝠物种声学分类时间间隔因素实验，非基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02284",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02270",
      "title": "Reliability Stress Tests and Decision-Time Routing for Chest X-ray Vision-Language Models",
      "published": "2026-10-01T06:23:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02270",
          "title": "Reliability Stress Tests and Decision-Time Routing for Chest X-ray Vision-Language Models",
          "published": "2026-10-01T06:23:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "胸片VLM可靠性压力测试与多agent路由，专用医疗评测。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02270",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02267",
      "title": "Fast Models, Slow Evidence: A Paired and Self-Audited Evaluation of System-1 Decision Models for LLM Agent Harnesses",
      "published": "2026-10-01T05:57:14Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02267",
          "title": "Fast Models, Slow Evidence: A Paired and Self-Audited Evaluation of System-1 Decision Models for LLM Agent Harnesses",
          "published": "2026-10-01T05:57:14Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02267",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Laya/Jev System1决策模型成对评测及自审，非新模型。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02247",
      "title": "Toward Controlling Biology with Language:Offline Learning of Prompt-Conditioned Interventions for Cells, Organoids, and Biobots",
      "published": "2026-09-30T16:49:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02247",
          "title": "Toward Controlling Biology with Language:Offline Learning of Prompt-Conditioned Interventions for Cells, Organoids, and Biobots",
          "published": "2026-09-30T16:49:01Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "既有生物干预档案的语言检索与离线映射应用，无通用基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02247",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02241",
      "title": "Hardware-Native Joint Sparse-Quantization for Trillion-Scale Mixture-of-Experts",
      "published": "2026-09-29T07:58:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02241",
          "title": "Hardware-Native Joint Sparse-Quantization for Trillion-Scale Mixture-of-Experts",
          "published": "2026-09-29T07:58:06Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "pending",
          "reason": "moesq用Gumbel支持模式与量化值联合优化，router加权expert重构，paired4:8 NVFP4和Blackwell SpTC grouped kernel是论文定义性路径；现有A100/A30不能验证该原生路径。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02241",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.02241v1",
              "location": "§3.1–3.4 Eq1–5; §4; Appendix B/D.1"
            },
            {
              "url": "https://arxiv.org/html/2610.02241v1",
              "location": "§3.1–3.4 Eq1–5; §4; Appendix B/D.1",
              "notes": "moesq用Gumbel支持模式与量化值联合优化，router加权expert重构，paired4:8 NVFP4和Blackwell SpTC grouped kernel是论文定义性路径；现有A100/A30不能验证该原生路径。"
            }
          ],
          "source": "https://arxiv.org/html/2610.02241v1",
          "locations": [
            "§3.1–3.4 Eq1–5",
            "§4",
            "Appendix B/D.1"
          ],
          "limitations": "SGPTQ初始化512×4096、refine8192、val128同混合语料；router冻结并缓存专家输入，再按压缩prefix逐层校准。核心是NVFP4 sparse MMA，CPU/CUDA fakequant只能机制诊断；真实B200系统验证尚缺，不冒称A100等价。",
          "code_status": "author algorithm explained; no verified complete public native kernel release in examined text",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.02241v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "moesq用Gumbel支持模式与量化值联合优化，router加权expert重构，paired4:8 NVFP4和Blackwell SpTC grouped kernel是论文定义性路径；现有A100/A30不能验证该原生路径。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02206",
      "title": "KaliBench: A Fine-Grained Benchmark for Cybersecurity Tool Use on Kali Linux with Runtime-Free Verifiable Rewards",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02206",
          "title": "KaliBench: A Fine-Grained Benchmark for Cybersecurity Tool Use on Kali Linux with Runtime-Free Verifiable Rewards",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "KaliBench公开8504 query-command/1642工具数据与runtime-free shlex评分，三个信息条件、alias-aware参数匹配可作工具使用评测。仅离线命令字符串评分，不等同实际环境执行成功；不得自动对真实目标执行命令。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02206v1",
              "location": "§3 Evaluation Protocol；§4；Appendix L"
            },
            {
              "url": "https://github.com/RISys-Lab/KaliBench",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "KaliBench数据与CLI评测/runtime-free reward，用现有SFT和RLVR，非独立新策略算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02206",
          "title": "KaliBench: A Fine-Grained Benchmark for Cybersecurity Tool Use on Kali Linux with Runtime-Free Verifiable Rewards",
          "published": "2026-10-01T17:59:55Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.02206v1",
          "location": "§3 Evaluation Protocol；§4；Appendix L；作者仓库README/文件列表已只读核查",
          "decision": "accepted",
          "reason": "KaliBench公开8504 query-command/1642工具数据与runtime-free shlex评分，三个信息条件、alias-aware参数匹配可作工具使用评测。仅离线命令字符串评分，不等同实际环境执行成功；不得自动对真实目标执行命令。",
          "id": "2610.02206",
          "repository_status": "new",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02206v1",
              "location": "§3 Evaluation Protocol；§4；Appendix L"
            },
            {
              "url": "https://github.com/RISys-Lab/KaliBench",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "KaliBench数据与CLI评测/runtime-free reward，用现有SFT和RLVR，非独立新策略算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "reviewer": "post_training_review_reused",
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02204",
      "title": "Reconstruct, Practice, Go Real: Guided Self-Improvement for Embodied Agents",
      "published": "2026-10-01T17:59:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02204",
          "title": "Reconstruct, Practice, Go Real: Guided Self-Improvement for Embodied Agents",
          "published": "2026-10-01T17:59:50Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02204",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "RPG从ABC视频重建MuJoCo任务并人工检查冻结evaluator；Runtime只部署观测，privileged独立episode供failureanalysis，Implementor修改skill/prompt，paired5seeds跨22任务gate平均增且单任务不降超.2，merge后重测。15轮单run/候选compute不匹配；savedround heldoutseed回顾评测非未见task，3实机各10trial统一标定冻结，不把privileged轨迹当部署policy。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "post_training_cross_track": false,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02204v1",
              "location": "§III-A–E Eq1–2；§IV-A/Fig4；§IV-E"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02202",
      "title": "ScholarCatalyst: A Benchmark for Retrieving Papers That Inspire New Research",
      "published": "2026-10-01T17:59:47Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02202",
          "title": "ScholarCatalyst: A Benchmark for Retrieving Papers That Inspire New Research",
          "published": "2026-10-01T17:59:47Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02202",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "ScholarCatalyst207真实项目894查询（207Core/687Sub）作者验证inspiration与hard negatives，删solution泄漏并按源论文完成时间截断corpus。Recall标签不完备；oracle候选重排只诊断不供agent。公开191k文档、evaluation及受限本地corpus agentic-search脚本，CCBYNC4，适合检索/科研评测入口而非新训练loss。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02202v1",
              "location": "§3数据构建/时间/验证；§4检索与agent结果"
            },
            {
              "url": "https://github.com/stanford-iris-lab/ScholarCatalyst",
              "location": "官方作者仓库；释放状态仅在reason明确标注已核者才声明可运行"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02199",
      "title": "TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning",
      "published": "2026-10-01T17:59:42Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02199",
          "title": "TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning",
          "published": "2026-10-01T17:59:42Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录taco-optimizer，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02199",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02196",
      "title": "InterEvolve: Test-Time Evolution of Reward Programs for Humanoid Loco-Manipulation",
      "published": "2026-10-01T17:59:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02196",
          "title": "InterEvolve: Test-Time Evolution of Reward Programs for Humanoid Loco-Manipulation",
          "published": "2026-10-01T17:59:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "InterEvolve 在冻结 forward-backward 运动先验上进化分阶段奖励程序，内层 CMA-ES 调参数、外层 LLM 调结构，固定场景验证并复用已核验技能。OMOMO/GRAB 与模拟八类任务可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02196",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02196v1",
              "location": "§3.1–3.4; §4.1–4.4; Appendix B/D/E",
              "notes": "InterEvolve 在冻结 forward-backward 运动先验上进化分阶段奖励程序，内层 CMA-ES 调参数、外层 LLM 调结构，固定场景验证并复用已核验技能。OMOMO/GRAB 与模拟八类任务可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02196v1",
          "locations": [
            "§3.1–3.4; §4.1–4.4; Appendix B/D/E"
          ],
          "limitations": "必须保持 verifier/进化场景与最终测试隔离；奖励可使用特权模拟状态但不能将测试正确计划交给策略；真实 G1 硬件演示不等于本地可验证。",
          "code_url": "https://sirui-xu.github.io/InterEvolve",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "InterEvolve 在冻结 forward-backward 运动先验上进化分阶段奖励程序，内层 CMA-ES 调参数、外层 LLM 调结构，固定场景验证并复用已核验技能。OMOMO/GRAB 与模拟八类任务可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02191",
      "title": "The Missing Primitive: Diagnosing and Repairing Mathematical Reasoning in Large Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02191",
          "title": "The Missing Primitive: Diagnosing and Repairing Mathematical Reasoning in Large Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Absorb以数学primitive为训练teacher特权，用reverse-KL单侧clamp限制压低学生偏好的强度，保留正向teacher指导；Prim/HLE/HMMT/Omni实测。gold primitive不得进入被评价student。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02191",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02191v1",
              "location": "§4.1–4.4；Appendix E"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02190",
      "title": "Trust the Direction, Search the Step: Zero-and-First-Order Methods for LLM Fine-Tuning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02190",
          "title": "Trust the Direction, Search the Step: Zero-and-First-Order Methods for LLM Fine-Tuning",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "ZFO沿基础一阶optimizer方向，用同batch正负两次前向估二三阶导，Taylor/Padé区间择步并奇点fallback；真实LLM微调与开销实验，须匹配额外前向预算。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02190",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02190v1",
              "location": "§2 Algorithm1；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02189",
      "title": "Generative modeling of intrinsically disordered protein regions by reinforcing sparse autoencoder features",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02189",
          "title": "Generative modeling of intrinsically disordered protein regions by reinforcing sparse autoencoder features",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "蛋白IDR专用LM及SAE功能控制，非本track的通用LLM RL/OPD能力方向。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02189",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02181",
      "title": "OmniSeek: Native Tool Integration for Multi-turn Audio-Visual Reasoning",
      "published": "2026-10-01T17:58:16Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02181",
          "title": "OmniSeek: Native Tool Integration for Multi-turn Audio-Visual Reasoning",
          "published": "2026-10-01T17:58:16Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "OmniSeek多轮视听主动搜索工具策略与RL训练，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02181",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02173",
      "title": "Every Ablation Is a Dose: Counterweights and the Semblance of Self-Repair",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02173",
          "title": "Every Ablation Is a Dose: Counterweights and the Semblance of Self-Repair",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "组件ablation的self-repair因果解释，非后训练算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02173",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02163",
      "title": "AutoCompact: Learning When to Compact Context in Long-Horizon Coding Agents",
      "published": "2026-10-01T17:54:34Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02163",
          "title": "AutoCompact: Learning When to Compact Context in Long-Horizon Coding Agents",
          "published": "2026-10-01T17:54:34Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录autocompact，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02163",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.02163",
          "title": "AutoCompact: Learning When to Compact Context in Long-Horizon Coding Agents",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已在Agent目录收录AutoCompact，避免跨track重复实现。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02163",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12605：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02161",
      "title": "DuoMind: Enabling Distributed Multi-Robot Coordination with Semantic Communication",
      "published": "2026-10-01T17:53:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02161",
          "title": "DuoMind: Enabling Distributed Multi-Robot Coordination with Semantic Communication",
          "published": "2026-10-01T17:53:09Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02161",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "DuoMind每机器人VLM高层orchestrator、VLA动作，四字段意图/子目标/信念/可选不确定性通信，无联合特殊训练；7RoboPoly+8RoboTwin双臂改分布、每任务50双机器人demo转100单体训练。共享global相机+本地wrist，模拟两机器人非实机大群体；通信与π0替换消融支持模块可复用，不能宣称更大规模部署。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02161v1",
              "location": "§2方法；§3.1–3.3与消融"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02159",
      "title": "When Do Intrinsic Rewards Lead to Exploration?",
      "published": "2026-10-01T17:52:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02159",
          "title": "When Do Intrinsic Rewards Lead to Exploration?",
          "published": "2026-10-01T17:52:41Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02159",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "intrinsic reward反事实信息探索理论，非LLM策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02150",
      "title": "From Knowledge Access to Source Learning: Developing Source-Specific Competence",
      "published": "2026-10-01T17:50:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02150",
          "title": "From Knowledge Access to Source Learning: Developing Source-Specific Competence",
          "published": "2026-10-01T17:50:16Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02150",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "SourceLearn持久source-grounded实体表示，Inspect/Deepen/Connect自学+consolidate；taskguided只用训练guidance答案诊断缺证据并重读source，更新representation/prompt不是模型权重。五任务、3次30/70guidance/test分割与AppWorld官方split；测试答案不得进入memory，QA judge与原生执行指标分开。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02150v1",
              "location": "§3 self-study/task-guided；§4 setup/results"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02148",
      "title": "Omni-Embed-Mini: Binding Modalities Without Forgetting via Dense Distillation",
      "published": "2026-10-01T17:49:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02148",
          "title": "Omni-Embed-Mini: Binding Modalities Without Forgetting via Dense Distillation",
          "published": "2026-10-01T17:49:40Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录omni-embed-mini，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02148",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02144",
      "title": "Faynt: Scaling and Optimizing Policies for Competitive Melee",
      "published": "2026-10-01T17:48:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02144",
          "title": "Faynt: Scaling and Optimizing Policies for Competitive Melee",
          "published": "2026-10-01T17:48:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Faynt针对SmashBros游戏的专用RL策略，非通用基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02144",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02142",
      "title": "Keyword Harnesses Fail Open: A Cheap Diagnostic Ladder for Tool-Use Claims in Small Language Models",
      "published": "2026-10-01T17:46:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02142",
          "title": "Keyword Harnesses Fail Open: A Cheap Diagnostic Ladder for Tool-Use Claims in Small Language Models",
          "published": "2026-10-01T17:46:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "关键词harness安全诊断与修补实验，核心为agent诊断。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02142",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02140",
      "title": "Finetuning with Sampling: SFT Learns Better Than You Think",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02140",
          "title": "Finetuning with Sampling: SFT Learns Better Than You Think",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "Projection Sampling用expert条件proposal与Metropolis-Hastings分块采样使信息保留轨迹靠近base，再SFT；化学/数学/开放域真实训练。不得将有限MCMC近似等同理想投影精确采样。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02140",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02140v1",
              "location": "§4.1–4.3 Algorithm1；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02117",
      "title": "Where-OPD: Spatially Guided On-Policy Self-Distillation of MLLMs with Synthetic Scenes",
      "published": "2026-10-01T17:34:10Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02117",
          "title": "Where-OPD: Spatially Guided On-Policy Self-Distillation of MLLMs with Synthetic Scenes",
          "published": "2026-10-01T17:34:10Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录where-opd，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02117",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.02117",
          "title": "Where-OPD: Spatially Guided On-Policy Self-Distillation of MLLMs with Synthetic Scenes",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现Where-OPD，保留synthetic scene privileged spatial指导的既有结论。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02117",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12563：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02091",
      "title": "GeoLatent: Geometry-Guided Latent Structuring with Routed Optimization for 3D Reasoning",
      "published": "2026-10-01T17:22:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02091",
          "title": "GeoLatent: Geometry-Guided Latent Structuring with Routed Optimization for 3D Reasoning",
          "published": "2026-10-01T17:22:40Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "GeoLatent 分离共享几何成分与残差，用三阶段路由优化阻断答案的视觉捷径；DA3/VGGT 训练目标只辅助潜变量。SPAR/SpatialLadder、SPBench/ViewSpatial 可真实验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02091",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.02091v1",
              "location": "§3.2–3.4; §4.1–4.4; Appendix B",
              "notes": "GeoLatent 分离共享几何成分与残差，用三阶段路由优化阻断答案的视觉捷径；DA3/VGGT 训练目标只辅助潜变量。SPAR/SpatialLadder、SPBench/ViewSpatial 可真实验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.02091v1",
          "locations": [
            "§3.2–3.4; §4.1–4.4; Appendix B"
          ],
          "limitations": "几何教师仅训练使用；37 个同 ScanNet 场景需去重报告；必须做路由干预检验，不能只加几何标签并称阻断捷径。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "GeoLatent 分离共享几何成分与残差，用三阶段路由优化阻断答案的视觉捷径；DA3/VGGT 训练目标只辅助潜变量。SPAR/SpatialLadder、SPBench/ViewSpatial 可真实验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02076",
      "title": "LLM-as-Jev: LLMs Are Already Jev-Style Decision Models -- When and How to Fine-Tune Them",
      "published": "2026-10-01T17:15:24Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02076",
          "title": "LLM-as-Jev: LLMs Are Already Jev-Style Decision Models -- When and How to Fine-Tune Them",
          "published": "2026-10-01T17:15:24Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录llm2jev，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02076",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02074",
      "title": "Homomorphic Advantage Operator: Stabilizing Reinforcement Learning Under Fully Homomorphic Encryption Constraints",
      "published": "2026-10-01T17:14:32Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02074",
          "title": "Homomorphic Advantage Operator: Stabilizing Reinforcement Learning Under Fully Homomorphic Encryption Constraints",
          "published": "2026-10-01T17:14:32Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02074",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "FHE约束传统RL homomorphic advantage算子。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02057",
      "title": "Optimizing Effective Training Time for Large-Scale Recommendation Systems",
      "published": "2026-10-01T17:02:16Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.02057",
          "title": "Optimizing Effective Training Time for Large-Scale Recommendation Systems",
          "published": "2026-10-01T17:02:16Z",
          "repository_status": "implemented",
          "decision": "implemented",
          "review_level": "registry",
          "fulltext_review_completed": false,
          "reason": "ETT 已在统一 manifest 实现，不重复登记为新增。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02057",
              "location": "research-manifest.json"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02045",
      "title": "Form and Void: Entangled Composition through an Autonomous AI Agent",
      "published": "2026-10-01T16:55:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02045",
          "title": "Form and Void: Entangled Composition through an Autonomous AI Agent",
          "published": "2026-10-01T16:55:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "FaV-A多阶段图像构图agent，无新可训练基础模型机制。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02045",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02039",
      "title": "CARM: Cancellation-Aware Response Masking for LLM Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02039",
          "title": "CARM: Cancellation-Aware Response Masking for LLM Reinforcement Learning",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现CARM逐token绝对log-ratio response masking。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02039",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12598：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.02038",
      "title": "Mimir: Physics-Grounded LLM Agents for Long-Horizon Irrigation Control",
      "published": "2026-10-01T16:50:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02038",
          "title": "Mimir: Physics-Grounded LLM Agents for Long-Horizon Irrigation Control",
          "published": "2026-10-01T16:50:52Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02038",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Mimir以固定水量物理模拟+候选格点/lex选择/投影shield保护LLM建议，ACE事件记忆只改context。19cropyears6938days/4环境时序60/40、九季memory冻结test；repair消融109.1→180.5cost但各消融不同slice不能横比。核心是灌溉特定ACE+MPC/运行时保障组合，未提出本库待补的通用学习/搜索机制或公共通用评测入口。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02038v1",
              "location": "§4.1–4.3；§5；§6.1–6.4/Table3"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02021",
      "title": "Task-Adaptive Grounded 3D-Programmers Using 2D VLMs",
      "published": "2026-10-01T16:43:17Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02021",
          "title": "Task-Adaptive Grounded 3D-Programmers Using 2D VLMs",
          "published": "2026-10-01T16:43:17Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "3D-Prog冻结2D VLM的坐标框架与反馈编程，agent track范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02021",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02019",
      "title": "Controllable Multi-label Video Safety Detection via Adaptive Tversky Policy Optimization",
      "published": "2026-10-01T16:42:30Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02019",
          "title": "Controllable Multi-label Video Safety Detection via Adaptive Tversky Policy Optimization",
          "published": "2026-10-01T16:42:30Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ATPO针对视频安全的自适应Tversky RL奖励，由post-training track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02019",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.02019",
          "title": "Controllable Multi-label Video Safety Detection via Adaptive Tversky Policy Optimization",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "ATPO以FN/FP EMA log-ratio误差反馈调Tversky alpha/beta，固定和为2，可全局/类别控制多标签reward；真实VideoVLM训练，新增自适应reward控制器而非重命名标准GRPO。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02019",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.02019v1",
              "location": "§3.3 Eq.7–13；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02015",
      "title": "On Language Drift during RLVR Post-Training",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.02015",
          "title": "On Language Drift during RLVR Post-Training",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "语言漂移的RLVR理论条件及经验分析，不提出新训练机制。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02015",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02012",
      "title": "Bellman Meets Lyapunov: Unsupervised Reinforcement Learning via Mastering Chaos",
      "published": "2026-10-01T16:38:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02012",
          "title": "Bellman Meets Lyapunov: Unsupervised Reinforcement Learning via Mastering Chaos",
          "published": "2026-10-01T16:38:03Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02012",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "F-CIP dynamics内生intrinsic reward传统RL，非语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02005",
      "title": "Counting Moves, Weighing Voices: Bayesian Dialectical Argumentation for Calibrated Multi-LLM Councils under Persistent Adversaries",
      "published": "2026-10-01T16:34:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.02005",
          "title": "Counting Moves, Weighing Voices: Bayesian Dialectical Argumentation for Calibrated Multi-LLM Councils under Persistent Adversaries",
          "published": "2026-10-01T16:34:50Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.02005",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "BDA把Propose/Challenge/Concede转签名endorsement counts，积分Beta可靠性的DawidSkene式汇聚，约25标签校准同预算比较；K>2伪似然需tempering，校准理论仅二类无challenge等条件。标签身份稳定学习在位置MCQ失效，sleeper攻击/可靠性突变不保证；是新聚合机制非无条件鲁棒获胜。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.02005v1",
              "location": "§3协议/后验；§4实验；§5限制"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.02002",
      "title": "Mem++: Non-Destructive Memory for Long-Term Organizational LLM Agents",
      "published": "2026-10-01T16:32:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.02002",
          "title": "Mem++: Non-Destructive Memory for Long-Term Organizational LLM Agents",
          "published": "2026-10-01T16:32:38Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录mem-plus-plus，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.02002",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.02002",
          "title": "Mem++: Non-Destructive Memory for Long-Term Organizational LLM Agents",
          "published": "2026-10-01T16:32:38Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.02002",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "Mem++已收录，完整文档时点过滤与lexical/semantic读时融合。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01999",
      "title": "From Reasoning Failures to Composable Video Spatial Intelligence",
      "published": "2026-10-01T16:31:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01999",
          "title": "From Reasoning Failures to Composable Video Spatial Intelligence",
          "published": "2026-10-01T16:31:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CROSS训练自由几何技能库与空间agent，不是基础模型训练算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01999",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01981",
      "title": "Universal interpolation for deep residual self-attention networks",
      "published": "2026-10-01T16:25:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01981",
          "title": "Universal interpolation for deep residual self-attention networks",
          "published": "2026-10-01T16:25:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "残差自注意力通用插值数学保证，无可比较的训练算法实证。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01981",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01973",
      "title": "Token-Level Video Reinforcement Learning",
      "published": "2026-10-01T16:22:41Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01973",
          "title": "Token-Level Video Reinforcement Learning",
          "published": "2026-10-01T16:22:41Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录tvrl，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01973",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01962",
      "title": "SIEVE: Selective attention-value Suppression for Vision-Language Models Unlearning",
      "published": "2026-10-01T16:16:53Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01962",
          "title": "SIEVE: Selective attention-value Suppression for Vision-Language Models Unlearning",
          "published": "2026-10-01T16:16:53Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SIEVE 交替优化 forget 的负 CE+attention value 归零和 retain 的正 CE+冻结参考 value 匹配，定义目标明确。合成 Profile Visual-QA/Textual-QA 可做选择性遗忘。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01962",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01962v1",
              "location": "§3.2.1–3.2.3/Eq4–8/Algorithm1; §4.1/4.4; Appendix C",
              "notes": "SIEVE 交替优化 forget 的负 CE+attention value 归零和 retain 的正 CE+冻结参考 value 匹配，定义目标明确。合成 Profile Visual-QA/Textual-QA 可做选择性遗忘。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01962v1",
          "locations": [
            "§3.2.1–3.2.3/Eq4–8/Algorithm1; §4.1/4.4; Appendix C"
          ],
          "limitations": "不直接约束 attention 权重；不能声称满足真实隐私/GDPR 删除；须分别测文本与视觉访问、保留集损害及重新学习。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "SIEVE 交替优化 forget 的负 CE+attention value 归零和 retain 的正 CE+冻结参考 value 匹配，定义目标明确。合成 Profile Visual-QA/Textual-QA 可做选择性遗忘。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01955",
      "title": "Do Your Own Research: Learning to Forecast by Learning to Search",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01955",
          "title": "Do Your Own Research: Learning to Forecast by Learning to Search",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "prime-forecast公开工具环境/历史问题/rollout记录，point-in-time过滤、封锁市场价格、Brier和弃答插补可独立评估研究预测；训练/测试按解决日期隔离。实时检索和API过滤非静态可复现，过滤的完美小样本结果不是无泄漏证明。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01955v1",
              "location": "§2–4；Appendix C"
            },
            {
              "url": "https://github.com/afifi-yusuf/prime-forecast",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "预测市场数据与时序防泄漏harness、单epoch Brier-GRPO应用，非新优化算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.01955",
          "title": "Do Your Own Research: Learning to Forecast by Learning to Search",
          "published": "2026-10-01T16:12:58Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.01955v1",
          "location": "§2–4；Appendix C；作者仓库README/文件列表已只读核查",
          "decision": "accepted",
          "reason": "prime-forecast公开工具环境/历史问题/rollout记录，point-in-time过滤、封锁市场价格、Brier和弃答插补可独立评估研究预测；训练/测试按解决日期隔离。实时检索和API过滤非静态可复现，过滤的完美小样本结果不是无泄漏证明。",
          "id": "2610.01955",
          "repository_status": "new",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01955v1",
              "location": "§2–4；Appendix C"
            },
            {
              "url": "https://github.com/afifi-yusuf/prime-forecast",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "预测市场数据与时序防泄漏harness、单epoch Brier-GRPO应用，非新优化算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "reviewer": "post_training_review_reused",
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01944",
      "title": "Anti-Persona: Disrupting Unauthorized Identity Binding and Recognition in Personalized Vision--Language Models",
      "published": "2026-10-01T16:10:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01944",
          "title": "Anti-Persona: Disrupting Unauthorized Identity Binding and Recognition in Personalized Vision--Language Models",
          "published": "2026-10-01T16:10:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Anti-Persona图像扰动隐私防护，不改变基础模型训练或推理核心。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01944",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01939",
      "title": "Fewer Tokens, Better Action: GPT-6 Astra Robot Agents with 14% Higher Success Rate but 65% Fewer Tokens",
      "published": "2026-10-01T16:07:49Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01939",
          "title": "Fewer Tokens, Better Action: GPT-6 Astra Robot Agents with 14% Higher Success Rate but 65% Fewer Tokens",
          "published": "2026-10-01T16:07:49Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "PyRUA-Lean机器人代码执行与选择性观测harness，agent track范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01939",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01921",
      "title": "Cross-Lingual Alignment for Decoder-Only Models using MoE Routers",
      "published": "2026-10-01T15:56:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01921",
          "title": "Cross-Lingual Alignment for Decoder-Only Models using MoE Routers",
          "published": "2026-10-01T15:56:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "XLR以平行语料的sequence-mean sparse router概率KL进行中层跨语言对齐，核心CPT辅助loss+packing优化明确，官方训练/评测公开，符合基础模型训练候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01921",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01921v1",
              "location": "§3 Eq1; §4.1–4.4; §5/Table1–2; App C/F; official README/contrastive_training README"
            },
            {
              "url": "https://arxiv.org/html/2610.01921v1",
              "location": "§3 Eq1; §4.1–4.4; §5/Table1–2; App C/F; official README/contrastive_training README",
              "notes": "topK后normalized router weights按token均值，KL(english||target)，只target反传；source earlyexit最后对齐层，varlenattention隔离英/目标。200k pairs1epoch batch32，LR/alpha按LM validationloss选，13/14pair改善1tie平均+.9pt。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01921v1",
          "locations": [
            "§3 Eq1",
            "§4.1–4.4",
            "§5/Table1–2",
            "App C/F",
            "official README/contrastive_training README"
          ],
          "limitations": "中层两个小模型按图主观选择，长预训练/更多语言未证；routeronly非可靠fulltraining替代。稀疏KL需核epsilon/zero处理，不能改全softmax而不披露。官方明示清理私有路径后未测试、非开箱即用；公开代码存在≠复现通过，需计英语extra compute。",
          "code_url": "https://github.com/lucasbandarkar/xl_moe_alignment",
          "implementation_status": "not_implemented",
          "fulltext_notes": "topK后normalized router weights按token均值，KL(english||target)，只target反传；source earlyexit最后对齐层，varlenattention隔离英/目标。200k pairs1epoch batch32，LR/alpha按LM validationloss选，13/14pair改善1tie平均+.9pt。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01917",
      "title": "MoLE: Mixture of Latent Experts for Complementary Visual Reasoning",
      "published": "2026-10-01T15:54:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01917",
          "title": "MoLE: Mixture of Latent Experts for Complementary Visual Reasoning",
          "published": "2026-10-01T15:54:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "MoLE的路由视觉证据、专家value变换与隔离潜在专家/summary拓扑构成可辨识新视觉推理结构，公开数据+详细附录足够作为保真实现候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01917",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01917v1",
              "location": "§3.2 Eq4–13; §4 Table1; App A.1–A.4/A.7"
            },
            {
              "url": "https://arxiv.org/html/2610.01917v1",
              "location": "§3.2 Eq4–13; §4 Table1; App A.1–A.4/A.7",
              "notes": "E4/S4 K2，perlayerrouter prior log(Kρ+epsilon)，layerRMSnorm+expertMLP db32跨层共享，γ.01；expert间禁attention，summary只汇总expert。stage1阻断普通prompt/answer看image2epoch，stage2恢复1epoch；LoRAr16、CE+balance/z/div，63k去重含SHA/pHash/DINO/SIFT，三seed78.2±.4。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01917v1",
          "locations": [
            "§3.2 Eq4–13",
            "§4 Table1",
            "App A.1–A.4/A.7"
          ],
          "limitations": "潜在token不是FFNexpert；ESVA只路由edge改V不能全局替换；gold只answer训练label不能影响inference routing。相同8latents不等FLOPs且额外参数；K2等按benchmark消融最优需另val冻结；专有基线来自外部且部分CVBench分项推算。未找到作者源码链接。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "E4/S4 K2，perlayerrouter prior log(Kρ+epsilon)，layerRMSnorm+expertMLP db32跨层共享，γ.01；expert间禁attention，summary只汇总expert。stage1阻断普通prompt/answer看image2epoch，stage2恢复1epoch；LoRAr16、CE+balance/z/div，63k去重含SHA/pHash/DINO/SIFT，三seed78.2±.4。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01908",
      "title": "Same Reward, Different Skills: When Multimodal RL Learns to Look",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01908",
          "title": "Same Reward, Different Skills: When Multimodal RL Learns to Look",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "counterfactual scene生成/target stable-switch-invariance对照与独立confirmatory set可构成视觉grounding评测；普通GRPO只训练discovery。匿名代码入口不可读，需验证scene生成器与固定dev/test公开，不能以benchmark增益替代视觉依赖证据。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01908v1",
              "location": "§2–3；§5.1–5.4；§6；Code availability"
            },
            {
              "url": "https://anonymous.4open.science/r/learning-without-looking-2432",
              "location": "作者资源入口只读核查；边界见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "visual resolvability数据设计与blind-vs-real训练控制实验，优化器仍标准GRPO。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "counterfactual scene生成/target stable-switch-invariance对照与独立confirmatory set可构成视觉grounding评测；普通GRPO只训练discovery。匿名代码入口不可读，需验证scene生成器与固定dev/test公开，不能以benchmark增益替代视觉依赖证据。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01896",
      "title": "Asynchronous LLM Post-Training: Group-Mass Capping and Convergence Analysis",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01896",
          "title": "Asynchronous LLM Post-Training: Group-Mass Capping and Convergence Analysis",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现GMC-GRPO，对异步组importance weight作mass capping。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01896",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12599：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01894",
      "title": "A foundation for systematic analysis of transformers and RNNs for tractography",
      "published": "2026-10-01T15:43:32Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.01894",
          "title": "A foundation for systematic analysis of transformers and RNNs for tractography",
          "published": "2026-10-01T15:43:32Z",
          "repository_status": "new",
          "decision": "out_of_scope",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "dMRI tractography 的 RNN/Transformer 训练与医学成像验证，不属于当前互联网推荐或通用 LLM 研究范围。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01894",
              "location": "Abstract"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01892",
      "title": "Selection-Based Structured Reasoning: Toward Efficient Multimodal Search Agents",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01892",
          "title": "Selection-Based Structured Reasoning: Toward Efficient Multimodal Search Agents",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "SSR全文不是普通工具应用：六共享推理模板以batched teacher-forced mean-logprob softmax选择，再插入全文生成action；SFT selector NLL+action NLL，GRPO一个categorical selector ratio+action token ratios，插入模板不逐token训练。AppendixB实际detach rollout竞争分数仅首步概率精确、后续近似。Qwen3VL2B/4B七multimodal搜索任务，效率须计候选prefill；保留原post摘要漏判并由正文纠正。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01892v1",
              "location": "§3.2–3.3 Eq1–6；§4；AppendixB Eq7–11"
            }
          ],
          "fulltext_review_completed": true,
          "pool": "main",
          "review_status": "reviewed",
          "post_training_cross_track": true,
          "cross_tracks": [
            "post_training",
            "agent"
          ],
          "supersedes_abstract_decision": "out_of_scope"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.01892",
          "title": "Selection-Based Structured Reasoning: Toward Efficient Multimodal Search Agents",
          "published": "2026-10-01T15:42:14Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01892",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "SSR全文不是普通工具应用：六共享推理模板以batched teacher-forced mean-logprob softmax选择，再插入全文生成action；SFT selector NLL+action NLL，GRPO一个categorical selector ratio+action token ratios，插入模板不逐token训练。AppendixB实际detach rollout竞争分数仅首步概率精确、后续近似。Qwen3VL2B/4B七multimodal搜索任务，效率须计候选prefill；保留原post摘要漏判并由正文纠正。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01892v1",
              "location": "§3.2–3.3 Eq1–6；§4；AppendixB Eq7–11"
            }
          ],
          "post_training_cross_track": true,
          "cross_tracks": [
            "agent",
            "post_training"
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01882",
      "title": "Flowing Faster to Coordinate: One-Step Online Multi-Agent Flow Policies",
      "published": "2026-10-01T15:36:31Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01882",
          "title": "Flowing Faster to Coordinate: One-Step Online Multi-Agent Flow Policies",
          "published": "2026-10-01T15:36:31Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01882",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "OMAF传统多Agent flow policy，无LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01846",
      "title": "Beyond Decodability: Do Acoustic Factors Drive Predictions in Speech-Based Alzheimer's Assessment?",
      "published": "2026-10-01T15:13:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01846",
          "title": "Beyond Decodability: Do Acoustic Factors Drive Predictions in Speech-Based Alzheimer's Assessment?",
          "published": "2026-10-01T15:13:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "阿尔茨海默语音评估声学干预诊断，无新通用模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01846",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01835",
      "title": "Varda-single-1.0: deterministic data-driven weather forecasting at 1 km resolution over Switzerland's complex topography",
      "published": "2026-10-01T15:07:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01835",
          "title": "Varda-single-1.0: deterministic data-driven weather forecasting at 1 km resolution over Switzerland's complex topography",
          "published": "2026-10-01T15:07:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "瑞士区域天气模型工程与验证，非通用基础模型新机制。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01835",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01833",
      "title": "Continuous Process-Level Evaluation for Evolving Enterprise AI Agent Skills",
      "published": "2026-10-01T15:06:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01833",
          "title": "Continuous Process-Level Evaluation for Evolving Enterprise AI Agent Skills",
          "published": "2026-10-01T15:06:23Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01833",
          "location": "Title and complete abstract",
          "decision": "pending",
          "reason": "企业skill评测独立API计算oracle→runtimeplaceholder模板→规则/少量LLM语义judge→依赖图归因，process/outcome分离有复用价值。但当前仅真实9应用Instana/Kubecost/Cloudability两私有业务skill、104/80模板；240trials MD/TXT同时改内容，liveAPI快照漂移且图根非因果。未定位公开完整模板/trace/可执行环境，无法作为公共回归入口；已读不是未审。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01833v1",
              "location": "§4–5；§6数据；§7–8；AppendixA"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01828",
      "title": "The Asymptotics of Language Model Alignment with Memory",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01828",
          "title": "The Asymptotics of Language Model Alignment with Memory",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "Markov生成下best-of-n与KL-RL渐近关系理论，未提出新训练算法。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01828",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01821",
      "title": "Beyond Linear Concepts: Discovering and Aligning Non-Linear Concept Manifolds in Large Language Models",
      "published": "2026-10-01T14:55:03Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01821",
          "title": "Beyond Linear Concepts: Discovering and Aligning Non-Linear Concept Manifolds in Large Language Models",
          "published": "2026-10-01T14:55:03Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "非线性概念流形解释性分析与CBA度量，无新能力训练算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01821",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01815",
      "title": "Debias Anything: Fairness with Diversity without Supervision in Diffusion Models",
      "published": "2026-10-01T14:51:03Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01815",
          "title": "Debias Anything: Fairness with Diversity without Supervision in Diffusion Models",
          "published": "2026-10-01T14:51:03Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Debias Anything 在冻结扩散模型上训练语义 adapter，以属性方向、目标比例引导和 disagreement 多样性项进行批级去偏。公开人脸/扩散检查点可检验质量公平性权衡。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01815",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01815v1",
              "location": "§4.1–4.3; §5.1–5.2; Appendix C/D",
              "notes": "Debias Anything 在冻结扩散模型上训练语义 adapter，以属性方向、目标比例引导和 disagreement 多样性项进行批级去偏。公开人脸/扩散检查点可检验质量公平性权衡。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01815v1",
          "locations": [
            "§4.1–4.3; §5.1–5.2; Appendix C/D"
          ],
          "limitations": "训练的是 adapter，不能宣传整个流程 training-free；批级比例公平不证明个体公平；公开代码链接尚未核验。",
          "code_url": "https://github.com/theaudaudiffret/Debias_anything",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Debias Anything 在冻结扩散模型上训练语义 adapter，以属性方向、目标比例引导和 disagreement 多样性项进行批级去偏。公开人脸/扩散检查点可检验质量公平性权衡。"
        },
        {
          "track": "post-training",
          "id": "2610.01815",
          "title": "Debias Anything: Fairness with Diversity without Supervision in Diffusion Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "图像diffusion公平与多样性guidance，不是语言模型RL/OPD。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01815",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01794",
      "title": "Continuous Conditioning of VLAs with Augmenting EMG and Visual Task Descriptors",
      "published": "2026-10-01T14:37:05Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01794",
          "title": "Continuous Conditioning of VLAs with Augmenting EMG and Visual Task Descriptors",
          "published": "2026-10-01T14:37:05Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "EMG/visual-conditioned VLA 将低通 EMG 与 proprio 拼接，另在 RoboCasa 以对象 mask 条件化动作；正文可验证设计，但真实三人 EMG 数据不公开。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01794",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01794v1",
              "location": "§III-A/B; §IV-A/B; §V; Appendix VI-B/C",
              "notes": "EMG/visual-conditioned VLA 将低通 EMG 与 proprio 拼接，另在 RoboCasa 以对象 mask 条件化动作；正文可验证设计，但真实三人 EMG 数据不公开。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.01794v1",
          "locations": [
            "§III-A/B; §IV-A/B; §V; Appendix VI-B/C"
          ],
          "limitations": "审后延期：真实 EMG 数据和原作者训练实现未找到；人类持续纠正不是自主 agent；RoboCasa 条件来自 simulator segmentation，是特权目标 mask，不能伪称 vision-only 公平优势。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "审后延期：真实 EMG 数据和原作者训练实现未找到；人类持续纠正不是自主 agent；RoboCasa 条件来自 simulator segmentation，是特权目标 mask，不能伪称 vision-only 公平优势。",
          "upstream_access_verified": false,
          "fulltext_notes": "EMG/visual-conditioned VLA 将低通 EMG 与 proprio 拼接，另在 RoboCasa 以对象 mask 条件化动作；正文可验证设计，但真实三人 EMG 数据不公开。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01785",
      "title": "VETO: Video Efficient Token Optimization for Vision Language Models",
      "published": "2026-10-01T14:32:43Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01785",
          "title": "VETO: Video Efficient Token Optimization for Vision Language Models",
          "published": "2026-10-01T14:32:43Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录veto，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01785",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01769",
      "title": "CONTRA: Discovering and Qualifying Behavior-Changing Questions for Selective Clarification in LLM Code Generation",
      "published": "2026-10-01T14:26:21Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01769",
          "title": "CONTRA: Discovering and Qualifying Behavior-Changing Questions for Selective Clarification in LLM Code Generation",
          "published": "2026-10-01T14:26:21Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01769",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "CONTRA先多轮发现问题，再要求相关且原需求未解决；每种可能答案采3程序、>=7共同输入，组内2/3稳定且至少一输入跨组不同才保留，失败非等价证明；history自适应选问或stop。419欠指定+80完整任务最多5问，GPT4o三票gold匹配；四模型macro F1 41.20vs27.32，程序隔离执行。通用执行证据澄清算子，plugin部署非线上A/B。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01769v1",
              "location": "§3.3–3.5；§4.1–4.2/Table2；§5"
            },
            {
              "url": "https://github.com/fangz-cs/Contra",
              "location": "官方作者仓库；释放状态仅在reason明确标注已核者才声明可运行"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01766",
      "title": "VideoEvolve: Evolving Agent Harnesses for Video Temporal Grounding",
      "published": "2026-10-01T14:24:24Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01766",
          "title": "VideoEvolve: Evolving Agent Harnesses for Video Temporal Grounding",
          "published": "2026-10-01T14:24:24Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "VideoEvolve演化视频定位agent harness，由agent track审查。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01766",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01754",
      "title": "Cog-VADU: A Training-Free Cognitive Reasoning Framework for Video Anomaly Detection and Understanding",
      "published": "2026-10-01T14:18:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01754",
          "title": "Cog-VADU: A Training-Free Cognitive Reasoning Framework for Video Anomaly Detection and Understanding",
          "published": "2026-10-01T14:18:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "Cog-VADU训练自由时序提示及重排，专用异常检测agent工作流。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01754",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01746",
      "title": "End-to-End Learning vs. Modular Architectures: Comparative Insights into Autonomous Driving Systems",
      "published": "2026-10-01T14:15:06Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.01746",
          "title": "End-to-End Learning vs. Modular Architectures: Comparative Insights into Autonomous Driving Systems",
          "published": "2026-10-01T14:15:06Z",
          "repository_status": "new",
          "decision": "out_of_scope",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "自动驾驶端到端/模块化架构比较综述与二值决策框架，非当前 LLM/Agent 新训练算法。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01746",
              "location": "Abstract"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01741",
      "title": "ATI-VLA: Action-Centric Predictive Vision-Language-Action Models via Actionable Alignment Then Adaptive Injection",
      "published": "2026-10-01T14:12:23Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01741",
          "title": "ATI-VLA: Action-Centric Predictive Vision-Language-Action Models via Actionable Alignment Then Adaptive Injection",
          "published": "2026-10-01T14:12:23Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "ATI-VLA共享动作/观察量化空间与分层侧路注入符合VLA新算法候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01741",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01741v1",
              "location": "§2.2 Eq5–15/Alg1; §3; App A/B/E"
            },
            {
              "url": "https://arxiv.org/html/2610.01741v1",
              "location": "§2.2 Eq5–15/Alg1; §3; App A/B/E",
              "notes": "第一阶段共同codebook+unifiedattentiondecoder预测未来观察动作，随后冻结alignment；当前观察编码的latent经FFN sidepath每s层crossattn只注入actionquery，learnedβ，第二阶段actiononly。OpenVLAOFT7B，LoRAr32α64，LIBEROchunk8、RoboTwin25。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01741v1",
          "locations": [
            "§2.2 Eq5–15/Alg1",
            "§3",
            "App A/B/E"
          ],
          "limitations": "推理不需未来帧/真实动作，不可用其填sidepath；量化gradient/codebook超参需作者实现补齐。8H100训练/5090部署，checkpoint按benchmarkvalidation挑选需重划独立seed/scene测试。多基线引用与reproduced须区分，项目页存在但未核到公开源码。",
          "code_url": "https://jiutian-vl.github.io/ATI-VLA-page",
          "implementation_status": "not_implemented",
          "fulltext_notes": "第一阶段共同codebook+unifiedattentiondecoder预测未来观察动作，随后冻结alignment；当前观察编码的latent经FFN sidepath每s层crossattn只注入actionquery，learnedβ，第二阶段actiononly。OpenVLAOFT7B，LoRAr32α64，LIBEROchunk8、RoboTwin25。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01710",
      "title": "CoEvolve: Construct-to-Edit Visual Grounding with Bidirectional State Refinement",
      "published": "2026-10-01T13:54:05Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01710",
          "title": "CoEvolve: Construct-to-Edit Visual Grounding with Bidirectional State Refinement",
          "published": "2026-10-01T13:54:05Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CoEvolve 以 RER-GRPO 训练有序多步 bbox 进展，再用 BDR 坐标去噪保留推理文本。RefCOCOg 训练和 RefCOCO/+ 持出评测可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01710",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01710v1",
              "location": "§3.2–3.3; §4.1–4.5; Appendix B/E",
              "notes": "CoEvolve 以 RER-GRPO 训练有序多步 bbox 进展，再用 BDR 坐标去噪保留推理文本。RefCOCOg 训练和 RefCOCO/+ 持出评测可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01710v1",
          "locations": [
            "§3.2–3.3; §4.1–4.5; Appendix B/E"
          ],
          "limitations": "受控损坏恢复 58.8→86.19 不等于自然错误恢复；DIOR 是域内再训练而非零样本；GT 坐标仅奖励/训练目标。",
          "code_url": "https://sundongwei.github.io/CoEvolve_Project/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "CoEvolve 以 RER-GRPO 训练有序多步 bbox 进展，再用 BDR 坐标去噪保留推理文本。RefCOCOg 训练和 RefCOCO/+ 持出评测可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01705",
      "title": "AgentWebRec: Compact Evidence Fusion over the Agent Web for Personalized Recommendation",
      "published": "2026-10-01T13:51:13Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.01705",
          "title": "AgentWebRec: Compact Evidence Fusion over the Agent Web for Personalized Recommendation",
          "published": "2026-10-01T13:51:13Z",
          "repository_status": "implemented",
          "decision": "implemented",
          "review_level": "registry",
          "fulltext_review_completed": false,
          "reason": "AgentWebRec 已实现；只复核注册，不重复列作本轮新增。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01705",
              "location": "research-manifest.json"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01687",
      "title": "Architectural Sampling: Test-Time Scaling via Computational Diversity in Frozen Vision-Language Models",
      "published": "2026-10-01T13:44:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01687",
          "title": "Architectural Sampling: Test-Time Scaling via Computational Diversity in Frozen Vision-Language Models",
          "published": "2026-10-01T13:44:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Architectural Sampling 重复冻结 VLM 的层窗口，组合递归次数得到结构 rollout，再以无标签自奖励 TTRV-GRPO 训练。公开多模型/十二基准可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01687",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01687v1",
              "location": "§3.1–3.3; §4.1–4.2; §5/Table5; Appendix E",
              "notes": "Architectural Sampling 重复冻结 VLM 的层窗口，组合递归次数得到结构 rollout，再以无标签自奖励 TTRV-GRPO 训练。公开多模型/十二基准可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01687v1",
          "locations": [
            "§3.1–3.3; §4.1–4.2; §5/Table5; Appendix E"
          ],
          "limitations": "Pass@k oracle 覆盖率不等于可用 Pass@1；有效选择器和 TTRV 单独测；层重复增加计算，需等 FLOP/token 预算；不能用于仅 API 黑盒。",
          "code_url": "https://akshit21112002.github.io/Architectural-Sampling/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Architectural Sampling 重复冻结 VLM 的层窗口，组合递归次数得到结构 rollout，再以无标签自奖励 TTRV-GRPO 训练。公开多模型/十二基准可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01670",
      "title": "Do MLLM Judges Judge the Edit? Auditing Bias in Image Editing Evaluation with Verified Quality Preservation",
      "published": "2026-10-01T13:30:07Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01670",
          "title": "Do MLLM Judges Judge the Edit? Auditing Bias in Image Editing Evaluation with Verified Quality Preservation",
          "published": "2026-10-01T13:30:07Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "EditJudgeBias以13个保质cue与sham/真实损伤阳性对照审计VLM judge，方法可复用；发布明确排除benchmark图、人评及judge/validator响应，不能重建原1196triplet实证。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01670",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01670v1",
              "location": "§3.1–3.4; §4 metrics; reproducibility statement; Appendix A",
              "notes": "EditJudgeBias以13个保质cue与sham/真实损伤阳性对照审计VLM judge，方法可复用；发布明确排除benchmark图、人评及judge/validator响应，不能重建原1196triplet实证。"
            }
          ],
          "source": "https://arxiv.org/html/2610.01670v1",
          "locations": [
            "§3.1–3.4",
            "§4 metrics",
            "reproducibility statement",
            "Appendix A"
          ],
          "limitations": "五数据名实为三个独立content pools，需cluster配对；保质由SSIM/校准VLM/少量人评共同验证，不能直接假定每个像素改动不影响质量。仅初步减偏pilot，不宣称成熟修复算法。",
          "code_status": "scripts promised/published but exact evaluated inputs and responses explicitly excluded",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.01670v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "EditJudgeBias以13个保质cue与sham/真实损伤阳性对照审计VLM judge，方法可复用；发布明确排除benchmark图、人评及judge/validator响应，不能重建原1196triplet实证。"
        },
        {
          "track": "post-training",
          "id": "2610.01670",
          "title": "Do MLLM Judges Judge the Edit? Auditing Bias in Image Editing Evaluation with Verified Quality Preservation",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "EditJudgeBias独立judge偏差审计：quality-preserving cues、sham/retest噪声基线、顺序互换、paired统计。官方仓库有cue/judge/metric CLI，可评新judge，但不含全部图像/人工注释/作者I2EBench输出，不能宣称精确复现原数值。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01670v1",
              "location": "§3–4；§5；Reproducibility Statement"
            },
            {
              "url": "https://github.com/yuan4629/EditJudgeBias",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "EditJudgeBias counterfactual评测MLLM judge，非后训练算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01649",
      "title": "CrossGMN: Graph Metanetworks for Cross-Architecture Weight-Space Transformations",
      "published": "2026-10-01T13:13:55Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01649",
          "title": "CrossGMN: Graph Metanetworks for Cross-Architecture Weight-Space Transformations",
          "published": "2026-10-01T13:13:55Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CrossGMN可作为小模型架构压缩/evolve元算子研究候选，不能宣称已支持LLM压缩。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01649",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01649v1",
              "location": "§3 Eq1–3; §4 Eq4–5/Theorem1; §5.1–5.4; Limitations; App D.1–D.7"
            },
            {
              "url": "https://arxiv.org/html/2610.01649v1",
              "location": "§3 Eq1–3; §4 Eq4–5/Theorem1; §5.1–5.4; Limitations; App D.1–D.7",
              "notes": "source不变、target等变的joint参数图；隐藏层全二部join+strided跨层，GMN输出target残差初始化再KD。实际bidirectional ScaleGMN，分类scaleequiv/INR signequiv；teacher对象隔离，MLP5000/100/1000 train/val/test，checkpoint用validation。A100含建图18–20ms，MNIST学生宽压缩4.99xwallclock。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01649v1",
          "locations": [
            "§3 Eq1–3",
            "§4 Eq4–5/Theorem1",
            "§5.1–5.4",
            "Limitations",
            "App D.1–D.7"
          ],
          "limitations": "最高约200k参数；须访问teacher参数且输入输出兼容。理论plainGMN与实验ScaleGMN区别；teacher群训练摊销成本不能忽略，MLP仅1.04x且5%失败，非普遍加速。未找到公开源码；anchor选择需validation而非test最优。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "source不变、target等变的joint参数图；隐藏层全二部join+strided跨层，GMN输出target残差初始化再KD。实际bidirectional ScaleGMN，分类scaleequiv/INR signequiv；teacher对象隔离，MLP5000/100/1000 train/val/test，checkpoint用validation。A100含建图18–20ms，MNIST学生宽压缩4.99xwallclock。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01640",
      "title": "Not All Error Yields to Scale: Where Scaling Stops in Vision-Language Inference",
      "published": "2026-10-01T13:05:39Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01640",
          "title": "Not All Error Yields to Scale: Where Scaling Stops in Vision-Language Inference",
          "published": "2026-10-01T13:05:39Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Separable Inference Scaling Law按backbone参数和真实视觉token数分别拟合误差floor+幂律，结合成本面选择heldout配置；可作为多模态预算规划诊断。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01640",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01640v1",
              "location": "§2.2–2.3; §5.1–5.3; Appendix evaluation grid",
              "notes": "Separable Inference Scaling Law按backbone参数和真实视觉token数分别拟合误差floor+幂律，结合成本面选择heldout配置；可作为多模态预算规划诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.01640v1",
          "locations": [
            "§2.2–2.3",
            "§5.1–5.3",
            "Appendix evaluation grid"
          ],
          "limitations": "26预训练模型650cells，N不含encoder/projector且家族其组件也变，不能将系数解作纯backbone因果效应。成本只prompt backbone FLOPs不含视觉前端/解码，非端到端延迟；HRBench4K/8K相同题应配对resample。需新验证网格后独立test，不在全benchmark拟合又报告选择收益。",
          "code_status": "no canonical author code URL located in examined text",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01640v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Separable Inference Scaling Law按backbone参数和真实视觉token数分别拟合误差floor+幂律，结合成本面选择heldout配置；可作为多模态预算规划诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01637",
      "title": "Fusing Visual and Textual Representations via Multi-layer Fusing Transformers for Vietnamese Visual Question Answering",
      "published": "2026-10-01T13:04:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01637",
          "title": "Fusing Visual and Textual Representations via Multi-layer Fusing Transformers for Vietnamese Visual Question Answering",
          "published": "2026-10-01T13:04:59Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "MFT 将 PhoBERT/ViT 多层双向跨模态 attention 融合用于越南语 VQA 分类。公开 ViVQA 可训练并测 EM/token F1，作为窄域多模态算法候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01637",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01637v1",
              "location": "§3.1–3.4; §4.1–4.5",
              "notes": "MFT 将 PhoBERT/ViT 多层双向跨模态 attention 融合用于越南语 VQA 分类。公开 ViVQA 可训练并测 EM/token F1，作为窄域多模态算法候选。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01637v1",
          "locations": [
            "§3.1–3.4; §4.1–4.5"
          ],
          "limitations": "不是生成式 LLM；随机 80/20 无独立 validation 的正文协议需改成明确 train/validation/test；不能直接用他人已发表数值宣称公平重跑。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "MFT 将 PhoBERT/ViT 多层双向跨模态 attention 融合用于越南语 VQA 分类。公开 ViVQA 可训练并测 EM/token F1，作为窄域多模态算法候选。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01625",
      "title": "Beyond Domain-Level Adaptation: Margin-Oriented Semantic-Appearance Interaction Correction for Personalized Federated Vision-Language Models",
      "published": "2026-10-01T12:57:30Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01625",
          "title": "Beyond Domain-Level Adaptation: Margin-Oriented Semantic-Appearance Interaction Correction for Personalized Federated Vision-Language Models",
          "published": "2026-10-01T12:57:30Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "MOSAIC 在冻结 CLIP 上联合共享/私有 prompt、域类交互残差与低秩类别修正及样本门控。Office31/Home/DomainNet 的公开联邦域分类可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01625",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01625v1",
              "location": "Method/Eq10–13; Experiments; Appendix B/F",
              "notes": "MOSAIC 在冻结 CLIP 上联合共享/私有 prompt、域类交互残差与低秩类别修正及样本门控。Office31/Home/DomainNet 的公开联邦域分类可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01625v1",
          "locations": [
            "Method/Eq10–13; Experiments; Appendix B/F"
          ],
          "limitations": "正文报告每轮最大测试准确率且无独立验证，接入必须换为 validation 选轮并说明协议差异；真类残差减法只诊断，推理须对所有候选类计算。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "MOSAIC 在冻结 CLIP 上联合共享/私有 prompt、域类交互残差与低秩类别修正及样本门控。Office31/Home/DomainNet 的公开联邦域分类可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01605",
      "title": "Hob-VL: A Benchmark for Visually Grounded Boolean Reasoning",
      "published": "2026-10-01T12:48:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01605",
          "title": "Hob-VL: A Benchmark for Visually Grounded Boolean Reasoning",
          "published": "2026-10-01T12:48:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Hob-VL提供符号/NL视觉布尔组合及DeMorgan一致性公开评测，可执行新provider推理并离线严格评分。",
          "review_level": "fulltext",
          "kind": "public_evaluation_infrastructure",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01605",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01605v1",
              "location": "§4构建; §5.1; 官方README evals.verify_release/results"
            },
            {
              "url": "https://arxiv.org/html/2610.01605v1",
              "location": "§4构建; §5.1; 官方README evals.verify_release/results",
              "notes": "6000布尔问来自3000base/DeMorgan对，另1000识别；1000合成场景+46实景；每公式10变量1024赋值验证；126kresponses，invalid记错，只有API失败重试。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01605v1",
          "locations": [
            "§4构建",
            "§5.1",
            "官方README evals.verify_release/results"
          ],
          "limitations": "共享场景、等价改写不能当独立样本；不把dummy/offline-placeholder当真实模型；模型仅图+谓词/问题无truthassignment；gen脚本未公开，但固定评测材料与运行入口已公开。",
          "code_url": "https://github.com/Yuzhou-Wang99/Hob-VL",
          "implementation_status": "not_implemented",
          "fulltext_notes": "6000布尔问来自3000base/DeMorgan对，另1000识别；1000合成场景+46实景；每公式10变量1024赋值验证；126kresponses，invalid记错，只有API失败重试。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01595",
      "title": "Before It Fades: Reinforcing Temporal Representations at Inference Time in VideoLLMs",
      "published": "2026-10-01T12:45:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01595",
          "title": "Before It Fades: Reinforcing Temporal Representations at Inference Time in VideoLLMs",
          "published": "2026-10-01T12:45:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "TAI 比较视频正序/逆序的逐层激活差异，取输入特定峰值向量按衰减注入后层；冻结三 VideoLLM、四公开时间推理基准可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01595",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01595v1",
              "location": "§3.1–3.2; §4; §5; Appendix evaluation protocol",
              "notes": "TAI 比较视频正序/逆序的逐层激活差异，取输入特定峰值向量按衰减注入后层；冻结三 VideoLLM、四公开时间推理基准可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01595v1",
          "locations": [
            "§3.1–3.2; §4; §5; Appendix evaluation protocol"
          ],
          "limitations": "双路正逆序推理不是零成本；保留非时间任务对照与完整额外 FLOP；禁止以正确答案挑层。",
          "code_url": "https://github.com/Youngwoo-git/Before-It-Fades",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "TAI 比较视频正序/逆序的逐层激活差异，取输入特定峰值向量按衰减注入后层；冻结三 VideoLLM、四公开时间推理基准可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01578",
      "title": "The hidden advantage of mask resampling: a theory of masked autoencoders",
      "published": "2026-10-01T12:35:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01578",
          "title": "The hidden advantage of mask resampling: a theory of masked autoencoders",
          "published": "2026-10-01T12:35:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "MAE掩码重采样的理论与既有机制解释，摘要未提出新算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01578",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01569",
      "title": "Managing Context and Communication in Distributed Agentic UAV Swarms",
      "published": "2026-10-01T12:30:29Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01569",
          "title": "Managing Context and Communication in Distributed Agentic UAV Swarms",
          "published": "2026-10-01T12:30:29Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "分布式无人机agent上下文及通信管理，agent track范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01569",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.01569",
          "title": "Managing Context and Communication in Distributed Agentic UAV Swarms",
          "published": "2026-10-01T12:30:29Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01569",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "分布式UAV新增peer-tag残差embedding+recency novelty最小距离gossip，管理员离线双阈值决定discard/compact/full，接收queue只是邻居已知的估计；三内存tokenFIFO、ID/path/TTL去重。10机SITL搜救，80211n解析模型非实机网络；proposal全完成而flood70–85%，后续耗时/误差仅成功run条件统计，不可只看省6–7MB到<0.5MB。通信/记忆策略可泛化候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01569v1",
              "location": "§4 atomicmemory；§5 Eq7–14；§6.1–6.2"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01564",
      "title": "Chaining Skills to Hijack LLM Agents",
      "published": "2026-10-01T12:28:49Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01564",
          "title": "Chaining Skills to Hijack LLM Agents",
          "published": "2026-10-01T12:28:49Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01564",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "APEX跨skill中间artifact将工作进度错误提升为授权，独立sandbox执行反馈优化chain；防御taint+原请求核验。690attempt四定向families512成功，family任务重叠，utility按checks权重不是整任务成功；workloop token增不自动构成越权。官方MIT执行/trace判据/参考controlled variants公开，SkillsBench另取；只纳防御沙箱评测，不执行外部攻击。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01564v1",
              "location": "§3–4；§5/6.3；Ethics；官方README"
            },
            {
              "url": "https://github.com/Minakamiii/Chaining_Skills_to_Hijack_LLM_Agents",
              "location": "官方README已读：公开内容/执行条件/许可"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01560",
      "title": "AURAL: Adaptive Latent Reasoning with Joint Chunk for Speech Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01560",
          "title": "AURAL: Adaptive Latent Reasoning with Joint Chunk for Speech Language Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "AURAL用对角+低秩协方差GMM联合latent chunks、CSA、可微两遍scheduled sampling，再按latent坐标归一ratio做GRPO；真实语音/文本基准和延迟，应保持整个latent模型。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01560",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.01560v1",
              "location": "§3.1–3.2 Eq.2–6；§5"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01548",
      "title": "Range-GRPO: Policy Optimization via Pairwise Relations among Reward Intervals",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01548",
          "title": "Range-GRPO: Policy Optimization via Pairwise Relations among Reward Intervals",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现Range-GRPO，以conformal reward interval pairwise relation计算优势。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01548",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12554：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01537",
      "title": "FedFit: Federated Fine-Tuning of LLMs via Vector-Bank Parameterization and Quantization",
      "published": "2026-10-01T12:09:46Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01537",
          "title": "FedFit: Federated Fine-Tuning of LLMs via Vector-Bank Parameterization and Quantization",
          "published": "2026-10-01T12:09:46Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "FedFit的双disjoint向量库、交替联邦聚合与低比特通信具有可复现研究价值；保留公式歧义核对门槛。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01537",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01537v1",
              "location": "§III Eq3–8; §IV Eq10–22/Alg1; §V Eq23–31; §VII TablesI–XIII"
            },
            {
              "url": "https://arxiv.org/html/2610.01537v1",
              "location": "§III Eq3–8; §IV Eq10–22/Alg1; §V Eq23–31; §VII TablesI–XIII",
              "notes": "固定seed sparsegather列归一化PA/PB共享bank；both→Aonly→Bonly，solo冻结bank时PoS=SoP。both用FedAvg+残差crosscov rank1 QR/SVD校正。uplink/downlink分块RTN独立，uplink持久errorfeedback。Qwen.5/1.5/3B,Dolly90/10,LoRAr4α8,每bank262144,20round×100steps，MetaMathQA外域及Dirichlet非IID。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01537v1",
          "locations": [
            "§III Eq3–8",
            "§IV Eq10–22/Alg1",
            "§V Eq23–31",
            "§VII TablesI–XIII"
          ],
          "limitations": "RSC是在bank空间的近似，不是原层空间最优；加入双残差产生cross项，不能称完全恢复SoP。Eq29写Q(e)但邻接文字/30要求Q(y+e)，实施前须明确记录勘误并测守恒。90/10eval被用于停止，无独立test表述；需新增隔离validation/test。多数单seed；通信字节不等真实无线延迟，未找到作者代码。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "固定seed sparsegather列归一化PA/PB共享bank；both→Aonly→Bonly，solo冻结bank时PoS=SoP。both用FedAvg+残差crosscov rank1 QR/SVD校正。uplink/downlink分块RTN独立，uplink持久errorfeedback。Qwen.5/1.5/3B,Dolly90/10,LoRAr4α8,每bank262144,20round×100steps，MetaMathQA外域及Dirichlet非IID。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01533",
      "title": "Neither Black nor White: Balancing Semantic and Collaborative Signals with Graph-Informed Semantic IDs (GrIS)",
      "published": "2026-10-01T12:08:56Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.01533",
          "title": "Neither Black nor White: Balancing Semantic and Collaborative Signals with Graph-Informed Semantic IDs (GrIS)",
          "published": "2026-10-01T12:08:56Z",
          "repository_status": "implemented",
          "decision": "implemented",
          "review_level": "registry",
          "fulltext_review_completed": false,
          "reason": "GrIS 已实现；只复核注册，不重复列作本轮新增。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01533",
              "location": "research-manifest.json"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01531",
      "title": "Towards Reliable Vision-Language Models for Autonomous Driving",
      "published": "2026-10-01T12:06:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01531",
          "title": "Towards Reliable Vision-Language Models for Autonomous Driving",
          "published": "2026-10-01T12:06:13Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "自动驾驶VLM损坏鲁棒性评估及已有VEA应用，无新核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01531",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01530",
      "title": "Calibrating Prediction Timeliness Through Multi-Objective Hyperparameter Optimization for Remaining Useful Life Prediction",
      "published": "2026-10-01T12:06:11Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01530",
          "title": "Calibrating Prediction Timeliness Through Multi-Objective Hyperparameter Optimization for Remaining Useful Life Prediction",
          "published": "2026-10-01T12:06:11Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "剩余寿命预测多目标超参优化，专用预测维护应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01530",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01514",
      "title": "How the Audit Rule Shapes Faithful Factor Explanations in LLMs",
      "published": "2026-10-01T11:48:59Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01514",
          "title": "How the Audit Rule Shapes Faithful Factor Explanations in LLMs",
          "published": "2026-10-01T11:48:59Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01514",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "解释factor审计规则激励理论/实验，非Agent执行算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01513",
      "title": "Decision Titan: Test-Time Training for Long-Term Memory in Offline Reinforcement Learning",
      "published": "2026-10-01T11:48:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01513",
          "title": "Decision Titan: Test-Time Training for Long-Term Memory in Offline Reinforcement Learning",
          "published": "2026-10-01T11:48:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Decision Titan 将 RTG/state/action DT 与 Titans fast-weight 神经记忆联合，按轨迹 chunk 更新记忆。X-Maze 重复记忆任务可验证长度外推。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01513",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01513v1",
              "location": "§3.1–3.2; §4.1–4.4; §5",
              "notes": "Decision Titan 将 RTG/state/action DT 与 Titans fast-weight 神经记忆联合，按轨迹 chunk 更新记忆。X-Maze 重复记忆任务可验证长度外推。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01513v1",
          "locations": [
            "§3.1–3.2; §4.1–4.4; §5"
          ],
          "limitations": "每个 episode 必须重置记忆、保留 chunk 顺序与 no-grad 跨 chunk；符号 X-Maze 不是物理导航能力；1.7 倍训练速度与 20 倍上下文有编码假设。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Decision Titan 将 RTG/state/action DT 与 Titans fast-weight 神经记忆联合，按轨迹 chunk 更新记忆。X-Maze 重复记忆任务可验证长度外推。"
        },
        {
          "track": "post-training",
          "id": "2610.01513",
          "title": "Decision Titan: Test-Time Training for Long-Term Memory in Offline Reinforcement Learning",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "Decision Titan在X-Maze用TTT增强Decision Transformer记忆，非语言模型后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01513",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01511",
      "title": "GAW-PO: Preference Optimization with Gradient-Aligned Token Weights",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01511",
          "title": "GAW-PO: Preference Optimization with Gradient-Aligned Token Weights",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现GAW-PO，按梯度对齐给DPO rejected token重新加权。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01511",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12600：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01509",
      "title": "Sharpening Tax in Post-Training",
      "published": "2026-10-01T11:46:00Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01509",
          "title": "Sharpening Tax in Post-Training",
          "published": "2026-10-01T11:46:00Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录sharpening-tax，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01509",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.01509",
          "title": "Sharpening Tax in Post-Training",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现Sharpening Tax/PTGS，避免将已收录diagnostic误作新候选。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01509",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12597：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.01509",
          "title": "Sharpening Tax in Post-Training",
          "published": "2026-10-01T11:46:00Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01509",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "Sharpening Tax/PTGS已收录，难度posterior温度采样。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01508",
      "title": "OverAct: Measuring and Mitigating Proactive Over-Authorization in LLM Tool-Calling Agents",
      "published": "2026-10-01T11:44:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01508",
          "title": "OverAct: Measuring and Mitigating Proactive Over-Authorization in LLM Tool-Calling Agents",
          "published": "2026-10-01T11:44:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01508",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "OverAct以保守literal-minimal工具集定义越界（非普适授权法则），8域48tools/240双标原题扩720paraphrase，set操作无LLMjudge。SelfAudit先request-grounded justification再preexecution filter不需oracle，filter承担多数收益，justificationalone反恶化；TCR .94→.89。可纳入权限过滤机制候选，本文称附材有logs但未定位公开下载，不把720题宣称已接入可执行benchmark。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01508v1",
              "location": "§3.1–3.4；§4.6/Table3；AppendixD/F"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01506",
      "title": "MCRI: A Four-Dimensional Framework for Analyzing and Evaluating Agent Skills",
      "published": "2026-10-01T11:43:59Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01506",
          "title": "MCRI: A Four-Dimensional Framework for Analyzing and Evaluating Agent Skills",
          "published": "2026-10-01T11:43:59Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01506",
          "location": "Title and complete abstract",
          "decision": "accepted",
          "reason": "MCRI可执行文本rubric四维Metadata/Constraints/Resources/Instructions先各1–5再task-conditioned aggregate，重复mean score×mean confidence选skill。3公共bench50subtasks/345Mind2Websteps，58275calls；相关/popularity不等于因果或通用质量。AppendixD完整评分器足以作为候选预筛机制，但F明确/Resources未包含且无公开repo，不能声称复现实验或公开全数据。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01506v1",
              "location": "§3.3；§4.1/4.3；§5；AppendixD与F"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01499",
      "title": "VTR-Bench: A Systematic Benchmark for Evaluating Visual Text Rendering in Video Generation",
      "published": "2026-10-01T11:40:03Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01499",
          "title": "VTR-Bench: A Systematic Benchmark for Evaluating Visual Text Rendering in Video Generation",
          "published": "2026-10-01T11:40:03Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "VTR-Bench公开300prompt、CoQ及carrier转录WER评测入口，支持新视频模型产物；核心keyframe agentic策略亦可研究但不能用未匹配预算增益作效率结论。",
          "review_level": "fulltext",
          "kind": "public_evaluation_infrastructure",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01499",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01499v1",
              "location": "§3.1–3.4; §4.1–4.5; AppC.2; 官方README Evaluation/Agentic Generation"
            },
            {
              "url": "https://arxiv.org/html/2610.01499v1",
              "location": "§3.1–3.4; §4.1–4.5; AppC.2; 官方README Evaluation/Agentic Generation",
              "notes": "300prompt/5类，1202textblocks，20CoQ每prompt；转录器不见reference字符串，R+5截断boundedWER；官方vtr-bench evaluate可测新MP4；agentic最多20动作/30API/3video加fallback；WER.4468→.3015。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01499v1",
          "locations": [
            "§3.1–3.4",
            "§4.1–4.5",
            "AppC.2",
            "官方README Evaluation/Agentic Generation"
          ],
          "limitations": "HF已生成视频private需申请，但公开prompt/checklist+执行代码足够生成新评测；缺失ID被排除必须固定全300coverage。参考人评100video偏可读三模型，不能外推全失败分布；clearest occurrence WER不单独测全时段一致性。Agentic预算显著增加，需等budget。",
          "code_url": "https://github.com/hardenyu21/VTR-Bench",
          "implementation_status": "not_implemented",
          "fulltext_notes": "300prompt/5类，1202textblocks，20CoQ每prompt；转录器不见reference字符串，R+5截断boundedWER；官方vtr-bench evaluate可测新MP4；agentic最多20动作/30API/3video加fallback；WER.4468→.3015。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01496",
      "title": "SALD: Self-Referenced Advantage Learning for Diffusion Models",
      "published": "2026-10-01T11:37:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01496",
          "title": "SALD: Self-Referenced Advantage Learning for Diffusion Models",
          "published": "2026-10-01T11:37:37Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SALD 同模型 easy-noise 无梯度教师与 hard-noise 学生比较，保留 batch-normalized 可微优势权重、样本 EMA 噪声课程和频域差异门控。公开扩散数据/检查点可真实训练。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01496",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01496v1",
              "location": "§2.1–2.5/Eq6–17; §3; Appendix D/E",
              "notes": "SALD 同模型 easy-noise 无梯度教师与 hard-noise 学生比较，保留 batch-normalized 可微优势权重、样本 EMA 噪声课程和频域差异门控。公开扩散数据/检查点可真实训练。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01496v1",
          "locations": [
            "§2.1–2.5/Eq6–17; §3; Appendix D/E"
          ],
          "limitations": "优势权重和空间权重不能随意 detach；最终仍是加权 hard 残差损失，非直接 easy-hard 蒸馏；频域门控不是逐像素因果解释；两次前向成本需等预算。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "SALD 同模型 easy-noise 无梯度教师与 hard-noise 学生比较，保留 batch-normalized 可微优势权重、样本 EMA 噪声课程和频域差异门控。公开扩散数据/检查点可真实训练。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01492",
      "title": "Q-SPT: Learnable Query-Based Compression for Low-Frame-Rate Speech Tokenization",
      "published": "2026-10-01T11:35:01Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01492",
          "title": "Q-SPT: Learnable Query-Based Compression for Low-Frame-Rate Speech Tokenization",
          "published": "2026-10-01T11:35:01Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Q-SPT 用滑窗 query 交叉注意力降采样 SenseVoice/DAC 特征，语义 FSQ+条件声学 RVQ，联合频谱/对抗/文本重建等训练。LibriSpeech 重建、ASR/TTS 支持公开验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01492",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01492v1",
              "location": "§2.1–2.2/Eq1–5; §3.1–3.3",
              "notes": "Q-SPT 用滑窗 query 交叉注意力降采样 SenseVoice/DAC 特征，语义 FSQ+条件声学 RVQ，联合频谱/对抗/文本重建等训练。LibriSpeech 重建、ASR/TTS 支持公开验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01492v1",
          "locations": [
            "§2.1–2.2/Eq1–5; §3.1–3.3"
          ],
          "limitations": "文本重建头仅训练存在；不同码率/stride 的修改 baseline 必须明确；不能仅用量化 toy 证明 ASR/TTS 性能。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Q-SPT 用滑窗 query 交叉注意力降采样 SenseVoice/DAC 特征，语义 FSQ+条件声学 RVQ，联合频谱/对抗/文本重建等训练。LibriSpeech 重建、ASR/TTS 支持公开验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01491",
      "title": "Auditing Web Agent Evaluation on WebArena-Lite: Human Review of Outcomes and Trajectories",
      "published": "2026-10-01T11:31:37Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01491",
          "title": "Auditing Web Agent Evaluation on WebArena-Lite: Human Review of Outcomes and Trajectories",
          "published": "2026-10-01T11:31:37Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01491",
          "location": "Title and complete abstract",
          "decision": "rejected",
          "reason": "WebArenaLite165固定任务、MASM动作分析+memory与proceduralGuide观察性比较；失败human纠正仅GPT非Qwen，25步净+6但pairedp=.392，一次rollout/任务。正文§6承认Guide一例暴露中间答案与一例statecarryover；55.2%有progress且人工audit非新公共自动执行器。不能把guide当无gold策略能力，也未形成有独立新增核心的合格算法/公共评测入口。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01491v1",
              "location": "§3.2；§4；§5 Tables3–5；§6"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01490",
      "title": "The Persona Is Still There, but Who Is Speaking? Latent Identity Reversion in Persistent AI Agents",
      "published": "2026-10-01T11:30:39Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01490",
          "title": "The Persona Is Still There, but Who Is Speaking? Latent Identity Reversion in Persistent AI Agents",
          "published": "2026-10-01T11:30:39Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01490",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "persona system anchor丢失的行为事故/受控研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01451",
      "title": "A Multi-Agent LLM Framework for Personalized Health Checkup Interpretation and Guidance",
      "published": "2026-10-01T10:48:04Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01451",
          "title": "A Multi-Agent LLM Framework for Personalized Health Checkup Interpretation and Guidance",
          "published": "2026-10-01T10:48:04Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01451",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "健康检查系统29intents/13mapped agents确定路由最多4intent，并行RAG后固定顺序+LLM合成，属于专域工程集成非新通用算法。120韩文compound queries/5合成records且Single限定单intent，比较包含结构性coverage差异；7类仅4类测试，memory/prefilter未评估，非临床安全证据，critical failures15→13.3%类似。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/pdf/2610.01451v1",
              "location": "PDF pp3–7 §3–4.4；pp8–10；AppendixB/C"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01434",
      "title": "MWOP: Modality-aware Width-wise Operation Pruning for Efficient MLLMs",
      "published": "2026-10-01T10:31:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01434",
          "title": "MWOP: Modality-aware Width-wise Operation Pruning for Efficient MLLMs",
          "published": "2026-10-01T10:31:21Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录mwop，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01434",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01415",
      "title": "Beyond Memory: Harnessing Long-Horizon Agents with Explicit Belief States",
      "published": "2026-10-01T10:21:46Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01415",
          "title": "Beyond Memory: Harnessing Long-Horizon Agents with Explicit Belief States",
          "published": "2026-10-01T10:21:46Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01415",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "PoS显式belief state与trapping恢复已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01395",
      "title": "AF-Muon: An AdamW-Free Muon Optimizer for Tied-Embedding Models",
      "published": "2026-10-01T09:59:36Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01395",
          "title": "AF-Muon: An AdamW-Free Muon Optimizer for Tied-Embedding Models",
          "published": "2026-10-01T09:59:36Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录af-muon，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01395",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01389",
      "title": "AiSearch: Interactive Multi-Modal Search with VLMs",
      "published": "2026-10-01T09:56:32Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01389",
          "title": "AiSearch: Interactive Multi-Modal Search with VLMs",
          "published": "2026-10-01T09:56:32Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "AiSearch交互多模态检索框架利用既有VLM，无新基础模型核心机制。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01389",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01364",
      "title": "LLM-Driven Multi-Agent Control for Skill-Based Smart Manufacturing",
      "published": "2026-10-01T09:34:25Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01364",
          "title": "LLM-Driven Multi-Agent Control for Skill-Based Smart Manufacturing",
          "published": "2026-10-01T09:34:25Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01364",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "智能制造MCP包装OPCUA、MQTT通信、外部state注入+物理toolmask，比较标准orchestrator/peer/mono三拓扑无新通用规划学习算法。9模拟任务各10run、单Gemma4 31B，成功run条件耗时token；mono/peer93%/orchestrator87%，silentfault子任务相反，不是实厂部署或通用公共评测新增。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01364v1",
              "location": "§IV-A–C；§V；§VI；§VII–VIII"
            }
          ],
          "reviewer": "post_training_review",
          "source_audit": "agent-post-delegated-results.json"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01349",
      "title": "PACE: Provenance-Aware Capability Enforcement for Tool-Using LLM Agents",
      "published": "2026-10-01T09:18:05Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01349",
          "title": "PACE: Provenance-Aware Capability Enforcement for Tool-Using LLM Agents",
          "published": "2026-10-01T09:18:05Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01349",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "PACE已收录，影响路径cut/能力effect执行前门控。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01345",
      "title": "ARCCS: An Automated Regulatory Compliance Checking System",
      "published": "2026-10-01T09:17:22Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01345",
          "title": "ARCCS: An Automated Regulatory Compliance Checking System",
          "published": "2026-10-01T09:17:22Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01345",
          "location": "§2.1–2.3；§3.1–3.3；§4；§5",
          "decision": "out_of_scope",
          "reason": "ARCCS用法规结构分段→原子requirement→scope适用/证据RAG→四标签confidence门槛的人机审查webapp，无新通用优化/规划机制。GDPR三terms文档100requirement、90LLMjudge无deterministicgold；采购100合成trace×12规则是受控sanity非真实法务覆盖。专门监管工具/小合成集不作为通用Agent或evolve公共新增。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01345v1",
              "location": "§2.1–2.3；§3.1–3.3；§4；§5"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01325",
      "title": "PPO-HRAP: Proximal Policy Optimization with a Hybrid Regime-Aware Policy for Risk-Controlled Trading",
      "published": "2026-10-01T08:49:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01325",
          "title": "PPO-HRAP: Proximal Policy Optimization with a Hybrid Regime-Aware Policy for Risk-Controlled Trading",
          "published": "2026-10-01T08:49:44Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01325",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "PPO-HRAP金融波动先验混合传统RL，非语言Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01316",
      "title": "What Wins a Vote? Formatting, Length, and Lexical Diversity in the French Compar:IA LLM Arena",
      "published": "2026-10-01T08:47:35Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.01316",
          "title": "What Wins a Vote? Formatting, Length, and Lexical Diversity in the French Compar:IA LLM Arena",
          "published": "2026-10-01T08:47:35Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "ComparIA 的偏好风格效应转后训练方向审查。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01316",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.01316",
          "title": "What Wins a Vote? Formatting, Length, and Lexical Diversity in the French Compar:IA LLM Arena",
          "pool": "cross_track_extra",
          "decision": "accepted",
          "reason": "公开偏好评估分析入口：投票时截断对话、风格/长度/词汇联合Bradley–Terry与model内对照；官方代码及derived data可读，原French ComparIA数据有gate。137293 decisive votes/116 models，complete-case127092；调整rank不是已证实更接近能力，不能因观察关联推断风格因果效应。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验、限制与公开资源定向审查",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01316v1",
              "location": "§2.2；§3.1–3.2；§4 rank comparison；Data/code statement"
            },
            {
              "url": "https://github.com/simonaszilinskas/style-control-analysis",
              "location": "官方资源/版本状态"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01286",
      "title": "Dyna3: VLM-Guided Training-Free 4D Reconstruction via Depth Foundation Models",
      "published": "2026-10-01T08:24:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01286",
          "title": "Dyna3: VLM-Guided Training-Free 4D Reconstruction via Depth Foundation Models",
          "published": "2026-10-01T08:24:21Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Dyna3 用 DA3 特征跨帧最佳匹配相似度判运动，Qwen2-VL/SAM3 语义 mask 协同分离静态聚合和逐帧动态点云。DAVIS/TUM/Sintel/DyCheck 可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01286",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01286v1",
              "location": "§3.2–3.6/Eq2; §4.1–4.6; Appendix A",
              "notes": "Dyna3 用 DA3 特征跨帧最佳匹配相似度判运动，Qwen2-VL/SAM3 语义 mask 协同分离静态聚合和逐帧动态点云。DAVIS/TUM/Sintel/DyCheck 可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01286v1",
          "locations": [
            "§3.2–3.6/Eq2; §4.1–4.6; Appendix A"
          ],
          "limitations": "不能将真实 DA3/SAM3 替换为 GT mask；所有 VLM/分割/重建开销须计入；公开检查点兼容性仍需实际验证。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "Dyna3 用 DA3 特征跨帧最佳匹配相似度判运动，Qwen2-VL/SAM3 语义 mask 协同分离静态聚合和逐帧动态点云。DAVIS/TUM/Sintel/DyCheck 可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01278",
      "title": "SCOPE-AD: Sequential cost-aware ordinal-belief planning with energy-based models for diagnostic agents",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01278",
          "title": "SCOPE-AD: Sequential cost-aware ordinal-belief planning with energy-based models for diagnostic agents",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "SCOPE-AD以观测ordinal belief、离线soft Bellman EBM规划teacher，再masked KL蒸馏到Qwen；ADNI患者级1552/333/333，真实未取得值隐藏。限医学离线规划非通用OPD或临床部署。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01278",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.01278v1",
              "location": "§2.2–2.4 Eq.3–4；§3"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.01278",
          "title": "SCOPE-AD: Sequential cost-aware ordinal-belief planning with energy-based models for diagnostic agents",
          "published": "2026-10-01T08:16:07Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.01278v1",
          "location": "§2.2–2.4 Eq.3–4；§3",
          "decision": "accepted",
          "reason": "SCOPE-AD以观测ordinal belief、离线soft Bellman EBM规划teacher，再masked KL蒸馏到Qwen；ADNI患者级1552/333/333，真实未取得值隐藏。限医学离线规划非通用OPD或临床部署。",
          "reviewer": "post_training_review_reused",
          "evidence": "经并行审查代理正文方法及实验定向核查，本Agent按完整摘要及共享正文记录确认与Agent机制范围相符。",
          "limitations": "复用正文审查而非本代理重读；公共artifact可执行性未在本条再次核验；接受是研究候选，不是实现完成。",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01275",
      "title": "Know When to Hold 'em: Correct-Token Retention in Uniform-State Diffusion Language Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01275",
          "title": "Know When to Hold 'em: Correct-Token Retention in Uniform-State Diffusion Language Models",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "USDM correct-token retention辅助loss属于扩散模型预训练/架构训练，转基础模型。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01275",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01270",
      "title": "Not All Is Lost: Repairing Lossy User Preference States of Personalization Encoders",
      "published": "2026-10-01T08:09:37Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.01270",
          "title": "Not All Is Lost: Repairing Lossy User Preference States of Personalization Encoders",
          "published": "2026-10-01T08:09:37Z",
          "repository_status": "implemented",
          "decision": "implemented",
          "review_level": "registry",
          "fulltext_review_completed": false,
          "reason": "REPAIR 已实现；只复核注册，不重复列作本轮新增。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01270",
              "location": "research-manifest.json"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01257",
      "title": "Science Utopia? Closed-Loop LLM Simulation of Academic Research Ecosystems",
      "published": "2026-10-01T07:51:10Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01257",
          "title": "Science Utopia? Closed-Loop LLM Simulation of Academic Research Ecosystems",
          "published": "2026-10-01T07:51:10Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01257",
          "location": "§2.1–2.2；§3.1–3.4；§5",
          "decision": "out_of_scope",
          "reason": "Suto模拟10年学术生态：研究者从当年可得SciEvo真实论文选择artifact而非实际开展科研，三reviewer均分+定额accept，grant rank与预算淘汰构成闭环。5000researcher worlds研究制度仿真，topic探索/资金等结果由建模机制驱动，非新通用Agent优化或真实科研能力基准。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01257v1",
              "location": "§2.1–2.2；§3.1–3.4；§5"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01256",
      "title": "DeFA: Dependency-Guided Failure Attribution for LLM Agents",
      "published": "2026-10-01T07:50:22Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01256",
          "title": "DeFA: Dependency-Guided Failure Attribution for LLM Agents",
          "published": "2026-10-01T07:50:22Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01256",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "DeFA依赖/失败传播图归因已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01243",
      "title": "When the Judge Acts: Auditing VLM-Guided Image Selection on Culturally Situated Prompts",
      "published": "2026-10-01T07:40:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01243",
          "title": "When the Judge Acts: Auditing VLM-Guided Image Selection on Culturally Situated Prompts",
          "published": "2026-10-01T07:40:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "JudgeActs固定CulturalFrames候选池，三次cyclic顺序检查与预设abstention gate，对照精确随机期望及事后人评oracle；可作VLM选择可靠性审计。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01243",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01243v1",
              "location": "§3 measures; §4.1–4.5; §7",
              "notes": "JudgeActs固定CulturalFrames候选池，三次cyclic顺序检查与预设abstention gate，对照精确随机期望及事后人评oracle；可作VLM选择可靠性审计。"
            }
          ],
          "source": "https://arxiv.org/html/2610.01243v1",
          "locations": [
            "§3 measures",
            "§4.1–4.5",
            "§7"
          ],
          "limitations": "人评/作者/国家元数据不入judge；300主集按prompt hash独立于30dev，bootstrap按prompt不按调用。3旋转非全排列，跨模型视觉预算/schema不同；abstention必须同时报覆盖，源码公开不表示底层图像有再分发许可。",
          "code_url": "https://github.com/seochan99/JudgeActs",
          "code_status": "official pipeline linked; source dataset has no declared license",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01243v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "JudgeActs固定CulturalFrames候选池，三次cyclic顺序检查与预设abstention gate，对照精确随机期望及事后人评oracle；可作VLM选择可靠性审计。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01238",
      "title": "Mixture-Trained Merging for Unified Multi-Objective Models",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01238",
          "title": "Mixture-Trained Merging for Unified Multi-Objective Models",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "MTM训练mixture-biased soft experts，以merge-simplex多目标BO选分支混合并迭代复用merged起点；真实Qwen4B/OLMo7B多域与think模式，必须validation选择并计入搜索训练。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01238",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.01238v1",
              "location": "§4.1–4.3；§5.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01234",
      "title": "ASCRIBE: Atomic and Significance-Based Reasoning for Thai Clinical SOAP Note Generation",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01234",
          "title": "ASCRIBE: Atomic and Significance-Based Reasoning for Thai Clinical SOAP Note Generation",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "ASCRIBE原子事实/临床重要性结构化推理、五类领域reward，正文LoRA SFT+标准GRPO；无新增核心优化器或蒸馏机制，归临床应用。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01234",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/pdf/2610.01234v1",
              "location": "§3.2.1–3.2.2；§6–7（PDF）"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01207",
      "title": "Dependency-Aware Reward Shaping for Agentic Reinforcement Learning",
      "published": "2026-10-01T07:16:28Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01207",
          "title": "Dependency-Aware Reward Shaping for Agentic Reinforcement Learning",
          "published": "2026-10-01T07:16:28Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01207",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "DARS依赖图predicate potential reward shaping已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01195",
      "title": "Federated Agent Optimization",
      "published": "2026-10-01T07:06:00Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01195",
          "title": "Federated Agent Optimization",
          "published": "2026-10-01T07:06:00Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01195",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Federated Agent Optimization问题定义/议程，无实现新算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01192",
      "title": "FlashBack: Knowing When to Remember in Streaming Vision-Language Models",
      "published": "2026-10-01T07:05:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01192",
          "title": "FlashBack: Knowing When to Remember in Streaming Vision-Language Models",
          "published": "2026-10-01T07:05:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "FlashBack 分隔原生流式状态和临时 Recall 分支，以时间证据路由选择历史检索/SideKV，Recall 推理不写回原生历史。公开视频基准可测因果长期记忆。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01192",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.01192v1",
              "location": "§3.2–3.4; §4.1–4.4; §6",
              "notes": "FlashBack 分隔原生流式状态和临时 Recall 分支，以时间证据路由选择历史检索/SideKV，Recall 推理不写回原生历史。公开视频基准可测因果长期记忆。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.01192v1",
          "locations": [
            "§3.2–3.4; §4.1–4.4; §6"
          ],
          "limitations": "原作者代码称后续公布；记忆库只能含观测前缀，禁止全视频离线检索；需计入临时检索/推理成本。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "FlashBack 分隔原生流式状态和临时 Recall 分支，以时间证据路由选择历史检索/SideKV，Recall 推理不写回原生历史。公开视频基准可测因果长期记忆。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01184",
      "title": "ReCast: Contract-Preserving Protection for Fixed-Interface Multimodal Reasoning",
      "published": "2026-10-01T07:00:48Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01184",
          "title": "ReCast: Contract-Preserving Protection for Fixed-Interface Multimodal Reasoning",
          "published": "2026-10-01T07:00:48Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "ReCast隐私媒体重构与远程解题agent工作流，agent track范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01184",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01180",
      "title": "Skeleton-and-Strategy Prompting: Training-Free Negation Understanding for Vision-Language Models",
      "published": "2026-10-01T06:53:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01180",
          "title": "Skeleton-and-Strategy Prompting: Training-Free Negation Understanding for Vision-Language Models",
          "published": "2026-10-01T06:53:45Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "SSP否定理解检索示例及提示策略，无新可训练核心模型。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01180",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01172",
      "title": "Learning Rate Transfer for Hybrid Transformer-SSM Architectures",
      "published": "2026-10-01T06:46:03Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01172",
          "title": "Learning Rate Transfer for Hybrid Transformer-SSM Architectures",
          "published": "2026-10-01T06:46:03Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "混合Transformer-SSM的naive μP+AdamW跨width学习率迁移给出可执行参数化/选参配方，可作研究配置operator而非新理论保证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01172",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01172v1",
              "location": "§3.1–3.4; §4.1–4.3; §5.1–5.4; Limitations/AppA.3"
            },
            {
              "url": "https://arxiv.org/html/2610.01172v1",
              "location": "§3.1–3.4; §4.1–4.3; §5.1–5.4; Limitations/AppA.3",
              "notes": "embeddingN(0,1)、hiddenwidth尺度和LRη/d、zerooutput；7serial/parallelhybrid，w256/512/1024及1.24B；AdamW percomponentnormalization；比较blockwiseSSM规则，transfergap多数0%，部分heldout佐证。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01172v1",
          "locations": [
            "§3.1–3.4",
            "§4.1–4.3",
            "§5.1–5.4",
            "Limitations/AppA.3"
          ],
          "limitations": "离散LR网格0gap非连续最佳；WT2训练多epochtrainloss最优1.0与val0.1不同必须本地val；24.9Btoken仅单LR单seed，不是大规模完整sweep；Mamba simplifiedZOH固定state16不等理论trueZOHgrowstate；coordinate-check失败不推出普适充分条件。",
          "code_status": "未在已核官方正文中找到作者源码入口；算法/实验描述可复核，未宣称源码已发布",
          "kind": "training_configuration_operator",
          "implementation_status": "not_implemented",
          "fulltext_notes": "embeddingN(0,1)、hiddenwidth尺度和LRη/d、zerooutput；7serial/parallelhybrid，w256/512/1024及1.24B；AdamW percomponentnormalization；比较blockwiseSSM规则，transfergap多数0%，部分heldout佐证。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01166",
      "title": "CineMR: Tool-Integrated Vision-Language Reasoning for Quantitative Cardiac MRI Assessment",
      "published": "2026-10-01T06:43:42Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01166",
          "title": "CineMR: Tool-Integrated Vision-Language Reasoning for Quantitative Cardiac MRI Assessment",
          "published": "2026-10-01T06:43:42Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CineMR心脏MRI工具使用医学agent，专用应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01166",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01161",
      "title": "My FAULT: Self-Diagnosis as Credit Assignment in Self-Evolving Agentic Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01161",
          "title": "My FAULT: Self-Diagnosis as Credit Assignment in Self-Evolving Agentic Reinforcement Learning",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已实现My FAULT自诊断terminal credit redistribution，保持既有保真度声明。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01161",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12561：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.01161",
          "title": "My FAULT: Self-Diagnosis as Credit Assignment in Self-Evolving Agentic Reinforcement Learning",
          "published": "2026-10-01T06:41:10Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01161",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "FAULT自诊断错误成本与terminal credit redistribution已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01138",
      "title": "Auditing Action Settlement in LLM Agent Environments: Order, Progress, and Replay",
      "published": "2026-10-01T06:17:52Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01138",
          "title": "Auditing Action Settlement in LLM Agent Environments: Order, Progress, and Replay",
          "published": "2026-10-01T06:17:52Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01138",
          "location": "§2.1–2.3；§3.1/3.4–3.5；§4",
          "decision": "pending",
          "reason": "typed proposals冻结snapshot，五仲裁策略，位置不依顺序需单move/唯一占位等假设，不推全state公平。2160脚本episodes与独立oracle/replay注错充分，但LLM archives无有效争用、pilot不平衡且正文明确artifacts local非publicrelease。方法非新同步架构、公共结算回归harness未释放，已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01138v1",
              "location": "§2.1–2.3；§3.1/3.4–3.5；§4"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01128",
      "title": "Grounding Large Language Models in DSGE Simulators for Policy Generation and Forecasting",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01128",
          "title": "Grounding Large Language Models in DSGE Simulators for Policy Generation and Forecasting",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "公开DSGE语言Agent环境：Snowdrop结构模拟器的状态深克隆、action校验、rolling forecast只提交首步、不可重写历史；matched PPO/GRPO共享起点/冲击。作者repo已可读，可作领域仿真任务；不是现实政策建议/实盘因果证据。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01128v1",
              "location": "§3.1–3.3；§7.1–7.3；§8"
            },
            {
              "url": "https://github.com/vasudeywos/Grounding_LLM_in_DSGE_Simulators_for_Policy_Generation_and_Forecasting",
              "location": "作者资源入口只读核查；边界见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "DSGE模拟器接入PPO/GRPO比较，摘要未提出新优化算法。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01127",
      "title": "Counting and Min-Cost Encoding for Tokenization in Large Language Models",
      "published": "2026-10-01T06:11:38Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01127",
          "title": "Counting and Min-Cost Encoding for Tokenization in Large Language Models",
          "published": "2026-10-01T06:11:38Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "CNF–MCE以直接substring统计/实际使用过滤建词表，再用带边界成本的全局DP分词，属清晰基础模型tokenizer算法候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01127",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01127v1",
              "location": "§3.1 Algorithms1/2; §3.2 Eq1–4; §4.1–4.6 Tables5–8; App B.1"
            },
            {
              "url": "https://arxiv.org/html/2610.01127v1",
              "location": "§3.1 Algorithms1/2; §3.2 Eq1–4; §4.1–4.6 Tables5–8; App B.1",
              "notes": "多lengthround/trie剪枝计数topm，MCEtokenize再topk使用频次；256bytes覆盖，cost1+boundary(.05或infty)+小IDcost，suffixDP保全局最小非greedy。6域同10kdocs压缩；1.8B平均44.1对44.1，8B51.6对51.0，8B CNF实际8.99B总参/6.95B非embed。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01127v1",
          "locations": [
            "§3.1 Algorithms1/2",
            "§3.2 Eq1–4",
            "§4.1–4.6 Tables5–8",
            "App B.1"
          ],
          "limitations": "8B mix250k对qwen152k词表/embedding量不同，不是同总参数比较；compression数字不自动等latency，MCE tokenizer本身成本须计。训练预算与字符曝光须重新严格匹配，已有LM直接替换segmentation分布不保证能力。未找到作者公开代码/词表链接；保留完整Unicode单位与DP成本而非仅最长匹配。",
          "code_url": null,
          "implementation_status": "not_implemented",
          "fulltext_notes": "多lengthround/trie剪枝计数topm，MCEtokenize再topk使用频次；256bytes覆盖，cost1+boundary(.05或infty)+小IDcost，suffixDP保全局最小非greedy。6域同10kdocs压缩；1.8B平均44.1对44.1，8B51.6对51.0，8B CNF实际8.99B总参/6.95B非embed。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01102",
      "title": "MASkillBlender: Decentralized Whole-Body Coordination for Multi-Humanoid Loco-Manipulation via Skill Blending",
      "published": "2026-10-01T05:42:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01102",
          "title": "MASkillBlender: Decentralized Whole-Body Coordination for Multi-Humanoid Loco-Manipulation via Skill Blending",
          "published": "2026-10-01T05:42:42Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01102",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "MASkillBlender多humanoid传统RL技能blending，无LLM策略。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01093",
      "title": "OrbitTAMP: Grounding Language Models for Task and Motion Planning in Spacecraft Rendezvous",
      "published": "2026-10-01T05:37:38Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01093",
          "title": "OrbitTAMP: Grounding Language Models for Task and Motion Planning in Spacecraft Rendezvous",
          "published": "2026-10-01T05:37:38Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01093",
          "location": "§III-A–B；§IV-D/E；§V-A/TableIII",
          "decision": "out_of_scope",
          "reason": "OrbitTAMP自然语言→partial MissionConfig→行为-时间图枚举/评估→waypoint→SCP；字段已指定则保留，安全来自后级约束优化非LLM。1000test是10%on-grid模块数据且无语言/behaviorselection；最终采用greedywaypoint非学习proposal。航天特定图/动力学TAMP组合，未见可独立通用Agent优化新增。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01093v1",
              "location": "§III-A–B；§IV-D/E；§V-A/TableIII"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01076",
      "title": "GLoC-EHR: Evidence-Cited Clinical Reasoning over Global Context and Local EHR Events",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01076",
          "title": "GLoC-EHR: Evidence-Cited Clinical Reasoning over Global Context and Local EHR Events",
          "repository_status": "new",
          "decision": "accepted",
          "reason": "GLoC-EHR新增global/local EHR memory接口与分阶段alignment、evidence-only sufficiency辅助loss；128350患者7:1:2隔离及外院验证。RL本身标准GRPO，接纳架构/grounded训练机制，gold只teacher/scorer可见。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01076",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.01076v1",
              "location": "§3.1–3.4 Eq.4–5；§4.1"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01073",
      "title": "Safety Must Survive Self-Improvement: Why Failures Persist and How Agents Recover",
      "published": "2026-10-01T05:13:51Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01073",
          "title": "Safety Must Survive Self-Improvement: Why Failures Persist and How Agents Recover",
          "published": "2026-10-01T05:13:51Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01073",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "RSI Safety当前contract验证/validated rollback已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01066",
      "title": "Probe with Participation Trophies: Random-Reward RL as a Probe of LLM Capability",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01066",
          "title": "Probe with Participation Trophies: Random-Reward RL as a Probe of LLM Capability",
          "repository_status": "new",
          "decision": "reviewed_deferred",
          "reason": "随机奖励checkpoint响应诊断有固定rollout交叉、16配对replicate及任务/奖励/输入控制，不是新的可靠能力训练。官方rl-random-prob仓库当前明确empty，缺公共脚本/数据，待补发后评估诊断入口。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01066v1",
              "location": "§3；Appendix 10；官方仓库empty状态"
            },
            {
              "url": "https://github.com/mynotwo/rl-random-prob",
              "location": "作者资源入口；当前可用性限制见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_decision": "rejected",
          "core_algorithm_reason": "随机奖励RL作为capability reachability probe，是诊断方法非改进训练算法。",
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "pool": "main",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "随机奖励checkpoint响应诊断有固定rollout交叉、16配对replicate及任务/奖励/输入控制，不是新的可靠能力训练。官方rl-random-prob仓库当前明确empty，缺公共脚本/数据，待补发后评估诊断入口。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01054",
      "title": "Capturing In-Context Learning Dynamics with Task Operators",
      "published": "2026-10-01T04:50:17Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01054",
          "title": "Capturing In-Context Learning Dynamics with Task Operators",
          "published": "2026-10-01T04:50:17Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Task Operator从ICL前向提取逐head/位置的乘性softmax质量与加性context value，用于无demo replay；解析定义、公开实现、明确answer-excluded验证和测试分离满足候选条件。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01054",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01054v1",
              "location": "§3 Eq1–7; §4.1/Table1; App B/C/E; official README"
            },
            {
              "url": "https://arxiv.org/html/2610.01054v1",
              "location": "§3 Eq1–7; §4.1/Table1; App B/C/E; official README",
              "notes": "u=w u'+b仅同前向contextmask是精确等式；replay更新WO diag(w),WOb再作用ZSL隐状态只是近似。8demos32无答案val，用ICL自己生成tokens提取/teacherforce NLL，template独立/content与output平均；稀疏p从.2..1 val选，full默认。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01054v1",
          "locations": [
            "§3 Eq1–7",
            "§4.1/Table1",
            "App B/C/E",
            "official README"
          ],
          "limitations": "generation不是GT答案，必须剥除test标签并保持GPQA non-Diamond demos/val；验证只收未hitbudgetcompletion应报告过滤数。任务template映射不能用同一最后token偏置替代，多shot易不稳；额外提取/逐site验证成本计入，非训练free等于无成本。",
          "code_url": "https://github.com/gzxiong/task_operator",
          "implementation_status": "not_implemented",
          "fulltext_notes": "u=w u'+b仅同前向contextmask是精确等式；replay更新WO diag(w),WOb再作用ZSL隐状态只是近似。8demos32无答案val，用ICL自己生成tokens提取/teacherforce NLL，template独立/content与output平均；稀疏p从.2..1 val选，full默认。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01042",
      "title": "Beyond Final Accuracy: Auditing Communication in LLM Multi-Agent Systems",
      "published": "2026-10-01T04:34:59Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01042",
          "title": "Beyond Final Accuracy: Auditing Communication in LLM Multi-Agent Systems",
          "published": "2026-10-01T04:34:59Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01042",
          "location": "§3.1–3.3；§4.1；AppendixG与成本；Reproducibility",
          "decision": "pending",
          "reason": "ICR冻结三agent原始轨迹、六有向单hop独立revision，gold只离线分四correctness strata，no-message控制；CR/PR/SR/SCR需分报，SI可掩保留与复制两种行为。430question/2580events选择至少一错，Acc†含未观测推断，latent成本不完整不能speedup。公共评测值得纳入但作者匿名repo curl超时/web不可达，无法核任务/代码/许可，待资源可读。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01042v1",
              "location": "§3.1–3.3；§4.1；AppendixG与成本；Reproducibility"
            }
          ],
          "resource_blocker": "官方匿名仓库 https://anonymous.4open.science/r/AgentICR-AA82/ curl25s超时、web不可读",
          "reviewer": "post_training_review"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01037",
      "title": "SLIM: Simplex-Lattice Interpolation Merging",
      "published": "2026-10-01T04:23:54Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.01037",
          "title": "SLIM: Simplex-Lattice Interpolation Merging",
          "published": "2026-10-01T04:23:54Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "SLIM用专家顶点与两两中点最小simplex二次格点设计拟合合并性能，再约束优化预测AVG；与同36次预算随机设计比较且另有heldout OOD。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01037",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.01037v1",
              "location": "§3.1–3.4 Eq1–8; §4.1/Table1; §5/Tables2–3; §6"
            },
            {
              "url": "https://arxiv.org/html/2610.01037v1",
              "location": "§3.1–3.4 Eq1–8; §4.1/Table1; §5/Tables2–3; §6",
              "notes": "Gemma9B/Llama8B各8expert，36eval拟合；ID用于选系数，OOD AlpacaEval/MATH500/HumanEval/FLORESdevtest/WildGuard。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.01037v1",
          "locations": [
            "§3.1–3.4 Eq1–8",
            "§4.1/Table1",
            "§5/Tables2–3",
            "§6"
          ],
          "limitations": "ID不是独立test；Gemma SLIM OOD50.30低于bestlattice51.85，Llama47.27更高；120eval cubic OOD反降。二次非concave无globalopt保证，36只是辨识模型下界非找好merge普适下界。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Gemma9B/Llama8B各8expert，36eval拟合；ID用于选系数，OOD AlpacaEval/MATH500/HumanEval/FLORESdevtest/WildGuard。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01027",
      "title": "LawCompass: Navigating from Legal QA to Multi-Agent Deep Research with Grounded Evidence",
      "published": "2026-10-01T04:16:08Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01027",
          "title": "LawCompass: Navigating from Legal QA to Multi-Agent Deep Research with Grounded Evidence",
          "published": "2026-10-01T04:16:08Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01027",
          "location": "§4.1–4.5；§5.1–5.2",
          "decision": "out_of_scope",
          "reason": "LawCompass三模式QA/retrieval/deepresearch，LangGraph planner3–5任务、schema修复+固定fallback，executor检索后citationcatalog合成。20query top5人工检索+主观usability，未验证长程法律任务可执行正确性。专门法规RAG/工程路由组合，无新增通用核心算子或公共task/scorer。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01027v1",
              "location": "§4.1–4.5；§5.1–5.2"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01026",
      "title": "It Takes Workflows to Evolve Better Workflows",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.01026",
          "title": "It Takes Workflows to Evolve Better Workflows",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "ledger已在Agent目录实现FloWright，非新候选。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.01026",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12562：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.01026",
          "title": "It Takes Workflows to Evolve Better Workflows",
          "published": "2026-10-01T04:15:49Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.01026",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "FloWright结构分层奖励/多role共演化已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.01023",
      "title": "Groundability, Not Scale Alone: When Weak Reviewers Can Audit Strong Coding Agents",
      "published": "2026-10-01T04:10:59Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01023",
          "title": "Groundability, Not Scale Alone: When Weak Reviewers Can Audit Strong Coding Agents",
          "published": "2026-10-01T04:10:59Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01023",
          "location": "§3；§4；§6 Algorithm1/6.2；§7",
          "decision": "accepted",
          "reason": "reviewability框架区分agent testimony/结构化/独立grounded证据；冻结cascade先空patch/新增staticerror再generatedtest（须base行为失败）再8Breview+abstain。official hidden test仅upperbound不能部署；32Django设计后121/122 GPT+59Gemini一次test，risk .33/.26、overreject .66/.67，generatedpass非证明。可纳独立核验/弃权策略候选，不能宣称可靠弱审强或总成本优势。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01023v1",
              "location": "§3；§4；§6 Algorithm1/6.2；§7"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.01017",
      "title": "Pay for the Fault, Not the Flow: Label-Free In-Flow Multi-Agent Workflow Optimization",
      "published": "2026-10-01T04:01:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.01017",
          "title": "Pay for the Fault, Not the Flow: Label-Free In-Flow Multi-Agent Workflow Optimization",
          "published": "2026-10-01T04:01:23Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.01017",
          "location": "§3.1–3.2 Eq3–8；§4；§5.1–5.3；AppendixD/E",
          "decision": "accepted",
          "reason": "InFlowOp cost=-log rubricsmatch造workflow，topdown拆/bottomup合并，运行中declaredinput/output contract判decomposition/assignment错，先换agent再局部重拆，invalidates descendants重跑之外缓存。无gold但semanticmatch非oracle；rollback不劣仅在检查可信/副作用可还原条件下。Braid8域，3闭源仅5域，singleLLM没工具无法读文件基线弱；同turnbudget单agent比较更有意义，profile成功筛选避免test跨样本泄漏。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.01017v1",
              "location": "§3.1–3.2 Eq3–8；§4；§5.1–5.3；AppendixD/E"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00991",
      "title": "Adapter Thickets: Splitting an RLVR Budget Beats Concentrating It",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00991",
          "title": "Adapter Thickets: Splitting an RLVR Budget Beats Concentrating It",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "Adapter thickets固定训练/160推理rollout预算，随机分片独立LoRA+标准GRPO再投票，是预算分配/集成实证而非新核心训练loss。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00991",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.00991v1",
              "location": "§3；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00988",
      "title": "Auditable Algebraic Counting Field for Cryptic-Pocket Detection from Apo Structures",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00988",
          "title": "Auditable Algebraic Counting Field for Cryptic-Pocket Detection from Apo Structures",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "apo蛋白结构cryptic-pocket监督algebraic field，无LM后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00988",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00984",
      "title": "HADRec: A Hierarchy-Aware Drug Recommendation Framework by Fusing Molecular Knowledge and Electronic Health Record",
      "published": "2026-10-01T03:20:54Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.00984",
          "title": "HADRec: A Hierarchy-Aware Drug Recommendation Framework by Fusing Molecular Knowledge and Electronic Health Record",
          "published": "2026-10-01T03:20:54Z",
          "repository_status": "new",
          "decision": "out_of_scope",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "HADRec 是临床药物推荐，在 MIMIC 医疗数据融合分子/EHR 与 ATC 层级，不是当前互联网搜广推；不把医疗离线指标转述为部署。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00984",
              "location": "Abstract"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00983",
      "title": "The Devil Is in the Reconstruction Loss Scale: Rethinking Optimization in LLM Quantization",
      "published": "2026-10-01T03:19:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00983",
          "title": "The Devil Is in the Reconstruction Loss Scale: Rethinking Optimization in LLM Quantization",
          "published": "2026-10-01T03:19:52Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "将PTQ重构MSE改为分组RMSE，使非零误差的输出梯度范数不依赖损失尺度；sample/channel/token/element是同一家族，可接现有PTQ训练对照。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00983",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00983v1",
              "location": "§3 Eq6–8; §4.1–4.3; Appendix A"
            },
            {
              "url": "https://arxiv.org/html/2610.00983v1",
              "location": "§3 Eq6–8; §4.1–4.3; Appendix A",
              "notes": "将PTQ重构MSE改为分组RMSE，使非零误差的输出梯度范数不依赖损失尺度；sample/channel/token/element是同一家族，可接现有PTQ训练对照。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00983v1",
          "locations": [
            "§3 Eq6–8",
            "§4.1–4.3",
            "Appendix A"
          ],
          "limitations": "模型家族的token/channel默认按整体实验表现选，需独立val；零误差处需数值安全处理并验证梯度；同训练超参、calibration和精度预算，不把fakequant数值改善当真实推理加速。",
          "code_url": "https://github.com/IntelChina-AI/RMSE",
          "code_status": "official repository reachable; not executed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00983v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "将PTQ重构MSE改为分组RMSE，使非零误差的输出梯度范数不依赖损失尺度；sample/channel/token/element是同一家族，可接现有PTQ训练对照。"
        },
        {
          "track": "post-training",
          "id": "2610.00983",
          "title": "The Devil Is in the Reconstruction Loss Scale: Rethinking Optimization in LLM Quantization",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "PTQ重建loss用RMSE进行梯度归一化，属于量化优化。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00983",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00981",
      "title": "NarrativeFlow: Flow-Based Vision-Language-Action Model Using Robot Velocity Fields",
      "published": "2026-10-01T03:18:18Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00981",
          "title": "NarrativeFlow: Flow-Based Vision-Language-Action Model Using Robot Velocity Fields",
          "published": "2026-10-01T03:18:18Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "NarrativeFlow双任务token与叙述差分训练监督增强语言条件机器人flow，可作算法候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00981",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00981v1",
              "location": "§3.1–3.5 Eq1–5; §4.1; §5.1–5.2; App B/E",
              "notes": "DINOv3+Qwen3embedding→4层fusion双readout，训练初/终图生成多caption差分cosloss，仅train目标；FlowasFlowDiT输出带−k(X−Xi)稳定项速度场。Fractal84212/1000/2000，Bridge57064/1000/2000明确train/val/test；300kstepsbatch128，HSR3task20trial。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00981v1",
          "locations": [
            "§3.1–3.5 Eq1–5",
            "§4.1",
            "§5.1–5.2",
            "App B/E"
          ],
          "limitations": "主贡献flow不是完整endtoend新VLA；固定相机且起始末端可见，需配既有flowcontrolpolicy。无原指令样本由初/终图生成指令，须区分人工自然指令测试；goal/GTflow只train/oracle，不得常规inference读取。项目页存在但未核作者源码，teacherforcinghistory到rollout偏移须测。",
          "code_url": "https://shota0520.github.io/NarrativeFlow-project-page/",
          "implementation_status": "not_implemented",
          "fulltext_notes": "DINOv3+Qwen3embedding→4层fusion双readout，训练初/终图生成多caption差分cosloss，仅train目标；FlowasFlowDiT输出带−k(X−Xi)稳定项速度场。Fractal84212/1000/2000，Bridge57064/1000/2000明确train/val/test；300kstepsbatch128，HSR3task20trial。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00979",
      "title": "RISED: RubrIcs for agentic multi-environment Selection and sElf-Distillation",
      "published": "2026-10-01T03:16:58Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00979",
          "title": "RISED: RubrIcs for agentic multi-environment Selection and sElf-Distillation",
          "published": "2026-10-01T03:16:58Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00979",
          "location": "§2.2/2.4；§3 Eq2；§4.1/4.3；§5",
          "decision": "accepted",
          "reason": "RISED固定rubric词表(4环境82/主3环境59)，Qwen32B异步tag每rollout；环境roundrobin定quota下MMR pooled相关−已选冗余选64/128groups，正负rubric选样但teacher仅top3positive union，k3OPD重要性比+GRPO，负rubric用于steer。3环境Qwen3/4B，强baseline仅+1.2/.6pp；半optimizer步不等半总成本，62.9%zero-variance组OPD仍有信号；删distill消融同时删negative steering要注明。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00979v1",
              "location": "§2.2/2.4；§3 Eq2；§4.1/4.3；§5"
            }
          ],
          "post_training_cross_track": true,
          "cross_tracks": [
            "agent",
            "post_training"
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00977",
      "title": "ABSENTIA: Detecting Broken Access Control Vulnerabilities in Web Applications",
      "published": "2026-10-01T03:11:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00977",
          "title": "ABSENTIA: Detecting Broken Access Control Vulnerabilities in Web Applications",
          "published": "2026-10-01T03:11:45Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00977",
          "location": "§4.1–4.4；§5.1–5.2；§7；Code Availability",
          "decision": "accepted",
          "reason": "ABSENTIA应用profile→双LLM抽pattern并集构routegraph→逐route声明invariant、查enforcer并source-grounded反例→共享file跨routecomposition，byte-identical依赖闭包缓存跨commit复用。BAC30已披露漏洞25项目，advisory/fix仅oracle；fixednegative仅对应bug非全repo安全，precision独立human73sample未确认LLMjudge增益。静态白盒defensive审计算子合格，代码正文willavailable不能声明已发布。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00977v1",
              "location": "§4.1–4.4；§5.1–5.2；§7；Code Availability"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00973",
      "title": "Concept Driven Domain Adaptation: Finding an Abstract Needle in a Haystack",
      "published": "2026-10-01T03:03:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00973",
          "title": "Concept Driven Domain Adaptation: Finding an Abstract Needle in a Haystack",
          "published": "2026-10-01T03:03:08Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "CDDA专用于中学物理概念视频检索，应用域适配而非通用基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00973",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00972",
      "title": "VeriHarness: Scaling Agentic Verification for Long-Horizon Tasks",
      "published": "2026-10-01T03:02:17Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00972",
          "title": "VeriHarness: Scaling Agentic Verification for Long-Horizon Tasks",
          "published": "2026-10-01T03:02:17Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00972",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "VeriHarness disagreement/consensus evidence verifier已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00969",
      "title": "A Citation-Grounded Benchmark for Trustworthy Earnings Call Transcript Analysis with Large Language Models",
      "published": "2026-10-01T02:59:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00969",
          "title": "A Citation-Grounded Benchmark for Trustworthy Earnings Call Transcript Analysis with Large Language Models",
          "published": "2026-10-01T02:59:14Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "ECTs-100数字证据以type/value/unit归一比较claim/citation/context，分开grounding与correctness；原完整transcript/题库/执行器发布未定位，先暂缓benchmark接入。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00969",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00969v1",
              "location": "§2.2–2.4; §3.2–3.4; Appendix A",
              "notes": "ECTs-100数字证据以type/value/unit归一比较claim/citation/context，分开grounding与correctness；原完整transcript/题库/执行器发布未定位，先暂缓benchmark接入。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00969v1",
          "locations": [
            "§2.2–2.4",
            "§3.2–3.4",
            "Appendix A"
          ],
          "limitations": "空数字默认1会虚高，须伴随coverage；相同数字不同主体/财期仍会匹配，不等于语义蕴涵。无专家对照校准，只有GPT4.1一种底座六配置，自动生成gold不能冒充金融专业真值；文档级聚合与公司切分必要。",
          "code_status": "official_dataset_and_evaluator_not_located",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.00969v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "ECTs-100数字证据以type/value/unit归一比较claim/citation/context，分开grounding与correctness；原完整transcript/题库/执行器发布未定位，先暂缓benchmark接入。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00964",
      "title": "RPTune: Learned Context Curation for LLM Catalog Search",
      "published": "2026-10-01T02:52:24Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00964",
          "title": "RPTune: Learned Context Curation for LLM Catalog Search",
          "published": "2026-10-01T02:52:24Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录rptune，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00964",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.00964",
          "title": "RPTune: Learned Context Curation for LLM Catalog Search",
          "repository_status": "implemented",
          "decision": "known",
          "reason": "Google RPTune已收录；ledger注明七商家实验及本地L1 curation，不能重复纳新。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00964",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "location": "line 12588：引用已有审查/实现边界，不重复声称新全文审查"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00958",
      "title": "Role-aware Heuristic Episodic Attention for Conversational LLMs",
      "published": "2026-10-01T02:39:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00958",
          "title": "Role-aware Heuristic Episodic Attention for Conversational LLMs",
          "published": "2026-10-01T02:39:52Z",
          "repository_status": "implemented",
          "pool": "main",
          "decision": "known",
          "reason": "ledger已收录rea，沿用既有结论。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00958",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00954",
      "title": "Beyond Leaderboards: Tokenomics of Agentic Small Language Model Ensembles",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00954",
          "title": "Beyond Leaderboards: Tokenomics of Agentic Small Language Model Ensembles",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "SLM ensemble推理反馈及token/cost评测，无参数后训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00954",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.00954",
          "title": "Beyond Leaderboards: Tokenomics of Agentic Small Language Model Ensembles",
          "published": "2026-10-01T02:37:56Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00954",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "SLM ensemble tokenomics case study，摘要主张评测而非新核心训练方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00952",
      "title": "A Matched-Budget Audit Framework for Recaptioned Image-Text Supervision Distributions",
      "published": "2026-10-01T02:35:20Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00952",
          "title": "A Matched-Budget Audit Framework for Recaptioned Image-Text Supervision Distributions",
          "published": "2026-10-01T02:35:20Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "Matched-Budget Recaption Audit在同源图片同文本预算下比较caption覆盖、prefix集中度、CBU密度与图像支持风险，适合作预训练数据筛选诊断。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00952",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00952v1",
              "location": "§4.1–4.2; §5.2–5.4; §6–7",
              "notes": "Matched-Budget Recaption Audit在同源图片同文本预算下比较caption覆盖、prefix集中度、CBU密度与图像支持风险，适合作预训练数据筛选诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00952v1",
          "locations": [
            "§4.1–4.2",
            "§5.2–5.4",
            "§6–7"
          ],
          "limitations": "词窗和regex lexical单位不同必须忠实记录；CBU提取固定Qwen、judge换Gemma并未完全独立，人评仅43resolvedclaims。只caption监督审计，不证明下游T2I训练更好；490Mcaption不可自动当作有权重发源图片，安全/PII/去重仍由训练管道处理。",
          "code_url": "https://huggingface.co/collections/BootsofLagrangian/recaptioned-image-text",
          "code_status": "official caption collection linked; paper describes audit bundle, not executed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00952v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Matched-Budget Recaption Audit在同源图片同文本预算下比较caption覆盖、prefix集中度、CBU密度与图像支持风险，适合作预训练数据筛选诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00922",
      "title": "EyeTAG: Eye Trajectory-Aware Gaze Estimation",
      "published": "2026-10-01T01:57:31Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00922",
          "title": "EyeTAG: Eye Trajectory-Aware Gaze Estimation",
          "published": "2026-10-01T01:57:31Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "EyeTAG注视估计专用时序运动先验，非通用基础模型机制。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00922",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00917",
      "title": "Finding the Right Fit: Model-Harness Interactions across Agent Tasks",
      "published": "2026-10-01T01:49:59Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00917",
          "title": "Finding the Right Fit: Model-Harness Interactions across Agent Tasks",
          "published": "2026-10-01T01:49:59Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00917",
          "location": "§3.1–3.4；§4.1；§7–8",
          "decision": "rejected",
          "reason": "66配置对3固定agentbench的model-harness实证，nativepair非必最好但model/context/tool/timeout原生设置不同；一个countedrun任务、infra重跑取last/缺失零，无法识别单组件因果。无新训练/规划方法或新公共任务/执行评分器；轨迹提案未测，不以排名调查作为新增能力候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00917v1",
              "location": "§3.1–3.4；§4.1；§7–8"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00906",
      "title": "ActiveSaddler: Automated Curriculum Learning for Agent Harness Optimization",
      "published": "2026-10-01T01:36:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00906",
          "title": "ActiveSaddler: Automated Curriculum Learning for Agent Harness Optimization",
          "published": "2026-10-01T01:36:03Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00906",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "ActiveSaddler非平稳failure-pattern bandit课程已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00905",
      "title": "Understanding Issues, Causes and Solutions in Open-Source LLM-based Multi-Agent Systems",
      "published": "2026-10-01T01:34:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00905",
          "title": "Understanding Issues, Causes and Solutions in Open-Source LLM-based Multi-Agent Systems",
          "published": "2026-10-01T01:34:45Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00905",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "开源多Agent issue原因/解决方案经验研究。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00903",
      "title": "Sharpen Before You Adapt: Data-Free Entry-State Sharpening for Test-Time Reinforcement Learning",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00903",
          "title": "Sharpen Before You Adapt: Data-Free Entry-State Sharpening for Test-Time Reinforcement Learning",
          "repository_status": "new",
          "decision": "rejected",
          "reason": "Entry-state sharpening统一分析SPIRAL、R-Zero和多数一致性伪样本SFT的TTRL准备效果，正文不绑定新算法，仍为现有GRPO与自蒸馏配方。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00903",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            },
            {
              "url": "https://arxiv.org/html/2610.00903v1",
              "location": "§3；§4"
            }
          ],
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验协议与主要结果的定向正文核查，非逐字通读附录",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00899",
      "title": "TOAST: Stochastic Robot Action Tokenization for Autoregressive Vision-Language-Action Models",
      "published": "2026-10-01T01:28:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00899",
          "title": "TOAST: Stochastic Robot Action Tokenization for Autoregressive Vision-Language-Action Models",
          "published": "2026-10-01T01:28:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "TOAST动作分词随机监督是清晰的基础VLA训练算子，可优先在公开LIBERO做同预算验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00899",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00899v1",
              "location": "§IV; §V-A–D TablesIII/V; 官方项目页"
            },
            {
              "url": "https://arxiv.org/html/2610.00899v1",
              "location": "§IV; §V-A–D TablesIII/V; 官方项目页",
              "notes": "DCTscale10+dimension-major+512unigram，DROID1Mchunk建词表；每步n64分词按P^α抽样，训练α.1(sim)/.5(real)，所有分词还原同量化动作；推理无分词采样。PaliGemma3B无动作预训练、同demo/30kstepbatch32，3seed2000rollout，bootstrap按seed聚类。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00899v1",
          "locations": [
            "§IV",
            "§V-A–D TablesIII/V",
            "官方项目页"
          ],
          "limitations": "不是动作噪声增广；同step不代表同targettoken FLOPs，需记实际token长度。真实4任务mean50.8相对det+15.8，不能外推开放任务；invalidtokenchunk丢弃重试需统计。项目页声明code但本次未提取到公开代码库链接，OpenPI仅基座。",
          "code_url": "https://kskshr.github.io/toast",
          "implementation_status": "not_implemented",
          "fulltext_notes": "DCTscale10+dimension-major+512unigram，DROID1Mchunk建词表；每步n64分词按P^α抽样，训练α.1(sim)/.5(real)，所有分词还原同量化动作；推理无分词采样。PaliGemma3B无动作预训练、同demo/30kstepbatch32，3seed2000rollout，bootstrap按seed聚类。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00898",
      "title": "When Do Biological Reasoning Models Use Their Biological Inputs?",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00898",
          "title": "When Do Biological Reasoning Models Use Their Biological Inputs?",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "公开bio-mirage干预/冲突评测核实存在，但输入依赖Evo2/蛋白/单细胞等专门生物编码器与KEGG/ChatNT/C2S任务；不是本轮通用LLM后训练或通用Agent评测入口，生物模态方向另列参考。",
          "review_level": "fulltext",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00898v1",
              "location": "§3.1–3.2；§4；Code availability"
            },
            {
              "url": "https://github.com/mims-harvard/bio-mirage",
              "location": "作者资源入口只读核查；边界见reason"
            }
          ],
          "fulltext_review_completed": true,
          "core_algorithm_reason": "生物模型输入依赖的因果评测，非新训练算法。",
          "core_algorithm_decision": "rejected",
          "fulltext_scope": "方法、实验与独立评测价值定向全文核查；未执行代码",
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00890",
      "title": "Cross-Benchmark Transfer from RL on Agentic Coding Tasks",
      "published": "2026-10-01T01:12:24Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00890",
          "title": "Cross-Benchmark Transfer from RL on Agentic Coding Tasks",
          "published": "2026-10-01T01:12:24Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00890",
          "location": "§3.3；§4.1–4.3；§5–6/Table2；§8",
          "decision": "rejected",
          "reason": "KimiK2.7Code rank32LoRA既有GSPO，1700专家repo/terminal任务、pass-to-pass全过gate乘fail-to-pass分数，tooltokensmasked、overlongfiltered，64H200一epoch。六bench/五独立集transfer有实证且finalcheckpoint预固定；部分publicbaseline、TB3trained8infra排除、单recipe无法归因新算法。未提出新增RL/OPD核心或公开1700task执行入口，保留实验参考不纳新实现。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00890v1",
              "location": "§3.3；§4.1–4.3；§5–6/Table2；§8"
            }
          ],
          "post_training_cross_track": true,
          "cross_tracks": [
            "agent",
            "post_training"
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00888",
      "title": "Match the Distribution, Not the Compute: Post-Training Multi-Token Prediction Heads",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00888",
          "title": "Match the Distribution, Not the Compute: Post-Training Multi-Token Prediction Heads",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "MTP head训练及speculative verification serving控制，转基础模型，不是RL/OPD核心。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00888",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00885",
      "title": "FORALL-LEAN-AGENT for Auditable Reasoning in Formal Mathematics and Software Verification",
      "published": "2026-10-01T01:00:35Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00885",
          "title": "FORALL-LEAN-AGENT for Auditable Reasoning in Formal Mathematics and Software Verification",
          "published": "2026-10-01T01:00:35Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00885",
          "location": "§3.1–3.6；§4；§5.3；§6",
          "decision": "accepted",
          "reason": "Forall-Lean-Agent隔离actor与fresh readonly reviewer、同artifact digest双批准；proofbodyless检索、OS全进程树sandbox/provider-only proxy、syntax/name-shadow/axiom审计，再serial clean验证。100VSB/672Putnam与2LeanEval；benchmarkrule/strict/independentkernel分母不同，legacy参考泄漏与filedrift有排除不能算能力。成本/compile/review预算非一致，不把harness收益归单模块。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00885v1",
              "location": "§3.1–3.6；§4；§5.3；§6"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00883",
      "title": "DeBERTa-ConPara: Attack-Aware and Deployment-Realistic Detection of AI-Generated Text",
      "published": "2026-10-01T00:57:33Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00883",
          "title": "DeBERTa-ConPara: Attack-Aware and Deployment-Realistic Detection of AI-Generated Text",
          "published": "2026-10-01T00:57:33Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "DeBERTa生成文本检测器Unicode预处理研究，专用检测应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00883",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00881",
      "title": "Machine Translation for Sign Languages",
      "published": "2026-10-01T00:56:46Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00881",
          "title": "Machine Translation for Sign Languages",
          "published": "2026-10-01T00:56:46Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "手语机器翻译综述，无新算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00881",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00878",
      "title": "UniTrackPLA: Unified Panorama-Language-Action Model for Instruction-Guided Navigation and Dynamic Person Tracking",
      "published": "2026-10-01T00:53:07Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00878",
          "title": "UniTrackPLA: Unified Panorama-Language-Action Model for Instruction-Guided Navigation and Dynamic Person Tracking",
          "published": "2026-10-01T00:53:07Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "UniTrackPLA 将 DINOv2/SigLIP 全景多视图输入与时间/方位编码映射到机器人航点，WAC 预测动作后的潜变量并以观测误差触发重规划。OmniTrack/OmniVLN 可做路由隔离验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00878",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00878v1",
              "location": "§III; §IV; Tables I–III",
              "notes": "UniTrackPLA 将 DINOv2/SigLIP 全景多视图输入与时间/方位编码映射到机器人航点，WAC 预测动作后的潜变量并以观测误差触发重规划。OmniTrack/OmniVLN 可做路由隔离验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00878v1",
          "locations": [
            "§III; §IV; Tables I–III"
          ],
          "limitations": "数据实际可下载与训练 checkpoint 尚待实现前核验；EP@0.2 不是 Success Rate；真实 Go2-W 硬件证据不能替代本地测试。",
          "code_url": "https://tw5775.github.io/UniTrackPLA/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "UniTrackPLA 将 DINOv2/SigLIP 全景多视图输入与时间/方位编码映射到机器人航点，WAC 预测动作后的潜变量并以观测误差触发重规划。OmniTrack/OmniVLN 可做路由隔离验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00872",
      "title": "MemFit: Efficient Long-Term Agentic Memory",
      "published": "2026-10-01T00:44:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00872",
          "title": "MemFit: Efficient Long-Term Agentic Memory",
          "published": "2026-10-01T00:44:33Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00872",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "MemFit append-only原始turn/多路径cross-encoder retrieval已收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00870",
      "title": "An Educator-Guided LLM Pedagogical Agent for Scaffolded Feedback in Conceptual Database Design",
      "published": "2026-10-01T00:38:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00870",
          "title": "An Educator-Guided LLM Pedagogical Agent for Scaffolded Feedback in Conceptual Database Design",
          "published": "2026-10-01T00:38:50Z",
          "source_group": "original",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00870",
          "location": "§3.2–3.4；§4课堂/4.2/4.3；§5",
          "decision": "out_of_scope",
          "reason": "教育ERD四阶段由教师控制披露，LLM选预写问题/模板填槽/后级反馈，episode memory非持续学生模型。63课程学生48完成、383自愿episode，仅186后续artifact，71.1%targetincorporation条件于改图不等正确率；无对照因果学习收益。专域教学部署，无新通用agent核心/可执行公开评测入口。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00870v1",
              "location": "§3.2–3.4；§4课堂/4.2/4.3；§5"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00864",
      "title": "Kinematic MeanFlow: One-Step Action Generation Policy for Robotic Foundation Models",
      "published": "2026-10-01T00:31:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00864",
          "title": "Kinematic MeanFlow: One-Step Action Generation Policy for Robotic Foundation Models",
          "published": "2026-10-01T00:31:19Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "accepted",
          "reason": "K-MF将MeanFlow时间导数拆成双区间JVP，提供真实的一步动作生成训练机制。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00864",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00864v1",
              "location": "§3.2 Eq5–9; §4.1–4.5; App C/E; Limitations/Reproducibility"
            },
            {
              "url": "https://arxiv.org/html/2610.00864v1",
              "location": "§3.2 Eq5–9; §4.1–4.5; App C/E; Limitations/Reproducibility",
              "notes": "sameconditionalpath zt/zc，(1−λ)^2与λ²加权stopgrad导数；λ可随机/.5/3层MLP，generator单独梯度与γ−.5→.5。JVP tangent[v,0,1]双区间拼batch，r/temb相加。GR00TN1.6微调与SimVLAS从零，LIBERO/SimplerEnv/COMPASS。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00864v1",
          "locations": [
            "§3.2 Eq5–9",
            "§4.1–4.5",
            "App C/E",
            "Limitations/Reproducibility"
          ],
          "limitations": "双JVP训练增时≤33%，一步不是无额外训练；H20训练/L40与Orin延迟未替代A100。正文futurecode，mainREADME404不等全库不存在，发布状态未验证；不能拿Euler单步替核心loss，不涵盖全身/灵巧手。",
          "code_url": "https://github.com/IntelChina-AI/K-MF",
          "implementation_status": "not_implemented",
          "fulltext_notes": "sameconditionalpath zt/zc，(1−λ)^2与λ²加权stopgrad导数；λ可随机/.5/3层MLP，generator单独梯度与γ−.5→.5。JVP tangent[v,0,1]双区间拼batch，r/temb相加。GR00TN1.6微调与SimVLAS从零，LIBERO/SimplerEnv/COMPASS。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00855",
      "title": "Lang3DSeg: Annotation-Free Open-Vocabulary 3D Segmentation with Point Transformers",
      "published": "2026-10-01T00:15:47Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00855",
          "title": "Lang3DSeg: Annotation-Free Open-Vocabulary 3D Segmentation with Point Transformers",
          "published": "2026-10-01T00:15:47Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "pending",
          "reason": "Lang3DSeg 用 SAM3 文本集成 mask 经 LiDAR 遮挡/多视图一致性过滤作为 PTv3 加权 CE/Lovasz/CLIP 监督。nuScenes/SemanticKITTI 原始数据公开。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00855",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00855v1",
              "location": "§III-A–C; §IV-A–D; §V",
              "notes": "Lang3DSeg 用 SAM3 文本集成 mask 经 LiDAR 遮挡/多视图一致性过滤作为 PTv3 加权 CE/Lovasz/CLIP 监督。nuScenes/SemanticKITTI 原始数据公开。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.00855v1",
          "locations": [
            "§III-A–C; §IV-A–D; §V"
          ],
          "limitations": "审后延期：原文代码 URL 为 github.com/<org>/Lang3DSeg 占位符且称接收后发布；关键伪标注筛选产物未提供；不能借 GT 类标取代语言伪标注。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "审后延期：原文代码 URL 为 github.com/<org>/Lang3DSeg 占位符且称接收后发布；关键伪标注筛选产物未提供；不能借 GT 类标取代语言伪标注。",
          "upstream_access_verified": false,
          "fulltext_notes": "Lang3DSeg 用 SAM3 文本集成 mask 经 LiDAR 遮挡/多视图一致性过滤作为 PTv3 加权 CE/Lovasz/CLIP 监督。nuScenes/SemanticKITTI 原始数据公开。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00852",
      "title": "Child-Adapted Structured Phonological Representations for Interpretable Speech Sound Analysis",
      "published": null,
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00852",
          "title": "Child-Adapted Structured Phonological Representations for Interpretable Speech Sound Analysis",
          "repository_status": "new",
          "decision": "out_of_scope",
          "reason": "儿童语音phonological表示适配，非语言模型策略训练。",
          "review_level": "abstract",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00852",
              "location": "Abstract（输入检索工件中的完整摘要已逐条审阅）"
            }
          ],
          "fulltext_review_completed": false,
          "pool": "main",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00849",
      "title": "Learning Multiple Timescales for Goal-Conditioned Reinforcement Learning",
      "published": "2026-10-01T00:06:57Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00849",
          "title": "Learning Multiple Timescales for Goal-Conditioned Reinforcement Learning",
          "published": "2026-10-01T00:06:57Z",
          "source_group": "original",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00849",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "GITA多timescale传统offline goal-conditioned RL，无LLM Agent。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00848",
      "title": "Geometric Similarity in VLM Low-Level Vision Representations",
      "published": "2026-10-01T00:06:17Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00848",
          "title": "Geometric Similarity in VLM Low-Level Vision Representations",
          "published": "2026-10-01T00:06:17Z",
          "repository_status": "new",
          "pool": "main",
          "decision": "out_of_scope",
          "reason": "GeoSim多层几何表征相似性解释框架，无新基础模型训练算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00848",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00838",
      "title": "SHARPO: Segment-Level Credit Assignment for Agentic Reinforcement Learning",
      "published": "2026-09-30T23:51:11Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00838",
          "title": "SHARPO: Segment-Level Credit Assignment for Agentic Reinforcement Learning",
          "repository_status": "implemented",
          "published": "2026-09-30T23:51:11Z",
          "decision": "known",
          "reason": "已有SHARPO条目；ledger L12601，沿用既有实现/证据边界，不重复收录。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00838",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "location": "L12601"
            }
          ],
          "review_status": "prior_review_reused"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.00838",
          "title": "SHARPO: Segment-Level Credit Assignment for Agentic Reinforcement Learning",
          "published": "2026-09-30T23:51:11Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00838",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "SHARPO分段teacher-student优势重加权已有post-training/sharpo目录，本轮不重复收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00825",
      "title": "Align Then Reason: A Multimodal Lip-Sync Judge for Dubbing",
      "published": "2026-09-30T23:35:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00825",
          "title": "Align Then Reason: A Multimodal Lip-Sync Judge for Dubbing",
          "published": "2026-09-30T23:35:37Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "pending",
          "reason": "ATR 以 AutoAVSR/XPhoneBERT 单调 CTC 关联视觉嘴型和音素，训练局部软 token judge 与标量校准；50k 多语对话/2100 测试定义清楚。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00825",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00825v1",
              "location": "§2.1–2.3; §3.1–3.5; Appendix A/B",
              "notes": "ATR 以 AutoAVSR/XPhoneBERT 单调 CTC 关联视觉嘴型和音素，训练局部软 token judge 与标量校准；50k 多语对话/2100 测试定义清楚。"
            }
          ],
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.00825v1",
          "locations": [
            "§2.1–2.3; §3.1–3.5; Appendix A/B"
          ],
          "limitations": "审后延期：自建配音训练/专业评价语料与实现未核验公开；未见语言使用 300 genuine target clips 校准，不是无目标数据零样本；Hungarian 块匹配和单 clip 指标须分开。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "审后延期：自建配音训练/专业评价语料与实现未核验公开；未见语言使用 300 genuine target clips 校准，不是无目标数据零样本；Hungarian 块匹配和单 clip 指标须分开。",
          "upstream_access_verified": false,
          "fulltext_notes": "ATR 以 AutoAVSR/XPhoneBERT 单调 CTC 关联视觉嘴型和音素，训练局部软 token judge 与标量校准；50k 多语对话/2100 测试定义清楚。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00809",
      "title": "Paying for Too Many Tokens? Valid and Cost-Efficient Multimodal LLM Annotation with Simple Heuristics",
      "published": "2026-09-30T22:59:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00809",
          "title": "Paying for Too Many Tokens? Valid and Cost-Efficient Multimodal LLM Annotation with Simple Heuristics",
          "published": "2026-09-30T22:59:51Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "视频社会科学标注的采样与网格启发式评估，无新核心模型。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00809",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00795",
      "title": "Can large language models unlock discrete data in ophthalmic diagnostic reports?",
      "published": "2026-09-30T22:35:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00795",
          "title": "Can large language models unlock discrete data in ophthalmic diagnostic reports?",
          "published": "2026-09-30T22:35:13Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "眼科PDF结构化提取20例概念验证，专用医学应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00795",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00779",
      "title": "Effective Synthetic Data Curation Requires Group-Level Signals",
      "published": "2026-09-30T22:16:23Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00779",
          "title": "Effective Synthetic Data Curation Requires Group-Level Signals",
          "repository_status": "new",
          "published": "2026-09-30T22:16:23Z",
          "decision": "accepted",
          "reason": "group-level influence评估下游训练效用，以组内梯度diversity优先分配昂贵group oracle调用，未审组用individual proxy；真实pretrain/RLVR训练，需隔离reference与test。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00779",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00779v1",
              "location": "§3.1–3.2；§5 Eq.3–4"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00767",
      "title": "Pre-training interventions, ex post facto: Grafting model beliefs across checkpoints",
      "published": "2026-09-30T22:02:46Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00767",
          "title": "Pre-training interventions, ex post facto: Grafting model beliefs across checkpoints",
          "repository_status": "new",
          "published": "2026-09-30T22:02:46Z",
          "decision": "accepted",
          "reason": "在base checkpoint学synthetic-document增量再加到post-trained模型，减少reality drift；多个模型及284B规模实测，区别于旧GRAFT的轨迹交换。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00767",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00767v1",
              "location": "§2.1–2.2；§3–5"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00758",
      "title": "Scalable Multi-Task Inverse Reinforcement Learning",
      "published": "2026-09-30T21:52:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00758",
          "title": "Scalable Multi-Task Inverse Reinforcement Learning",
          "published": "2026-09-30T21:52:03Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00758",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "低秩多任务逆强化学习及状态覆盖理论，非LLM Agent核心控制/记忆/工具算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00717",
      "title": "Sequential Functional Structured Tucker Compression for Large Language Model Attentions",
      "published": "2026-09-30T21:06:29Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00717",
          "title": "Sequential Functional Structured Tucker Compression for Large Language Model Attentions",
          "published": "2026-09-30T21:06:29Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "FTC真实顺序student激活度量、共享QKV Tucker与稀疏core联合字节预算、WO独立teacher-map校准，含同度量SeqSVD/等存储core消融，作为模型压缩候选。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00717",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00717v1",
              "location": "§3.1–3.5 Eq1–4; §4.1–4.3 Tables1–3; Appendix A.4 Tables17–18"
            },
            {
              "url": "https://arxiv.org/html/2610.00717v1",
              "location": "§3.1–3.5 Eq1–4; §4.1–4.3 Tables1–3; Appendix A.4 Tables17–18",
              "notes": "MHA/GQA6B–32B，无梯度recovery，固定超参beta.5/anchoring.5/WOmu1/prune.02/2refits。存储包含factor/core与1bitmask；GQA原生K/V不重复。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00717v1",
          "locations": [
            "§3.1–3.5 Eq1–4",
            "§4.1–4.3 Tables1–3",
            "Appendix A.4 Tables17–18"
          ],
          "limitations": "主表本法256校准窗口而baseline128，Qwen2.5-7B强压缩128时PPL12.55→43.90，不能宣称全部等数据净收益；实际2:4 core强压缩58.50，不能把非结构稀疏直接当GPU加速；未核到作者代码。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "MHA/GQA6B–32B，无梯度recovery，固定超参beta.5/anchoring.5/WOmu1/prune.02/2refits。存储包含factor/core与1bitmask；GQA原生K/V不重复。",
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.00717",
          "title": "Sequential Functional Structured Tucker Compression for Large Language Model Attentions",
          "repository_status": "new",
          "published": "2026-09-30T21:06:29Z",
          "decision": "out_of_scope",
          "reason": "FTC顺序Tucker attention压缩，无RL/OPD；已转基础模型轨道，不能作为全局淘汰理由。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00717",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00710",
      "title": "ReLiveGym: Evaluating Long-Lived Agents over Weeks of Replayed Reality",
      "published": "2026-09-30T20:59:33Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00710",
          "title": "ReLiveGym: Evaluating Long-Lived Agents over Weeks of Replayed Reality",
          "published": "2026-09-30T20:59:33Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00710",
          "location": "§3.1–3.3；§4.1–4.2；§5.3；官方README与DATA.md",
          "decision": "accepted",
          "reason": "ReLiveGym8任务真实流回放数周，clock只在wait推进不模拟LLM延迟，observations按timestamp隔离；deterministic timedcommit score+hardcostwallet，sleep/watcher/cron和dailyhindsightmemory/BoNprune。BoN仅过去已结算反馈选次日，无未来gold；某任务得益非全面。官方代码/8scorer/config公开但无数据随仓，DATA提供公开重建而bundle链接占位；需33GB，时间推断有误差，Linux无OSfence仅禁shell。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/pdf/2610.00710v1",
              "location": "§3.1–3.3；§4.1–4.2；§5.3；官方README与DATA.md"
            },
            {
              "url": "https://github.com/SaharaLabsAI/ReLiveGym",
              "location": "README与DATA.md已读，run/scorer/时间与数据构建边界"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00705",
      "title": "Meta-Multi-Agent Reinforcement Learning for Fast Adaptation of Interactive Policies with Applications to Autonomous Driving",
      "published": "2026-09-30T20:52:19Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00705",
          "title": "Meta-Multi-Agent Reinforcement Learning for Fast Adaptation of Interactive Policies with Applications to Autonomous Driving",
          "published": "2026-09-30T20:52:19Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00705",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "Markov games的meta-NE/gradient-play快速适应与自动驾驶策略，非LLM Agent研究方向。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00694",
      "title": "How Divergence Becomes Decision Flips in Compressed Language Models",
      "published": "2026-09-30T20:37:18Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00694",
          "title": "How Divergence Becomes Decision Flips in Compressed Language Models",
          "published": "2026-09-30T20:37:18Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "压缩模型TV与决策翻转的测量关系，主要分析非新能力算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00694",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00680",
      "title": "Curvature Under Attack in hZACH-ViT: Gauge Symmetry, Boundary Saturation, and Adversarial Failure",
      "published": "2026-09-30T20:20:13Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00680",
          "title": "Curvature Under Attack in hZACH-ViT: Gauge Symmetry, Boundary Saturation, and Adversarial Failure",
          "published": "2026-09-30T20:20:13Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "小型ViT曲率与对抗边界饱和诊断，未提出通用基础模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00680",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00677",
      "title": "Harnessing Vision-Language Models for Perceptual Quality Assessment and Autonomous Content Adjustment in Augmented Reality",
      "published": "2026-09-30T20:13:50Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00677",
          "title": "Harnessing Vision-Language Models for Perceptual Quality Assessment and Autonomous Content Adjustment in Augmented Reality",
          "published": "2026-09-30T20:13:50Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "RateAR感知质量benchmark及AR自动调整应用，无新基础模型核心机制。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00677",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00675",
      "title": "LabBook: Harnessing Experimental History for Efficient LLM-Driven Discovery",
      "published": "2026-09-30T20:11:51Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00675",
          "title": "LabBook: Harnessing Experimental History for Efficient LLM-Driven Discovery",
          "published": "2026-09-30T20:11:51Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00675",
          "location": "§3.1–3.3 Eq1–3；§4.1–4.4；Code availability",
          "decision": "accepted",
          "reason": "LabBook单自由文本semanticmemory+losslessexperimentlog，latest完整code/result+best/stagnation信息自动入context，agent最多5次History/Code/Result只读检索并共同输出完整新program与memory，不强制bestparent。49FrontierCS+9公开任务同模型prompt/evaluator，去memory/去retrieval、fullhistory/最高分检索消融；跨任务分数按各task最佳归一仅聚合，测试选择应validation隔离。代码willrelease但机制完整可候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00675v1",
              "location": "§3.1–3.3 Eq1–3；§4.1–4.4；Code availability"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00673",
      "title": "Closing the Loop: Practical Training Recipes for Looped Language Models",
      "published": "2026-09-30T20:09:58Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00673",
          "title": "Closing the Loop: Practical Training Recipes for Looped Language Models",
          "published": "2026-09-30T20:09:58Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "pending",
          "reason": "Closing the Loop有可执行新转换配方：单标量输入重注入+平滑exit加权LM损失，正文完成核查；但本文同数据/步数不等训练FLOPs，尚缺预算匹配控制，不能将额外循环训练当成算法净收益。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00673",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00673v1",
              "location": "§3.1–3.6; §4.1–4.5 Eq1–2; §5.3/Table4; Appendix I/Table21"
            },
            {
              "url": "https://arxiv.org/html/2610.00673v1",
              "location": "§3.1–3.6; §4.1–4.5 Eq1–2; §5.3/Table4; Appendix I/Table21",
              "notes": "Qwen1.7B持续60Btoken，三循环训练两循环测试，GSM66.64→70.96、MMLUPro30.76→34.52；训练31.0GFLOPs/token对dense10.3，成本约3倍。更大4B在所有指标仍领先。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00673v1",
          "locations": [
            "§3.1–3.6",
            "§4.1–4.5 Eq1–2",
            "§5.3/Table4",
            "Appendix I/Table21"
          ],
          "limitations": "从头配方LoopLM总9.9e21FLOPs，对同参数dense2.5e21和3.9B dense7.1e21；不能用310B对Ouro7.7T直接归因架构优越。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "Qwen1.7B持续60Btoken，三循环训练两循环测试，GSM66.64→70.96、MMLUPro30.76→34.52；训练31.0GFLOPs/token对dense10.3，成本约3倍。更大4B在所有指标仍领先。",
          "review_status": "reviewed_deferred"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00666",
      "title": "VisionQ: VLM-as-a-Judge Taxonomy, Dataset and Benchmark for Qualitative Analysis in Computer Vision",
      "published": "2026-09-30T20:03:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00666",
          "title": "VisionQ: VLM-as-a-Judge Taxonomy, Dataset and Benchmark for Qualitative Analysis in Computer Vision",
          "published": "2026-09-30T20:03:52Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "VisionQ具备新VLM judge基准执行与DPO训练代码，可作作者声明一致性的诊断评测，不能包装为客观视觉质量或自动审稿能力。",
          "review_level": "fulltext",
          "kind": "diagnostic_evaluation_and_posttraining",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00666",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00666v1",
              "location": "§3.2–3.4; §4; §5.1–5.4; §6; 官方README Benchmark/Judge"
            },
            {
              "url": "https://arxiv.org/html/2610.00666v1",
              "location": "§3.2–3.4; §4; §5.1–5.4; §6; 官方README Benchmark/Judge",
              "notes": "4524问题/513papers、309eligible bench；输入只重排lettered crop+criterion，隐藏claim/caption/method；paper-disjoint2867train717test、9525symmetry DPO pairs，Gemma4 LoRA49.9→52.4%。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00666v1",
          "locations": [
            "§3.2–3.4",
            "§4",
            "§5.1–5.4",
            "§6",
            "官方README Benchmark/Judge"
          ],
          "limitations": "groundtruth作者声称winner未经独立人类验证；overall gain95%CI[-1.9,+7.0]，明确有效主要位置偏差减少；position swap与symmetry无独立归因；checkpoint900选择须另设val；figure crops仅非商业，公开源污染未排除。",
          "code_url": "https://github.com/ReML-AI/visionq",
          "implementation_status": "not_implemented",
          "fulltext_notes": "4524问题/513papers、309eligible bench；输入只重排lettered crop+criterion，隐藏claim/caption/method；paper-disjoint2867train717test、9525symmetry DPO pairs，Gemma4 LoRA49.9→52.4%。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00665",
      "title": "Analysis of Quantized and Efficiently Adapted Protein Language Models",
      "published": "2026-09-30T20:02:41Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00665",
          "title": "Analysis of Quantized and Efficiently Adapted Protein Language Models",
          "published": "2026-09-30T20:02:41Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "蛋白语言模型现有QLoRA量化适配评估，无新核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00665",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00663",
      "title": "Backdoor Containment via Expert Quarantine and Shutdown in LLMs",
      "published": "2026-09-30T20:02:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00663",
          "title": "Backdoor Containment via Expert Quarantine and Shutdown in LLMs",
          "published": "2026-09-30T20:02:14Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "QES用attention-derived软trigger定位、sample peakiness调制、四routing约束训练expert LoRA并关闭隔离expert；不依赖gold trigger，实际两任务三攻击多模型。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00663",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00663v1",
              "location": "Abstract（完整摘要逐条审查）; §4.1–4.2 Eq.1–8；§5"
            },
            {
              "url": "https://arxiv.org/abs/2610.00663",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00663v1",
              "location": "§4.1–4.2 Eq.1–8；§5"
            }
          ],
          "review_provenance": "post_training_review正文审查复用；foundation核对交叉记录",
          "official_url": "https://arxiv.org/html/2610.00663v1",
          "locations": [
            "Abstract（完整摘要逐条审查）",
            "§4.1–4.2 Eq.1–8；§5"
          ],
          "implementation_status": "not_implemented",
          "limitations": "独立核读§4–6和App.D：对Sleeper数字trigger、GQA下VPI稀有token及自适应/句法隐蔽trigger有明确失败；attention定位不是可靠oracle。§5默认超参依据单cell ablation，未来须独立validation选择。",
          "fulltext_notes": [
            {
              "url": "https://arxiv.org/abs/2610.00663",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00663v1",
              "location": "§4.1–4.2 Eq.1–8；§5"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "post-training",
          "id": "2610.00663",
          "title": "Backdoor Containment via Expert Quarantine and Shutdown in LLMs",
          "repository_status": "new",
          "published": "2026-09-30T20:02:14Z",
          "decision": "accepted",
          "reason": "QES用attention-derived软trigger定位、sample peakiness调制、四routing约束训练expert LoRA并关闭隔离expert；不依赖gold trigger，实际两任务三攻击多模型。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00663",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00663v1",
              "location": "§4.1–4.2 Eq.1–8；§5"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00661",
      "title": "Exploring More, Reasoning Better: Stepwise Risk-Sensitive GRPO for Diffusion Language Models",
      "published": "2026-09-30T19:59:48Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00661",
          "title": "Exploring More, Reasoning Better: Stepwise Risk-Sensitive GRPO for Diffusion Language Models",
          "repository_status": "new",
          "published": "2026-09-30T19:59:48Z",
          "decision": "accepted",
          "reason": "StepRS-GRPO按denoising maskedness调风险系数并变换组优势，保留原diffusion trainer；binary reward下仅状态/题目重加权，真实SDAR1.7/4B训练和mass/RMS controls。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00661",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00661v1",
              "location": "§3.2 Eq.3.2–3.4；§4.1"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00654",
      "title": "When More Data Is Not Enough: The Context-Sufficiency Frontier in Generative AI Personalization",
      "published": "2026-09-30T19:54:26Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.00654",
          "title": "When More Data Is Not Enough: The Context-Sufficiency Frontier in Generative AI Personalization",
          "published": "2026-09-30T19:54:26Z",
          "repository_status": "new",
          "decision": "rejected",
          "review_level": "full-text",
          "fulltext_review_completed": true,
          "reason": "家居零售商语境充足性研究明确是两个构造用户、单请求、主模型的 32×10 离线因子实验；有零售商品目录不代表线上 A/B。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00654",
              "location": "PDF pp3–4 Introduction; experiment design"
            }
          ],
          "fulltext_receipt": {
            "id": "2610.00654",
            "url": "https://arxiv.org/pdf/2610.00654v1",
            "sha256": "d77d27610dad154abc0ac5518a1a34b35b5697bdb7b448b0f604342e82955059",
            "status": "downloaded",
            "characters": 88151,
            "errors": [
              {
                "url": "https://arxiv.org/html/2610.00654v1",
                "error": "HTTP Error 404: Not Found"
              }
            ]
          }
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00651",
      "title": "Agent Evaluation Reliability: More Tasks Won't (Always) Fix An Agent Leaderboard",
      "published": "2026-09-30T19:52:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00651",
          "title": "Agent Evaluation Reliability: More Tasks Won't (Always) Fix An Agent Leaderboard",
          "published": "2026-09-30T19:52:09Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00651",
          "location": "§3.1–3.5 Eq2/8/9；§4；§5.3；官方README",
          "decision": "accepted",
          "reason": "Bernoulli-logit Bayesian交叉variance分解区分model与model-scaffold部署对象，π²/3剩余项因单cell重试不足不可再分。29,923HAL/54model13scaffold，D-study后验传播显示加任务不能消掉model×scaffold/benchmark方差；均衡exchangeable且setupcost假设下的breadth结论非任意新任务更好。官方MIT R/Stan tests+公开outcomes、美元是价格假设非实测，可纳评测可靠性/预算分配分析工具。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00651v1",
              "location": "§3.1–3.5 Eq2/8/9；§4；§5.3；官方README"
            },
            {
              "url": "https://github.com/hardy-education/scaffold_eval",
              "location": "官方资源，已读状态在reason逐项注明"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00650",
      "title": "Self-Evolving Coding Rules for AI Coding Agents",
      "published": "2026-09-30T19:51:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00650",
          "title": "Self-Evolving Coding Rules for AI Coding Agents",
          "published": "2026-09-30T19:51:41Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00650",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "RuleEvolve编码规则池变异-评测已有agent-research/rule-evolve目录，不重复收录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00648",
      "title": "Incident-Arena: Getting agents to the last nine of reliability",
      "published": "2026-09-30T19:50:42Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00648",
          "title": "Incident-Arena: Getting agents to the last nine of reliability",
          "published": "2026-09-30T19:50:42Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00648",
          "location": "§3.1–3.4；§4；§5.3–5.4；§6；官方README",
          "decision": "accepted",
          "reason": "IncidentArena20K8s故障3substrates，hidden deterministic outcomeSLI+restart/reattack安全gate，healthy阈值先冻结，oracle/noop+adversarial QA；nativeharness3000trials，13Slack导致coverage不均、reasoning差异CI宽，rewardhack posthocjudge不等hidden scorer。官方Apache2任务/Harborfork公开，LinuxDocker8CPU16GB40–77GB；需隔离cluster/secret并不能用生产权限直跑。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00648v1",
              "location": "§3.1–3.4；§4；§5.3–5.4；§6；官方README"
            },
            {
              "url": "https://github.com/abundant-ai/incident-arena",
              "location": "官方资源，已读状态在reason逐项注明"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00636",
      "title": "CompMat-Bench: Benchmarking AI Agents for Computational Materials Science",
      "published": "2026-09-30T19:37:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00636",
          "title": "CompMat-Bench: Benchmarking AI Agents for Computational Materials Science",
          "published": "2026-09-30T19:37:09Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00636",
          "location": "§3.1–3.3；§4；§5；§6；作者项目页",
          "decision": "pending",
          "reason": "CompMat94任务由15研究65steps复现生成，precomputed HPC vs实际workflow分离，4guidance/span条件、8workflow，gold/graders隔离与fixedrule。强模型fullguidance单任务饱和，workflow需128CPU239GB/5h，42题full/reduced一样且硬件预算不齐。作者官网明确Code and data forthcoming，完整task/eval未公开，不能公共执行；已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00636v1",
              "location": "§3.1–3.3；§4；§5；§6；作者项目页"
            },
            {
              "url": "https://www.chenmuzhang.com/compmat-bench.html",
              "location": "官方资源，已读状态在reason逐项注明"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00629",
      "title": "ASAD: Adaptive Software Agents for Debugging",
      "published": "2026-09-30T19:32:44Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00629",
          "title": "ASAD: Adaptive Software Agents for Debugging",
          "published": "2026-09-30T19:32:44Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00629",
          "location": "§III-B–D；§IV-C；§V-D；§VII；Conclusion",
          "decision": "rejected",
          "reason": "ASAD主agent依据静态复杂度特征prompt决定simplefix或生成顺序角色，再逐agent最多3修订/全局5迭代；职责/优先级由LLM自由生成，非新增明确优化器。三既有debugbench与100sample5run，testpassing不等correct、223Defects4J人工核验；结尾runtime反馈/多文件协作仍未来。主要标准planner-specialist-review组织组合，不作为新核心算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00629v1",
              "location": "§III-B–D；§IV-C；§V-D；§VII；Conclusion"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00623",
      "title": "HAWK: Rethinking Multimodal Drafting for Speculative Decoding",
      "published": "2026-09-30T19:26:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00623",
          "title": "HAWK: Rethinking Multimodal Drafting for Speculative Decoding",
          "published": "2026-09-30T19:26:06Z",
          "repository_status": "implemented",
          "pool": "late",
          "decision": "known",
          "reason": "输入标注已实现HAWK，需引用ledger既有记录。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00623",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00622",
      "title": "Understanding and Mitigating Library-Related Issues in LLM-Generated Code",
      "published": "2026-09-30T19:25:02Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00622",
          "title": "Understanding and Mitigating Library-Related Issues in LLM-Generated Code",
          "published": "2026-09-30T19:25:02Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00622",
          "location": "§IV-A–E；§V；§VI-A/消融",
          "decision": "rejected",
          "reason": "Analyzer抽JSON依赖→搜索官方doc/抽imports/snippets→Generator→compile/import+LLMValidator迭代，本质既有library-grounded RAG/selfrefine工程组合。300tasks5models消融有实测但compile不执行logic，自动pip依赖不证明semanticcorrect/安全，检索版本未构新协议；无新算法或独立公共评分器增量。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00622v1",
              "location": "§IV-A–E；§V；§VI-A/消融"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00619",
      "title": "Beyond Supra-Competitive Outcomes: Collusive Behaviour in Deep Reinforcement Learning for Optimal Execution Games",
      "published": "2026-09-30T19:20:23Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00619",
          "title": "Beyond Supra-Competitive Outcomes: Collusive Behaviour in Deep Reinforcement Learning for Optimal Execution Games",
          "published": "2026-09-30T19:20:23Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00619",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "金融执行博弈PPO合谋行为与惩罚诊断，非LLM Agent方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00613",
      "title": "Spatial Strategies, Not Actions: Vector-Quantized Geodesics as Tools for LLM-Driven Agents",
      "published": "2026-09-30T19:16:47Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00613",
          "title": "Spatial Strategies, Not Actions: Vector-Quantized Geodesics as Tools for LLM-Driven Agents",
          "published": "2026-09-30T19:16:47Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00613",
          "location": "§4.1–4.4；§5/Table1；§6",
          "decision": "accepted",
          "reason": "离线250geodesic五步片段原点归一VQ/Kmedoids压5prototype，加5primitivewait工具；LLM一次描述、运行只选五步openloop，optionalcollisionfilter仅已观察障碍。单QwenVL格世界无高维泛化，signedmeasure动态增skill纯proposal未测；需保留真实geodesic采样与VQ，不用手写技能冒充。机制可作spatialtool建库候选。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00613v1",
              "location": "§4.1–4.4；§5/Table1；§6"
            },
            {
              "url": "https://github.com/gabriel-turinici/quantized_geodesics_agents",
              "location": "官方资源，已读状态在reason逐项注明"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00610",
      "title": "Explainable Suicide Risk Assessment on Social Media with Multi-Task QLoRA",
      "published": "2026-09-30T19:13:19Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00610",
          "title": "Explainable Suicide Risk Assessment on Social Media with Multi-Task QLoRA",
          "repository_status": "new",
          "published": "2026-09-30T19:13:19Z",
          "decision": "rejected",
          "reason": "自杀风险共享任务系统为标准multi-task QLoRA、概率平均/交叉折聚合，领域应用而非通用算法/新增公共评测协议。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00610",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00609",
      "title": "Legal Research Bench: Measuring End-to-End Reliability in Long-Horizon Legal Research Agents",
      "published": "2026-09-30T19:13:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00609",
          "title": "Legal Research Bench: Measuring End-to-End Reliability in Long-Horizon Legal Research Agents",
          "published": "2026-09-30T19:13:16Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00609",
          "location": "§3.1–3.3；§4.2；§6；官方README Platform",
          "decision": "pending",
          "reason": "LRB413律师问题asofdate+allpassrubric（任何invalidcite整体fail），5public/200val/208test；15题45responses校准judge后用于全部，单trial不测runvariance。公开仓只有5样题+harness，README平台需审批与VALSkey，408正式题不公开，不能无授权接入公共evolve基准；已审暂缓。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00609v1",
              "location": "§3.1–3.3；§4.2；§6；官方README Platform"
            },
            {
              "url": "https://github.com/vals-ai/legal-research-bench",
              "location": "官方资源，已读状态在reason逐项注明"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00604",
      "title": "MIKASA-Robo-VLA: Benchmarking Memory in VLA Models for Long-Horizon Manipulation",
      "published": "2026-09-30T19:10:31Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00604",
          "title": "MIKASA-Robo-VLA: Benchmarking Memory in VLA Models for Long-Horizon Manipulation",
          "published": "2026-09-30T19:10:31Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "MIKASA-Robo-VLA提供ManiSkill3 90任务、两RGB+7D状态/动作统一接口、success_once与22500示范，可补真实执行的VLA记忆评估候选。",
          "review_level": "fulltext",
          "kind": "evaluation_scope_recheck",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00604",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00604v1",
              "location": "§3.1/3.4–3.6; §4.1–4.2; §6; Appendix D",
              "notes": "MIKASA-Robo-VLA提供ManiSkill3 90任务、两RGB+7D状态/动作统一接口、success_once与22500示范，可补真实执行的VLA记忆评估候选。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00604v1",
          "locations": [
            "§3.1/3.4–3.6",
            "§4.1–4.2",
            "§6",
            "Appendix D"
          ],
          "limitations": "示范oracle 1.0是成功筛选后不是原始成功率，privileged simulator只允许teacher/评测。LeRobot无per-step reward且两格式无共享episode ID，不可按indexjoin。基线只14任务单checkpoint、无历史，与记忆因果结论不同；任务gap非完全factorial，机器人实物迁移未测。",
          "code_url": "https://github.com/CognitiveAISystems/MIKASA-Robo",
          "code_status": "official environment reachable; VLA release revisions/task interface must be pinned",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00604v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "MIKASA-Robo-VLA提供ManiSkill3 90任务、两RGB+7D状态/动作统一接口、success_once与22500示范，可补真实执行的VLA记忆评估候选。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00592",
      "title": "ALER: Adaptive Learnable Experience Rewriting for Reinforcement Learning",
      "published": "2026-09-30T18:55:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00592",
          "title": "ALER: Adaptive Learnable Experience Rewriting for Reinforcement Learning",
          "published": "2026-09-30T18:55:45Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "ALER部分可观测RL槽记忆agent，agent track范围。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00592",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.00592",
          "title": "ALER: Adaptive Learnable Experience Rewriting for Reinforcement Learning",
          "published": "2026-09-30T18:55:45Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00592",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "LSTM+slot memory的传统部分可观测RL经验重写，非LLM Agent方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00590",
      "title": "Towards Hierarchical Cyber Defense with Large Language Models: From Planning to Execution",
      "published": "2026-09-30T18:53:03Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00590",
          "title": "Towards Hierarchical Cyber Defense with Large Language Models: From Planning to Execution",
          "published": "2026-09-30T18:53:03Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/abs/2610.00590",
          "location": "§3.2–3.5；§4.1–4.4；§5.1–5.3",
          "decision": "out_of_scope",
          "reason": "Cyberwheel把subnet planner/primitiveexecutor各换PPO或frozenLLM，noisydetector局部观测且同seed20episode100steps；LLM+LLM强模型胜而小模型不稳定。是已有层级控制三配置在专用网络防御sim的实证，单global seed不能泛化鲁棒性，无新增通用训练/规划算子或公共任务定义增量。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00590v1",
              "location": "§3.2–3.5；§4.1–4.4；§5.1–5.3"
            }
          ],
          "reviewer": "post_training_review"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00574",
      "title": "Make Sparse Rewards Count: Density-Aware Reward Aggregation for Multi-Reward RL",
      "published": "2026-09-30T18:45:26Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00574",
          "title": "Make Sparse Rewards Count: Density-Aware Reward Aggregation for Multi-Reward RL",
          "repository_status": "new",
          "published": "2026-09-30T18:45:26Z",
          "decision": "accepted",
          "reason": "DARA按各reward活跃group密度sqrt(max-density/density)有上限加权，Asym仅放大正优势再batch normalize；ToolRL/BFCL-v4与数学真实训练。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00574",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00574v1",
              "location": "§3.3 Eq.6–8；§4"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00573",
      "title": "FORTE: Adaptive Scoring and Exact Keyframe Selection for Long-Video Question Answering",
      "published": "2026-09-30T18:45:18Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00573",
          "title": "FORTE: Adaptive Scoring and Exact Keyframe Selection for Long-Video Question Answering",
          "published": "2026-09-30T18:45:18Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "FORTE 在有限打分预算内用带状 RBF-GP 估计帧相关度和时间覆盖边际收益，再用精确 O(KN) 上包络动态规划选 64 帧。公开长视频 QA 可验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00573",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00573v1",
              "location": "§3.2–3.3; §4.1–4.4; Appendix C/D",
              "notes": "FORTE 在有限打分预算内用带状 RBF-GP 估计帧相关度和时间覆盖边际收益，再用精确 O(KN) 上包络动态规划选 64 帧。公开长视频 QA 可验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00573v1",
          "locations": [
            "§3.2–3.3; §4.1–4.4; Appendix C/D"
          ],
          "limitations": "原作者代码仅承诺发表后开放；GP 打分编码计入预算；相对 uniform 没有端到端速度提升证据；不得在测试基准选最佳参数。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "FORTE 在有限打分预算内用带状 RBF-GP 估计帧相关度和时间覆盖边际收益，再用精确 O(KN) 上包络动态规划选 64 帧。公开长视频 QA 可验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00568",
      "title": "Emergent Unfaithfulness: How Alignment Training Causes Language Models to Silently Override Task Faithfulness",
      "published": "2026-09-30T18:41:05Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00568",
          "title": "Emergent Unfaithfulness: How Alignment Training Causes Language Models to Silently Override Task Faithfulness",
          "repository_status": "new",
          "published": "2026-09-30T18:41:05Z",
          "decision": "accepted",
          "reason": "FaithConflict公开940对确认/冲突文档、FaithGap与8行为/7推理类型judge，22 checkpoint×prompt条件；官方代码数据已可读。任务忠实性和事实正确性必须分开，不能以复述有害虚构文档作为安全改善指标。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00568v1",
              "location": "§3.1–3.4；§4–5；Reproducibility Statement"
            },
            {
              "url": "https://github.com/uiuc-conversational-ai-lab/Emergent-unfaithfulness",
              "location": "作者仓库README/文件列表已只读核查"
            }
          ],
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00562",
      "title": "Can LLMs Reason Over Long Horizons? An Empirical Evaluation of Context Strategies for Longitudinal Clinical Reasoning",
      "published": "2026-09-30T18:36:19Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00562",
          "title": "Can LLMs Reason Over Long Horizons? An Empirical Evaluation of Context Strategies for Longitudinal Clinical Reasoning",
          "published": "2026-09-30T18:36:19Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "MedLoCoMo临床长时上下文策略对比，专用评估。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00562",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00559",
      "title": "PhysVista: Benchmarking Physical Intelligence in VLMs via a Perception-Reasoning-Assessment Loop",
      "published": "2026-09-30T18:34:22Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00559",
          "title": "PhysVista: Benchmarking Physical Intelligence in VLMs via a Perception-Reasoning-Assessment Loop",
          "published": "2026-09-30T18:34:22Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "PhysVista以公开视频帧和题目定义感知/因果/物理评估多任务，补充物理VLM评测覆盖，可接入为公共基础设施候选。",
          "review_level": "fulltext",
          "kind": "public_evaluation_infrastructure",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00559",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00559v1",
              "location": "§3.2–3.4; §4.1–4.5; 官方README Data Loading/Model Input"
            },
            {
              "url": "https://arxiv.org/html/2610.00559v1",
              "location": "§3.2–3.4; §4.1–4.5; 官方README Data Loading/Model Input",
              "notes": "公开annotation字段和帧选择；prediction只前半帧，order明确indices，options_answer只评测；violation多标签F1，scoringSRCC/PLCC，localization论文meanIoU。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00559v1",
          "locations": [
            "§3.2–3.4",
            "§4.1–4.5",
            "官方README Data Loading/Model Input"
          ],
          "limitations": "outcome uncertainty正确答案恒Indeterminate易shortcut；实景统一score5，real/generated域线索；人工反事实标签非物理模拟金标。官方README笼统其余accuracy与论文localizationIoU冲突，接入必须核并保留论文定位指标，不称已有完整harness。",
          "code_url": "https://github.com/Helen1p/PhysVista",
          "implementation_status": "not_implemented",
          "fulltext_notes": "公开annotation字段和帧选择；prediction只前半帧，order明确indices，options_answer只评测；violation多标签F1，scoringSRCC/PLCC，localization论文meanIoU。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00557",
      "title": "No One Architecture Fits All: A Cross-Environment Evaluation of Hierarchical Red Team Agents",
      "published": "2026-09-30T18:32:50Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00557",
          "title": "No One Architecture Fits All: A Cross-Environment Evaluation of Hierarchical Red Team Agents",
          "published": "2026-09-30T18:32:50Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00557",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "跨CybORG/Cyberwheel比较已有RL+RL及LLM+LLM架构并分析瓶颈，主要评价研究不提出新机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00541",
      "title": "Random Recursive Models",
      "published": "2026-09-30T18:23:14Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00541",
          "title": "Random Recursive Models",
          "published": "2026-09-30T18:23:14Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "RRM逐样本逐步均匀有放回选择可复用层，真实随机递归训练；TRM+RRM保持完整TRM设置只换层顺序提供核心控制，纳入小规模递归架构研究候选，不称大模型能力已证实。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00541",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00541v1",
              "location": "§3 Eq4–6; §4; §5.1–5.5 Tables1–6"
            },
            {
              "url": "https://arxiv.org/html/2610.00541v1",
              "location": "§3 Eq4–6; §4; §5.1–5.5 Tables1–6",
              "notes": "SudokuExtreme同5M/672层应用的RRM接近TRM；只换顺序的TRM+RRM改善；ARC7M同480应用47.38对既有TRM44.60但后者为文献结果。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00541v1",
          "locations": [
            "§3 Eq4–6",
            "§4",
            "§5.1–5.5 Tables1–6"
          ],
          "limitations": "三seed主要是固定checkpoint的推理随机seed，不是独立训练。CIFAR/Zebra增加深度常平台或退化；深度监督不可移除。PTRM100轨迹仅固定1000题子集，非单样本能力。",
          "implementation_status": "not_implemented",
          "fulltext_notes": "SudokuExtreme同5M/672层应用的RRM接近TRM；只换顺序的TRM+RRM改善；ARC7M同480应用47.38对既有TRM44.60但后者为文献结果。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00540",
      "title": "Assessing the Impact of Language Disparity on Multilingual Linguistic Ability in Large Language Models",
      "published": "2026-09-30T18:22:47Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00540",
          "title": "Assessing the Impact of Language Disparity on Multilingual Linguistic Ability in Large Language Models",
          "repository_status": "new",
          "published": "2026-09-30T18:22:47Z",
          "decision": "rejected",
          "reason": "既有MultiBLiMP四读出与101语言对比，贡献为语言知情评测解释，摘要无独立新增benchmark/训练算法。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00540",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00511",
      "title": "Before Agents Decide: Epistemic Action in LLM-Based Systems",
      "published": "2026-09-30T18:07:41Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00511",
          "title": "Before Agents Decide: Epistemic Action in LLM-Based Systems",
          "published": "2026-09-30T18:07:41Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00511",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "认识性行动的概念分类与设计论证，未呈现实现算法或实验证据。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00499",
      "title": "Denoising Surface: Modeling and Predicting Inference Cost for Diffusion LLM Serving",
      "published": "2026-09-30T18:01:37Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00499",
          "title": "Denoising Surface: Modeling and Predicting Inference Cost for Diffusion LLM Serving",
          "published": "2026-09-30T18:01:37Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "DWS将扩散解码负载分解为block存活概率和条件denoise-step存活概率，MiniLM两阶段多尺度/Brier监督，CPU INT8预测加硬件成本剖面驱动SJF。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00499",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00499v1",
              "location": "§4 Eq6–8; §5 limitations; §6.1–6.4"
            },
            {
              "url": "https://arxiv.org/html/2610.00499v1",
              "location": "§4 Eq6–8; §5 limitations; §6.1–6.4",
              "notes": "DWS将扩散解码负载分解为block存活概率和条件denoise-step存活概率，MiniLM两阶段多尺度/Brier监督，CPU INT8预测加硬件成本剖面驱动SJF。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00499v1",
          "locations": [
            "§4 Eq6–8",
            "§5 limitations",
            "§6.1–6.4"
          ],
          "limitations": "100k训练含10k验证、10k独立测试；真实成本模型测试用GT轨迹必须与prompt预测分开。模型家族、block大小、解码阈值改变需重训；batch96/SGLang实测不保证其他引擎，等待30秒折扣10%的aging要保留。",
          "code_status": "paper references code, canonical author release URL not located in examined text",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00499v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "DWS将扩散解码负载分解为block存活概率和条件denoise-step存活概率，MiniLM两阶段多尺度/Brier监督，CPU INT8预测加硬件成本剖面驱动SJF。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00497",
      "title": "Gumbel Straight Flow: Distilling Autoregressive Models into One-step Flow Maps",
      "published": "2026-09-30T18:01:06Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00497",
          "title": "Gumbel Straight Flow: Distilling Autoregressive Models into One-step Flow Maps",
          "published": "2026-09-30T18:01:06Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "Google DeepMind Amsterdam参与GSF：AR Gumbel耦合直路径+单调Gaussianization+diagonal教师/semigroup自一致flow-map损失，官方正文含同架构同迭代FMLM-re控制及teacher-forced后验Gumbel训练算法。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00497",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00497v1",
              "location": "§3.1–3.2 Eq6–8; §4.1–4.3 Tables2/6–8; Appendix C Algorithms1–2; Appendix D–E"
            },
            {
              "url": "https://arxiv.org/html/2610.00497v1",
              "location": "§3.1–3.2 Eq6–8; §4.1–4.3 Tables2/6–8; Appendix C Algorithms1–2; Appendix D–E",
              "notes": "167.8M学生，batch512最长1M步；每数据仅一个teacherforced forward而非串行生成教师样本。Gaussian coupledDER单步PPL114.9/GM0.94/entropy5.07，rawGumbel133.5/1.76/4.87；FMLM-re同学习率/批量/迭代对照。"
            }
          ],
          "official_url": "https://arxiv.org/html/2610.00497v1",
          "locations": [
            "§3.1–3.2 Eq6–8",
            "§4.1–4.3 Tables2/6–8",
            "Appendix C Algorithms1–2",
            "Appendix D–E"
          ],
          "limitations": "最优路径直线性假设充足容量，真实student远落后ARteacher；四步D-MMD更好但模型近2倍。多数外部baseline用原文值；温度sweep需独立validation，不能以测试最优当固定配置；接入须计teacher成本。",
          "institution": "含Google DeepMind Amsterdam学生研究合作",
          "implementation_status": "not_implemented",
          "fulltext_notes": "167.8M学生，batch512最长1M步；每数据仅一个teacherforced forward而非串行生成教师样本。Gaussian coupledDER单步PPL114.9/GM0.94/entropy5.07，rawGumbel133.5/1.76/4.87；FMLM-re同学习率/批量/迭代对照。",
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00487",
      "title": "ScaffoldM3C: A Multimodal Sequential Monte Carlo Framework for Generative Stable Construction Planning",
      "published": "2026-09-30T18:00:17Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00487",
          "title": "ScaffoldM3C: A Multimodal Sequential Monte Carlo Framework for Generative Stable Construction Planning",
          "published": "2026-09-30T18:00:17Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "ScaffoldM3C 以 Gemma 条件编码和位置/类别/候选似然三头生成砌块，SMC 对碰撞修复位移惩罚、采样重加权并选最长稳定构建序列。StableText2Brick 可重建监督。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00487",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00487v1",
              "location": "§III-C/Algorithm1; §IV/Eq6–7; §V; §VI–VIII; Appendix A",
              "notes": "ScaffoldM3C 以 Gemma 条件编码和位置/类别/候选似然三头生成砌块，SMC 对碰撞修复位移惩罚、采样重加权并选最长稳定构建序列。StableText2Brick 可重建监督。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00487v1",
          "locations": [
            "§III-C/Algorithm1; §IV/Eq6–7; §V; §VI–VIII; Appendix A"
          ],
          "limitations": "必须逐步检查支撑稳定性而非仅末态；SMC 是模型候选后验，不是直接读取目标序列；真实 xArm 不必纳入模拟能力声明；自建13条件序列未核验发布。",
          "code_url": "https://stanfordmsl.github.io/ScaffoldM3C/",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "ScaffoldM3C 以 Gemma 条件编码和位置/类别/候选似然三头生成砌块，SMC 对碰撞修复位移惩罚、采样重加权并选最长稳定构建序列。StableText2Brick 可重建监督。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00465",
      "title": "AIR-LLM: Broadcasting AI Weights over Radio for Memory-Free Edge LLM Inference via RF Computing",
      "published": "2026-09-30T18:00:02Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00465",
          "title": "AIR-LLM: Broadcasting AI Weights over Radio for Memory-Free Edge LLM Inference via RF Computing",
          "published": "2026-09-30T18:00:02Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "pending",
          "reason": "AIR-LLM以无线权重广播、射频乘法与校准单元执行GEMV；需专用RF硬件与测量曲线，当前GPU环境不能证明主硬件结论。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00465",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00465v1",
              "location": "§3 RF engine/calibration; §4.1–4.2; §5.1"
            },
            {
              "url": "https://arxiv.org/html/2610.00465v1",
              "location": "§3 RF engine/calibration; §4.1–4.2; §5.1",
              "notes": "AIR-LLM以无线权重广播、射频乘法与校准单元执行GEMV；需专用RF硬件与测量曲线，当前GPU环境不能证明主硬件结论。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00465v1",
          "locations": [
            "§3 RF engine/calibration",
            "§4.1–4.2",
            "§5.1"
          ],
          "limitations": "城市传播由Sionna光追，实物只在有线无噪条件测RF mixer误差再注入；两名默认用户按约4/3 ENOB选取，不是所有用户端到端分布。不得把模拟噪声注入命名为真实无线LLM复现。",
          "code_status": "no complete author RF implementation release located",
          "review_status": "reviewed_deferred",
          "official_url": "https://arxiv.org/html/2610.00465v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "AIR-LLM以无线权重广播、射频乘法与校准单元执行GEMV；需专用RF硬件与测量曲线，当前GPU环境不能证明主硬件结论。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00437",
      "title": "JevSpawn: Adaptive Agentic Inference through Compositional Action Spaces",
      "published": "2026-09-30T17:23:01Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00437",
          "title": "JevSpawn: Adaptive Agentic Inference through Compositional Action Spaces",
          "published": "2026-09-30T17:23:01Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00437",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "JevSpawn组合动作空间与反馈分支选择已有agent-research/jev-spawn目录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00435",
      "title": "How AI Agents Discover Scientific Equations: From Hydrotope Rediscovery to New Water-Wave Amplitudes",
      "published": "2026-09-30T17:16:58Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00435",
          "title": "How AI Agents Discover Scientific Equations: From Hydrotope Rediscovery to New Water-Wave Amplitudes",
          "published": "2026-09-30T17:16:58Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00435v1",
          "location": "§3.1–3.2、§5.1–5.4、Appendix C/E",
          "decision": "accepted",
          "reason": "PI 将解析与数值探索分配给两位学生，共享记录并独立用 BG 递归找反例，重建跨频率 chamber 的全局振幅公式。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "团队计算量高于单代理；两次团队成功不是统计总体成功率，140 个精确测试不是全域解析证明；官方公式和测试答案须仅供最终验证。固定 SR split 的模型选择边界须重做独立 validation。",
          "code": "https://github.com/ZihanZhou26/hydrotope_benchmark",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00432",
      "title": "XOR-Trellis: Ultra-Low-Complexity Dequantization and Curvature-Aware Hadamard-Free LLM Quantization",
      "published": "2026-09-30T17:05:40Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00432",
          "title": "XOR-Trellis: Ultra-Low-Complexity Dequantization and Curvature-Aware Hadamard-Free LLM Quantization",
          "published": "2026-09-30T17:05:40Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "XOR-Trellis以16位状态和每步2位分支生成四值FP4 palette，LDLQ调整目标加D加权Viterbi保留曲率，无需Hadamard旋转。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00432",
              "location": "完整摘要逐条审查"
            },
            {
              "url": "https://arxiv.org/html/2610.00432v1",
              "location": "§3 FP4 palettes; §4.2–4.3; §5/Table1–3; Appendix D"
            },
            {
              "url": "https://arxiv.org/html/2610.00432v1",
              "location": "§3 FP4 palettes; §4.2–4.3; §5/Table1–3; Appendix D",
              "notes": "XOR-Trellis以16位状态和每步2位分支生成四值FP4 palette，LDLQ调整目标加D加权Viterbi保留曲率，无需Hadamard旋转。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00432v1",
          "locations": [
            "§3 FP4 palettes",
            "§4.2–4.3",
            "§5/Table1–3",
            "Appendix D"
          ],
          "limitations": "384 RedPajama、seed0、无finetune；2.25有效bpw含组32 scale，必须实现状态/位流而不是独立round。简单指令解码不自动证明端到端CUDA速度，FP4原生硬件收益不能在A100以模拟声称。",
          "code_status": "not_found_in_paper",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00432v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "XOR-Trellis以16位状态和每步2位分支生成四值FP4 palette，LDLQ调整目标加D加权Viterbi保留曲率，无需Hadamard旋转。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00431",
      "title": "ChainLoRA: Geometry-Preserving Task Vector Merging for Continual Learning in LLMs",
      "published": "2026-09-30T16:43:34Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00431",
          "title": "ChainLoRA: Geometry-Preserving Task Vector Merging for Continual Learning in LLMs",
          "repository_status": "new",
          "published": "2026-09-30T16:43:34Z",
          "decision": "accepted",
          "reason": "ChainLoRA按QR carrier链式初始化、一侧几何正则，归档后SVD共同carrier与Procrustes对齐再共享/残差merge；真实持续学习三套数据。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00431",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00431v1",
              "location": "§3.2 Eq.1–3；§4 Algorithm1；§6"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00430",
      "title": "Memetic Trojans: Social Contagions as Carriers of Adversarial Payloads in Agent Networks",
      "published": "2026-09-30T16:43:02Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00430",
          "title": "Memetic Trojans: Social Contagions as Carriers of Adversarial Payloads in Agent Networks",
          "published": "2026-09-30T16:43:02Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00430",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "社会传播携带对抗payload的漏洞/网络模拟分析，未提供提升Agent核心能力的方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00426",
      "title": "IrekoGPT: Turning Structured Pruning into Post-Hoc Slimmable LLMs",
      "published": "2026-09-30T16:08:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00426",
          "title": "IrekoGPT: Turning Structured Pruning into Post-Hoc Slimmable LLMs",
          "published": "2026-09-30T16:08:59Z",
          "repository_status": "implemented",
          "pool": "late",
          "decision": "known",
          "reason": "输入标注已实现IrekoGPT，需引用ledger既有记录。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00426",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00425",
      "title": "Code That Works, Environments That Don't: Measuring Environment Reproducibility in AI-Generated Software",
      "published": "2026-09-30T16:04:45Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00425",
          "title": "Code That Works, Environments That Don't: Measuring Environment Reproducibility in AI-Generated Software",
          "published": "2026-09-30T16:04:45Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00425v1",
          "location": "§2–5、§6.6",
          "decision": "pending",
          "reason": "Gen→Repair 在干净 Docker 中最多 10 次修复，比较初始声明、最终安装、ptrace 动态加载三层依赖集。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "论文称 50×4×3 主实例加400重复均手工执行，承诺开放材料但正文未定位任务包。动态加载仅覆盖被执行路径且漏掉 C++ header-only；C++ transitive=1 是定义，不能当模型改善。待官方任务/容器/解析器发布。",
          "code": "未定位原始任务与实现链接",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00406",
      "title": "LLM-as-a-Judge for Low-Resource Languages: Adapting Ragas and Comparative Ranking for Romanian",
      "published": "2026-09-30T13:19:21Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00406",
          "title": "LLM-as-a-Judge for Low-Resource Languages: Adapting Ragas and Comparative Ranking for Romanian",
          "published": "2026-09-30T13:19:21Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "罗马尼亚语RAG评判策略与benchmark，无新核心模型机制。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00406",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00400",
      "title": "Representation Transitions Reveal Emerging Safety Risks in Multi-Turn LLM Agents",
      "published": "2026-09-30T12:30:56Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00400",
          "title": "Representation Transitions Reveal Emerging Safety Risks in Multi-Turn LLM Agents",
          "published": "2026-09-30T12:30:56Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00400v1",
          "location": "§3–5、Algorithm 1、Appendix A/F/G",
          "decision": "accepted",
          "reason": "DART 用危害减良性 transition 均值方向，去除良性均值和主协方差方向，在 segment 边界累积投影，阈值触发后定位最大贡献段并添加提醒再生成。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "层/rank 在 inner validation 选择、良性 calibration 定阈值；必须真实 hidden-state transition。ASR/Utility 为最终是否拒绝代理指标，不是工具危害成功率；检测全中仍25%成功说明提醒存在失败。模型相关方向不得通用复制。",
          "code": "https://anonymous.4open.science/r/dart-iclr2027-repro-F41B",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00399",
      "title": "Metacognitive Reasoning in Energy Based Models using Instance Based Learning Theory",
      "published": "2026-09-30T12:08:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00399",
          "title": "Metacognitive Reasoning in Energy Based Models using Instance Based Learning Theory",
          "published": "2026-09-30T12:08:51Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "accepted",
          "reason": "MERITED以191M EBT能量分布+问题embedding的经验相似性选择MCMC深度或逐步stop，20训练记忆例构建状态动作回报，可作动态计算机制诊断。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00399",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00399v1",
              "location": "Algorithm2–3; Tasks and Data Splits; IBL State, Memory, and Depth Control Eq7–8; Metrics, Timing, and Statistical Analysis",
              "notes": "MERITED以191M EBT能量分布+问题embedding的经验相似性选择MCMC深度或逐步stop，20训练记忆例构建状态动作回报，可作动态计算机制诊断。"
            }
          ],
          "source": "https://arxiv.org/html/2610.00399v1",
          "locations": [
            "Algorithm2–3",
            "Tasks and Data Splits",
            "IBL State, Memory, and Depth Control Eq7–8",
            "Metrics, Timing, and Statistical Analysis"
          ],
          "limitations": "原实验450配置在同评估集选且实际一split/seed，误差条是两任务变化，不是10独立run；OpenBookQA用train。optimal-stop计时预缓存测试trajectory energy，未计状态取得成本；须改为实时state和独立val/test才可声称效率/泛化，保留论文协议回放为诊断。",
          "code_url": "https://github.com/TailiaReganMalloy/instance-energy-based-learning",
          "code_status": "author code/weights linked, not executed",
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00399v1",
          "implementation_status": "not_implemented",
          "fulltext_notes": "MERITED以191M EBT能量分布+问题embedding的经验相似性选择MCMC深度或逐步stop，20训练记忆例构建状态动作回报，可作动态计算机制诊断。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00398",
      "title": "WIPSNet: Deep Learning for Paediatric Wheeze Detection from Overnight Impedance Pneumography",
      "published": "2026-09-30T11:58:27Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00398",
          "title": "WIPSNet: Deep Learning for Paediatric Wheeze Detection from Overnight Impedance Pneumography",
          "published": "2026-09-30T11:58:27Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "WIPSNet儿科阻抗呼吸测量专用3D ResNet分类，无通用模型机制。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00398",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00388",
      "title": "T2SPO: Trajectory-to-Step Policy Optimization for Agentic Reinforcement Learning",
      "published": "2026-09-30T10:34:27Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00388",
          "title": "T2SPO: Trajectory-to-Step Policy Optimization for Agentic Reinforcement Learning",
          "repository_status": "implemented",
          "published": "2026-09-30T10:34:27Z",
          "decision": "known",
          "reason": "已有T2SPO；ledger L12689明确仅真实TabPFN CPU合成状态+objective，无LLM任务训练。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00388",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "location": "L12689"
            }
          ],
          "review_status": "prior_review_reused"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.00388",
          "title": "T2SPO: Trajectory-to-Step Policy Optimization for Agentic Reinforcement Learning",
          "published": "2026-09-30T10:34:27Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00388",
          "location": "Title and complete abstract",
          "decision": "known",
          "reason": "T2SPO用TabPFN轨迹剩余距离产生step credit已有post-training/t2spo目录。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00385",
      "title": "FAER: Auditable Utility-Aligned Trajectory Replay for Language Model Post-Training",
      "published": "2026-09-30T09:41:08Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00385",
          "title": "FAER: Auditable Utility-Aligned Trajectory Replay for Language Model Post-Training",
          "repository_status": "new",
          "published": "2026-09-30T09:41:08Z",
          "decision": "accepted",
          "reason": "FAER-UTILITY在非target calibration块拟合梯度对齐/metadata replay权重并无放回抽样，trace冻结后才join正确性；正文完成learner行用normalized alignment，optimizer-aware虚步仅扩展/诊断，不能混称已验证。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00385",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00385v1",
              "location": "§3.1/3.3 Eq.4–9；§4.1"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00374",
      "title": "Faithful Chart Generation for Multimodal Deep Research: Frame-Evidence Co-Adaptation",
      "published": "2026-09-30T07:33:25Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00374",
          "title": "Faithful Chart Generation for Multimodal Deep Research: Frame-Evidence Co-Adaptation",
          "published": "2026-09-30T07:33:25Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "FECA证据自适应图表计划agent工作流，无新基础模型核心算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00374",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00372",
      "title": "When Harnesses Lose the Signal: Causal Evaluation of Recovery in LLM Agents",
      "published": "2026-09-30T07:04:25Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00372",
          "title": "When Harnesses Lose the Signal: Causal Evaluation of Recovery in LLM Agents",
          "published": "2026-09-30T07:04:25Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00372v1",
          "location": "§3–5、Eq.1–7、§5.1",
          "decision": "accepted",
          "reason": "CIR 从同一环境状态配对重放 refresh/不 refresh，区分 rescue 与 harm；三 logistic 模型分别预测异常及两种成功，OOF 阈值在 clean-harm 约束下选择，按时间最多刷新一次。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "93拟合任务与75prefix-feasible测试任务分离；成功筛选 cohort 不代表全 ALFWorld。边际概率相乘只是 rescue/harm score，非联合因果概率；干预位置用预录事实轨迹25%是评测设计，在线控制不能访问未来。",
          "code": "正文未定位开源代码链接",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00367",
      "title": "MoRA: MoE Pruning via Router Bias Learning and Expert Approximation",
      "published": "2026-09-30T06:38:43Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00367",
          "title": "MoRA: MoE Pruning via Router Bias Learning and Expert Approximation",
          "repository_status": "new",
          "published": "2026-09-30T06:38:43Z",
          "decision": "out_of_scope",
          "reason": "MoRA学习router bias及expert输出仿射近似做MoE剪枝，转基础模型轨道，非全局拒绝。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00367",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00363",
      "title": "Deep Learning for Anomaly Detection in Railway Systems: A Structured Survey",
      "published": "2026-09-30T06:29:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00363",
          "title": "Deep Learning for Anomaly Detection in Railway Systems: A Structured Survey",
          "published": "2026-09-30T06:29:59Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "铁路异常检测结构化综述，无新算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00363",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00354",
      "title": "Proof-Gated Signing: Solver-Checked Transaction Guards that Hold Under State Drift for Onchain AI Agents",
      "published": "2026-09-30T00:24:01Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00354",
          "title": "Proof-Gated Signing: Solver-Checked Transaction Guards that Hold Under State Drift for Onchain AI Agents",
          "published": "2026-09-30T00:24:01Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00354v1",
          "location": "§2 Theorem/Table1、Algorithm1、§3–4",
          "decision": "accepted",
          "reason": "Proof-Gated Signing 先模拟交易抽取资产变化，再由 Z3 验证价格区间内策略，编译余额/收款/allowance/owner 后置条件，由钱包原子执行与回滚防止 check-to-inclusion 状态漂移。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "保障依赖guard持钥、诚实tracked token、价格带和策略；untracked资产与offchain permit不覆盖。260设计同源脚本不是heldout，9个in-policy慢损失只是session上界而非阻止；须本地链运行不能仅返回ALLOW。",
          "code": "论文称公开代码、合约及logs，正文提取未定位仓库URL",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00333",
      "title": "LEGO-OPD: Factorized Teacher Composition for Multimodal On-Policy Distillation",
      "published": "2026-09-29T13:57:51Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00333",
          "title": "LEGO-OPD: Factorized Teacher Composition for Multimodal On-Policy Distillation",
          "published": "2026-09-29T13:57:51Z",
          "repository_status": "implemented",
          "pool": "late",
          "decision": "known",
          "reason": "输入标注已实现LEGO-OPD，需引用ledger既有记录。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00333",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.00333",
          "title": "LEGO-OPD: Factorized Teacher Composition for Multimodal On-Policy Distillation",
          "repository_status": "implemented",
          "published": "2026-09-29T13:57:51Z",
          "decision": "known",
          "reason": "已有LEGO-OPD条目，ledger L12603；沿用既有factorized teacher证据。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00333",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "location": "L12603"
            }
          ],
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00332",
      "title": "The Weakest Link: Distilling LLM Reasoning with Worst-Case Constrained Reinforcement Learning",
      "published": "2026-09-29T13:51:52Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00332",
          "title": "The Weakest Link: Distilling LLM Reasoning with Worst-Case Constrained Reinforcement Learning",
          "repository_status": "implemented",
          "published": "2026-09-29T13:51:52Z",
          "decision": "known",
          "reason": "已有Weakest Link，ledger L12690明确L1 exact-vocab梯度及小策略prefix约束，无LLMbenchmark声明。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00332",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "location": "L12690"
            }
          ],
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00317",
      "title": "DriftOPD: Sequence-Level Reverse-KL Distillation for One-Step VLA Policies",
      "published": "2026-09-29T02:55:12Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00317",
          "title": "DriftOPD: Sequence-Level Reverse-KL Distillation for One-Step VLA Policies",
          "published": "2026-09-29T02:55:12Z",
          "repository_status": "implemented",
          "pool": "late",
          "decision": "known",
          "reason": "输入标注已实现DriftOPD，需引用ledger既有记录。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00317",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "location": "lines12557–12605"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.00317",
          "title": "DriftOPD: Sequence-Level Reverse-KL Distillation for One-Step VLA Policies",
          "repository_status": "implemented",
          "published": "2026-09-29T02:55:12Z",
          "decision": "known",
          "reason": "已有DriftOPD条目，ledger L12604；沿用既有一跳drifting/critic证据边界。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00317",
              "location": "Abstract（完整摘要逐条审查）"
            },
            {
              "location": "L12604"
            }
          ],
          "review_status": "prior_review_reused"
        }
      ],
      "status": "known",
      "implementation_status": "existing_record"
    },
    {
      "id": "2610.00316",
      "title": "DuplexSpeechBench-Document Grounding: Benchmarking Document Grounding and Hallucinations in Voice Agents",
      "published": "2026-09-29T01:43:55Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00316",
          "title": "DuplexSpeechBench-Document Grounding: Benchmarking Document Grounding and Hallucinations in Voice Agents",
          "published": "2026-09-29T01:43:55Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00316v1",
          "location": "§2–4、Appendix B–E/H",
          "decision": "pending",
          "reason": "DSB-DG 50文档1636QA、20对话，以固定证据的递增context tier、probe-distractor-repeat与不同refresh频次比较语音grounding与延迟。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "需官方完整QA/音频/对话/scorer包，当前仅定位项目页；ground truth仅judge可读。GDS接近0需结合初始GA，FTED是用户语音结束至首token，不是完整语音时延；平台context注入和ASR错误需独立记录。",
          "code": "https://dsb-dg.github.io/",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00313",
      "title": "Rules to Tools: Executable Checks for LLM Agents in Scientific Computing",
      "published": "2026-09-29T00:36:16Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00313",
          "title": "Rules to Tools: Executable Checks for LLM Agents in Scientific Computing",
          "published": "2026-09-29T00:36:16Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00313v1",
          "location": "§3–5、Eq.1–3、Appendix B/C/D/G",
          "decision": "accepted",
          "reason": "Rules to Tools 将公开物理方程/边界/输出约束编成可调用checker，修复时提供artifact实际残差，独立隐藏grader给最终成绩；匹配text与tool组保持书面规则、探针和budget一致。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "prepared checker 是支持包处理效应，非证明tool格式本身因果更优；八任务差值CI[-12.5,43.75]pp。flow text点值与tool网格L2 gate不完全等价，开发暴露任务和heldout任务分开。hidden参考数组/评分代码不得进入repair容器。",
          "code": "正文引用 anonymous supplement/public_checker_sources，未定位可直接访问的URL",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00302",
      "title": "Decoding the Disaster: Multi-Task Geospatial Reasoning with Vision-Language Models and Crowdsourced Imagery for Disaster Mapping",
      "published": "2026-09-28T07:10:08Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00302",
          "title": "Decoding the Disaster: Multi-Task Geospatial Reasoning with Vision-Language Models and Crowdsourced Imagery for Disaster Mapping",
          "published": "2026-09-28T07:10:08Z",
          "repository_status": "new",
          "pool": "extra",
          "decision": "out_of_scope",
          "reason": "GRDisaster灾难街景地理定位与损毁严重度，专用领域应用benchmark，暂不接入通用能力任务。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00302",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00256",
      "title": "Verification Pulses and the Cost of Escaping Wrong Consensus",
      "published": "2026-09-24T03:29:27Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00256",
          "title": "Verification Pulses and the Cost of Escaping Wrong Consensus",
          "repository_status": "new",
          "published": "2026-09-24T03:29:27Z",
          "decision": "rejected",
          "reason": "binary consensus register的verification-pulse控制理论及LM响应实验，schedule对比区间均含零，未形成独立通用LLM能力训练/评测组件。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00256",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00253",
      "title": "System Attribution in LLM Brand Recommendations: Single Responses Identify the System, Aggregated Brand Profiles Do Not Transfer",
      "published": "2026-09-23T21:57:07Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.00253",
          "title": "System Attribution in LLM Brand Recommendations: Single Responses Identify the System, Aggregated Brand Profiles Do Not Transfer",
          "published": "2026-09-23T21:57:07Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "研究模型输出归属与品牌偏差审计，不是线上推荐算法；转通用评价审查。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00253",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "foundation-model",
          "id": "2610.00253",
          "title": "System Attribution in LLM Brand Recommendations: Single Responses Identify the System, Aggregated Brand Profiles Do Not Transfer",
          "decision": "out_of_scope",
          "review_level": "fulltext",
          "reason": "采用已有字符n-gram/随机森林解释特定品牌推荐采集语料，域与harness未交叉且聚合profile跨域失败；非新基础模型算法，分析代码/完整数据仍请求提供，暂无独立公开通用evolve任务。",
          "official_url": "https://arxiv.org/html/2610.00253v1",
          "locations": [
            "§1–4",
            "§6.4–6.5",
            "§7",
            "Data Availability/Code Availability"
          ],
          "evidence": "单回复800字符97.84%系统归属主要来自格式；50聚合单元跨域仅4/32正确；完成上限/时窗/域混淆明确。",
          "original_publication_date": "2026-09-23",
          "implementation_status": "not_implemented",
          "fulltext_review_completed": true
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00251",
      "title": "The Null Is the Hard Part: Exact Tests for Memorization in Generative Models",
      "published": "2026-09-23T17:59:25Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.00251",
          "title": "The Null Is the Hard Part: Exact Tests for Memorization in Generative Models",
          "published": "2026-09-23T17:59:25Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "生成模型记忆审计的精确统计零假设与多重校正，转基础模型/多模态评估审查。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00251",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "foundation-model",
          "id": "2610.00251",
          "title": "The Null Is the Hard Part: Exact Tests for Memorization in Generative Models",
          "decision": "accepted",
          "review_level": "fulltext",
          "kind": "evaluation_infrastructure",
          "reason": "模型级随机标签置换与图像级匹配控制conformal/BH审计可补生成记忆评估，官方公开代码含真实测试入口与测量输出。仅接纳为研究评测候选，非已运行或可证明模型不记忆。",
          "official_url": "https://arxiv.org/html/2610.00251v1",
          "code_url": "https://github.com/sushovan4/memorization-audits",
          "locations": [
            "§2 Propositions1–3",
            "§3/Table1–2",
            "§4–6",
            "Reproducibility statement",
            "official README experiments/genmem.py and genmem_sscd.py"
          ],
          "evidence": "CIFAR随机split下精确swap null；MemBench61候选/300匹配控制，median相似度BH5%认证36，maximum相同12代预算约46。",
          "limitations": "SD无随机训练/heldout split，exchangeability是假设；近重复尺度不覆盖语义复制；模型级PCA/Alpha计算限制2000图；失去认证不等于删除记忆。",
          "original_publication_date": "2026-09-23",
          "implementation_status": "not_implemented",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00223",
      "title": "A Holistic Assessment of the Carbon Footprint of Noor, a Very Large Arabic Language Model",
      "published": "2026-09-22T11:25:39Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00223",
          "title": "A Holistic Assessment of the Carbon Footprint of Noor, a Very Large Arabic Language Model",
          "published": "2026-09-22T11:25:39Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "Noor碳足迹整体评估，无新模型算法。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00223",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00204",
      "title": "Query Independent Variable Rate Visual Token Coding",
      "published": "2026-09-20T15:54:59Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00204",
          "title": "Query Independent Variable Rate Visual Token Coding",
          "published": "2026-09-20T15:54:59Z",
          "repository_status": "new",
          "pool": "extra",
          "decision": "accepted",
          "reason": "RDTok 在 query-independent PCA 基底上建逐 token 量化率失真曲线，以整数动态规划分配总 bit 预算。ChartQA/COCO 公共图像及冻结 VLM 可验证压缩。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00204",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00204v1",
              "location": "§2.1–2.3/Eq4–5; §3.1–3.4",
              "notes": "RDTok 在 query-independent PCA 基底上建逐 token 量化率失真曲线，以整数动态规划分配总 bit 预算。ChartQA/COCO 公共图像及冻结 VLM 可验证压缩。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00204v1",
          "locations": [
            "§2.1–2.3/Eq4–5; §3.1–3.4"
          ],
          "limitations": "token 数不减少；必须真实 bit-packing 并计变换元数据而非 fp16 张量声称压缩；PCA 仅训练数据拟合；query 不参与码率分配。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "RDTok 在 query-independent PCA 基底上建逐 token 量化率失真曲线，以整数动态规划分配总 bit 预算。ChartQA/COCO 公共图像及冻结 VLM 可验证压缩。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00197",
      "title": "Comedic Fool's Gold: Reward Exploits and Countermeasures in Conversational Humor",
      "published": "2026-09-18T20:14:09Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00197",
          "title": "Comedic Fool's Gold: Reward Exploits and Countermeasures in Conversational Humor",
          "repository_status": "new",
          "published": "2026-09-18T20:14:09Z",
          "decision": "reviewed_deferred",
          "reason": "对话幽默reward审计有笑声通道、全speaker归一与并发scorer噪声诊断；仪器修正后微小taste gain消失，遗留token漏洞未封全。未找到公开数据/runner入口，不能仅凭内部archived声明认定公共评测可执行。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00197v1",
              "location": "§2–3；§5–7；Table 4 provenance"
            }
          ],
          "fulltext_scope": "针对方法、实验协议、资源声明的正文定向核查；未执行作者代码",
          "candidate_kind": "evaluation_infrastructure",
          "review_status": "reviewed_deferred",
          "eligibility_decision": "pending",
          "deferral_reason": "对话幽默reward审计有笑声通道、全speaker归一与并发scorer噪声诊断；仪器修正后微小taste gain消失，遗留token漏洞未封全。未找到公开数据/runner入口，不能仅凭内部archived声明认定公共评测可执行。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00196",
      "title": "GPEC: Efficient Pre-LLM Gaussian Process Embedding Correction for Cardiac Video Caption Generation",
      "published": "2026-09-18T19:52:05Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00196",
          "title": "GPEC: Efficient Pre-LLM Gaussian Process Embedding Correction for Cardiac Video Caption Generation",
          "published": "2026-09-18T19:52:05Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "GPEC心脏视频caption的GP残差适配，专用医疗应用。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00196",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00188",
      "title": "Uncertainty-Aware RL-Controlled Adaptive 3D Mapping",
      "published": "2026-09-17T17:53:51Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00188",
          "title": "Uncertainty-Aware RL-Controlled Adaptive 3D Mapping",
          "published": "2026-09-17T17:53:51Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00188",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "RL调控TSDF体素细分的3D建图策略，非LLM Agent方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00182",
      "title": "Localizing Post-Wire Semantic Changes in MCP Agent Frameworks",
      "published": "2026-09-17T04:06:38Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00182",
          "title": "Localizing Post-Wire Semantic Changes in MCP Agent Frameworks",
          "published": "2026-09-17T04:06:38Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00182v1",
          "location": "§III method、§IV evaluation、Ethics/Reproducibility",
          "decision": "accepted",
          "reason": "MCP post-wire差分测试用allowlisted projector保留语义atom与compartment，分别检查协议合法、类型语义留存、特定consumer可访问性，并沿各框架公开carrier边界定位。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "324捕获与3次新进程是确定性稳定性，不是模型质量样本；H4仅本地provider request，未远端调用；新2026-07-28协议未测。v4包仅重建归一化capture，不重跑框架环境；明确missing与null、text恢复与structured槽不能混计。",
          "code": "https://doi.org/10.5281/zenodo.22784143",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00106",
      "title": "SyntheticHLS: Building Diverse Synthetic High-Level Synthesis Datasets using LLMs",
      "published": "2026-09-09T02:40:29Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00106",
          "title": "SyntheticHLS: Building Diverse Synthetic High-Level Synthesis Datasets using LLMs",
          "published": "2026-09-09T02:40:29Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "SyntheticHLS硬件综合数据生成与变异agent，无通用基础模型核心训练。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00106",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00097",
      "title": "DramaAgent: Agentic Storytelling Video Generation",
      "published": "2026-09-08T16:11:35Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00097",
          "title": "DramaAgent: Agentic Storytelling Video Generation",
          "published": "2026-09-08T16:11:35Z",
          "repository_status": "new",
          "pool": "extra",
          "decision": "out_of_scope",
          "reason": "DramaAgent长故事视频分层控制与修补，agent track负责。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00097",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        },
        {
          "track": "agent",
          "arxiv_id": "2610.00097",
          "title": "DramaAgent: Agentic Storytelling Video Generation",
          "published": "2026-09-08T16:11:35Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00097v1",
          "location": "§3.1–3.5、Eq.1–9、Appendix B/D",
          "decision": "accepted",
          "reason": "DramaAgent 层级分镜、固定角色reference、逐scene候选视频与音频生成，以身份/语义/时序/音画加权评估，针对最弱维度改写并有限次数重生成。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "真实video/audio生成是定义核心，文字fixture不能称复现；τ=.8、epsilon=.02、R=2与K预算冻结并validation选。API/backbone、候选数和重试成本匹配，VLM评分与人工偏好分开；音画兼容非严格lip-sync。",
          "code": "https://github.com/AIGeeksGroup/DramaAgent",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00096",
      "title": "FACET at WMT 2026 Automated Translation Quality Evaluation Task",
      "published": "2026-09-08T14:49:27Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00096",
          "title": "FACET at WMT 2026 Automated Translation Quality Evaluation Task",
          "repository_status": "new",
          "published": "2026-09-08T14:49:27Z",
          "decision": "rejected",
          "reason": "FACET为WMT共享任务三次固定model prompt分解翻译质量，无训练组件，专门提交报告且无新增通用执行框架。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00096",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00093",
      "title": "Safety in Self-Evolving Agents: A Survey",
      "published": "2026-09-08T05:04:40Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00093",
          "title": "Safety in Self-Evolving Agents: A Survey",
          "published": "2026-09-08T05:04:40Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00093",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "自演化Agent安全综述与SAVER分类框架，不是新可复现算法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00092",
      "title": "BudgetSchemaBench: A Budget-Swept Diagnostic for Schema Context in Text-to-SQL",
      "published": "2026-09-08T03:38:47Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00092",
          "title": "BudgetSchemaBench: A Budget-Swept Diagnostic for Schema Context in Text-to-SQL",
          "published": "2026-09-08T03:38:47Z",
          "source_group": "extra",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00092v1",
          "location": "§3；§4 Tables4–5；§5；官方README.MD及contents API 2026-10-07",
          "decision": "pending",
          "reason": "BudgetSchemaBench的预算扫描/数据库命名空间验证/执行评分适合evolve评测，但官方仓库只有339字节README.MD，明确Code under organization's review and will be released soon，公开执行发布阻塞。",
          "reviewer": "agent_review",
          "evidence": "80库、1534开发题，255调参1279heldout；2.5/10/25/50%上下文预算，完整table打包；lexical预算增益18pp、dense3pp；按namespace+SQLglot+BIRD行集合执行，另报严格/放宽投影界。",
          "limitations": "gold-guaranteed上下文仅诊断不可给被测Agent；移除gold表仍94.6%命中提示污染但非证明；serialization≤2pp且CI±4不是等价(δ3TOST未成立)。正文声称BSD3发布与官方现状不符，仓库license=null、没有runner/manifest。",
          "code": "https://github.com/megagonlabs/budget-schema",
          "candidate_kind": "evaluation_infrastructure",
          "pending_reason": "public_artifacts_not_released",
          "review_status": "reviewed_deferred",
          "fulltext_review_completed": true,
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00084",
      "title": "Scientific Agents: Evaluating Profession-Specific System Prompts on Scientific Tasks",
      "published": "2026-09-07T00:21:09Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00084",
          "title": "Scientific Agents: Evaluating Profession-Specific System Prompts on Scientific Tasks",
          "published": "2026-09-07T00:21:09Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00084",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "503职业系统prompt的对照评价和成本负结果，无新Agent能力机制。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00069",
      "title": "A Framework for Egocentric and Exocentric Procedural Understanding via Temporal Segmentation and Semantic Abstraction",
      "published": "2026-09-04T17:34:52Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00069",
          "title": "A Framework for Egocentric and Exocentric Procedural Understanding via Temporal Segmentation and Semantic Abstraction",
          "published": "2026-09-04T17:34:52Z",
          "repository_status": "new",
          "pool": "late",
          "decision": "out_of_scope",
          "reason": "冻结DINOv2/VJEPA2工作事件记忆设计及评估提纲，agent概念框架。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00069",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00054",
      "title": "The First Token Is Not the Verdict: Hidden Costs of Reading LLM Judges Without Generating",
      "published": "2026-09-04T00:45:28Z",
      "reviews": [
        {
          "track": "recommendation",
          "id": "2610.00054",
          "title": "The First Token Is Not the Verdict: Hidden Costs of Reading LLM Judges Without Generating",
          "published": "2026-09-04T00:45:28Z",
          "repository_status": "new",
          "decision": "transfer",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "reason": "LLM judge 首 token 读取的位置偏差审计，转后训练评测；不能当推荐线上研究。",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00054",
              "location": "Abstract"
            }
          ]
        },
        {
          "track": "post-training",
          "id": "2610.00054",
          "title": "The First Token Is Not the Verdict: Hidden Costs of Reading LLM Judges Without Generating",
          "pool": "cross_track_extra",
          "decision": "reviewed_deferred",
          "reason": "提出first-token compliance检查与不合规才生成的judge读数协议，具有通用评测价值；1678/11596需要生成，85.5%节省但合规子集仍0–5.5%读数错误，不能把首token当最终裁决。未找到作者代码/预测数据公共入口；等待可执行资源确认，不记已接入。",
          "review_level": "fulltext",
          "fulltext_review_completed": true,
          "fulltext_scope": "方法、实验、限制与公开资源定向审查",
          "evidence": [
            {
              "url": "https://arxiv.org/html/2610.00054v1",
              "location": "§3–5；§6 Limitations；§7 Recommendations"
            },
            {
              "url": "https://arxiv.org/abs/2610.00054",
              "location": "官方资源/版本状态"
            }
          ],
          "eligibility_decision": "pending",
          "review_status": "reviewed_deferred"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00047",
      "title": "Characterizing a Configuration Where Inference-Time PRM-Pruned Fragment Grafting Is Inert: Evidence from Three Reasoning LMs",
      "published": "2026-09-03T11:06:07Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00047",
          "title": "Characterizing a Configuration Where Inference-Time PRM-Pruned Fragment Grafting Is Inert: Evidence from Three Reasoning LMs",
          "repository_status": "new",
          "published": "2026-09-03T11:06:07Z",
          "decision": "rejected",
          "reason": "PPFG推理fragment grafting特定配置的零效应/等价检验，可作为负结果参考；不新增训练算法或独立通用benchmark。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00047",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00040",
      "title": "DSSR-3D: Decoupled Reasoning for View-Dependent Referring in 3D Gaussians",
      "published": "2026-09-03T01:27:45Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00040",
          "title": "DSSR-3D: Decoupled Reasoning for View-Dependent Referring in 3D Gaussians",
          "published": "2026-09-03T01:27:45Z",
          "repository_status": "new",
          "pool": "extra",
          "decision": "accepted",
          "reason": "DSSR-3D 用 FLAN-T5 分析目标/方位/锚点，语义 Gaussian softmax 定位锚点，在相机 XZ 平面做局部方向衰减并融合目标分数。Ref-LERF 公开场景支持验证。",
          "review_level": "fulltext",
          "abstract_review_completed": true,
          "fulltext_review_completed": true,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00040",
              "location": "Abstract（完整摘要已逐条审查）"
            },
            {
              "url": "https://arxiv.org/html/2610.00040v1",
              "location": "§3.2–3.6; §4.1–4.2; §5.2–5.3; §6",
              "notes": "DSSR-3D 用 FLAN-T5 分析目标/方位/锚点，语义 Gaussian softmax 定位锚点，在相机 XZ 平面做局部方向衰减并融合目标分数。Ref-LERF 公开场景支持验证。"
            }
          ],
          "review_status": "reviewed",
          "official_url": "https://arxiv.org/html/2610.00040v1",
          "locations": [
            "§3.2–3.6; §4.1–4.2; §5.2–5.3; §6"
          ],
          "limitations": "近水平视角、单锚点限制；语义场已预训练，非全流程 training-free；ViewRef-GS 生成 GT 使用 GroundingSAM，应避免同源评价泄露；自建场景发布需另核验。",
          "code_url": "",
          "implementation_status": "not_implemented",
          "algorithm_verifiability": "定义算法已正文核查；实现仍须忠实保留算子、损失和信息边界。",
          "data_verifiability": "正文评测数据/切分已核查；公共数据或可重建任务路径见结论，尚未执行实验。",
          "upstream_access_verified": false,
          "fulltext_notes": "DSSR-3D 用 FLAN-T5 分析目标/方位/锚点，语义 Gaussian softmax 定位锚点，在相机 XZ 平面做局部方向衰减并融合目标分数。Ref-LERF 公开场景支持验证。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00035",
      "title": "Integrating Fairness and Explainability in a Multiple Instance Reinforcement Learning System",
      "published": "2026-09-02T17:30:18Z",
      "reviews": [
        {
          "track": "post-training",
          "id": "2610.00035",
          "title": "Integrating Fairness and Explainability in a Multiple Instance Reinforcement Learning System",
          "repository_status": "new",
          "published": "2026-09-02T17:30:18Z",
          "decision": "out_of_scope",
          "reason": "教育风险RL-MIL与fairness hypernetwork，非语言模型训练/通用LLM评测。",
          "review_level": "abstract",
          "fulltext_review_completed": false,
          "pool": "late",
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00035",
              "location": "Abstract（完整摘要逐条审查）"
            }
          ],
          "review_status": "reviewed"
        },
        {
          "track": "agent",
          "arxiv_id": "2610.00035",
          "title": "Integrating Fairness and Explainability in a Multiple Instance Reinforcement Learning System",
          "published": "2026-09-02T17:30:18Z",
          "source_group": "late",
          "review_level": "abstract",
          "source": "https://arxiv.org/abs/2610.00035",
          "location": "Title and complete abstract",
          "decision": "out_of_scope",
          "reason": "学生风险预测的RL-MIL公平超网络及mode collapse分析，非LLM Agent方法。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed"
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00031",
      "title": "Seeing the City or Recognizing the Place? What Street-View Imagery Adds Beyond Existing Urban Data in VLM-Based Urban Sensing",
      "published": "2026-09-02T12:21:39Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00031",
          "title": "Seeing the City or Recognizing the Place? What Street-View Imagery Adds Beyond Existing Urban Data in VLM-Based Urban Sensing",
          "published": "2026-09-02T12:21:39Z",
          "repository_status": "new",
          "pool": "extra",
          "decision": "out_of_scope",
          "reason": "街景预测对地理记录依赖的城市数据质量诊断，专用城市感知而非通用评测任务。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00031",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00025",
      "title": "Measuring the Microtask Eligibility Gap: When Is an Off-the-Shelf SLM Enough for an Agent Harness?",
      "published": "2026-09-01T21:07:51Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00025",
          "title": "Measuring the Microtask Eligibility Gap: When Is an Off-the-Shelf SLM Enough for an Agent Harness?",
          "published": "2026-09-01T21:07:51Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00025v1",
          "location": "§3–7、Table1–2、Appendix G–I",
          "decision": "accepted",
          "reason": "四microtask用非LLM基线预定质量门槛和CI判定SLM eligibility；calibration上选logprob operating point，memory BM25 shortlist→SLM rerank及tool基线gating。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed",
          "limitations": "0/16是固定prompt/模型条件，非所有SLM不行。oracle-on-test仅可达上界，不可部署；量化T2/T4材料不足以重构完整ranking/selection，因此只能diagnostic。阈值为单部署者偏好，质量eligibility不含真实成本。",
          "code": "正文未定位开源仓库链接",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00024",
      "title": "Encoded but Disconnected: Decomposing Vision-Language Model Failures under a Patching Null",
      "published": "2026-09-01T20:15:24Z",
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2610.00024",
          "title": "Encoded but Disconnected: Decomposing Vision-Language Model Failures under a Patching Null",
          "published": "2026-09-01T20:15:24Z",
          "repository_status": "new",
          "pool": "extra",
          "decision": "out_of_scope",
          "reason": "VLM中层patching负结果及oracle标签干预；论文明确非部署方法，不能用于evolve能力提升。",
          "review_level": "abstract",
          "abstract_review_completed": true,
          "fulltext_review_completed": false,
          "evidence": [
            {
              "url": "https://arxiv.org/abs/2610.00024",
              "location": "Abstract（完整摘要已逐条审查）"
            }
          ]
        }
      ],
      "status": "rejected_or_out_of_scope",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00015",
      "title": "From Proposal to Verified Effect: Praxa, an Evidence-Bound Harness for Governed AI Agent Execution",
      "published": "2026-07-27T05:57:10Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00015",
          "title": "From Proposal to Verified Effect: Praxa, an Evidence-Bound Harness for Governed AI Agent Execution",
          "published": "2026-07-27T05:57:10Z",
          "source_group": "late",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00015v1",
          "location": "§3–6、§8–11",
          "decision": "pending",
          "reason": "Praxa 由model提案，经确定性authority gate、broker执行、read-back evidence绑定状态，并对recursive specialist候选以protected/resource gate核验。",
          "implementation_status": "not_implemented_in_this_review",
          "review_status": "reviewed_deferred",
          "limitations": "核心authority executor私有，public SDK不含执行器。Terminal-Bench12任务pilot固定顺序与rebuild不对称、verifier未全计预算；recursive topology是synthetic proxy且optimizer未运行。HOLD确认性试验零次，registry/config wiring不能称真实改进。待公开核心实现或许可。",
          "code": "https://github.com/praxa-labs/praxa ; https://github.com/praxa-labs/praxa-benchmarks",
          "reviewer": "post_close",
          "fulltext_review_completed": true,
          "evidence": "正文方法、实验、限制与公开材料声明已审查；候选接受不表示已实现或执行。"
        }
      ],
      "status": "reviewed_deferred",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00012",
      "title": "When Do Causal World Models Help Modular LLM Agents",
      "published": "2026-07-12T04:03:37Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00012",
          "title": "When Do Causal World Models Help Modular LLM Agents",
          "published": "2026-07-12T04:03:37Z",
          "source_group": "extra",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00012v1",
          "location": "§4；§5/Table1；§6–7；官方仓库README",
          "decision": "accepted",
          "reason": "FedCausalCompose的局部干预响应匹配、边发现与组合约束可作诊断性Agent世界模型候选；真实实现必须学习边，不能以oracle边替代。",
          "reviewer": "agent_review",
          "evidence": "Bernoulli干预响应匹配构边；APIBank582例顺序/发现边/oracle成功3.61/4.64/5.67%；tau retail无anchor70/45/45、有anchor60/60/75。",
          "limitations": "实际为集中式trace harness而非部署的联邦隐私系统；人工模块/oracle理论假设强，ALFWorld对正确边比例非单调30/45/20/35/40，部分划分退化25pp，多数单种子；AndroidWorld未运行。",
          "code": "https://github.com/Hik289/fed-causal-world",
          "code_status": "public MIT; synthetic/tau/ALFWorld runners described",
          "candidate_kind": "causal_world_model_diagnostic",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2610.00010",
      "title": "Heavy-Tailed Memory Traces in Long-Horizon Language Agents",
      "published": "2026-07-09T15:00:39Z",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2610.00010",
          "title": "Heavy-Tailed Memory Traces in Long-Horizon Language Agents",
          "published": "2026-07-09T15:00:39Z",
          "source_group": "extra",
          "review_level": "fulltext",
          "source": "https://arxiv.org/html/2610.00010v1",
          "location": "§4；§5.4–5.7 Tables3–5；AppendixA.1/B；官方仓库README",
          "decision": "accepted",
          "reason": "CTWM以访问排名幂律预算分配核心/尾部记忆，适合作为可执行记忆压缩机制候选；不能将近零任务成功率的token节约宣传成能力提升。",
          "reviewer": "agent_review",
          "evidence": "b(r;τ)=r^-τ/Σj j^-τ；紧凑合成轨迹token170.71→160.65、尾部错误.932→.805；固定轨迹replay差距≤4e-4，收益来自序列化改变策略轨迹。",
          "limitations": "图紧凑基线156.4token比CTWM160.7更低但错误更高；ALFWorld one-shot均0/18，three-shot图1/18而CTWM0/18，LongMemEval77例CTWM0而图3正确；24.48%省token不构成任务能力改善。τ=1手选；不得凭该诊断直接evolve晋级。",
          "code": "https://github.com/Hik289/world-model-self-organized-criticality",
          "code_status": "public MIT; README lists comparison/ALFWorld/frozen-replay runners",
          "candidate_kind": "memory_efficiency_diagnostic",
          "fulltext_review_completed": true,
          "review_status": "reviewed",
          "implementation_status": "not_implemented_in_this_review"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2602.16490",
      "title": "From Growing to Looping: A Unified View of Iterative Computation in LLMs",
      "published": null,
      "reviews": [
        {
          "track": "foundation-model",
          "id": "2602.16490",
          "title": "From Growing to Looping: A Unified View of Iterative Computation in LLMs",
          "decision": "accepted",
          "review_level": "fulltext",
          "kind": "historical_backfill",
          "reason": "Google合作历史漏收录：grow-first/loop-later组合配方与中间block recurrence有真实SmolLM训练、22公共任务及参数/训练/推理三类预算对照；可纳入循环模型研究候选，不称10月新文。",
          "official_url": "https://arxiv.org/html/2602.16490v1",
          "official_institution_url": "https://research.google/pubs/from-growing-to-looping-a-unified-view-of-iterative-computation-in-llms/",
          "locations": [
            "§3.1–3.2/Table1",
            "§5.1–5.3/Table2/Table3",
            "Appendix A",
            "Appendix C.3/Figure17",
            "Appendix D–E"
          ],
          "evidence": "360M/1.7B约200B/400B token；LIDAS复制中层权重及AdamW状态、PROP1分配170k预训练steps；数学cooldown末30k步。1.7B LIDAS NMT20% GSM8K13.34，加入8–11层loop17.36；同loop baseline12.59。",
          "limitations": "2倍仅部分reasoning primitives，额外loop增加推理计算；知识/语言任务loop可退化；block/数学源在下游基准上做ablation选择，正式复现需独立validation。官方全文/Google页未找到作者代码链接。",
          "institution": "Technical University of Munich / Helmholtz AI / Google Paradigms of Intelligence",
          "original_publication_date": "2026-02-18",
          "implementation_status": "not_implemented",
          "fulltext_review_completed": true
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    },
    {
      "id": "2510.15831",
      "title": "VISTA: A Test-Time Self-Improving Video Generation Agent",
      "published": "2025-10-17",
      "reviews": [
        {
          "track": "agent",
          "arxiv_id": "2510.15831",
          "title": "VISTA: A Test-Time Self-Improving Video Generation Agent",
          "decision": "accepted",
          "review_level": "fulltext",
          "reviewer": "agent_review",
          "source": "https://arxiv.org/html/2510.15831v1",
          "location": "§2.1–2.2/Algorithms1–2/Eq1–3；§4.1/Table2正文；§4.2；§4.3/Tables3–4；Limitations；官方project",
          "reason": "Google高优先历史补发现：结构化prompt规划、双向tournament保留champion、三维normal/adversarial/meta批评、DTPA修订后实际重生成/再选，属于可执行Agent自改进闭环而非视频主干创新。",
          "evidence": "100 MovieGen公开prompt+161内部multi-scene；Gemini2.5Flash+Veo3，5轮每轮约30video；50prompt人评66.4%偏好，score3.78 vs3.33；按video数量扩展基线有对照。",
          "limitations": "首次2025-10-17，不计2026新论文；官方项目仅demo/prompts和论文，未发现作者源码发布；内部161prompt不可得；约.7M token/轮且排除视频生成cost；复现需实际多模态judge和video generator，非固定视频打分fixture。",
          "institution": "Google; National University of Singapore",
          "published": "2025-10-17",
          "code": "not_found",
          "project": "https://g-vista.github.io/",
          "source_group": "historical_cross_track",
          "fulltext_review_completed": true,
          "review_status": "reviewed"
        }
      ],
      "status": "accepted",
      "implementation_status": "not_implemented_in_this_review"
    }
  ]
}
