{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YSGYBCDO3ZCP4X53EQCOZKVNL6","short_pith_number":"pith:YSGYBCDO","canonical_record":{"source":{"id":"1711.04506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T10:37:36Z","cross_cats_sorted":[],"title_canon_sha256":"f2b24df67666880fdb04e6360d2b4e3c9f15edb12b4d2a7235a14ae368cc9aa1","abstract_canon_sha256":"25ee2fa4a90f96889559a7aac1ee9d12f10f96b13cd36d15fb8a5a822fe54dc8"},"schema_version":"1.0"},"canonical_sha256":"c48d80886ede44fe5fbb2404ecaaad5fbb5bdf54095066544a719753655e17b4","source":{"kind":"arxiv","id":"1711.04506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04506","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04506v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04506","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"YSGYBCDO3ZCP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YSGYBCDO3ZCP4X53","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YSGYBCDO","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YSGYBCDO3ZCP4X53EQCOZKVNL6","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T10:37:36Z","cross_cats_sorted":[],"title_canon_sha256":"f2b24df67666880fdb04e6360d2b4e3c9f15edb12b4d2a7235a14ae368cc9aa1","abstract_canon_sha256":"25ee2fa4a90f96889559a7aac1ee9d12f10f96b13cd36d15fb8a5a822fe54dc8"},"schema_version":"1.0"},"canonical_sha256":"c48d80886ede44fe5fbb2404ecaaad5fbb5bdf54095066544a719753655e17b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:36.570256Z","signature_b64":"ngzGLj57bs7Kn1gN4uU4Koq6wUObIqd3K9HQxk+xoLuPleYQGvP5u0A/Pwfv2+jdX0K9K0G/vEmrKrZieiwRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c48d80886ede44fe5fbb2404ecaaad5fbb5bdf54095066544a719753655e17b4","last_reissued_at":"2026-05-18T00:30:36.569242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:36.569242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04506","source_version":1,"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-18T00:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkmnSKVlLRvAp8r2vCqB4MUoxUmmQq73zMdlLzcyCVVK9mxmXhx1B4WDTHTGwh/AAc/xrUUIKyjYi6m7k1iXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:33:46.538136Z"},"content_sha256":"4fa95ba0ecf383293bc2b510e34e0af6a9a53c32181808828ff7bbdb8188d219","schema_version":"1.0","event_id":"sha256:4fa95ba0ecf383293bc2b510e34e0af6a9a53c32181808828ff7bbdb8188d219"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YSGYBCDO3ZCP4X53EQCOZKVNL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint Solving via Fractional Edge Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Martin Grohe","submitted_at":"2017-11-13T10:37:36Z","abstract_excerpt":"Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this paper, we are interested in structural properties that can make the problem tractable. So far, the largest structural class that is known to be polynomial-time solvable is the class of bounded hypertree width instances introduced by Gottlob et al. Here we identify a new class of polynomial-time solvable instances: those having bounded fractional edge cover number.\n  Combining hyp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04506","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"},"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-18T00:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zkI+WKysKkxJ8a0uvlAV+4QM8lJvmg2CS+TQx3Sh2r9ZhqZjuAKNf7QwTLl2g69AN0JsJfBTTPdtDcceOo+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:33:46.538780Z"},"content_sha256":"9812b719ed879b2d26b4a9d17ea5801ae67191b9ad7151155a09bdb367c3e11f","schema_version":"1.0","event_id":"sha256:9812b719ed879b2d26b4a9d17ea5801ae67191b9ad7151155a09bdb367c3e11f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/bundle.json","state_url":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/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-06-05T18:33:46Z","links":{"resolver":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6","bundle":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/bundle.json","state":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YSGYBCDO3ZCP4X53EQCOZKVNL6","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":"25ee2fa4a90f96889559a7aac1ee9d12f10f96b13cd36d15fb8a5a822fe54dc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T10:37:36Z","title_canon_sha256":"f2b24df67666880fdb04e6360d2b4e3c9f15edb12b4d2a7235a14ae368cc9aa1"},"schema_version":"1.0","source":{"id":"1711.04506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04506","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04506v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04506","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"YSGYBCDO3ZCP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YSGYBCDO3ZCP4X53","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YSGYBCDO","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:9812b719ed879b2d26b4a9d17ea5801ae67191b9ad7151155a09bdb367c3e11f","target":"graph","created_at":"2026-05-18T00:30:36Z","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":"Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this paper, we are interested in structural properties that can make the problem tractable. So far, the largest structural class that is known to be polynomial-time solvable is the class of bounded hypertree width instances introduced by Gottlob et al. Here we identify a new class of polynomial-time solvable instances: those having bounded fractional edge cover number.\n  Combining hyp","authors_text":"D\\'aniel Marx, Martin Grohe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T10:37:36Z","title":"Constraint Solving via Fractional Edge Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04506","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:4fa95ba0ecf383293bc2b510e34e0af6a9a53c32181808828ff7bbdb8188d219","target":"record","created_at":"2026-05-18T00:30:36Z","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":"25ee2fa4a90f96889559a7aac1ee9d12f10f96b13cd36d15fb8a5a822fe54dc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T10:37:36Z","title_canon_sha256":"f2b24df67666880fdb04e6360d2b4e3c9f15edb12b4d2a7235a14ae368cc9aa1"},"schema_version":"1.0","source":{"id":"1711.04506","kind":"arxiv","version":1}},"canonical_sha256":"c48d80886ede44fe5fbb2404ecaaad5fbb5bdf54095066544a719753655e17b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c48d80886ede44fe5fbb2404ecaaad5fbb5bdf54095066544a719753655e17b4","first_computed_at":"2026-05-18T00:30:36.569242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:36.569242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ngzGLj57bs7Kn1gN4uU4Koq6wUObIqd3K9HQxk+xoLuPleYQGvP5u0A/Pwfv2+jdX0K9K0G/vEmrKrZieiwRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:36.570256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fa95ba0ecf383293bc2b510e34e0af6a9a53c32181808828ff7bbdb8188d219","sha256:9812b719ed879b2d26b4a9d17ea5801ae67191b9ad7151155a09bdb367c3e11f"],"state_sha256":"e743c777c8023b91316f827161b3df60fd3327406cddcc9c867e21057d22ea56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ql5N+RvySrBSJvF3pc29GmKqrVdo0ZpdXbnR7D/tFZGiLlT5VlPhNpDo5D+Fbc6wtmUhIDs8qQh8Ovmra7nHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:33:46.542350Z","bundle_sha256":"d6c8c7552efc5c0febac3de100f7839ea7a157494e78082ad0d894c1f2d1fcba"}}