{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EW73UOW5FMWG5YRFQ5L3APMOU5","short_pith_number":"pith:EW73UOW5","schema_version":"1.0","canonical_sha256":"25bfba3add2b2c6ee2258757b03d8ea77c4cc1c4a398c5694163a8b92021aba9","source":{"kind":"arxiv","id":"1504.07067","version":3},"attestation_state":"computed","paper":{"title":"Effectiveness of Structural Restrictions for Hybrid CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Michal Rolinek, Rustem Takhanov, Vladimir Kolmogorov","submitted_at":"2015-04-27T13:07:15Z","abstract_excerpt":"Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\\mbox{$\\bR \\rightarrow \\bGamma$}$ between two relational structures, e.g.\\ between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for {\\em fixed template CSPs} in which the right side $\\bGamma$ is fixed and the left side $\\bR$ is unconstrained.\n  Far fewer results are known for the {\\em hybrid} setting that restricts both sides simultaneously. It assumes that $\\bR$"},"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":"1504.07067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-27T13:07:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e9dda03552f62aa59d4ddd6ffaf29212ac45cc8cbbdcf94430a33a5f443783c1","abstract_canon_sha256":"e1879c9deb2d7d9dd92255b480782afb3a31a734a6347cd665978d0ba9e6fe64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:21.068216Z","signature_b64":"b0fxVgFueMsYVJPZIJkfghmRzja5nh7QzIK+uOycBLAFdCn/XucH38LEXuxjkiifgqhrwrh09fJzmII+abRqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25bfba3add2b2c6ee2258757b03d8ea77c4cc1c4a398c5694163a8b92021aba9","last_reissued_at":"2026-05-18T01:29:21.067474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:21.067474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effectiveness of Structural Restrictions for Hybrid CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Michal Rolinek, Rustem Takhanov, Vladimir Kolmogorov","submitted_at":"2015-04-27T13:07:15Z","abstract_excerpt":"Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\\mbox{$\\bR \\rightarrow \\bGamma$}$ between two relational structures, e.g.\\ between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for {\\em fixed template CSPs} in which the right side $\\bGamma$ is fixed and the left side $\\bR$ is unconstrained.\n  Far fewer results are known for the {\\em hybrid} setting that restricts both sides simultaneously. It assumes that $\\bR$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07067","kind":"arxiv","version":3},"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":"1504.07067","created_at":"2026-05-18T01:29:21.067608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07067v3","created_at":"2026-05-18T01:29:21.067608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07067","created_at":"2026-05-18T01:29:21.067608+00:00"},{"alias_kind":"pith_short_12","alias_value":"EW73UOW5FMWG","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EW73UOW5FMWG5YRF","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EW73UOW5","created_at":"2026-05-18T12:29:19.899920+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/EW73UOW5FMWG5YRFQ5L3APMOU5","json":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5.json","graph_json":"https://pith.science/api/pith-number/EW73UOW5FMWG5YRFQ5L3APMOU5/graph.json","events_json":"https://pith.science/api/pith-number/EW73UOW5FMWG5YRFQ5L3APMOU5/events.json","paper":"https://pith.science/paper/EW73UOW5"},"agent_actions":{"view_html":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5","download_json":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5.json","view_paper":"https://pith.science/paper/EW73UOW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07067&json=true","fetch_graph":"https://pith.science/api/pith-number/EW73UOW5FMWG5YRFQ5L3APMOU5/graph.json","fetch_events":"https://pith.science/api/pith-number/EW73UOW5FMWG5YRFQ5L3APMOU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/action/storage_attestation","attest_author":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/action/author_attestation","sign_citation":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/action/citation_signature","submit_replication":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/action/replication_record"}},"created_at":"2026-05-18T01:29:21.067608+00:00","updated_at":"2026-05-18T01:29:21.067608+00:00"}