{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:32TFFTKVUAB75ERCZBOESWAHRJ","short_pith_number":"pith:32TFFTKV","schema_version":"1.0","canonical_sha256":"dea652cd55a003fe9222c85c4958078a54f29419959ed68c5cf4f370f04f576c","source":{"kind":"arxiv","id":"1207.1811","version":1},"attestation_state":"computed","paper":{"title":"The SeqBin Constraint Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"George Katsirelos, Nina Narodytska, Toby Walsh","submitted_at":"2012-07-07T16:21:53Z","abstract_excerpt":"We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong restrictions: it does not detect bounds disentailment and it is not idempotent. We identify the cause for these problems, and propose a new propagator that overcomes both issues. Our algorithm is based on a connection to the problem of finding a path of a given cost in a restricted $n$-partite graph. Our propagator enforces domain consistency in O"},"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":"1207.1811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-07T16:21:53Z","cross_cats_sorted":[],"title_canon_sha256":"335a0f4d43d04658b165fe14dc2a707502a4e6c3a8f6d3129e4a6176f8521b21","abstract_canon_sha256":"c2c34f5c55439fa4112369d39fd79abcf7070dad76c64fe535173c5b82c6374d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.460186Z","signature_b64":"5Qh9sI9iuthK2eHZAHbvVegpioC80dhlHeo6eMNZHP1RAJWYjdHcWfdyaU7NTmE88HbxW4QUbqxecK1u1UmcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea652cd55a003fe9222c85c4958078a54f29419959ed68c5cf4f370f04f576c","last_reissued_at":"2026-05-18T02:21:08.459795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.459795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The SeqBin Constraint Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"George Katsirelos, Nina Narodytska, Toby Walsh","submitted_at":"2012-07-07T16:21:53Z","abstract_excerpt":"We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong restrictions: it does not detect bounds disentailment and it is not idempotent. We identify the cause for these problems, and propose a new propagator that overcomes both issues. Our algorithm is based on a connection to the problem of finding a path of a given cost in a restricted $n$-partite graph. Our propagator enforces domain consistency in O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1811","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":"1207.1811","created_at":"2026-05-18T02:21:08.459854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1811v1","created_at":"2026-05-18T02:21:08.459854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1811","created_at":"2026-05-18T02:21:08.459854+00:00"},{"alias_kind":"pith_short_12","alias_value":"32TFFTKVUAB7","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"32TFFTKVUAB75ERC","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"32TFFTKV","created_at":"2026-05-18T12:26:50.516681+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/32TFFTKVUAB75ERCZBOESWAHRJ","json":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ.json","graph_json":"https://pith.science/api/pith-number/32TFFTKVUAB75ERCZBOESWAHRJ/graph.json","events_json":"https://pith.science/api/pith-number/32TFFTKVUAB75ERCZBOESWAHRJ/events.json","paper":"https://pith.science/paper/32TFFTKV"},"agent_actions":{"view_html":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ","download_json":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ.json","view_paper":"https://pith.science/paper/32TFFTKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1811&json=true","fetch_graph":"https://pith.science/api/pith-number/32TFFTKVUAB75ERCZBOESWAHRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/32TFFTKVUAB75ERCZBOESWAHRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ/action/storage_attestation","attest_author":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ/action/author_attestation","sign_citation":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ/action/citation_signature","submit_replication":"https://pith.science/pith/32TFFTKVUAB75ERCZBOESWAHRJ/action/replication_record"}},"created_at":"2026-05-18T02:21:08.459854+00:00","updated_at":"2026-05-18T02:21:08.459854+00:00"}