{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TNJ3MKD7I6V2PTRYQT2XJSDVG2","short_pith_number":"pith:TNJ3MKD7","schema_version":"1.0","canonical_sha256":"9b53b6287f47aba7ce3884f574c8753687bca9b53f1b75bc726803883230cd0f","source":{"kind":"arxiv","id":"1609.09392","version":2},"attestation_state":"computed","paper":{"title":"Polynomial-time algorithms for the curve graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Mark C. Bell, Richard C. H. Webb","submitted_at":"2016-09-29T15:35:09Z","abstract_excerpt":"We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For example, we can use these geodesics to compute the asymptotic translation length, Nielsen--Thurston type, and canonical curve system of a mapping class in polynomial time in its word length."},"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":"1609.09392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-09-29T15:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"9cb7c08163c8c2237681805e86c40005daf440778de5ca738dd33b73db743fe4","abstract_canon_sha256":"84402ff34e00d9ab8ea71ce6972673118ae74bbbaa5e3a39a70f307a000c6522"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:13.458824Z","signature_b64":"oR0rlFXwChmA5rna+dbSVoXq1E3IMvVQ0dNiFRw6hKdT4UXwxZWSdJ4DKwvjRnpnQ26Y0SfBecr8S3tKWveCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b53b6287f47aba7ce3884f574c8753687bca9b53f1b75bc726803883230cd0f","last_reissued_at":"2026-05-18T01:03:13.458187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:13.458187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time algorithms for the curve graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Mark C. Bell, Richard C. H. Webb","submitted_at":"2016-09-29T15:35:09Z","abstract_excerpt":"We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For example, we can use these geodesics to compute the asymptotic translation length, Nielsen--Thurston type, and canonical curve system of a mapping class in polynomial time in its word length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09392","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":"1609.09392","created_at":"2026-05-18T01:03:13.458289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09392v2","created_at":"2026-05-18T01:03:13.458289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09392","created_at":"2026-05-18T01:03:13.458289+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNJ3MKD7I6V2","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNJ3MKD7I6V2PTRY","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNJ3MKD7","created_at":"2026-05-18T12:30:44.179134+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/TNJ3MKD7I6V2PTRYQT2XJSDVG2","json":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2.json","graph_json":"https://pith.science/api/pith-number/TNJ3MKD7I6V2PTRYQT2XJSDVG2/graph.json","events_json":"https://pith.science/api/pith-number/TNJ3MKD7I6V2PTRYQT2XJSDVG2/events.json","paper":"https://pith.science/paper/TNJ3MKD7"},"agent_actions":{"view_html":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2","download_json":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2.json","view_paper":"https://pith.science/paper/TNJ3MKD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09392&json=true","fetch_graph":"https://pith.science/api/pith-number/TNJ3MKD7I6V2PTRYQT2XJSDVG2/graph.json","fetch_events":"https://pith.science/api/pith-number/TNJ3MKD7I6V2PTRYQT2XJSDVG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2/action/storage_attestation","attest_author":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2/action/author_attestation","sign_citation":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2/action/citation_signature","submit_replication":"https://pith.science/pith/TNJ3MKD7I6V2PTRYQT2XJSDVG2/action/replication_record"}},"created_at":"2026-05-18T01:03:13.458289+00:00","updated_at":"2026-05-18T01:03:13.458289+00:00"}