{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZTSA7H52SXYGUYG4GZVCYI2HHV","short_pith_number":"pith:ZTSA7H52","canonical_record":{"source":{"id":"1611.08942","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-28T00:23:46Z","cross_cats_sorted":["math.PR","stat.OT"],"title_canon_sha256":"21d6e6f4ab4944fa96279af6b6f5b39ab605b183064297fbe41a22ae34ea0e63","abstract_canon_sha256":"cb56bc3a545ca453e573932cc88b49029590434c8ce32b9dd1455040a23e7f27"},"schema_version":"1.0"},"canonical_sha256":"cce40f9fba95f06a60dc366a2c23473d58fdc85f94f11c83fd66ff4993df8d13","source":{"kind":"arxiv","id":"1611.08942","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08942","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08942v5","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08942","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZTSA7H52SXYG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTSA7H52SXYGUYG4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTSA7H52","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZTSA7H52SXYGUYG4GZVCYI2HHV","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08942","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-28T00:23:46Z","cross_cats_sorted":["math.PR","stat.OT"],"title_canon_sha256":"21d6e6f4ab4944fa96279af6b6f5b39ab605b183064297fbe41a22ae34ea0e63","abstract_canon_sha256":"cb56bc3a545ca453e573932cc88b49029590434c8ce32b9dd1455040a23e7f27"},"schema_version":"1.0"},"canonical_sha256":"cce40f9fba95f06a60dc366a2c23473d58fdc85f94f11c83fd66ff4993df8d13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:57.682848Z","signature_b64":"4uQcFSCD9SYt3Le6u73ZYPSFqSCRCT6udwb+oew8HL12qAKdQcUjwIil0LAp/8Jp2Kk8+vGtaAvKXK0hIBpcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce40f9fba95f06a60dc366a2c23473d58fdc85f94f11c83fd66ff4993df8d13","last_reissued_at":"2026-05-18T00:54:57.682436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:57.682436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08942","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UJf9aqIiLq41gtqm8vDXpmsOksts4JcZtWL0v0Q3csjhfGLAFaXR54Jftdj6teMYnQYcUeVLhSPPSwaROJqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:36:36.472014Z"},"content_sha256":"9b0e47245cfb703cd26ea0fea379d4110494418a4ce4892262fa99740da0a0a2","schema_version":"1.0","event_id":"sha256:9b0e47245cfb703cd26ea0fea379d4110494418a4ce4892262fa99740da0a0a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZTSA7H52SXYGUYG4GZVCYI2HHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The BIN_COUNTS Constraint: Filtering and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.OT"],"primary_cat":"cs.AI","authors_text":"Armagan Tarim, \\\"Ozg\\\"ur Akg\\\"un, Roberto Rossi, Steven Prestwich","submitted_at":"2016-11-28T00:23:46Z","abstract_excerpt":"We introduce the BIN_COUNTS constraint, which deals with the problem of counting the number of decision variables in a set which are assigned values that lie in given bins. We illustrate a decomposition and a filtering algorithm that achieves generalised arc consistency. We contrast the filtering power of these two approaches and we discuss a number of applications. We show that BIN_COUNTS can be employed to develop a decomposition for the $\\chi^2$ test constraint, a new statistical constraint that we introduce in this work. We also show how this new constraint can be employed in the context o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08942","kind":"arxiv","version":5},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXTvBgS5bA1GSSf0y6zl4Qg0/oD3YuHq5xJxWRLhffV3pvRBJmVpdvEHbPi0n4qGtMbi7cmzLP+Ln3v5xth3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:36:36.472366Z"},"content_sha256":"3225ee9af1a181844b726b5b5d6ec5107b37898c8f80da3e2465ed9c485b7933","schema_version":"1.0","event_id":"sha256:3225ee9af1a181844b726b5b5d6ec5107b37898c8f80da3e2465ed9c485b7933"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTSA7H52SXYGUYG4GZVCYI2HHV/bundle.json","state_url":"https://pith.science/pith/ZTSA7H52SXYGUYG4GZVCYI2HHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTSA7H52SXYGUYG4GZVCYI2HHV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T19:36:36Z","links":{"resolver":"https://pith.science/pith/ZTSA7H52SXYGUYG4GZVCYI2HHV","bundle":"https://pith.science/pith/ZTSA7H52SXYGUYG4GZVCYI2HHV/bundle.json","state":"https://pith.science/pith/ZTSA7H52SXYGUYG4GZVCYI2HHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTSA7H52SXYGUYG4GZVCYI2HHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZTSA7H52SXYGUYG4GZVCYI2HHV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cb56bc3a545ca453e573932cc88b49029590434c8ce32b9dd1455040a23e7f27","cross_cats_sorted":["math.PR","stat.OT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-28T00:23:46Z","title_canon_sha256":"21d6e6f4ab4944fa96279af6b6f5b39ab605b183064297fbe41a22ae34ea0e63"},"schema_version":"1.0","source":{"id":"1611.08942","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08942","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08942v5","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08942","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZTSA7H52SXYG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTSA7H52SXYGUYG4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTSA7H52","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:3225ee9af1a181844b726b5b5d6ec5107b37898c8f80da3e2465ed9c485b7933","target":"graph","created_at":"2026-05-18T00:54:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce the BIN_COUNTS constraint, which deals with the problem of counting the number of decision variables in a set which are assigned values that lie in given bins. We illustrate a decomposition and a filtering algorithm that achieves generalised arc consistency. We contrast the filtering power of these two approaches and we discuss a number of applications. We show that BIN_COUNTS can be employed to develop a decomposition for the $\\chi^2$ test constraint, a new statistical constraint that we introduce in this work. We also show how this new constraint can be employed in the context o","authors_text":"Armagan Tarim, \\\"Ozg\\\"ur Akg\\\"un, Roberto Rossi, Steven Prestwich","cross_cats":["math.PR","stat.OT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-28T00:23:46Z","title":"The BIN_COUNTS Constraint: Filtering and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08942","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9b0e47245cfb703cd26ea0fea379d4110494418a4ce4892262fa99740da0a0a2","target":"record","created_at":"2026-05-18T00:54:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cb56bc3a545ca453e573932cc88b49029590434c8ce32b9dd1455040a23e7f27","cross_cats_sorted":["math.PR","stat.OT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-28T00:23:46Z","title_canon_sha256":"21d6e6f4ab4944fa96279af6b6f5b39ab605b183064297fbe41a22ae34ea0e63"},"schema_version":"1.0","source":{"id":"1611.08942","kind":"arxiv","version":5}},"canonical_sha256":"cce40f9fba95f06a60dc366a2c23473d58fdc85f94f11c83fd66ff4993df8d13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cce40f9fba95f06a60dc366a2c23473d58fdc85f94f11c83fd66ff4993df8d13","first_computed_at":"2026-05-18T00:54:57.682436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:57.682436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4uQcFSCD9SYt3Le6u73ZYPSFqSCRCT6udwb+oew8HL12qAKdQcUjwIil0LAp/8Jp2Kk8+vGtaAvKXK0hIBpcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:57.682848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08942","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b0e47245cfb703cd26ea0fea379d4110494418a4ce4892262fa99740da0a0a2","sha256:3225ee9af1a181844b726b5b5d6ec5107b37898c8f80da3e2465ed9c485b7933"],"state_sha256":"2c94d5eb424509e029de7b903b53248a25fb3419a53756dcbcd7f4c77651d960"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9EXCZbScOd0TDUsBO1adut3qtPCkDwf8ZJhWxBaJquice6RO2hOePCZEJnn7omdNvLA2k5fQjDZ9akWtO7UAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:36:36.474169Z","bundle_sha256":"d7ee580fcbeeb7e66b7507e40e410def8f07abac5284bfc475b1add131cd07c5"}}