{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PX4RCCRYII3NURB4RT3AC2ZLLC","short_pith_number":"pith:PX4RCCRY","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"},"canonical_sha256":"7df9110a384236da443c8cf6016b2b58a811bcde3cd0c423df8753beecfde70d","source":{"kind":"arxiv","id":"1608.05390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05390","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05390v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05390","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"PX4RCCRYII3N","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PX4RCCRYII3NURB4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PX4RCCRY","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PX4RCCRYII3NURB4RT3AC2ZLLC","target":"record","payload":{"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"},"canonical_sha256":"7df9110a384236da443c8cf6016b2b58a811bcde3cd0c423df8753beecfde70d","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"},"source_kind":"arxiv","source_id":"1608.05390","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfk0hIowUMgE0/OIKHjGHx1zwM41rHxAm7g0xjs/6KpubVTzF+2NYL0hEPVLKE72SXlGq4XflgRC3vglEEl1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:38:23.059637Z"},"content_sha256":"e54cf96d8d47ea5f2900905a305fb54b3652672632f5a259d741f14014a071a6","schema_version":"1.0","event_id":"sha256:e54cf96d8d47ea5f2900905a305fb54b3652672632f5a259d741f14014a071a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PX4RCCRYII3NURB4RT3AC2ZLLC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oyRTJEKCzOri3cCV0DPnxOMTNHiZfG5qhG896LgspmjAXvulDBqtm2KELuTIby0nt/8OXeqwJr6Bd/3eet+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:38:23.059977Z"},"content_sha256":"045df928f43cfb9355db0762cabde2ba5c327882ec8ee568a9078c0ecd85cc11","schema_version":"1.0","event_id":"sha256:045df928f43cfb9355db0762cabde2ba5c327882ec8ee568a9078c0ecd85cc11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/bundle.json","state_url":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T20:38:23Z","links":{"resolver":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC","bundle":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/bundle.json","state":"https://pith.science/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PX4RCCRYII3NURB4RT3AC2ZLLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PX4RCCRYII3NURB4RT3AC2ZLLC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9e8f529304b26921419c9709a2e99eafb4628bf79632fc0107c8631560b391c5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-18T19:47:10Z","title_canon_sha256":"10e69037726a8cacf1031a4ee2fb004c07180f252e9fe23d9e7151dbc12587b8"},"schema_version":"1.0","source":{"id":"1608.05390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05390","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05390v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05390","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"PX4RCCRYII3N","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PX4RCCRYII3NURB4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PX4RCCRY","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:045df928f43cfb9355db0762cabde2ba5c327882ec8ee568a9078c0ecd85cc11","target":"graph","created_at":"2026-05-18T01:08:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Steve Alpern, Thomas Lidbetter","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-18T19:47:10Z","title":"Constant Factor Approximate Solutions for Expanding Search on General Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05390","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e54cf96d8d47ea5f2900905a305fb54b3652672632f5a259d741f14014a071a6","target":"record","created_at":"2026-05-18T01:08:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9e8f529304b26921419c9709a2e99eafb4628bf79632fc0107c8631560b391c5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-18T19:47:10Z","title_canon_sha256":"10e69037726a8cacf1031a4ee2fb004c07180f252e9fe23d9e7151dbc12587b8"},"schema_version":"1.0","source":{"id":"1608.05390","kind":"arxiv","version":1}},"canonical_sha256":"7df9110a384236da443c8cf6016b2b58a811bcde3cd0c423df8753beecfde70d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7df9110a384236da443c8cf6016b2b58a811bcde3cd0c423df8753beecfde70d","first_computed_at":"2026-05-18T01:08:31.219620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:31.219620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pmsmQ90cXPLt8OekBXVkJ7XhKrLCiRRvEFz1IqdVj6Dyqv1awyjoDqKNcVA4P7Kcv1Ix5YcRaHWtd0cHelCKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:31.220172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e54cf96d8d47ea5f2900905a305fb54b3652672632f5a259d741f14014a071a6","sha256:045df928f43cfb9355db0762cabde2ba5c327882ec8ee568a9078c0ecd85cc11"],"state_sha256":"86465ff3cdcffcd8d5090a59d54c189adf176178d0129e570cc68e74b6f48484"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0/BcYvVVSIlklfBdJMOHRltDqNGkiTCNawN4coFWPbkNjy6Xoyu6P/teqMvsYdn0yn2OuakXLuTYvu0cxZbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:38:23.061896Z","bundle_sha256":"37a12c9fe9d208322a358e1c40cdf81ab4e320381fc23d9a227126cfdb062a57"}}