{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LOLXVLVVO6QK4P444EKZY3IJP4","short_pith_number":"pith:LOLXVLVV","schema_version":"1.0","canonical_sha256":"5b977aaeb577a0ae3f9ce1159c6d097f1304b34cb3b254c153158ab5898ecd8d","source":{"kind":"arxiv","id":"1502.02467","version":1},"attestation_state":"computed","paper":{"title":"Structural Decompositions for Problems with Global Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Evgenij Thorstensen","submitted_at":"2015-02-09T12:55:36Z","abstract_excerpt":"A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or implicitly, by special-purpose algorithms provided by a solver.\n  Such implicitly represented constraints, known as global constraints, are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. In recent years, a variety of restrictions on the structure of CSP in"},"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":"1502.02467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-09T12:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"3e57aebb5df163043fdb12cd9ee47287936ae905695a237913873524615ce1f7","abstract_canon_sha256":"6a193226281d52a82eae9e305513f6f371e4710f0923b7601379d8cdb2215f86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.220797Z","signature_b64":"qs12AD17ra3Z0pdNg2fsewtAfTzIV7pzQD+a2tgr+1sdlMxAvuO+R3jX7AIt3+d2SU4sZEdbvBHo8q4GbESQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b977aaeb577a0ae3f9ce1159c6d097f1304b34cb3b254c153158ab5898ecd8d","last_reissued_at":"2026-05-18T02:27:42.219848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.219848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Decompositions for Problems with Global Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Evgenij Thorstensen","submitted_at":"2015-02-09T12:55:36Z","abstract_excerpt":"A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or implicitly, by special-purpose algorithms provided by a solver.\n  Such implicitly represented constraints, known as global constraints, are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. In recent years, a variety of restrictions on the structure of CSP in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02467","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":"1502.02467","created_at":"2026-05-18T02:27:42.220010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02467v1","created_at":"2026-05-18T02:27:42.220010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02467","created_at":"2026-05-18T02:27:42.220010+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOLXVLVVO6QK","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOLXVLVVO6QK4P44","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOLXVLVV","created_at":"2026-05-18T12:29:29.992203+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/LOLXVLVVO6QK4P444EKZY3IJP4","json":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4.json","graph_json":"https://pith.science/api/pith-number/LOLXVLVVO6QK4P444EKZY3IJP4/graph.json","events_json":"https://pith.science/api/pith-number/LOLXVLVVO6QK4P444EKZY3IJP4/events.json","paper":"https://pith.science/paper/LOLXVLVV"},"agent_actions":{"view_html":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4","download_json":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4.json","view_paper":"https://pith.science/paper/LOLXVLVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02467&json=true","fetch_graph":"https://pith.science/api/pith-number/LOLXVLVVO6QK4P444EKZY3IJP4/graph.json","fetch_events":"https://pith.science/api/pith-number/LOLXVLVVO6QK4P444EKZY3IJP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4/action/storage_attestation","attest_author":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4/action/author_attestation","sign_citation":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4/action/citation_signature","submit_replication":"https://pith.science/pith/LOLXVLVVO6QK4P444EKZY3IJP4/action/replication_record"}},"created_at":"2026-05-18T02:27:42.220010+00:00","updated_at":"2026-05-18T02:27:42.220010+00:00"}