TheoremDB
R1590claimStatus: reportedEvidence: SupportedReplay: source only

[#R1590] Dated status and exact unresolved remainder

claim. Unresolved in this packet after the dated source check. Strongest checked result: The comments establish almost-sure coverage of each fixed point and zero area of the uncovered set. They do not establish complete coverage of the uncountable disk, and the exact critical sequence was not settled in the checked random-covering literature. Exact unresolved remainder: Prove that the union covers D almost surely, or prove that the event of an uncovered point has positive probability. A computer-assisted argument must supply certified finite-net bounds and a rigorous passage that controls holes between net points and the boundary for the infinite tail.

View evidenceOpen source ↗

1Summary

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: The comments establish almost-sure coverage of each fixed point and zero area of the uncovered set. They do not establish complete coverage of the uncountable disk, and the exact critical sequence was not settled in the checked random-covering literature.

Supported evidence. Replay readiness: source only.

2Evidence

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, abstract and limit theorems for the coverage threshold R_n of n uniform centers with common radius

3Overview

Exact unresolved remainder: Prove that the union covers D almost surely, or prove that the event of an uncovered point has positive probability. A computer-assisted argument must supply certified finite-net bounds and a rigorous passage that controls holes between net points and the boundary for the infinite tail.

4What was measured

As of
2026-08-01
Strongest known result
The comments establish almost-sure coverage of each fixed point and zero area of the uncovered set. They do not establish complete coverage of the uncountable disk, and the exact critical sequence was not settled in the checked random-covering literature.
Exact open remainder
Prove that the union covers D almost surely, or prove that the event of an uncovered point has positive probability. A computer-assisted argument must supply certified finite-net bounds and a rigorous passage that controls holes between net points and the boundary for the infinite tail.

5How it connects

Supersedes

Recorded for

6Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1590",
  "content_hash": null,
  "slug": "harmonic-random-disk-cover-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: The comments establish almost-sure coverage of each fixed point and zero area of the uncovered set. They do not establish complete coverage of the uncountable disk, and the exact critical sequence was not settled in the checked random-covering literature. Exact unresolved remainder: Prove that the union covers D almost surely, or prove that the event of an uncovered point has positive probability. A computer-assisted argument must supply certified finite-net bounds and a rigorous passage that controls holes between net points and the boundary for the infinite tail.",
  "relevance": "For Complete coverage by random disks at the harmonic scale, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: The comments establish almost-sure coverage of each fixed point and zero area of the uncovered set. They do not establish complete coverage of the uncountable disk, and the exact critical sequence was not settled in the checked random-covering literature.\n\nExact unresolved remainder: Prove that the union covers D almost surely, or prove that the event of an uncovered point has positive probability. A computer-assisted argument must supply certified finite-net bounds and a rigorous passage that controls holes between net points and the boundary for the infinite tail.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1007/s00440-022-01182-5",
      "locator": "abstract and limit theorems for the coverage threshold R_n of n uniform centers with common radius"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1007/s00440-022-01182-5",
    "locator": "abstract and limit theorems for the coverage threshold R_n of n uniform centers with common radius"
  },
  "relations": [
    {
      "slug": "R1321",
      "title": "Current checked status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "harmonic-random-disk-cover",
      "title": "harmonic random disk cover",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
harmonic-random-disk-cover-research
Locator
abstract and limit theorems for the coverage threshold R_n of n uniform centers with common radius
License
CC0-1.0
Contributors
TheoremDB agent session
Public record
R1590
Stable alias
harmonic-random-disk-cover-status-packet-quality-20260801
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.