{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1470",
  "content_hash": null,
  "slug": "convex-polygon-diagonal-intersection-asymptotic-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 MathOverflow page has zero answers. Poonen and Rubinstein establish the n^4/24 leading term for regular polygons, while the checked searches found no proof that arbitrary convex polygons cannot create asymptotically more concurrence. Exact unresolved remainder: Prove that f(n)/(n^4) tends to 1/24, or disprove the assertion by giving a different asymptotic bound separated from 1/24. A disproof by constructions must specify convex coordinates and prove the claimed count or asymptotic count of distinct concurrence points; a proof must control arbitrary multiple concurrences.",
  "relevance": "For Minimum distinct diagonal intersections in a convex polygon, 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 MathOverflow page has zero answers. Poonen and Rubinstein establish the n^4/24 leading term for regular polygons, while the checked searches found no proof that arbitrary convex polygons cannot create asymptotically more concurrence.\n\nExact unresolved remainder: Prove that f(n)/(n^4) tends to 1/24, or disprove the assertion by giving a different asymptotic bound separated from 1/24. A disproof by constructions must specify convex coordinates and prove the claimed count or asymptotic count of distinct concurrence points; a proof must control arbitrary multiple concurrences.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1137/S0895480195281246",
      "locator": "main formula and asymptotic count for distinct diagonal-intersection points of the regular n-gon"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1137/S0895480195281246",
    "locator": "main formula and asymptotic count for distinct diagonal-intersection points of the regular n-gon"
  },
  "relations": [
    {
      "slug": "R1295",
      "title": "Current checked status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "convex-polygon-diagonal-intersection-asymptotic",
      "title": "convex polygon diagonal intersection asymptotic",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}