{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YSGYBCDO3ZCP4X53EQCOZKVNL6","short_pith_number":"pith:YSGYBCDO","schema_version":"1.0","canonical_sha256":"c48d80886ede44fe5fbb2404ecaaad5fbb5bdf54095066544a719753655e17b4","source":{"kind":"arxiv","id":"1711.04506","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.04506","created_at":"2026-05-18T00:30:36.569448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04506v1","created_at":"2026-05-18T00:30:36.569448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04506","created_at":"2026-05-18T00:30:36.569448+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSGYBCDO3ZCP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSGYBCDO3ZCP4X53","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSGYBCDO","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07794","citing_title":"Density Decomposition on Hypergraphs","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6","json":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6.json","graph_json":"https://pith.science/api/pith-number/YSGYBCDO3ZCP4X53EQCOZKVNL6/graph.json","events_json":"https://pith.science/api/pith-number/YSGYBCDO3ZCP4X53EQCOZKVNL6/events.json","paper":"https://pith.science/paper/YSGYBCDO"},"agent_actions":{"view_html":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6","download_json":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6.json","view_paper":"https://pith.science/paper/YSGYBCDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04506&json=true","fetch_graph":"https://pith.science/api/pith-number/YSGYBCDO3ZCP4X53EQCOZKVNL6/graph.json","fetch_events":"https://pith.science/api/pith-number/YSGYBCDO3ZCP4X53EQCOZKVNL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/action/storage_attestation","attest_author":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/action/author_attestation","sign_citation":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/action/citation_signature","submit_replication":"https://pith.science/pith/YSGYBCDO3ZCP4X53EQCOZKVNL6/action/replication_record"}},"created_at":"2026-05-18T00:30:36.569448+00:00","updated_at":"2026-05-18T00:30:36.569448+00:00"}