{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HPHNYYUT323YMMXJ7PVVOC4NK5","short_pith_number":"pith:HPHNYYUT","schema_version":"1.0","canonical_sha256":"3bcedc6293deb78632e9fbeb570b8d576ed75a378422e71ebe001e7a490cadd3","source":{"kind":"arxiv","id":"1612.05733","version":1},"attestation_state":"computed","paper":{"title":"Backdoors to Tractable Valued CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"M. S. Ramanujan, Robert Ganian, Stefan Szeider","submitted_at":"2016-12-17T11:33:37Z","abstract_excerpt":"We extend the notion of a strong backdoor from the CSP setting to the Valued CSP setting (VCSP, for short). This provides a means for augmenting a class of tractable VCSP instances to instances that are outside the class but of small distance to the class, where the distance is measured in terms of the size of a smallest backdoor. We establish that VCSP is fixed-parameter tractable when parameterized by the size of a smallest backdoor into every tractable class of VCSP instances characterized by a (possibly infinite) tractable valued constraint language of finite arity and finite domain. We fu"},"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":"1612.05733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-17T11:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"5fe11b8cf15530e404c6d3f75cc0e0f50cbb9baab44b5102168f33527fdb2db6","abstract_canon_sha256":"d9910583a9a908f91ca86f2a08ec60a6f33b9327f4c5c42bd89de0b470e384d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:46.831922Z","signature_b64":"wrryIUzbdC5OgVY2eL38H3j0RBwKiIDcOr2q7gdND3waSs3vCxn4+Xi9v4Xgh7YfBHZMV5drETfAfeWaII8qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bcedc6293deb78632e9fbeb570b8d576ed75a378422e71ebe001e7a490cadd3","last_reissued_at":"2026-05-18T00:54:46.831443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:46.831443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backdoors to Tractable Valued CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"M. S. Ramanujan, Robert Ganian, Stefan Szeider","submitted_at":"2016-12-17T11:33:37Z","abstract_excerpt":"We extend the notion of a strong backdoor from the CSP setting to the Valued CSP setting (VCSP, for short). This provides a means for augmenting a class of tractable VCSP instances to instances that are outside the class but of small distance to the class, where the distance is measured in terms of the size of a smallest backdoor. We establish that VCSP is fixed-parameter tractable when parameterized by the size of a smallest backdoor into every tractable class of VCSP instances characterized by a (possibly infinite) tractable valued constraint language of finite arity and finite domain. We fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05733","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":"1612.05733","created_at":"2026-05-18T00:54:46.831515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05733v1","created_at":"2026-05-18T00:54:46.831515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05733","created_at":"2026-05-18T00:54:46.831515+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPHNYYUT323Y","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPHNYYUT323YMMXJ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPHNYYUT","created_at":"2026-05-18T12:30:19.053100+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/HPHNYYUT323YMMXJ7PVVOC4NK5","json":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5.json","graph_json":"https://pith.science/api/pith-number/HPHNYYUT323YMMXJ7PVVOC4NK5/graph.json","events_json":"https://pith.science/api/pith-number/HPHNYYUT323YMMXJ7PVVOC4NK5/events.json","paper":"https://pith.science/paper/HPHNYYUT"},"agent_actions":{"view_html":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5","download_json":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5.json","view_paper":"https://pith.science/paper/HPHNYYUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05733&json=true","fetch_graph":"https://pith.science/api/pith-number/HPHNYYUT323YMMXJ7PVVOC4NK5/graph.json","fetch_events":"https://pith.science/api/pith-number/HPHNYYUT323YMMXJ7PVVOC4NK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5/action/storage_attestation","attest_author":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5/action/author_attestation","sign_citation":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5/action/citation_signature","submit_replication":"https://pith.science/pith/HPHNYYUT323YMMXJ7PVVOC4NK5/action/replication_record"}},"created_at":"2026-05-18T00:54:46.831515+00:00","updated_at":"2026-05-18T00:54:46.831515+00:00"}