{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TOO5NJ6C77AEDRM4WHUXOIJ67I","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":"bc81766c6f62dfc73b67112e3be55c4a329cab6cf89895576c97de842203d72d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-05T03:58:49Z","title_canon_sha256":"6d9afb1ccbffabf8191b58d0581aedb3b022b1afdeb951a8d3df6526ab3ec992"},"schema_version":"1.0","source":{"id":"1512.01621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01621","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01621v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01621","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"TOO5NJ6C77AE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TOO5NJ6C77AEDRM4","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TOO5NJ6C","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:6d8f73734e61d159e2bdeaaf239bacbbf4ea618c267adce758d8d1a2ec0c0de3","target":"graph","created_at":"2026-05-18T01:25:10Z","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 give a new general approach for designing exact exponential-time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a universe of size n and the task is to determine whether the family contains at least one set. Our approach is based on \"monotone local search\", where the goal is to extend a partial solution to a solution by adding as few elements as possible. More formally, in the extension problem we are also given as input a subset X of the universe and an integer k. The task is to determine whether one can add at most k elements to X ","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Saket Saurabh, Serge Gaspers","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-05T03:58:49Z","title":"Exact Algorithms via Monotone Local Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01621","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:9e0ed1dce861585800091b6f9e2c3ae3616e28c5012a7886e8e37a4b151c17cd","target":"record","created_at":"2026-05-18T01:25:10Z","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":"bc81766c6f62dfc73b67112e3be55c4a329cab6cf89895576c97de842203d72d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-05T03:58:49Z","title_canon_sha256":"6d9afb1ccbffabf8191b58d0581aedb3b022b1afdeb951a8d3df6526ab3ec992"},"schema_version":"1.0","source":{"id":"1512.01621","kind":"arxiv","version":1}},"canonical_sha256":"9b9dd6a7c2ffc041c59cb1e977213efa1426f10914aa7116e3a10c4c445d1717","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b9dd6a7c2ffc041c59cb1e977213efa1426f10914aa7116e3a10c4c445d1717","first_computed_at":"2026-05-18T01:25:10.789938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:10.789938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Tww63Om3cC+odzrwzLl5ysnqdbMg7UbplVx7CL4lSoLWS8hbHm6PTqAPSyQeAsmDYAYt4meREDxKwhZkOvbBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:10.790528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e0ed1dce861585800091b6f9e2c3ae3616e28c5012a7886e8e37a4b151c17cd","sha256:6d8f73734e61d159e2bdeaaf239bacbbf4ea618c267adce758d8d1a2ec0c0de3"],"state_sha256":"1817356fc12eb12e982924017dbe88e5d3f2b478f0e09e67e2674858c9656515"}