{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J33NKP6UTJEKY2ZG7PEOZHM2AM","short_pith_number":"pith:J33NKP6U","schema_version":"1.0","canonical_sha256":"4ef6d53fd49a48ac6b26fbc8ec9d9a032123b9b8b6f0407f23fa7630f6ad098a","source":{"kind":"arxiv","id":"1110.4719","version":1},"attestation_state":"computed","paper":{"title":"A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nicolas Beldiceanu, Thierry Petit, Xavier Lorca","submitted_at":"2011-10-21T07:49:48Z","abstract_excerpt":"This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving general- ized arc-consistency according to some properties. SEQ BIN can be used for encoding counting con- straints such as CHANGE, SMOOTH or INCREAS- ING NVALUE. For some of these constraints and some of their variants GAC can be enforced with a time and space complexity linear in the sum of domain sizes, which improves or equals the best known results of the literature."},"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":"1110.4719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-21T07:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"8b661fa64902b5d7fc880501f216c04b54c5bb0995660253ae25bbf04240c1b7","abstract_canon_sha256":"c0f8eaab135174681267e2f0ceb344967f64f242fa2cba827fa6b48a2605bae9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:35.203532Z","signature_b64":"BDiNt9oI251xZkiR6ZEJToByr+cYUwQ5nIfz5cQyBmARetiTXR4EvpEupp47z7D4M3v59AX5nTBDHahoniJMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef6d53fd49a48ac6b26fbc8ec9d9a032123b9b8b6f0407f23fa7630f6ad098a","last_reissued_at":"2026-05-18T04:10:35.202801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:35.202801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nicolas Beldiceanu, Thierry Petit, Xavier Lorca","submitted_at":"2011-10-21T07:49:48Z","abstract_excerpt":"This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving general- ized arc-consistency according to some properties. SEQ BIN can be used for encoding counting con- straints such as CHANGE, SMOOTH or INCREAS- ING NVALUE. For some of these constraints and some of their variants GAC can be enforced with a time and space complexity linear in the sum of domain sizes, which improves or equals the best known results of the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4719","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":"1110.4719","created_at":"2026-05-18T04:10:35.202910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4719v1","created_at":"2026-05-18T04:10:35.202910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4719","created_at":"2026-05-18T04:10:35.202910+00:00"},{"alias_kind":"pith_short_12","alias_value":"J33NKP6UTJEK","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J33NKP6UTJEKY2ZG","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J33NKP6U","created_at":"2026-05-18T12:26:32.869790+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/J33NKP6UTJEKY2ZG7PEOZHM2AM","json":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM.json","graph_json":"https://pith.science/api/pith-number/J33NKP6UTJEKY2ZG7PEOZHM2AM/graph.json","events_json":"https://pith.science/api/pith-number/J33NKP6UTJEKY2ZG7PEOZHM2AM/events.json","paper":"https://pith.science/paper/J33NKP6U"},"agent_actions":{"view_html":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM","download_json":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM.json","view_paper":"https://pith.science/paper/J33NKP6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4719&json=true","fetch_graph":"https://pith.science/api/pith-number/J33NKP6UTJEKY2ZG7PEOZHM2AM/graph.json","fetch_events":"https://pith.science/api/pith-number/J33NKP6UTJEKY2ZG7PEOZHM2AM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM/action/storage_attestation","attest_author":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM/action/author_attestation","sign_citation":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM/action/citation_signature","submit_replication":"https://pith.science/pith/J33NKP6UTJEKY2ZG7PEOZHM2AM/action/replication_record"}},"created_at":"2026-05-18T04:10:35.202910+00:00","updated_at":"2026-05-18T04:10:35.202910+00:00"}