{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TOINAO4SQGAJ4HR4S2YGEWZX3T","short_pith_number":"pith:TOINAO4S","schema_version":"1.0","canonical_sha256":"9b90d03b9281809e1e3c96b0625b37dcc809dc045aab7641d3fc022cd4e5b883","source":{"kind":"arxiv","id":"1604.04314","version":2},"attestation_state":"computed","paper":{"title":"Simplifying triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.GT","authors_text":"Mark C. Bell","submitted_at":"2016-04-14T22:32:45Z","abstract_excerpt":"We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.04314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-04-14T22:32:45Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"5cf90665b47e39754daeff906d86137dfb52e1a619d84eb0b1e9cb3bceade302","abstract_canon_sha256":"30da147488eb47479245f8e62b6485d1cca82c5965a4990a2d81ab8c45f5af31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:29.050055Z","signature_b64":"LZR0BkcFiqiZ+JQGmnCyk7Rpi6cm1xNNPoysVv7erAmBA+IyCE2mW2DLGYYG1rRH6qoKorCuJ4aDKC0Z2TmACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b90d03b9281809e1e3c96b0625b37dcc809dc045aab7641d3fc022cd4e5b883","last_reissued_at":"2026-05-18T01:16:29.049487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:29.049487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.GT","authors_text":"Mark C. Bell","submitted_at":"2016-04-14T22:32:45Z","abstract_excerpt":"We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04314","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.04314","created_at":"2026-05-18T01:16:29.049600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04314v2","created_at":"2026-05-18T01:16:29.049600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04314","created_at":"2026-05-18T01:16:29.049600+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOINAO4SQGAJ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOINAO4SQGAJ4HR4","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOINAO4S","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T","json":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T.json","graph_json":"https://pith.science/api/pith-number/TOINAO4SQGAJ4HR4S2YGEWZX3T/graph.json","events_json":"https://pith.science/api/pith-number/TOINAO4SQGAJ4HR4S2YGEWZX3T/events.json","paper":"https://pith.science/paper/TOINAO4S"},"agent_actions":{"view_html":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T","download_json":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T.json","view_paper":"https://pith.science/paper/TOINAO4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04314&json=true","fetch_graph":"https://pith.science/api/pith-number/TOINAO4SQGAJ4HR4S2YGEWZX3T/graph.json","fetch_events":"https://pith.science/api/pith-number/TOINAO4SQGAJ4HR4S2YGEWZX3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T/action/storage_attestation","attest_author":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T/action/author_attestation","sign_citation":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T/action/citation_signature","submit_replication":"https://pith.science/pith/TOINAO4SQGAJ4HR4S2YGEWZX3T/action/replication_record"}},"created_at":"2026-05-18T01:16:29.049600+00:00","updated_at":"2026-05-18T01:16:29.049600+00:00"}