{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:743JTHHFCXGZ5INO7ZEAK7L7V2","short_pith_number":"pith:743JTHHF","canonical_record":{"source":{"id":"1404.3675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-14T18:13:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"45346a7586365b3b8da4cb8cc47fda76d82fbd87fa23e0bc338ecd38d82eedf2","abstract_canon_sha256":"4004ff3697e62c97b9724b5ae8bd4391570fe05f0ee223452f20a0bd39e45763"},"schema_version":"1.0"},"canonical_sha256":"ff36999ce515cd9ea1aefe48057d7faea4a14eba51841fd12cec1042e81b4888","source":{"kind":"arxiv","id":"1404.3675","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3675","created_at":"2026-05-18T02:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3675v2","created_at":"2026-05-18T02:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3675","created_at":"2026-05-18T02:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"743JTHHFCXGZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"743JTHHFCXGZ5INO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"743JTHHF","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:743JTHHFCXGZ5INO7ZEAK7L7V2","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-14T18:13:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"45346a7586365b3b8da4cb8cc47fda76d82fbd87fa23e0bc338ecd38d82eedf2","abstract_canon_sha256":"4004ff3697e62c97b9724b5ae8bd4391570fe05f0ee223452f20a0bd39e45763"},"schema_version":"1.0"},"canonical_sha256":"ff36999ce515cd9ea1aefe48057d7faea4a14eba51841fd12cec1042e81b4888","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:38.533008Z","signature_b64":"l2aGyWvUDd5Jo0V/Ys8ampBi550nl0iTTCaUDis/IC+joYhfpqVZD6AH5e6TgBGXDYXu+FZYSUhF65VUllLrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff36999ce515cd9ea1aefe48057d7faea4a14eba51841fd12cec1042e81b4888","last_reissued_at":"2026-05-18T02:40:38.532241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:38.532241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3675","source_version":2,"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:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibJe2KndXNL0Rl/hkAoV29UbpI1pxdXQBFjN4INMFlt4JpsPx19QlAXm3og5d2JhQvq0AiBx5OsUuX7d/htaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:17:13.587360Z"},"content_sha256":"b76081ce08153f9fb514155cc0bbe411b3aa19ee33ba1bbc76dd40d8da8dcdce","schema_version":"1.0","event_id":"sha256:b76081ce08153f9fb514155cc0bbe411b3aa19ee33ba1bbc76dd40d8da8dcdce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:743JTHHFCXGZ5INO7ZEAK7L7V2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Backdoors To Tractable Constraint Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.AI","authors_text":"Clement Carbonnel, Emmanuel Hebrard, Martin C. Cooper","submitted_at":"2014-04-14T18:13:23Z","abstract_excerpt":"In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the property allows efficient solving, then a small strong backdoor provides a reasonable decomposition of the original instance into easy instances. An important challenge is the design of algorithms that can find quickly a small strong backdoor if one exists. We present a systematic study of the parameterized complexity of backdoor detection when the target property is a restricted type of constraint language defined by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3675","kind":"arxiv","version":2},"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:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REMkoE9hezJOj0lEDHGquDO1J6WirG83oANkTOu2BT32RD4wx7fw+llTZ54fVG7YYqKtSf3gVTc7saVNmncsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:17:13.588045Z"},"content_sha256":"31a7b80b86528df8c19ef3717428ce3fde84d4d51a2e67ca1d555c5a7753f57a","schema_version":"1.0","event_id":"sha256:31a7b80b86528df8c19ef3717428ce3fde84d4d51a2e67ca1d555c5a7753f57a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/743JTHHFCXGZ5INO7ZEAK7L7V2/bundle.json","state_url":"https://pith.science/pith/743JTHHFCXGZ5INO7ZEAK7L7V2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/743JTHHFCXGZ5INO7ZEAK7L7V2/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-05-28T21:17:13Z","links":{"resolver":"https://pith.science/pith/743JTHHFCXGZ5INO7ZEAK7L7V2","bundle":"https://pith.science/pith/743JTHHFCXGZ5INO7ZEAK7L7V2/bundle.json","state":"https://pith.science/pith/743JTHHFCXGZ5INO7ZEAK7L7V2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/743JTHHFCXGZ5INO7ZEAK7L7V2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:743JTHHFCXGZ5INO7ZEAK7L7V2","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":"4004ff3697e62c97b9724b5ae8bd4391570fe05f0ee223452f20a0bd39e45763","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-14T18:13:23Z","title_canon_sha256":"45346a7586365b3b8da4cb8cc47fda76d82fbd87fa23e0bc338ecd38d82eedf2"},"schema_version":"1.0","source":{"id":"1404.3675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3675","created_at":"2026-05-18T02:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3675v2","created_at":"2026-05-18T02:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3675","created_at":"2026-05-18T02:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"743JTHHFCXGZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"743JTHHFCXGZ5INO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"743JTHHF","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:31a7b80b86528df8c19ef3717428ce3fde84d4d51a2e67ca1d555c5a7753f57a","target":"graph","created_at":"2026-05-18T02:40:38Z","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 the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the property allows efficient solving, then a small strong backdoor provides a reasonable decomposition of the original instance into easy instances. An important challenge is the design of algorithms that can find quickly a small strong backdoor if one exists. We present a systematic study of the parameterized complexity of backdoor detection when the target property is a restricted type of constraint language defined by ","authors_text":"Clement Carbonnel, Emmanuel Hebrard, Martin C. Cooper","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-14T18:13:23Z","title":"On Backdoors To Tractable Constraint Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3675","kind":"arxiv","version":2},"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:b76081ce08153f9fb514155cc0bbe411b3aa19ee33ba1bbc76dd40d8da8dcdce","target":"record","created_at":"2026-05-18T02:40:38Z","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":"4004ff3697e62c97b9724b5ae8bd4391570fe05f0ee223452f20a0bd39e45763","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-14T18:13:23Z","title_canon_sha256":"45346a7586365b3b8da4cb8cc47fda76d82fbd87fa23e0bc338ecd38d82eedf2"},"schema_version":"1.0","source":{"id":"1404.3675","kind":"arxiv","version":2}},"canonical_sha256":"ff36999ce515cd9ea1aefe48057d7faea4a14eba51841fd12cec1042e81b4888","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff36999ce515cd9ea1aefe48057d7faea4a14eba51841fd12cec1042e81b4888","first_computed_at":"2026-05-18T02:40:38.532241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:38.532241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l2aGyWvUDd5Jo0V/Ys8ampBi550nl0iTTCaUDis/IC+joYhfpqVZD6AH5e6TgBGXDYXu+FZYSUhF65VUllLrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:38.533008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b76081ce08153f9fb514155cc0bbe411b3aa19ee33ba1bbc76dd40d8da8dcdce","sha256:31a7b80b86528df8c19ef3717428ce3fde84d4d51a2e67ca1d555c5a7753f57a"],"state_sha256":"e755731995605b84377f0aa307a5ed387614427804fa3648a747787d7bf7b705"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O05AoyAMeQrSiyfBetBeYEcLjMSCJRsJ2il99RFcEqt9X4Mpby2dmZf7+2rpfvBRZ9JnAPsjKeRCQMmIf236Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:17:13.591867Z","bundle_sha256":"60fa3331f8d8062ab59cab43e177f0ddd59f4b390ab812d3c201a0ea01b1f4f2"}}