{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WGT7J3OWXMFAYQXG3JVU2HYEP7","short_pith_number":"pith:WGT7J3OW","schema_version":"1.0","canonical_sha256":"b1a7f4edd6bb0a0c42e6da6b4d1f047fc641414e0261969cfa3e7129c026b22e","source":{"kind":"arxiv","id":"2012.05682","version":6},"attestation_state":"computed","paper":{"title":"Tractable Combinations of Temporal CSPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"math.LO","authors_text":"Jakub Rydval, Johannes Greiner, Manuel Bodirsky","submitted_at":"2020-12-10T14:08:34Z","abstract_excerpt":"The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1 \\cup T_2)$ where $T_1$ and $T_2$ are theories with disjoint finite relational signatures. We prove that if $T_1$ and $T_2$ are the theories of temporal structures, i.e., structures where all relations have a first-order definition in $(Q;<)$, then CSP$(T_1 \\cup T_2)$ is in P or NP-complete. To this end we prove a purely algebraic statement about the structu"},"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":"2012.05682","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-10T14:08:34Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"42f3bbda255d0762b99a86281f4bfffdf73213d79564e37e27f6642a19c1974e","abstract_canon_sha256":"68dc12805538386ecb43a027eb957a7159cb56d1d49fe38f16d93a881337d712"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:31.749623Z","signature_b64":"SonsKXO4WU+dWclTIcMk2+udV6crVcJhEc2rZUBXNaiNUD2DEElGm0F9+yHjRZBGfmaizx/FcC7PG21rtQxDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1a7f4edd6bb0a0c42e6da6b4d1f047fc641414e0261969cfa3e7129c026b22e","last_reissued_at":"2026-07-05T06:23:31.749207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:31.749207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractable Combinations of Temporal CSPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"math.LO","authors_text":"Jakub Rydval, Johannes Greiner, Manuel Bodirsky","submitted_at":"2020-12-10T14:08:34Z","abstract_excerpt":"The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1 \\cup T_2)$ where $T_1$ and $T_2$ are theories with disjoint finite relational signatures. We prove that if $T_1$ and $T_2$ are the theories of temporal structures, i.e., structures where all relations have a first-order definition in $(Q;<)$, then CSP$(T_1 \\cup T_2)$ is in P or NP-complete. To this end we prove a purely algebraic statement about the structu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.05682","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.05682/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2012.05682","created_at":"2026-07-05T06:23:31.749272+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.05682v6","created_at":"2026-07-05T06:23:31.749272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.05682","created_at":"2026-07-05T06:23:31.749272+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGT7J3OWXMFA","created_at":"2026-07-05T06:23:31.749272+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGT7J3OWXMFAYQXG","created_at":"2026-07-05T06:23:31.749272+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGT7J3OW","created_at":"2026-07-05T06:23:31.749272+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/WGT7J3OWXMFAYQXG3JVU2HYEP7","json":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7.json","graph_json":"https://pith.science/api/pith-number/WGT7J3OWXMFAYQXG3JVU2HYEP7/graph.json","events_json":"https://pith.science/api/pith-number/WGT7J3OWXMFAYQXG3JVU2HYEP7/events.json","paper":"https://pith.science/paper/WGT7J3OW"},"agent_actions":{"view_html":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7","download_json":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7.json","view_paper":"https://pith.science/paper/WGT7J3OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.05682&json=true","fetch_graph":"https://pith.science/api/pith-number/WGT7J3OWXMFAYQXG3JVU2HYEP7/graph.json","fetch_events":"https://pith.science/api/pith-number/WGT7J3OWXMFAYQXG3JVU2HYEP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/action/storage_attestation","attest_author":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/action/author_attestation","sign_citation":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/action/citation_signature","submit_replication":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/action/replication_record"}},"created_at":"2026-07-05T06:23:31.749272+00:00","updated_at":"2026-07-05T06:23:31.749272+00:00"}