{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:63LWP42LVRXMDGFTA3SLMSFLOI","short_pith_number":"pith:63LWP42L","canonical_record":{"source":{"id":"2012.01199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-02T13:33:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7f334143419eec0bcf0a75fb13b332ddbeddebbf083972e04587f6ca53137e30","abstract_canon_sha256":"5a808912b88cc87620f72cf689cd56dda1915e81db494b99d5ff47f106712e81"},"schema_version":"1.0"},"canonical_sha256":"f6d767f34bac6ec198b306e4b648ab721937ace8ce2aebb85dac71eadad60c69","source":{"kind":"arxiv","id":"2012.01199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.01199","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"arxiv_version","alias_value":"2012.01199v1","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01199","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"pith_short_12","alias_value":"63LWP42LVRXM","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"pith_short_16","alias_value":"63LWP42LVRXMDGFT","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"pith_short_8","alias_value":"63LWP42L","created_at":"2026-07-05T01:56:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:63LWP42LVRXMDGFTA3SLMSFLOI","target":"record","payload":{"canonical_record":{"source":{"id":"2012.01199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-02T13:33:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7f334143419eec0bcf0a75fb13b332ddbeddebbf083972e04587f6ca53137e30","abstract_canon_sha256":"5a808912b88cc87620f72cf689cd56dda1915e81db494b99d5ff47f106712e81"},"schema_version":"1.0"},"canonical_sha256":"f6d767f34bac6ec198b306e4b648ab721937ace8ce2aebb85dac71eadad60c69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:36.718957Z","signature_b64":"7iRNcs61gSG/J+PjfRip3+E1C9ms4jvwRe787GL2HV449Q3JogC/aqXyOjSNA+v+bUfCucMtF3V8NZMNomF7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6d767f34bac6ec198b306e4b648ab721937ace8ce2aebb85dac71eadad60c69","last_reissued_at":"2026-07-05T01:56:36.718570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:36.718570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.01199","source_version":1,"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-05T01:56:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vs/6/JS42ZjleuRxOOvbR6hd+JlarMSeLfKVHPTlLcE4/JRm1DaXlaCz3jHr0pT9pyW7zypzYuO8OInLoRQmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:33:51.157028Z"},"content_sha256":"8f5d6cf9e7b742992c4c12797c811aaad5f9ced2764110d9fca9816e52087c0f","schema_version":"1.0","event_id":"sha256:8f5d6cf9e7b742992c4c12797c811aaad5f9ced2764110d9fca9816e52087c0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:63LWP42LVRXMDGFTA3SLMSFLOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tractable Combinations of Theories via Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Johannes Greiner, Manuel Bodirsky","submitted_at":"2020-12-02T13:33:34Z","abstract_excerpt":"For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient conditions for polynomial-time tractability of the constraint satisfaction problem for the union of two theories with disjoint relational signatures. To this end, we introduce the concept of sampling for theories and show that samplings can be applied to examples which are not covered by the seminal result of Nelson and Oppen."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.01199","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.01199/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-05T01:56:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wEibWNsDugFO9akKhbr1YmltNDhgixlI7lUNb612Wqpa/WHQuB1f5HjrW3aDGzpVb0RAWZDr/VbZjK2sWniDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:33:51.157381Z"},"content_sha256":"dcc6eaf151d2e27c7681508861575be9bcffcb1a382aba49d6518e6a1674735f","schema_version":"1.0","event_id":"sha256:dcc6eaf151d2e27c7681508861575be9bcffcb1a382aba49d6518e6a1674735f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63LWP42LVRXMDGFTA3SLMSFLOI/bundle.json","state_url":"https://pith.science/pith/63LWP42LVRXMDGFTA3SLMSFLOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63LWP42LVRXMDGFTA3SLMSFLOI/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-22T06:33:51Z","links":{"resolver":"https://pith.science/pith/63LWP42LVRXMDGFTA3SLMSFLOI","bundle":"https://pith.science/pith/63LWP42LVRXMDGFTA3SLMSFLOI/bundle.json","state":"https://pith.science/pith/63LWP42LVRXMDGFTA3SLMSFLOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63LWP42LVRXMDGFTA3SLMSFLOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:63LWP42LVRXMDGFTA3SLMSFLOI","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":"5a808912b88cc87620f72cf689cd56dda1915e81db494b99d5ff47f106712e81","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-02T13:33:34Z","title_canon_sha256":"7f334143419eec0bcf0a75fb13b332ddbeddebbf083972e04587f6ca53137e30"},"schema_version":"1.0","source":{"id":"2012.01199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.01199","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"arxiv_version","alias_value":"2012.01199v1","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01199","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"pith_short_12","alias_value":"63LWP42LVRXM","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"pith_short_16","alias_value":"63LWP42LVRXMDGFT","created_at":"2026-07-05T01:56:36Z"},{"alias_kind":"pith_short_8","alias_value":"63LWP42L","created_at":"2026-07-05T01:56:36Z"}],"graph_snapshots":[{"event_id":"sha256:dcc6eaf151d2e27c7681508861575be9bcffcb1a382aba49d6518e6a1674735f","target":"graph","created_at":"2026-07-05T01:56:36Z","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.01199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient conditions for polynomial-time tractability of the constraint satisfaction problem for the union of two theories with disjoint relational signatures. To this end, we introduce the concept of sampling for theories and show that samplings can be applied to examples which are not covered by the seminal result of Nelson and Oppen.","authors_text":"Johannes Greiner, Manuel Bodirsky","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-02T13:33:34Z","title":"Tractable Combinations of Theories via Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.01199","kind":"arxiv","version":1},"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:8f5d6cf9e7b742992c4c12797c811aaad5f9ced2764110d9fca9816e52087c0f","target":"record","created_at":"2026-07-05T01:56:36Z","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":"5a808912b88cc87620f72cf689cd56dda1915e81db494b99d5ff47f106712e81","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2020-12-02T13:33:34Z","title_canon_sha256":"7f334143419eec0bcf0a75fb13b332ddbeddebbf083972e04587f6ca53137e30"},"schema_version":"1.0","source":{"id":"2012.01199","kind":"arxiv","version":1}},"canonical_sha256":"f6d767f34bac6ec198b306e4b648ab721937ace8ce2aebb85dac71eadad60c69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6d767f34bac6ec198b306e4b648ab721937ace8ce2aebb85dac71eadad60c69","first_computed_at":"2026-07-05T01:56:36.718570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:56:36.718570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7iRNcs61gSG/J+PjfRip3+E1C9ms4jvwRe787GL2HV449Q3JogC/aqXyOjSNA+v+bUfCucMtF3V8NZMNomF7Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:56:36.718957Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.01199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f5d6cf9e7b742992c4c12797c811aaad5f9ced2764110d9fca9816e52087c0f","sha256:dcc6eaf151d2e27c7681508861575be9bcffcb1a382aba49d6518e6a1674735f"],"state_sha256":"7f4d55d26a3b7dd2ee90dd590a317eb2548d954405bb6570b28e72b2bc2d8fd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6nMMXPL1x7Jli7dV7I74OFxIav90tuRsrdI19z9jWhctQLuCZ3zn3ngFBtFxx1U+ui9cl1lHAyy7u1i2Mfr0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T06:33:51.160540Z","bundle_sha256":"81c9b881a5a0e712b4283efb48f42c00158d4ae08de63a650b26c68cf8c0016c"}}