{"id":"W2178931426","doi":"10.48550/arxiv.1511.05427","title":"A New Matching Algorithm for Multidimensional Persistence","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Simplicial complex; Persistent homology; Mathematics; Simplex; Simplicial homology; Matching (statistics); Simplicial approximation theorem; h-vector; Combinatorics; Computation; Function (biology); Algorithm; Discrete mathematics; Simplicial set; Pure mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003411998,0.0002756686,0.000391233,0.0003665126,0.0001605709,0.00009536798,0.001793586,0.0002435774,0.00004724146],"category_scores_gemma":[0.00007616691,0.0002673967,0.0003776353,0.000995177,0.00005911632,0.0003535782,0.002631561,0.0003451231,0.00009589634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001641984,"about_ca_system_score_gemma":0.0003252956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005226685,"about_ca_topic_score_gemma":0.00002163898,"domain_scores_codex":[0.9980146,0.00006769529,0.0001854911,0.001215407,0.000145318,0.0003715298],"domain_scores_gemma":[0.998015,0.0001996594,0.0002032136,0.0009438283,0.0002564998,0.0003818402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005371507,0.0003557207,0.0003882938,0.00007875529,0.0007478978,0.0006409085,0.0006400768,0.2735808,0.00002378021,0.5202925,0.02222517,0.1809724],"study_design_scores_gemma":[0.0005254516,0.00007008745,0.0001331952,0.00002802772,0.0001228169,0.000005938575,0.00009749717,0.8699884,0.00001538127,0.1225406,0.006042684,0.0004299791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005893392,0.0001756257,0.9923692,0.0002352318,0.0004667403,0.0002029507,0.00009378231,0.0001735267,0.0003895998],"genre_scores_gemma":[0.2817665,0.00007198311,0.7060892,0.0002490681,0.0002259113,0.00000170127,0.000125829,0.0000156216,0.01145422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5964076,"threshold_uncertainty_score":0.9999778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1190661799554938,"score_gpt":0.2104218989014556,"score_spread":0.09135571894596176,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}