{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FXPSCEJPH6FO3D4NIJI6REE4MD","short_pith_number":"pith:FXPSCEJP","schema_version":"1.0","canonical_sha256":"2ddf21112f3f8aed8f8d4251e8909c60cacb23eb85762e89b2a0856184c781f4","source":{"kind":"arxiv","id":"1307.2867","version":1},"attestation_state":"computed","paper":{"title":"Tractable Combinations of Global Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"David A. Cohen, Evgenij Thorstensen, Peter G. Jeavons, Stanislav \\v{Z}ivn\\'y","submitted_at":"2013-07-10T18:01:30Z","abstract_excerpt":"We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems.\n  Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structura"},"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":"1307.2867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-10T18:01:30Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"7728d7f0b074a40e968af45c2a0e96bd870a13980887b14f17f90008803b9379","abstract_canon_sha256":"f9cbb58f58e766ac5c4dd711d95baac438f3a63d24198d267ad03c563d4463ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:50.192906Z","signature_b64":"u6JVtPHnbVBk3pzy/QaWaXuUQqwrOf4Zk7xKZjGzM3AVUspC5NhQKrhiJcqKD5KJXpsDRcNAHLej6l3/B0SYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ddf21112f3f8aed8f8d4251e8909c60cacb23eb85762e89b2a0856184c781f4","last_reissued_at":"2026-05-18T03:18:50.192343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:50.192343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractable Combinations of Global Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"David A. Cohen, Evgenij Thorstensen, Peter G. Jeavons, Stanislav \\v{Z}ivn\\'y","submitted_at":"2013-07-10T18:01:30Z","abstract_excerpt":"We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems.\n  Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structura"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2867","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":""},"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":"1307.2867","created_at":"2026-05-18T03:18:50.192411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2867v1","created_at":"2026-05-18T03:18:50.192411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2867","created_at":"2026-05-18T03:18:50.192411+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXPSCEJPH6FO","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXPSCEJPH6FO3D4N","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXPSCEJP","created_at":"2026-05-18T12:27:45.050594+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/FXPSCEJPH6FO3D4NIJI6REE4MD","json":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD.json","graph_json":"https://pith.science/api/pith-number/FXPSCEJPH6FO3D4NIJI6REE4MD/graph.json","events_json":"https://pith.science/api/pith-number/FXPSCEJPH6FO3D4NIJI6REE4MD/events.json","paper":"https://pith.science/paper/FXPSCEJP"},"agent_actions":{"view_html":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD","download_json":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD.json","view_paper":"https://pith.science/paper/FXPSCEJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2867&json=true","fetch_graph":"https://pith.science/api/pith-number/FXPSCEJPH6FO3D4NIJI6REE4MD/graph.json","fetch_events":"https://pith.science/api/pith-number/FXPSCEJPH6FO3D4NIJI6REE4MD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD/action/storage_attestation","attest_author":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD/action/author_attestation","sign_citation":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD/action/citation_signature","submit_replication":"https://pith.science/pith/FXPSCEJPH6FO3D4NIJI6REE4MD/action/replication_record"}},"created_at":"2026-05-18T03:18:50.192411+00:00","updated_at":"2026-05-18T03:18:50.192411+00:00"}