{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6K65JIITNHR2VWZ5FAACWLNTRC","short_pith_number":"pith:6K65JIIT","schema_version":"1.0","canonical_sha256":"f2bdd4a11369e3aadb3d28002b2db388bbd4d3217b4644db466b370d2d205a11","source":{"kind":"arxiv","id":"1607.07598","version":4},"attestation_state":"computed","paper":{"title":"On Submodular Search and Machine Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"L\\'aszl\\'o A. V\\'egh, Robbert Fokkink, Thomas Lidbetter","submitted_at":"2016-07-26T08:59:31Z","abstract_excerpt":"Suppose some objects are hidden in a finite set $S$ of hiding places which must be examined one-by-one. The cost of searching subsets of $S$ is given by a submodular function and the probability that all objects are contained in a subset is given by a supermodular function. We seek an ordering of $S$ that finds all the objects in minimal expected cost. This problem is NP-hard and we give an efficient combinatorial $2$-approximation algorithm, generalizing analogous results in scheduling theory. We also give a new scheduling application $1|prec|\\sum w_A h(C_A)$, where a set of jobs must be orde"},"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":"1607.07598","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-26T08:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"98514ebe26a407b04c6b81e3a36a6b0d9a5ed0209955d8e849663bd91acfcb43","abstract_canon_sha256":"181bf3675b0d4854d0203890783c57b75e95e379202130840da64dd4e6d65cd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:48.428397Z","signature_b64":"6sAQcWYHX4Y5bub9T2kxecaqAIxhPJSybKR/G1r2fmrjs9SOuC3Um/Jle32q+LYC4CJNW6Hf9vc0r2nT5GDhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2bdd4a11369e3aadb3d28002b2db388bbd4d3217b4644db466b370d2d205a11","last_reissued_at":"2026-05-18T00:13:48.426752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:48.426752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Submodular Search and Machine Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"L\\'aszl\\'o A. V\\'egh, Robbert Fokkink, Thomas Lidbetter","submitted_at":"2016-07-26T08:59:31Z","abstract_excerpt":"Suppose some objects are hidden in a finite set $S$ of hiding places which must be examined one-by-one. The cost of searching subsets of $S$ is given by a submodular function and the probability that all objects are contained in a subset is given by a supermodular function. We seek an ordering of $S$ that finds all the objects in minimal expected cost. This problem is NP-hard and we give an efficient combinatorial $2$-approximation algorithm, generalizing analogous results in scheduling theory. We also give a new scheduling application $1|prec|\\sum w_A h(C_A)$, where a set of jobs must be orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07598","kind":"arxiv","version":4},"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":"1607.07598","created_at":"2026-05-18T00:13:48.426858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07598v4","created_at":"2026-05-18T00:13:48.426858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07598","created_at":"2026-05-18T00:13:48.426858+00:00"},{"alias_kind":"pith_short_12","alias_value":"6K65JIITNHR2","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6K65JIITNHR2VWZ5","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6K65JIIT","created_at":"2026-05-18T12:30:01.593930+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/6K65JIITNHR2VWZ5FAACWLNTRC","json":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC.json","graph_json":"https://pith.science/api/pith-number/6K65JIITNHR2VWZ5FAACWLNTRC/graph.json","events_json":"https://pith.science/api/pith-number/6K65JIITNHR2VWZ5FAACWLNTRC/events.json","paper":"https://pith.science/paper/6K65JIIT"},"agent_actions":{"view_html":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC","download_json":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC.json","view_paper":"https://pith.science/paper/6K65JIIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07598&json=true","fetch_graph":"https://pith.science/api/pith-number/6K65JIITNHR2VWZ5FAACWLNTRC/graph.json","fetch_events":"https://pith.science/api/pith-number/6K65JIITNHR2VWZ5FAACWLNTRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/action/storage_attestation","attest_author":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/action/author_attestation","sign_citation":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/action/citation_signature","submit_replication":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/action/replication_record"}},"created_at":"2026-05-18T00:13:48.426858+00:00","updated_at":"2026-05-18T00:13:48.426858+00:00"}