{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KJU3EF23RDRIQEYINP3OQN6ISW","short_pith_number":"pith:KJU3EF23","schema_version":"1.0","canonical_sha256":"5269b2175b88e28813086bf6e837c895ac91ef3f9111a712073d5547dd2b75a4","source":{"kind":"arxiv","id":"1411.6756","version":5},"attestation_state":"computed","paper":{"title":"Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk","submitted_at":"2014-11-25T08:03:19Z","abstract_excerpt":"In parameterized complexity, it is a natural idea to consider different generalizations of classic problems. Usually, such generalization are obtained by introducing a \"relaxation\" variable, where the original problem corresponds to setting this variable to a constant value. For instance, the problem of packing sets of size at most $p$ into a given universe generalizes the Maximum Matching problem, which is recovered by taking $p=2$. Most often, the complexity of the problem increases with the relaxation variable, but very recently Abasi et al. have given a surprising example of a problem --- "},"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":"1411.6756","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-25T08:03:19Z","cross_cats_sorted":[],"title_canon_sha256":"0fd80f40d3aa365632c34e0e65ef240d205f92ff37f948176d4cafe8f10338fc","abstract_canon_sha256":"9ca833076646f233d18ab29b31c04553e20271af1d11528b41a441398f9f2a15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:54.370402Z","signature_b64":"PvsrpZ7S3GqhMvHOELNqN06SZ4SHenjXM6hAdQrsBgF9g2Tb+6ZNaAelnhiPwytlcrXZ0AK9JX1mz5H7gQZsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5269b2175b88e28813086bf6e837c895ac91ef3f9111a712073d5547dd2b75a4","last_reissued_at":"2026-05-18T02:17:54.369967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:54.369967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk","submitted_at":"2014-11-25T08:03:19Z","abstract_excerpt":"In parameterized complexity, it is a natural idea to consider different generalizations of classic problems. Usually, such generalization are obtained by introducing a \"relaxation\" variable, where the original problem corresponds to setting this variable to a constant value. For instance, the problem of packing sets of size at most $p$ into a given universe generalizes the Maximum Matching problem, which is recovered by taking $p=2$. Most often, the complexity of the problem increases with the relaxation variable, but very recently Abasi et al. have given a surprising example of a problem --- "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6756","kind":"arxiv","version":5},"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":"1411.6756","created_at":"2026-05-18T02:17:54.370030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6756v5","created_at":"2026-05-18T02:17:54.370030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6756","created_at":"2026-05-18T02:17:54.370030+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJU3EF23RDRI","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJU3EF23RDRIQEYI","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJU3EF23","created_at":"2026-05-18T12:28:35.611951+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/KJU3EF23RDRIQEYINP3OQN6ISW","json":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW.json","graph_json":"https://pith.science/api/pith-number/KJU3EF23RDRIQEYINP3OQN6ISW/graph.json","events_json":"https://pith.science/api/pith-number/KJU3EF23RDRIQEYINP3OQN6ISW/events.json","paper":"https://pith.science/paper/KJU3EF23"},"agent_actions":{"view_html":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW","download_json":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW.json","view_paper":"https://pith.science/paper/KJU3EF23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6756&json=true","fetch_graph":"https://pith.science/api/pith-number/KJU3EF23RDRIQEYINP3OQN6ISW/graph.json","fetch_events":"https://pith.science/api/pith-number/KJU3EF23RDRIQEYINP3OQN6ISW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW/action/storage_attestation","attest_author":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW/action/author_attestation","sign_citation":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW/action/citation_signature","submit_replication":"https://pith.science/pith/KJU3EF23RDRIQEYINP3OQN6ISW/action/replication_record"}},"created_at":"2026-05-18T02:17:54.370030+00:00","updated_at":"2026-05-18T02:17:54.370030+00:00"}