{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TOO5NJ6C77AEDRM4WHUXOIJ67I","short_pith_number":"pith:TOO5NJ6C","schema_version":"1.0","canonical_sha256":"9b9dd6a7c2ffc041c59cb1e977213efa1426f10914aa7116e3a10c4c445d1717","source":{"kind":"arxiv","id":"1512.01621","version":1},"attestation_state":"computed","paper":{"title":"Exact Algorithms via Monotone Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Saket Saurabh, Serge Gaspers","submitted_at":"2015-12-05T03:58:49Z","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 "},"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":"1512.01621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-05T03:58:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6d9afb1ccbffabf8191b58d0581aedb3b022b1afdeb951a8d3df6526ab3ec992","abstract_canon_sha256":"bc81766c6f62dfc73b67112e3be55c4a329cab6cf89895576c97de842203d72d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.790528Z","signature_b64":"3Tww63Om3cC+odzrwzLl5ysnqdbMg7UbplVx7CL4lSoLWS8hbHm6PTqAPSyQeAsmDYAYt4meREDxKwhZkOvbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b9dd6a7c2ffc041c59cb1e977213efa1426f10914aa7116e3a10c4c445d1717","last_reissued_at":"2026-05-18T01:25:10.789938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.789938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Algorithms via Monotone Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Saket Saurabh, Serge Gaspers","submitted_at":"2015-12-05T03:58:49Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01621","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.01621","created_at":"2026-05-18T01:25:10.790029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01621v1","created_at":"2026-05-18T01:25:10.790029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01621","created_at":"2026-05-18T01:25:10.790029+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOO5NJ6C77AE","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOO5NJ6C77AEDRM4","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOO5NJ6C","created_at":"2026-05-18T12:29:42.218222+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/TOO5NJ6C77AEDRM4WHUXOIJ67I","json":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I.json","graph_json":"https://pith.science/api/pith-number/TOO5NJ6C77AEDRM4WHUXOIJ67I/graph.json","events_json":"https://pith.science/api/pith-number/TOO5NJ6C77AEDRM4WHUXOIJ67I/events.json","paper":"https://pith.science/paper/TOO5NJ6C"},"agent_actions":{"view_html":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I","download_json":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I.json","view_paper":"https://pith.science/paper/TOO5NJ6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01621&json=true","fetch_graph":"https://pith.science/api/pith-number/TOO5NJ6C77AEDRM4WHUXOIJ67I/graph.json","fetch_events":"https://pith.science/api/pith-number/TOO5NJ6C77AEDRM4WHUXOIJ67I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I/action/storage_attestation","attest_author":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I/action/author_attestation","sign_citation":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I/action/citation_signature","submit_replication":"https://pith.science/pith/TOO5NJ6C77AEDRM4WHUXOIJ67I/action/replication_record"}},"created_at":"2026-05-18T01:25:10.790029+00:00","updated_at":"2026-05-18T01:25:10.790029+00:00"}