{"schema_version":"papers/paper-detail-v1","title":"Hierarchical Task Network Planning with LLM-Generated Heuristics","surface":"papers","opportunity_kernel":{"paper_id":"8ba5d384-108a-4135-87da-743cd60ea856","title":"Hierarchical Task Network Planning with LLM-Generated Heuristics","authors":["Felipe Meneguzzi","Alexandre Buchweitz","Augusto B. Corrêa","Victor Scherer Putrich","André Grahl Pereira"],"arxiv_id":"2605.07707v1","doi":null,"published_at":"2026-05-08T13:14:31.000Z","score_object":{"overall":{"value":7,"scale":"0-10","confidence":0.85,"confidence_reason":"Backfilled from persisted papers.viability_score.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-11T20:18:28.411Z","fresh_until":"2026-06-10T20:18:28.411Z","is_stale":false,"source_count":1,"missingness":[]},"technical":{"value":1.4,"scale":"0-10","confidence":0.55,"confidence_reason":"Backfilled from paper_extraction_scorecards.reconstruction_score.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-11T20:36:03.718Z","fresh_until":"2026-05-25T20:36:03.718Z","is_stale":true,"source_count":1,"missingness":["reproducibility_results.reproducibility_score","deployability_scores.score"]},"commercial":{"value":5,"scale":"0-10","confidence":0.75,"confidence_reason":"Backfilled from persisted commercial_flags and repo availability.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-11T20:18:28.411Z","fresh_until":"2026-06-10T20:18:28.411Z","is_stale":false,"source_count":2,"missingness":[]},"market":{"value":5.5,"scale":"0-10","confidence":0.45,"confidence_reason":"Heuristic market score materialized from paper metadata, repo availability, and deployability.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-11T20:40:03.306Z","fresh_until":"2026-05-25T20:40:03.306Z","is_stale":true,"source_count":1,"missingness":[]},"team":{"value":5.65,"scale":"0-10","confidence":0.42,"confidence_reason":"Heuristic fallback from paper author count and extracted affiliations.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-11T20:18:28.411Z","fresh_until":"2026-05-25T20:18:28.411Z","is_stale":true,"source_count":2,"missingness":[]},"methodology":{"value":4.7,"scale":"0-10","confidence":0.82,"confidence_reason":"Backfilled from paper_extraction_scorecards.total_score.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-11T20:21:19.399Z","fresh_until":"2026-06-10T20:21:19.399Z","is_stale":false,"source_count":2,"missingness":[]}},"evidence_receipt":{"freshness":"stale","proof_status":"unverified","repo_status":"active","references_count":0,"source_count":4,"coverage":0.8333,"missingness":["references"],"unresolved_unknowns":[],"last_verification_at":"2026-05-11T20:36:03.718Z"},"lineage_hash":"f938c7d47759851a3b9a1beb72513a91cb1d9e3dc9ea667978f06a75e2de5c88"},"distribution":null,"replication_evidence":[],"author_dna":[]}