{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XP7LHECR3CCK5TQJXML4XGNCD4","short_pith_number":"pith:XP7LHECR","schema_version":"1.0","canonical_sha256":"bbfeb39051d884aece09bb17cb99a21f14ac3a526eaea725770d5d794783eafd","source":{"kind":"arxiv","id":"2512.17211","version":2},"attestation_state":"computed","paper":{"title":"Shortest paths in planar domains with hyperbolic type metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.CV","math.NA"],"primary_cat":"math.MG","authors_text":"Anni Hakanen, Antti Rasila, Matti Vuorinen, Shuliang Gao","submitted_at":"2025-12-19T03:47:46Z","abstract_excerpt":"We study planar domains $G$ equipped with a hyperbolic type metric and approximate geodesics that join two points $x,y \\in G$ and their lengths. We present an algorithm that enables one to approximate the shortest distance in polygonal domains taken with respect to the quasihyperbolic metric. The method is based on Dijkstra's algorithm, and we give several examples demonstrating how the algorithm works and analyze its accuracy. We experimentally demonstrate several previously theoretically observed features of geodesics, such as the relationship between hyperbolic and quasihyperbolic distance "},"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":"2512.17211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2025-12-19T03:47:46Z","cross_cats_sorted":["cs.NA","math.CV","math.NA"],"title_canon_sha256":"d19561a1cde9aede14f9dac53e311112c5628e21eef84d20b03152a803db558a","abstract_canon_sha256":"12f851b2d48fed9cfbb011f61819585fb2ea691d1969e491f746f3a74ba8571b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:01.563094Z","signature_b64":"3LhQ8aPMj/mXNm7/ZE3jOCnqUtAme+yXyDT4kqpRhpsHud+xL/+ZQj9FOVd7UlqsoXyMD6Q28ecMLM8/ESeyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbfeb39051d884aece09bb17cb99a21f14ac3a526eaea725770d5d794783eafd","last_reissued_at":"2026-05-26T02:04:01.562012Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:01.562012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest paths in planar domains with hyperbolic type metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.CV","math.NA"],"primary_cat":"math.MG","authors_text":"Anni Hakanen, Antti Rasila, Matti Vuorinen, Shuliang Gao","submitted_at":"2025-12-19T03:47:46Z","abstract_excerpt":"We study planar domains $G$ equipped with a hyperbolic type metric and approximate geodesics that join two points $x,y \\in G$ and their lengths. We present an algorithm that enables one to approximate the shortest distance in polygonal domains taken with respect to the quasihyperbolic metric. The method is based on Dijkstra's algorithm, and we give several examples demonstrating how the algorithm works and analyze its accuracy. We experimentally demonstrate several previously theoretically observed features of geodesics, such as the relationship between hyperbolic and quasihyperbolic distance "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.17211","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.17211/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2512.17211","created_at":"2026-05-26T02:04:01.562127+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.17211v2","created_at":"2026-05-26T02:04:01.562127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.17211","created_at":"2026-05-26T02:04:01.562127+00:00"},{"alias_kind":"pith_short_12","alias_value":"XP7LHECR3CCK","created_at":"2026-05-26T02:04:01.562127+00:00"},{"alias_kind":"pith_short_16","alias_value":"XP7LHECR3CCK5TQJ","created_at":"2026-05-26T02:04:01.562127+00:00"},{"alias_kind":"pith_short_8","alias_value":"XP7LHECR","created_at":"2026-05-26T02:04:01.562127+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/XP7LHECR3CCK5TQJXML4XGNCD4","json":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4.json","graph_json":"https://pith.science/api/pith-number/XP7LHECR3CCK5TQJXML4XGNCD4/graph.json","events_json":"https://pith.science/api/pith-number/XP7LHECR3CCK5TQJXML4XGNCD4/events.json","paper":"https://pith.science/paper/XP7LHECR"},"agent_actions":{"view_html":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4","download_json":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4.json","view_paper":"https://pith.science/paper/XP7LHECR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.17211&json=true","fetch_graph":"https://pith.science/api/pith-number/XP7LHECR3CCK5TQJXML4XGNCD4/graph.json","fetch_events":"https://pith.science/api/pith-number/XP7LHECR3CCK5TQJXML4XGNCD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4/action/storage_attestation","attest_author":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4/action/author_attestation","sign_citation":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4/action/citation_signature","submit_replication":"https://pith.science/pith/XP7LHECR3CCK5TQJXML4XGNCD4/action/replication_record"}},"created_at":"2026-05-26T02:04:01.562127+00:00","updated_at":"2026-05-26T02:04:01.562127+00:00"}