[Rule] 3-PARTITION to INTERSECTION GRAPH FOR SEGMENTS ON A GRID

[isPANN]

[zazabap]

Issue Quality Check — Rule

Check	Result	Details
Usefulness	⚠️ Warn	Neither source ("3-PARTITION") nor target ("INTERSECTION GRAPH FOR SEGMENTS ON A GRID") exist in the codebase; cannot evaluate usefulness
Non-trivial	⚠️ Warn	No reduction algorithm provided — cannot evaluate
Correctness	⚠️ Warn	No references provided — cannot evaluate
Well-written	❌ Fail	Issue body is completely empty

Overall: 0 passed, 1 failed, 3 warnings

---

Usefulness

Neither the source problem "3-PARTITION" nor the target problem "INTERSECTION GRAPH FOR SEGMENTS ON A GRID" currently exist in the reduction graph. Without an issue body, it is impossible to evaluate the proposed overhead or motivation. The problems themselves are not yet implemented, so corresponding [Model] issues would need to be filed and implemented first.

Non-trivial

No reduction algorithm is described. Cannot assess whether the reduction involves genuine structural transformation or is trivial.

Correctness

No references are cited. Cannot verify any claims.

Well-written

The issue body is completely empty. All required template sections are missing:

• Source — not specified in body
• Target — not specified in body
• Motivation — missing
• Reference — missing
• Reduction Algorithm — missing
• Size Overhead — missing
• Validation Method — missing
• Example — missing

The issue title mentions a reduction from 3-PARTITION to an intersection graph problem, but without any content this is not actionable.

Recommendations

• Fill in all sections of the [Rule] issue template with substantive content.
• Since neither problem exists in the codebase, file [Model] issues for both "3-Partition" and the intersection graph problem first.
• Provide at least one literature reference for the reduction.
• Include a complete, step-by-step reduction algorithm and a worked example.

[isPANN]

Closing: issue body was empty or incorrect (wrong content). Will re-create with correct content.