{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EXZUOXCX2MDEAOONYQ3ENLQTSR","short_pith_number":"pith:EXZUOXCX","schema_version":"1.0","canonical_sha256":"25f3475c57d3064039cdc43646ae139477c3f00f5e503f9f5c60fe64668df085","source":{"kind":"arxiv","id":"2006.14772","version":1},"attestation_state":"computed","paper":{"title":"Two robots moving geodesically on a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.GT","authors_text":"David Recio-Mitter, Donald M. Davis, Michael Harrison","submitted_at":"2020-06-26T03:21:37Z","abstract_excerpt":"We study the geodesic complexity of the ordered and unordered configuration spaces of graphs in both the $\\ell_1$ and $\\ell_2$ metrics. We determine the geodesic complexity of the ordered two-point $\\varepsilon$-configuration space of any star graph in both the $\\ell_1$ and $\\ell_2$ metrics and of the unordered two-point configuration space of any tree in the $\\ell_1$ metric, by finding explicit geodesics from any pair to any other pair, and arranging them into a minimal number of continuously-varying families. In each case the geodesic complexity matches the known value of the topological com"},"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":"2006.14772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2020-06-26T03:21:37Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"ffe12deae81368b13b7aa7756756e3a5e9ea1d59ed525cb8a10f1a080db61832","abstract_canon_sha256":"099bc00f9e624bb51fd499f548a14d5ad90f65538c64d1859c18f319131dfca4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:06.097102Z","signature_b64":"j4+W92JG8OeUFyv8BF+yOQDySRfSmYf5X8FNHz+4vWd/Y6a5W4WPozmRSBvx9ssg8Or8vePszF1UIWbXCMNnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25f3475c57d3064039cdc43646ae139477c3f00f5e503f9f5c60fe64668df085","last_reissued_at":"2026-07-05T04:47:06.096688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:06.096688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two robots moving geodesically on a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.GT","authors_text":"David Recio-Mitter, Donald M. Davis, Michael Harrison","submitted_at":"2020-06-26T03:21:37Z","abstract_excerpt":"We study the geodesic complexity of the ordered and unordered configuration spaces of graphs in both the $\\ell_1$ and $\\ell_2$ metrics. We determine the geodesic complexity of the ordered two-point $\\varepsilon$-configuration space of any star graph in both the $\\ell_1$ and $\\ell_2$ metrics and of the unordered two-point configuration space of any tree in the $\\ell_1$ metric, by finding explicit geodesics from any pair to any other pair, and arranging them into a minimal number of continuously-varying families. In each case the geodesic complexity matches the known value of the topological com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14772","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.14772/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":"2006.14772","created_at":"2026-07-05T04:47:06.096745+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.14772v1","created_at":"2026-07-05T04:47:06.096745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14772","created_at":"2026-07-05T04:47:06.096745+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXZUOXCX2MDE","created_at":"2026-07-05T04:47:06.096745+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXZUOXCX2MDEAOON","created_at":"2026-07-05T04:47:06.096745+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXZUOXCX","created_at":"2026-07-05T04:47:06.096745+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/EXZUOXCX2MDEAOONYQ3ENLQTSR","json":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR.json","graph_json":"https://pith.science/api/pith-number/EXZUOXCX2MDEAOONYQ3ENLQTSR/graph.json","events_json":"https://pith.science/api/pith-number/EXZUOXCX2MDEAOONYQ3ENLQTSR/events.json","paper":"https://pith.science/paper/EXZUOXCX"},"agent_actions":{"view_html":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR","download_json":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR.json","view_paper":"https://pith.science/paper/EXZUOXCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.14772&json=true","fetch_graph":"https://pith.science/api/pith-number/EXZUOXCX2MDEAOONYQ3ENLQTSR/graph.json","fetch_events":"https://pith.science/api/pith-number/EXZUOXCX2MDEAOONYQ3ENLQTSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR/action/storage_attestation","attest_author":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR/action/author_attestation","sign_citation":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR/action/citation_signature","submit_replication":"https://pith.science/pith/EXZUOXCX2MDEAOONYQ3ENLQTSR/action/replication_record"}},"created_at":"2026-07-05T04:47:06.096745+00:00","updated_at":"2026-07-05T04:47:06.096745+00:00"}