{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F3IIQ3JJBASSAMKFILGW67XZIN","short_pith_number":"pith:F3IIQ3JJ","schema_version":"1.0","canonical_sha256":"2ed0886d29082520314542cd6f7ef94352a7fa24a426946a9b86473b004805ee","source":{"kind":"arxiv","id":"1401.5341","version":1},"attestation_state":"computed","paper":{"title":"Domain Views for Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Laurent Michel, Pascal Van Hentenryck","submitted_at":"2014-01-21T15:22:29Z","abstract_excerpt":"Views are a standard abstraction in constraint programming: They make it possible to implement a single version of each constraint, while avoiding to create new variables and constraints that would slow down propagation. Traditional constraint-programming systems provide the concept of {\\em variable views} which implement a view of the type $y = f(x)$ by delegating all (domain and constraint) operations on variable $y$ to variable $x$. This paper proposes the alternative concept of {\\em domain views} which only delegate domain operations. Domain views preserve the benefits of variable views bu"},"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":"1401.5341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-21T15:22:29Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"8a301848852d82736cb6425d540b96cbe6acc95a83ca216928c90c549c7c9179","abstract_canon_sha256":"e9be3f12f212fd5415fa2e4f723033f429e2765a5f261f5e6a7a7ef0da973b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.097273Z","signature_b64":"HxFs0jg/8qNqRl7uNoSZWNEg4Ogb9mV7m1x5DZkql4JFcADPc+0fNyyfpQY92bYeppWpPy+AdJs9yfZthAuECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed0886d29082520314542cd6f7ef94352a7fa24a426946a9b86473b004805ee","last_reissued_at":"2026-05-18T03:01:34.096599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.096599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domain Views for Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Laurent Michel, Pascal Van Hentenryck","submitted_at":"2014-01-21T15:22:29Z","abstract_excerpt":"Views are a standard abstraction in constraint programming: They make it possible to implement a single version of each constraint, while avoiding to create new variables and constraints that would slow down propagation. Traditional constraint-programming systems provide the concept of {\\em variable views} which implement a view of the type $y = f(x)$ by delegating all (domain and constraint) operations on variable $y$ to variable $x$. This paper proposes the alternative concept of {\\em domain views} which only delegate domain operations. Domain views preserve the benefits of variable views bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5341","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":"1401.5341","created_at":"2026-05-18T03:01:34.096689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5341v1","created_at":"2026-05-18T03:01:34.096689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5341","created_at":"2026-05-18T03:01:34.096689+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3IIQ3JJBASS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3IIQ3JJBASSAMKF","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3IIQ3JJ","created_at":"2026-05-18T12:28:28.263976+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/F3IIQ3JJBASSAMKFILGW67XZIN","json":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN.json","graph_json":"https://pith.science/api/pith-number/F3IIQ3JJBASSAMKFILGW67XZIN/graph.json","events_json":"https://pith.science/api/pith-number/F3IIQ3JJBASSAMKFILGW67XZIN/events.json","paper":"https://pith.science/paper/F3IIQ3JJ"},"agent_actions":{"view_html":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN","download_json":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN.json","view_paper":"https://pith.science/paper/F3IIQ3JJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5341&json=true","fetch_graph":"https://pith.science/api/pith-number/F3IIQ3JJBASSAMKFILGW67XZIN/graph.json","fetch_events":"https://pith.science/api/pith-number/F3IIQ3JJBASSAMKFILGW67XZIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN/action/storage_attestation","attest_author":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN/action/author_attestation","sign_citation":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN/action/citation_signature","submit_replication":"https://pith.science/pith/F3IIQ3JJBASSAMKFILGW67XZIN/action/replication_record"}},"created_at":"2026-05-18T03:01:34.096689+00:00","updated_at":"2026-05-18T03:01:34.096689+00:00"}