{"schema_version":"papers/paper-detail-v1","title":"Hierarchical Discrete Flow Matching for Graph Generation","surface":"papers","opportunity_kernel":{"paper_id":"07ec6fca-5d75-4b90-b64c-5e9b81e510d8","title":"Hierarchical Discrete Flow Matching for Graph Generation","authors":["Yoann Boget","Pablo Strasser","Alexandros Kalousis"],"arxiv_id":"2604.00236v1","doi":null,"published_at":"2026-03-31T20:58:12.000Z","score_object":{"overall":{"value":3,"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-04-02T20:56:02.684Z","fresh_until":"2026-05-02T20:56:02.684Z","is_stale":true,"source_count":1,"missingness":[]},"technical":{"value":2,"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-04-03T20:30:24.533Z","fresh_until":"2026-04-17T20:30:24.533Z","is_stale":true,"source_count":1,"missingness":["reproducibility_results.reproducibility_score","deployability_scores.score"]},"commercial":{"value":4,"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-04-02T20:56:02.684Z","fresh_until":"2026-05-02T20:56:02.684Z","is_stale":true,"source_count":1,"missingness":[]},"market":{"value":0,"scale":"0-10","confidence":0.15,"confidence_reason":"No persisted distribution_readiness_scores row was available; marked low confidence.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-04-02T20:56:02.684Z","fresh_until":"2026-04-16T20:56:02.684Z","is_stale":true,"source_count":0,"missingness":["distribution_readiness_scores.score"]},"team":{"value":0,"scale":"0-10","confidence":0.15,"confidence_reason":"No persisted team-quality evidence was available; marked low confidence.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-04-02T20:56:02.684Z","fresh_until":"2026-04-16T20:56:02.684Z","is_stale":true,"source_count":0,"missingness":["engineer_profiles.builder_score","author_startups"]},"methodology":{"value":7.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-04-02T21:07:44.692Z","fresh_until":"2026-05-02T21:07:44.692Z","is_stale":true,"source_count":2,"missingness":[]}},"evidence_receipt":{"freshness":"stale","proof_status":"unverified","repo_status":"missing","references_count":79,"source_count":3,"coverage":0.6667,"missingness":["repo_url","distribution_readiness_scores"],"unresolved_unknowns":["distribution readiness has not been computed yet"],"last_verification_at":"2026-04-03T20:30:24.533Z"},"lineage_hash":"cb99bd98be7a405031a9aba67e770ab914a8265a7d95369335fe7c992e018b2c"},"distribution":null,"replication_evidence":[],"author_dna":[]}