{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EW73UOW5FMWG5YRFQ5L3APMOU5","short_pith_number":"pith:EW73UOW5","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"},"canonical_sha256":"25bfba3add2b2c6ee2258757b03d8ea77c4cc1c4a398c5694163a8b92021aba9","source":{"kind":"arxiv","id":"1504.07067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07067","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07067v3","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07067","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"EW73UOW5FMWG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EW73UOW5FMWG5YRF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EW73UOW5","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EW73UOW5FMWG5YRFQ5L3APMOU5","target":"record","payload":{"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"},"canonical_sha256":"25bfba3add2b2c6ee2258757b03d8ea77c4cc1c4a398c5694163a8b92021aba9","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"},"source_kind":"arxiv","source_id":"1504.07067","source_version":3,"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-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Frr0DZy+VBUT1LWGCoryRLAm6UWTyGCzFYcOFWHAiTyyZBzAvpPzROsoBp/D9wbZ8nHQzdi44BWyC2kglnI0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:36:59.291250Z"},"content_sha256":"c449f619553f783267d9d4dd508967cb4c3660a4f0a203392bc5acb471902c6e","schema_version":"1.0","event_id":"sha256:c449f619553f783267d9d4dd508967cb4c3660a4f0a203392bc5acb471902c6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EW73UOW5FMWG5YRFQ5L3APMOU5","target":"graph","payload":{"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"},"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-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4CbfjX6dtUB1JSia2zqRXudPAoeZQNZuF69Fk3HrxFKd1K91EAKOe0xkSWE1wAzOJnkySUp+gtgn9h100kdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:36:59.291602Z"},"content_sha256":"e4aff1277657dbd133037247b8f65186ce6ded3e2d851f76e761494ae19f72cc","schema_version":"1.0","event_id":"sha256:e4aff1277657dbd133037247b8f65186ce6ded3e2d851f76e761494ae19f72cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/bundle.json","state_url":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/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-28T04:36:59Z","links":{"resolver":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5","bundle":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/bundle.json","state":"https://pith.science/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EW73UOW5FMWG5YRFQ5L3APMOU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EW73UOW5FMWG5YRFQ5L3APMOU5","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":"e1879c9deb2d7d9dd92255b480782afb3a31a734a6347cd665978d0ba9e6fe64","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-27T13:07:15Z","title_canon_sha256":"e9dda03552f62aa59d4ddd6ffaf29212ac45cc8cbbdcf94430a33a5f443783c1"},"schema_version":"1.0","source":{"id":"1504.07067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07067","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07067v3","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07067","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"EW73UOW5FMWG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EW73UOW5FMWG5YRF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EW73UOW5","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:e4aff1277657dbd133037247b8f65186ce6ded3e2d851f76e761494ae19f72cc","target":"graph","created_at":"2026-05-18T01:29:21Z","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":"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$","authors_text":"Michal Rolinek, Rustem Takhanov, Vladimir Kolmogorov","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-27T13:07:15Z","title":"Effectiveness of Structural Restrictions for Hybrid CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07067","kind":"arxiv","version":3},"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:c449f619553f783267d9d4dd508967cb4c3660a4f0a203392bc5acb471902c6e","target":"record","created_at":"2026-05-18T01:29:21Z","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":"e1879c9deb2d7d9dd92255b480782afb3a31a734a6347cd665978d0ba9e6fe64","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-27T13:07:15Z","title_canon_sha256":"e9dda03552f62aa59d4ddd6ffaf29212ac45cc8cbbdcf94430a33a5f443783c1"},"schema_version":"1.0","source":{"id":"1504.07067","kind":"arxiv","version":3}},"canonical_sha256":"25bfba3add2b2c6ee2258757b03d8ea77c4cc1c4a398c5694163a8b92021aba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25bfba3add2b2c6ee2258757b03d8ea77c4cc1c4a398c5694163a8b92021aba9","first_computed_at":"2026-05-18T01:29:21.067474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:21.067474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b0fxVgFueMsYVJPZIJkfghmRzja5nh7QzIK+uOycBLAFdCn/XucH38LEXuxjkiifgqhrwrh09fJzmII+abRqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:21.068216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c449f619553f783267d9d4dd508967cb4c3660a4f0a203392bc5acb471902c6e","sha256:e4aff1277657dbd133037247b8f65186ce6ded3e2d851f76e761494ae19f72cc"],"state_sha256":"f03d08367b12a7bc545bf6c9ead2d06db113696031288160c1146c8079f411f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxEuMxRf9gx/Qfx0xGYsBntEdRaTojjUllR3eWJvQNL+uEYWhfIEGqO/2F32KJqQ5yKIbsSPDubGA/7SZp3QAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T04:36:59.293458Z","bundle_sha256":"600f11587ee47972d83ab20f61719ce2ca0244bff3f120c716284454026399c5"}}