{"paper":{"title":"Counting Triangulated 3-Spheres, Nuclei, and Polyhedra","arxiv_id":"2611.16518","primary_cat":"math.CO","submitted_at":"2026-11-12T09:16:11+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":0.87,"id":"s0","own":true,"role":"method","text":"We exploit two-dimensional dual polyhedra to study triangulated $3$-spheres and nuclei.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.84,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.17,"role_probabilities":{"gap":0.0,"method":0.87,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.13,"interpretation":0.0}},{"i":1,"p":0.91,"id":"s1","own":true,"role":"result","text":"First, we show that the long-standing open problem of whether the number of triangulated $3$-spheres is exponentially bounded is equivalent to the corresponding problem for one-vertex generalized triangulations, and hence also for special spines of the $3$-ball.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.41,"quantitative":true,"quantitative_p":0.52,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.91,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.09,"interpretation":0.0}},{"i":2,"p":0.5,"id":"s2","own":true,"role":"interpretation","text":"This also establishes an equivalent counting problem for nuclei.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.85,"main_claim_p":0.12,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.47,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.5}},{"i":3,"p":0.97,"id":"s3","own":true,"role":"contribution","text":"Second, we investigate properties of nuclei, including their dual polyhedra.","hedge":{"p":0.84,"label":"asserted"},"own_p":0.87,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.03,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.97,"interpretation":0.0}},{"i":4,"p":0.98,"id":"s4","own":true,"role":"result","text":"We also prove that every nontrivial nucleus contains a tetrahedron with six interior edges, identify the unique vertex-minimal nontrivial nucleus with $11$ vertices and $35$ tetrahedra, and construct nuclei whose dual graphs have genus growing linearly with the number of tetrahedra.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.27,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.98,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.79,"text":"First, we show that the long-standing open problem of whether the number of triangulated $3$-spheres is exponentially bounded is equivalent to the corresponding problem for one-vertex generalized triangulations, and hence also for special spines of the $3$-ball.","location":"abstract s1","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":4327,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.07,"states_limitation":0.08,"human_participants":0.01,"controlled_comparison":0.01,"randomized_assignment":0.01,"states_quantitative_result":0.95,"compares_with_prior_results":0.17,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":1.0,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":1.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.66,"text":"We also prove that every nontrivial nucleus contains a tetrahedron with six interior edges, identify the unique vertex-minimal nontrivial nucleus with $11$ vertices and $35$ tetrahedra, and construct nuclei whose dual graphs have genus growing linearly with the number of tetrahedra.","location":"abstract s4"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":5,"sentences_in_abstract":5},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}