{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6K65JIITNHR2VWZ5FAACWLNTRC","short_pith_number":"pith:6K65JIIT","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"},"canonical_sha256":"f2bdd4a11369e3aadb3d28002b2db388bbd4d3217b4644db466b370d2d205a11","source":{"kind":"arxiv","id":"1607.07598","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07598","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07598v4","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07598","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"6K65JIITNHR2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6K65JIITNHR2VWZ5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6K65JIIT","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6K65JIITNHR2VWZ5FAACWLNTRC","target":"record","payload":{"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"},"canonical_sha256":"f2bdd4a11369e3aadb3d28002b2db388bbd4d3217b4644db466b370d2d205a11","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"},"source_kind":"arxiv","source_id":"1607.07598","source_version":4,"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-18T00:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShqYzuABRzLk/P0cPM7s3R3uRpCBRVh0uWwHSJCcUcT+9Rwq1Z4IbObifU8o5uJVuoWK9kjlGIlUOTTiSJaEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:09:00.234885Z"},"content_sha256":"110192906b1d4f57c90f65a77da7efce7ad1d70361aaa20a20b870bc6994986a","schema_version":"1.0","event_id":"sha256:110192906b1d4f57c90f65a77da7efce7ad1d70361aaa20a20b870bc6994986a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6K65JIITNHR2VWZ5FAACWLNTRC","target":"graph","payload":{"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"},"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-18T00:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slbi0u+iIiS/h34VRevdGy5bnWRlmJ6fE729bkMhDJOx3fuG/DqGuucWcXmAvLoL4cLHZkXD5EKCO1cC7iYrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:09:00.235235Z"},"content_sha256":"ab2b4d47979990c583fa8fc78eb35bc89476ca2afd3c670a0240c56bece7127a","schema_version":"1.0","event_id":"sha256:ab2b4d47979990c583fa8fc78eb35bc89476ca2afd3c670a0240c56bece7127a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/bundle.json","state_url":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6K65JIITNHR2VWZ5FAACWLNTRC/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-03T22:09:00Z","links":{"resolver":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC","bundle":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/bundle.json","state":"https://pith.science/pith/6K65JIITNHR2VWZ5FAACWLNTRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6K65JIITNHR2VWZ5FAACWLNTRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6K65JIITNHR2VWZ5FAACWLNTRC","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":"181bf3675b0d4854d0203890783c57b75e95e379202130840da64dd4e6d65cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-26T08:59:31Z","title_canon_sha256":"98514ebe26a407b04c6b81e3a36a6b0d9a5ed0209955d8e849663bd91acfcb43"},"schema_version":"1.0","source":{"id":"1607.07598","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07598","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07598v4","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07598","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"6K65JIITNHR2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6K65JIITNHR2VWZ5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6K65JIIT","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:ab2b4d47979990c583fa8fc78eb35bc89476ca2afd3c670a0240c56bece7127a","target":"graph","created_at":"2026-05-18T00:13:48Z","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":"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","authors_text":"L\\'aszl\\'o A. V\\'egh, Robbert Fokkink, Thomas Lidbetter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-26T08:59:31Z","title":"On Submodular Search and Machine Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07598","kind":"arxiv","version":4},"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:110192906b1d4f57c90f65a77da7efce7ad1d70361aaa20a20b870bc6994986a","target":"record","created_at":"2026-05-18T00:13:48Z","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":"181bf3675b0d4854d0203890783c57b75e95e379202130840da64dd4e6d65cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-26T08:59:31Z","title_canon_sha256":"98514ebe26a407b04c6b81e3a36a6b0d9a5ed0209955d8e849663bd91acfcb43"},"schema_version":"1.0","source":{"id":"1607.07598","kind":"arxiv","version":4}},"canonical_sha256":"f2bdd4a11369e3aadb3d28002b2db388bbd4d3217b4644db466b370d2d205a11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2bdd4a11369e3aadb3d28002b2db388bbd4d3217b4644db466b370d2d205a11","first_computed_at":"2026-05-18T00:13:48.426752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:48.426752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6sAQcWYHX4Y5bub9T2kxecaqAIxhPJSybKR/G1r2fmrjs9SOuC3Um/Jle32q+LYC4CJNW6Hf9vc0r2nT5GDhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:48.428397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07598","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:110192906b1d4f57c90f65a77da7efce7ad1d70361aaa20a20b870bc6994986a","sha256:ab2b4d47979990c583fa8fc78eb35bc89476ca2afd3c670a0240c56bece7127a"],"state_sha256":"0b070fcc81b03f3c169c65396547a01a0dae58ec4582cbc0fd20fd77639dfe0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENkWY/189LhLIxYAJlxHTfWs2vK3xh5TRczCwpkI1fJZr+w2nfj5fPtnvS3jgisirZUsTnwqnJzWpxD0nWc0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:09:00.237343Z","bundle_sha256":"e108d5f2c6a9b418a136f7f60fbfe0dfb471c18f6c92b7b57667a894bd2ff025"}}