{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XSJ7QECJOX6CF7HT3U4NYISZVG","short_pith_number":"pith:XSJ7QECJ","schema_version":"1.0","canonical_sha256":"bc93f8104975fc22fcf3dd38dc2259a9b15be6ff5be2ffa00624850e91f8729d","source":{"kind":"arxiv","id":"1408.6812","version":2},"attestation_state":"computed","paper":{"title":"Towards a General Framework for Searching on a Line and Searching on $m$ Rays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jean-Lou De Carufel, Prosenjit Bose","submitted_at":"2014-08-28T19:15:18Z","abstract_excerpt":"Consider the following classical search problem: given a target point $p\\in \\Re$, starting at the origin, find $p$ with minimum cost, where cost is defined as the distance travelled. Let $D$ be the distance of $p$ from the origin. When no lower bound on $D$ is given, no competitive search strategy exists. Demaine, Fekete and Gal (Online searching with turn cost, Theor. Comput. Sci., 361(2-3):342-355, 2006) considered the situation where no lower bound on $D$ is given but a fixed \\emph{turn cost} $t>0$ is charged every time the searcher changes direction. When the total cost is expressed as $c "},"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":"1408.6812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-28T19:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"10d6968a354c80ade74f8d4f6337128745ef74b7700c6bd1630ff150ca0939ae","abstract_canon_sha256":"aa457aacb59f532932aff9a1a351a08afc3016e80210eea701c9b40f4b6e7c08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.768760Z","signature_b64":"2T3afjVw/rB2klZTnwhLBN1ymTrwmrF2S0C/ZmERv03+ARCybpMGNCwekfPGc53SMqWes7mItvF0mV5TzpK8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc93f8104975fc22fcf3dd38dc2259a9b15be6ff5be2ffa00624850e91f8729d","last_reissued_at":"2026-05-18T02:38:38.768348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.768348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a General Framework for Searching on a Line and Searching on $m$ Rays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jean-Lou De Carufel, Prosenjit Bose","submitted_at":"2014-08-28T19:15:18Z","abstract_excerpt":"Consider the following classical search problem: given a target point $p\\in \\Re$, starting at the origin, find $p$ with minimum cost, where cost is defined as the distance travelled. Let $D$ be the distance of $p$ from the origin. When no lower bound on $D$ is given, no competitive search strategy exists. Demaine, Fekete and Gal (Online searching with turn cost, Theor. Comput. Sci., 361(2-3):342-355, 2006) considered the situation where no lower bound on $D$ is given but a fixed \\emph{turn cost} $t>0$ is charged every time the searcher changes direction. When the total cost is expressed as $c "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6812","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":"1408.6812","created_at":"2026-05-18T02:38:38.768416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6812v2","created_at":"2026-05-18T02:38:38.768416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6812","created_at":"2026-05-18T02:38:38.768416+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSJ7QECJOX6C","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSJ7QECJOX6CF7HT","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSJ7QECJ","created_at":"2026-05-18T12:28:57.508820+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/XSJ7QECJOX6CF7HT3U4NYISZVG","json":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG.json","graph_json":"https://pith.science/api/pith-number/XSJ7QECJOX6CF7HT3U4NYISZVG/graph.json","events_json":"https://pith.science/api/pith-number/XSJ7QECJOX6CF7HT3U4NYISZVG/events.json","paper":"https://pith.science/paper/XSJ7QECJ"},"agent_actions":{"view_html":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG","download_json":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG.json","view_paper":"https://pith.science/paper/XSJ7QECJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6812&json=true","fetch_graph":"https://pith.science/api/pith-number/XSJ7QECJOX6CF7HT3U4NYISZVG/graph.json","fetch_events":"https://pith.science/api/pith-number/XSJ7QECJOX6CF7HT3U4NYISZVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG/action/storage_attestation","attest_author":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG/action/author_attestation","sign_citation":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG/action/citation_signature","submit_replication":"https://pith.science/pith/XSJ7QECJOX6CF7HT3U4NYISZVG/action/replication_record"}},"created_at":"2026-05-18T02:38:38.768416+00:00","updated_at":"2026-05-18T02:38:38.768416+00:00"}