{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WGT7J3OWXMFAYQXG3JVU2HYEP7","short_pith_number":"pith:WGT7J3OW","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"},"canonical_sha256":"b1a7f4edd6bb0a0c42e6da6b4d1f047fc641414e0261969cfa3e7129c026b22e","source":{"kind":"arxiv","id":"2012.05682","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.05682","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2012.05682v6","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.05682","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"WGT7J3OWXMFA","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"WGT7J3OWXMFAYQXG","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"WGT7J3OW","created_at":"2026-07-05T06:23:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WGT7J3OWXMFAYQXG3JVU2HYEP7","target":"record","payload":{"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"},"canonical_sha256":"b1a7f4edd6bb0a0c42e6da6b4d1f047fc641414e0261969cfa3e7129c026b22e","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"},"source_kind":"arxiv","source_id":"2012.05682","source_version":6,"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-07-05T06:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s068E3wYide7t6q5s8WAby3W5Wjew5MSwmNoziqA8IyIjQROsgSrs/kdvVRoKAdJH8L3082hbaVAWcTQU/MZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:25:09.549246Z"},"content_sha256":"400c8df1b0830f5895236fbbbc847f95ee7554e848e1ffe2b464e7f9a50ace3b","schema_version":"1.0","event_id":"sha256:400c8df1b0830f5895236fbbbc847f95ee7554e848e1ffe2b464e7f9a50ace3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WGT7J3OWXMFAYQXG3JVU2HYEP7","target":"graph","payload":{"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"},"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-07-05T06:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFgwaDL3GqZzoBJuThTrtDhUUhDZJdAsgoMMnePQBd6xrJYPtf+LvQyfSsz2tPlR4egMQ1JKMCmWOhde8sPgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:25:09.549752Z"},"content_sha256":"04025a6cfa8fe30f38f976cd7f50d6e8f4c65df4a4621794e4e722145194b652","schema_version":"1.0","event_id":"sha256:04025a6cfa8fe30f38f976cd7f50d6e8f4c65df4a4621794e4e722145194b652"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/bundle.json","state_url":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/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-08-22T13:25:09Z","links":{"resolver":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7","bundle":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/bundle.json","state":"https://pith.science/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGT7J3OWXMFAYQXG3JVU2HYEP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WGT7J3OWXMFAYQXG3JVU2HYEP7","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":"68dc12805538386ecb43a027eb957a7159cb56d1d49fe38f16d93a881337d712","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-10T14:08:34Z","title_canon_sha256":"42f3bbda255d0762b99a86281f4bfffdf73213d79564e37e27f6642a19c1974e"},"schema_version":"1.0","source":{"id":"2012.05682","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.05682","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"2012.05682v6","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.05682","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"WGT7J3OWXMFA","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_16","alias_value":"WGT7J3OWXMFAYQXG","created_at":"2026-07-05T06:23:31Z"},{"alias_kind":"pith_short_8","alias_value":"WGT7J3OW","created_at":"2026-07-05T06:23:31Z"}],"graph_snapshots":[{"event_id":"sha256:04025a6cfa8fe30f38f976cd7f50d6e8f4c65df4a4621794e4e722145194b652","target":"graph","created_at":"2026-07-05T06:23:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.05682/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jakub Rydval, Johannes Greiner, Manuel Bodirsky","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-10T14:08:34Z","title":"Tractable Combinations of Temporal CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.05682","kind":"arxiv","version":6},"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:400c8df1b0830f5895236fbbbc847f95ee7554e848e1ffe2b464e7f9a50ace3b","target":"record","created_at":"2026-07-05T06:23:31Z","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":"68dc12805538386ecb43a027eb957a7159cb56d1d49fe38f16d93a881337d712","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-10T14:08:34Z","title_canon_sha256":"42f3bbda255d0762b99a86281f4bfffdf73213d79564e37e27f6642a19c1974e"},"schema_version":"1.0","source":{"id":"2012.05682","kind":"arxiv","version":6}},"canonical_sha256":"b1a7f4edd6bb0a0c42e6da6b4d1f047fc641414e0261969cfa3e7129c026b22e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1a7f4edd6bb0a0c42e6da6b4d1f047fc641414e0261969cfa3e7129c026b22e","first_computed_at":"2026-07-05T06:23:31.749207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:31.749207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SonsKXO4WU+dWclTIcMk2+udV6crVcJhEc2rZUBXNaiNUD2DEElGm0F9+yHjRZBGfmaizx/FcC7PG21rtQxDAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:31.749623Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.05682","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:400c8df1b0830f5895236fbbbc847f95ee7554e848e1ffe2b464e7f9a50ace3b","sha256:04025a6cfa8fe30f38f976cd7f50d6e8f4c65df4a4621794e4e722145194b652"],"state_sha256":"e3ce0312dd84af4dccbf7b74e2a052c1f2a01863a856cabdfafcd6be21becb4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+6G6ZtukS9ccoE1zGnGajubx+EHnJYD2WGApbUCFRYuOmWON/sxt0VnT3gF0aueFA/64ptJMd3Wys8zzKEGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:25:09.554491Z","bundle_sha256":"4c539316757858ef7aac91ff73a60d2ef9bf3b2092e831fd66d440bce0060471"}}