{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:W5LSQ6JRKELL3WCHW3PRTQN2SN","short_pith_number":"pith:W5LSQ6JR","canonical_record":{"source":{"id":"1911.08959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-20T15:18:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e483f20866dc8283154601c4db62a8c1856b5b04c6ce1645e300c444ec2e2948","abstract_canon_sha256":"6ab1ac27afad2eb273ba98885bc190ff06c916fdefde00eef8ddba36ebb9236e"},"schema_version":"1.0"},"canonical_sha256":"b7572879315116bdd847b6df19c1ba93757da15cd7abd31642f174c2ccedef00","source":{"kind":"arxiv","id":"1911.08959","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08959","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08959v1","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08959","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"W5LSQ6JRKELL","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5LSQ6JRKELL3WCH","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5LSQ6JR","created_at":"2026-07-05T00:20:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:W5LSQ6JRKELL3WCHW3PRTQN2SN","target":"record","payload":{"canonical_record":{"source":{"id":"1911.08959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-20T15:18:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e483f20866dc8283154601c4db62a8c1856b5b04c6ce1645e300c444ec2e2948","abstract_canon_sha256":"6ab1ac27afad2eb273ba98885bc190ff06c916fdefde00eef8ddba36ebb9236e"},"schema_version":"1.0"},"canonical_sha256":"b7572879315116bdd847b6df19c1ba93757da15cd7abd31642f174c2ccedef00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:47.314578Z","signature_b64":"5HxLwfiP4FztSQkGGYQE1P0/aPmu5vvr5eQM1DNkPOchE9wAzoDiS8YKFFTWIpmajsJbwI18vyRME8J3iBK6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7572879315116bdd847b6df19c1ba93757da15cd7abd31642f174c2ccedef00","last_reissued_at":"2026-07-05T00:20:47.314167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:47.314167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.08959","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-07-05T00:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFASibr9YSm1NDHe99DrHdpm326NQ4WQK0y9bskmuKxHDb14oCWIa7JUKSWUApA2k+UO1V0dXvRLGBoK4jprAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:30:58.431507Z"},"content_sha256":"03dce895cc528341fa825521a97e84337b8b8e6b6b5f564ab03cd0a39fcc93e2","schema_version":"1.0","event_id":"sha256:03dce895cc528341fa825521a97e84337b8b8e6b6b5f564ab03cd0a39fcc93e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:W5LSQ6JRKELL3WCHW3PRTQN2SN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact and approximation algorithms for the expanding search problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ben Hermans, Jannik Matuschke, Roel Leus","submitted_at":"2019-11-20T15:18:24Z","abstract_excerpt":"Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a known probability distribution. The expanding search problem asks for a search sequence of the vertices so as to minimize the expected time for finding the target, where the time for reaching the next vertex is determined by its distance to the region that was already searched. This problem has numerous applications, such as searching for hidden explosives, mining coal, and disaster relief. In this paper, we develop exact algorithms and heuristics, including a branch-and-cut procedure, a greedy algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08959","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/1911.08959/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"},"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-07-05T00:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+pGYBmbcPkOIdiGIE2fOlpk7ov0rsV6qvY+21Qqrs91IqJc4Qnv8Kb8EyfE81KK/ZFw0RVJ8e3AqrS+XzUnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:30:58.431882Z"},"content_sha256":"7a2261657fccf1fc655bb2655a5730968200b91b6c35cb8743e5a191fed9ebfe","schema_version":"1.0","event_id":"sha256:7a2261657fccf1fc655bb2655a5730968200b91b6c35cb8743e5a191fed9ebfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5LSQ6JRKELL3WCHW3PRTQN2SN/bundle.json","state_url":"https://pith.science/pith/W5LSQ6JRKELL3WCHW3PRTQN2SN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5LSQ6JRKELL3WCHW3PRTQN2SN/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-07-07T11:30:58Z","links":{"resolver":"https://pith.science/pith/W5LSQ6JRKELL3WCHW3PRTQN2SN","bundle":"https://pith.science/pith/W5LSQ6JRKELL3WCHW3PRTQN2SN/bundle.json","state":"https://pith.science/pith/W5LSQ6JRKELL3WCHW3PRTQN2SN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5LSQ6JRKELL3WCHW3PRTQN2SN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:W5LSQ6JRKELL3WCHW3PRTQN2SN","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":"6ab1ac27afad2eb273ba98885bc190ff06c916fdefde00eef8ddba36ebb9236e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-20T15:18:24Z","title_canon_sha256":"e483f20866dc8283154601c4db62a8c1856b5b04c6ce1645e300c444ec2e2948"},"schema_version":"1.0","source":{"id":"1911.08959","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08959","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08959v1","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08959","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"W5LSQ6JRKELL","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5LSQ6JRKELL3WCH","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5LSQ6JR","created_at":"2026-07-05T00:20:47Z"}],"graph_snapshots":[{"event_id":"sha256:7a2261657fccf1fc655bb2655a5730968200b91b6c35cb8743e5a191fed9ebfe","target":"graph","created_at":"2026-07-05T00:20:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.08959/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a known probability distribution. The expanding search problem asks for a search sequence of the vertices so as to minimize the expected time for finding the target, where the time for reaching the next vertex is determined by its distance to the region that was already searched. This problem has numerous applications, such as searching for hidden explosives, mining coal, and disaster relief. In this paper, we develop exact algorithms and heuristics, including a branch-and-cut procedure, a greedy algorithm","authors_text":"Ben Hermans, Jannik Matuschke, Roel Leus","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-20T15:18:24Z","title":"Exact and approximation algorithms for the expanding search problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08959","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:03dce895cc528341fa825521a97e84337b8b8e6b6b5f564ab03cd0a39fcc93e2","target":"record","created_at":"2026-07-05T00:20:47Z","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":"6ab1ac27afad2eb273ba98885bc190ff06c916fdefde00eef8ddba36ebb9236e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-20T15:18:24Z","title_canon_sha256":"e483f20866dc8283154601c4db62a8c1856b5b04c6ce1645e300c444ec2e2948"},"schema_version":"1.0","source":{"id":"1911.08959","kind":"arxiv","version":1}},"canonical_sha256":"b7572879315116bdd847b6df19c1ba93757da15cd7abd31642f174c2ccedef00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7572879315116bdd847b6df19c1ba93757da15cd7abd31642f174c2ccedef00","first_computed_at":"2026-07-05T00:20:47.314167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:47.314167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5HxLwfiP4FztSQkGGYQE1P0/aPmu5vvr5eQM1DNkPOchE9wAzoDiS8YKFFTWIpmajsJbwI18vyRME8J3iBK6DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:47.314578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.08959","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03dce895cc528341fa825521a97e84337b8b8e6b6b5f564ab03cd0a39fcc93e2","sha256:7a2261657fccf1fc655bb2655a5730968200b91b6c35cb8743e5a191fed9ebfe"],"state_sha256":"69199e3490d2c047edfbb13d5b55a777ef1a8c278f4a491ebe87fac4ed7fa57f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+mKvHSVTaGOlpr3Thc8PoeZ/jsZiR5ugAu0X9qRT/VoxTmt03bi0XZNlvSOgwEqAw92PlwG6GK67vB+7GEEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:30:58.433882Z","bundle_sha256":"1a0e3d2058e221bc2f6c2a2758065d590bc8a648e9acff129d32182afc8096ad"}}