{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NJQMPOSRNMBIXZD5XNYLPNEMBZ","short_pith_number":"pith:NJQMPOSR","schema_version":"1.0","canonical_sha256":"6a60c7ba516b028be47dbb70b7b48c0e536439335ebaad00cbcd518c37f97454","source":{"kind":"arxiv","id":"1711.00788","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of optimal homotopies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Arnaud de Mesmay, Erin Wolf Chambers, Tim Ophelders","submitted_at":"2017-11-02T15:49:59Z","abstract_excerpt":"In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More precisely, given two homotopic curves $\\gamma_1$ and $\\gamma_2$ on a combinatorial (say, triangulated) surface, we investigate the problem of computing a homotopy between $\\gamma_1$ and $\\gamma_2$ where the length of the longest intermediate curve is minimized. Such optimal homotopies are relevant for a wide range of purposes, from very theoretical question"},"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":"1711.00788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-11-02T15:49:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5d1bd55b9ff4d08c6b3d7c248a132481305ad72fdd035b1f2d4ca564b51f83ba","abstract_canon_sha256":"505ee0232f461c4d44c7215501a4c80d90f915ede841918331f5f01fadf0bd65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:29.539366Z","signature_b64":"ogA/+l99ex1W7hL9zPoGdOJpSA3Cb4U2ZXPvk/XVEANd/aYlyxijKdBFUK2k1mW0P0reX1bniT5mWTvcoA8JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a60c7ba516b028be47dbb70b7b48c0e536439335ebaad00cbcd518c37f97454","last_reissued_at":"2026-05-18T00:31:29.538623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:29.538623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of optimal homotopies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Arnaud de Mesmay, Erin Wolf Chambers, Tim Ophelders","submitted_at":"2017-11-02T15:49:59Z","abstract_excerpt":"In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More precisely, given two homotopic curves $\\gamma_1$ and $\\gamma_2$ on a combinatorial (say, triangulated) surface, we investigate the problem of computing a homotopy between $\\gamma_1$ and $\\gamma_2$ where the length of the longest intermediate curve is minimized. Such optimal homotopies are relevant for a wide range of purposes, from very theoretical question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00788","kind":"arxiv","version":1},"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":"1711.00788","created_at":"2026-05-18T00:31:29.538748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00788v1","created_at":"2026-05-18T00:31:29.538748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00788","created_at":"2026-05-18T00:31:29.538748+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJQMPOSRNMBI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJQMPOSRNMBIXZD5","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJQMPOSR","created_at":"2026-05-18T12:31:31.346846+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/NJQMPOSRNMBIXZD5XNYLPNEMBZ","json":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ.json","graph_json":"https://pith.science/api/pith-number/NJQMPOSRNMBIXZD5XNYLPNEMBZ/graph.json","events_json":"https://pith.science/api/pith-number/NJQMPOSRNMBIXZD5XNYLPNEMBZ/events.json","paper":"https://pith.science/paper/NJQMPOSR"},"agent_actions":{"view_html":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ","download_json":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ.json","view_paper":"https://pith.science/paper/NJQMPOSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00788&json=true","fetch_graph":"https://pith.science/api/pith-number/NJQMPOSRNMBIXZD5XNYLPNEMBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NJQMPOSRNMBIXZD5XNYLPNEMBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ/action/storage_attestation","attest_author":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ/action/author_attestation","sign_citation":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ/action/citation_signature","submit_replication":"https://pith.science/pith/NJQMPOSRNMBIXZD5XNYLPNEMBZ/action/replication_record"}},"created_at":"2026-05-18T00:31:29.538748+00:00","updated_at":"2026-05-18T00:31:29.538748+00:00"}