{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ESDC3UVKW3SX2A4LQ6C3G4MROY","short_pith_number":"pith:ESDC3UVK","schema_version":"1.0","canonical_sha256":"24862dd2aab6e57d038b8785b37191763f3059a3b5a579ede95bed00bd5c4d44","source":{"kind":"arxiv","id":"1606.03894","version":1},"attestation_state":"computed","paper":{"title":"A Probabilistic-Based Model for Binary CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.AI","authors_text":"Amine Balafrej, Charlotte Truchet, Xavier Lorca","submitted_at":"2016-06-13T11:03:26Z","abstract_excerpt":"This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in the CSP, it shows how to express, in a predictive way, the probability that a domain value becomes inconsistent, then it express the expectation of the number of arc-inconsistent values in each domain of the constraint network. Thus, it express the expectation of the number of arc-inconsistent values for the whole constraint network. Next, it provides bounds for each of these three probabilistic indicators. Finally, "},"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":"1606.03894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-13T11:03:26Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"b5a607746d510cc0b44e7ee365129492f9f3dc57f5fe258bc2b260ee2310e995","abstract_canon_sha256":"5fca87ed8b9e3d39b70313c4cca7b364feec39bf41a2891330d9bc4f546265cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:32.442860Z","signature_b64":"o6exhSyioGreQCTOir1mpoupfG3zAgHLJ7UF+KCV5xZztOctq0b+W/TeAdcRfQS80HzXVPmbd+ic9B2braKyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24862dd2aab6e57d038b8785b37191763f3059a3b5a579ede95bed00bd5c4d44","last_reissued_at":"2026-05-18T01:12:32.442503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:32.442503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Probabilistic-Based Model for Binary CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.AI","authors_text":"Amine Balafrej, Charlotte Truchet, Xavier Lorca","submitted_at":"2016-06-13T11:03:26Z","abstract_excerpt":"This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in the CSP, it shows how to express, in a predictive way, the probability that a domain value becomes inconsistent, then it express the expectation of the number of arc-inconsistent values in each domain of the constraint network. Thus, it express the expectation of the number of arc-inconsistent values for the whole constraint network. Next, it provides bounds for each of these three probabilistic indicators. Finally, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03894","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":"1606.03894","created_at":"2026-05-18T01:12:32.442564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03894v1","created_at":"2026-05-18T01:12:32.442564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03894","created_at":"2026-05-18T01:12:32.442564+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESDC3UVKW3SX","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESDC3UVKW3SX2A4L","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESDC3UVK","created_at":"2026-05-18T12:30:15.759754+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/ESDC3UVKW3SX2A4LQ6C3G4MROY","json":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY.json","graph_json":"https://pith.science/api/pith-number/ESDC3UVKW3SX2A4LQ6C3G4MROY/graph.json","events_json":"https://pith.science/api/pith-number/ESDC3UVKW3SX2A4LQ6C3G4MROY/events.json","paper":"https://pith.science/paper/ESDC3UVK"},"agent_actions":{"view_html":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY","download_json":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY.json","view_paper":"https://pith.science/paper/ESDC3UVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03894&json=true","fetch_graph":"https://pith.science/api/pith-number/ESDC3UVKW3SX2A4LQ6C3G4MROY/graph.json","fetch_events":"https://pith.science/api/pith-number/ESDC3UVKW3SX2A4LQ6C3G4MROY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY/action/storage_attestation","attest_author":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY/action/author_attestation","sign_citation":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY/action/citation_signature","submit_replication":"https://pith.science/pith/ESDC3UVKW3SX2A4LQ6C3G4MROY/action/replication_record"}},"created_at":"2026-05-18T01:12:32.442564+00:00","updated_at":"2026-05-18T01:12:32.442564+00:00"}