{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PX4RCCRYII3NURB4RT3AC2ZLLC","short_pith_number":"pith:PX4RCCRY","schema_version":"1.0","canonical_sha256":"7df9110a384236da443c8cf6016b2b58a811bcde3cd0c423df8753beecfde70d","source":{"kind":"arxiv","id":"1608.05390","version":1},"attestation_state":"computed","paper":{"title":"Constant Factor Approximate Solutions for Expanding Search on General Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Steve Alpern, Thomas Lidbetter","submitted_at":"2016-08-18T19:47:10Z","abstract_excerpt":"We study the classical problem introduced by R. Isaacs and S. Gal of minimizing the time to find a hidden point $H$ on a network $Q$ moving from a known starting point. Rather than adopting the traditional continuous unit speed path paradigm, we use the ``expanding search'' paradigm recently introduced by the authors. Here the regions $S\\left( t\\right) $ that have been searched by time $t$ are increasing from the starting point and have total length $t$. Roughly speaking the search follows a sequence of arcs $a_{i}$ such that each one starts at some point of an earlier one. This type of search"},"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":"1608.05390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-18T19:47:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"10e69037726a8cacf1031a4ee2fb004c07180f252e9fe23d9e7151dbc12587b8","abstract_canon_sha256":"9e8f529304b26921419c9709a2e99eafb4628bf79632fc0107c8631560b391c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:31.220172Z","signature_b64":"pmsmQ90cXPLt8OekBXVkJ7XhKrLCiRRvEFz1IqdVj6Dyqv1awyjoDqKNcVA4P7Kcv1Ix5YcRaHWtd0cHelCKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7df9110a384236da443c8cf6016b2b58a811bcde3cd0c423df8753beecfde70d","last_reissued_at":"2026-05-18T01:08:31.219620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:31.219620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Factor Approximate Solutions for Expanding Search on General Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Steve Alpern, Thomas Lidbetter","submitted_at":"2016-08-18T19:47:10Z","abstract_excerpt":"We study the classical problem introduced by R. Isaacs and S. Gal of minimizing the time to find a hidden point $H$ on a network $Q$ moving from a known starting point. Rather than adopting the traditional continuous unit speed path paradigm, we use the ``expanding search'' paradigm recently introduced by the authors. Here the regions $S\\left( t\\right) $ that have been searched by time $t$ are increasing from the starting point and have total length $t$. Roughly speaking the search follows a sequence of arcs $a_{i}$ such that each one starts at some point of an earlier one. This type of search"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05390","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":"1608.05390","created_at":"2026-05-18T01:08:31.219721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05390v1","created_at":"2026-05-18T01:08:31.219721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05390","created_at":"2026-05-18T01:08:31.219721+00:00"},{"alias_kind":"pith_short_12","alias_value":"PX4RCCRYII3N","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PX4RCCRYII3NURB4","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PX4RCCRY","created_at":"2026-05-18T12:30:39.010887+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/PX4RCCRYII3NURB4RT3AC2ZLLC","json":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC.json","graph_json":"https://pith.science/api/pith-number/PX4RCCRYII3NURB4RT3AC2ZLLC/graph.json","events_json":"https://pith.science/api/pith-number/PX4RCCRYII3NURB4RT3AC2ZLLC/events.json","paper":"https://pith.science/paper/PX4RCCRY"},"agent_actions":{"view_html":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC","download_json":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC.json","view_paper":"https://pith.science/paper/PX4RCCRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05390&json=true","fetch_graph":"https://pith.science/api/pith-number/PX4RCCRYII3NURB4RT3AC2ZLLC/graph.json","fetch_events":"https://pith.science/api/pith-number/PX4RCCRYII3NURB4RT3AC2ZLLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/action/storage_attestation","attest_author":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/action/author_attestation","sign_citation":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/action/citation_signature","submit_replication":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/action/replication_record"}},"created_at":"2026-05-18T01:08:31.219721+00:00","updated_at":"2026-05-18T01:08:31.219721+00:00"}