{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P53XZV7Z2ECUPD6LI5CXS4QRIE","short_pith_number":"pith:P53XZV7Z","schema_version":"1.0","canonical_sha256":"7f777cd7f9d105478fcb4745797211410826569c54afc87dab66d3593b73a8b1","source":{"kind":"arxiv","id":"2504.17955","version":2},"attestation_state":"computed","paper":{"title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"(2) University of Rochester), Daniel S. Hirschberg (1), Irvine, Michael T. Goodrich (1), Ofek Gila (1), Shayan Taherijam (1) ((1) University of California, Zahra Hadizadeh (2)","submitted_at":"2025-04-24T21:58:38Z","abstract_excerpt":"We introduce and study the Marco Polo problem, which is a combinatorial approach to geometric localization. In this problem, we are told there are one or more points of interest (POIs) within distance $n$ of the origin that we wish to localize. Given a mobile search point, $\\Delta$, that is initially at the origin, a localization algorithm is a strategy to move $\\Delta$ to be within a distance of $1$ of a POI. In the combinatorial localization problem we study, the only tool we can use is reminiscent of the children's game, \"Marco Polo,\" in that $\\Delta$ can issue a probe signal out a specifie"},"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":"2504.17955","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-24T21:58:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4f5da03e8c46acb3da96af22e1fdcb8d6790636795e1e990f00e032492c12b8e","abstract_canon_sha256":"d6a9e0a2442c283fb922ac1d05858d0c4a62cd514b78a0110991fdfc9ddb2f59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:19.186564Z","signature_b64":"1iHM/zIrkUa/iLSFwd0HezgrAx8ZBGmBdqi2xa2oGJZKbmLn+0Z5uIcR1pb2IY8SHxcp9gh4XzyPrvDkbCS3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f777cd7f9d105478fcb4745797211410826569c54afc87dab66d3593b73a8b1","last_reissued_at":"2026-07-05T11:56:19.186090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:19.186090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"(2) University of Rochester), Daniel S. Hirschberg (1), Irvine, Michael T. Goodrich (1), Ofek Gila (1), Shayan Taherijam (1) ((1) University of California, Zahra Hadizadeh (2)","submitted_at":"2025-04-24T21:58:38Z","abstract_excerpt":"We introduce and study the Marco Polo problem, which is a combinatorial approach to geometric localization. In this problem, we are told there are one or more points of interest (POIs) within distance $n$ of the origin that we wish to localize. Given a mobile search point, $\\Delta$, that is initially at the origin, a localization algorithm is a strategy to move $\\Delta$ to be within a distance of $1$ of a POI. In the combinatorial localization problem we study, the only tool we can use is reminiscent of the children's game, \"Marco Polo,\" in that $\\Delta$ can issue a probe signal out a specifie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17955","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/2504.17955/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":"2504.17955","created_at":"2026-07-05T11:56:19.186148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17955v2","created_at":"2026-07-05T11:56:19.186148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17955","created_at":"2026-07-05T11:56:19.186148+00:00"},{"alias_kind":"pith_short_12","alias_value":"P53XZV7Z2ECU","created_at":"2026-07-05T11:56:19.186148+00:00"},{"alias_kind":"pith_short_16","alias_value":"P53XZV7Z2ECUPD6L","created_at":"2026-07-05T11:56:19.186148+00:00"},{"alias_kind":"pith_short_8","alias_value":"P53XZV7Z","created_at":"2026-07-05T11:56:19.186148+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/P53XZV7Z2ECUPD6LI5CXS4QRIE","json":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE.json","graph_json":"https://pith.science/api/pith-number/P53XZV7Z2ECUPD6LI5CXS4QRIE/graph.json","events_json":"https://pith.science/api/pith-number/P53XZV7Z2ECUPD6LI5CXS4QRIE/events.json","paper":"https://pith.science/paper/P53XZV7Z"},"agent_actions":{"view_html":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE","download_json":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE.json","view_paper":"https://pith.science/paper/P53XZV7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17955&json=true","fetch_graph":"https://pith.science/api/pith-number/P53XZV7Z2ECUPD6LI5CXS4QRIE/graph.json","fetch_events":"https://pith.science/api/pith-number/P53XZV7Z2ECUPD6LI5CXS4QRIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE/action/storage_attestation","attest_author":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE/action/author_attestation","sign_citation":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE/action/citation_signature","submit_replication":"https://pith.science/pith/P53XZV7Z2ECUPD6LI5CXS4QRIE/action/replication_record"}},"created_at":"2026-07-05T11:56:19.186148+00:00","updated_at":"2026-07-05T11:56:19.186148+00:00"}