{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WA5N55CFPKNXM46573ZYX6DMUE","short_pith_number":"pith:WA5N55CF","canonical_record":{"source":{"id":"1004.0871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-06T15:24:39Z","cross_cats_sorted":[],"title_canon_sha256":"586a4be75911cb2e665da9dd6fa3c1f1d81b30a0ad435bf67325fd71eb2a26e6","abstract_canon_sha256":"680e69a33b15d3f275493b0340d96c485564ea541253c777b57ce79f0783f136"},"schema_version":"1.0"},"canonical_sha256":"b03adef4457a9b7673ddfef38bf86ca13f279aaea58752876c6481f715bd848a","source":{"kind":"arxiv","id":"1004.0871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0871","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0871v1","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0871","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"WA5N55CFPKNX","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WA5N55CFPKNXM465","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WA5N55CF","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WA5N55CFPKNXM46573ZYX6DMUE","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-06T15:24:39Z","cross_cats_sorted":[],"title_canon_sha256":"586a4be75911cb2e665da9dd6fa3c1f1d81b30a0ad435bf67325fd71eb2a26e6","abstract_canon_sha256":"680e69a33b15d3f275493b0340d96c485564ea541253c777b57ce79f0783f136"},"schema_version":"1.0"},"canonical_sha256":"b03adef4457a9b7673ddfef38bf86ca13f279aaea58752876c6481f715bd848a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:14.111584Z","signature_b64":"ixO/vFd8sPKZSAV8EFL2HkpFZo7MoIRiSw3eiq1WhJPxgwZzyPjzKwwUf5KFQUwaXzQnD0horYwVRDViu4akAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b03adef4457a9b7673ddfef38bf86ca13f279aaea58752876c6481f715bd848a","last_reissued_at":"2026-05-18T02:08:14.111105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:14.111105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0871","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-18T02:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmNr3tcX7k8YJ3j0JaqmeRNbYH9IAU+4maY430UZABS20t2MpcpQkdBjXihxz9WZ+3Rw+MnGr6wMGRNwTBh5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:03:21.766038Z"},"content_sha256":"e8d488663e9890dedd8fc83dbee49520b3cba1f216ab20b49173d103dcd30905","schema_version":"1.0","event_id":"sha256:e8d488663e9890dedd8fc83dbee49520b3cba1f216ab20b49173d103dcd30905"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WA5N55CFPKNXM46573ZYX6DMUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Local Search for Weighted Standard Set Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dominic Dumrauf, Tim S\\\"u{\\ss}","submitted_at":"2010-04-06T15:24:39Z","abstract_excerpt":"In this paper, we study the complexity of computing locally optimal solutions for weighted versions of standard set problems such as SetCover, SetPacking, and many more. For our investigation, we use the framework of PLS, as defined in Johnson et al., [JPY88]. We show that for most of these problems, computing a locally optimal solution is already PLS-complete for a simple neighborhood of size one. For the local search versions of weighted SetPacking and SetCover, we derive tight bounds for a simple neighborhood of size two. To the best of our knowledge, these are one of the very few PLS resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0871","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-18T02:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XLoSbAQ1KzPbLf4X9gGoRL6CvcrAzZFg/OsxITm2wWSqQtM4ZqgVQrcw+9sLRRJRLg7heX9HnmG/NMon40GDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:03:21.766395Z"},"content_sha256":"562e1720445cd35abcd117a936979b307a248c27c0b1b877653360241c04586f","schema_version":"1.0","event_id":"sha256:562e1720445cd35abcd117a936979b307a248c27c0b1b877653360241c04586f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WA5N55CFPKNXM46573ZYX6DMUE/bundle.json","state_url":"https://pith.science/pith/WA5N55CFPKNXM46573ZYX6DMUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WA5N55CFPKNXM46573ZYX6DMUE/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-02T02:03:21Z","links":{"resolver":"https://pith.science/pith/WA5N55CFPKNXM46573ZYX6DMUE","bundle":"https://pith.science/pith/WA5N55CFPKNXM46573ZYX6DMUE/bundle.json","state":"https://pith.science/pith/WA5N55CFPKNXM46573ZYX6DMUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WA5N55CFPKNXM46573ZYX6DMUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WA5N55CFPKNXM46573ZYX6DMUE","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":"680e69a33b15d3f275493b0340d96c485564ea541253c777b57ce79f0783f136","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-06T15:24:39Z","title_canon_sha256":"586a4be75911cb2e665da9dd6fa3c1f1d81b30a0ad435bf67325fd71eb2a26e6"},"schema_version":"1.0","source":{"id":"1004.0871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0871","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0871v1","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0871","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"WA5N55CFPKNX","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WA5N55CFPKNXM465","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WA5N55CF","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:562e1720445cd35abcd117a936979b307a248c27c0b1b877653360241c04586f","target":"graph","created_at":"2026-05-18T02:08:14Z","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":"In this paper, we study the complexity of computing locally optimal solutions for weighted versions of standard set problems such as SetCover, SetPacking, and many more. For our investigation, we use the framework of PLS, as defined in Johnson et al., [JPY88]. We show that for most of these problems, computing a locally optimal solution is already PLS-complete for a simple neighborhood of size one. For the local search versions of weighted SetPacking and SetCover, we derive tight bounds for a simple neighborhood of size two. To the best of our knowledge, these are one of the very few PLS resul","authors_text":"Dominic Dumrauf, Tim S\\\"u{\\ss}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-06T15:24:39Z","title":"On the Complexity of Local Search for Weighted Standard Set Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0871","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:e8d488663e9890dedd8fc83dbee49520b3cba1f216ab20b49173d103dcd30905","target":"record","created_at":"2026-05-18T02:08:14Z","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":"680e69a33b15d3f275493b0340d96c485564ea541253c777b57ce79f0783f136","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-06T15:24:39Z","title_canon_sha256":"586a4be75911cb2e665da9dd6fa3c1f1d81b30a0ad435bf67325fd71eb2a26e6"},"schema_version":"1.0","source":{"id":"1004.0871","kind":"arxiv","version":1}},"canonical_sha256":"b03adef4457a9b7673ddfef38bf86ca13f279aaea58752876c6481f715bd848a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b03adef4457a9b7673ddfef38bf86ca13f279aaea58752876c6481f715bd848a","first_computed_at":"2026-05-18T02:08:14.111105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:08:14.111105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ixO/vFd8sPKZSAV8EFL2HkpFZo7MoIRiSw3eiq1WhJPxgwZzyPjzKwwUf5KFQUwaXzQnD0horYwVRDViu4akAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:08:14.111584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8d488663e9890dedd8fc83dbee49520b3cba1f216ab20b49173d103dcd30905","sha256:562e1720445cd35abcd117a936979b307a248c27c0b1b877653360241c04586f"],"state_sha256":"d42b0415fc27de97852cb47fd86ae756d6878597dd75802c3842fe29eead93a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ia4qFDbqeON7d3ovXCOkoA/6eoPznYUg7PflfqY5kVBPB6L10Yn+I/uuZCxuaUGqdNDTxpv1tVL9YELnuHZvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:03:21.768298Z","bundle_sha256":"02b2170c92303b136a90ee9dccf83bba6694d83169c48a79ba3df6a2c8f7981c"}}