{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NPK6KW2PRZDFWB24ZMWYBOT7QL","short_pith_number":"pith:NPK6KW2P","schema_version":"1.0","canonical_sha256":"6bd5e55b4f8e465b075ccb2d80ba7f82f5eaba03473c0bfb462f19beb230b62c","source":{"kind":"arxiv","id":"1401.4601","version":1},"attestation_state":"computed","paper":{"title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandro Zanarini, Claude-Guy Quimper, Gilles Pesant","submitted_at":"2014-01-18T21:09:25Z","abstract_excerpt":"Designing a search heuristic for constraint programming that is reliable across problem domains has been an important research topic in recent years. This paper concentrates on one family of candidates: counting-based search. Such heuristics seek to make branching decisions that preserve most of the solutions by determining what proportion of solutions to each individual constraint agree with that decision. Whereas most generic search heuristics in constraint programming rely on local information at the level of the individual variable, our search heuristics are based on more global informatio"},"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.4601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:09:25Z","cross_cats_sorted":[],"title_canon_sha256":"6b46f3e93a815324241536dbec7c415153c2ea1f164321d9ab98eb88df635634","abstract_canon_sha256":"3cfd29581d2f6ea7f07d3b56c4d633b2c61a438447f29ffedfcf76129c16cc0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.277432Z","signature_b64":"gHmhVoy2Mr+6bXRrWe+ljp1QFaY0VXienVSeKBWL72Llv+9A3yhoSFzMdDMb7aLdBVbzBkhkXUVjOxQ9NIKRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bd5e55b4f8e465b075ccb2d80ba7f82f5eaba03473c0bfb462f19beb230b62c","last_reissued_at":"2026-05-18T03:01:45.276845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.276845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandro Zanarini, Claude-Guy Quimper, Gilles Pesant","submitted_at":"2014-01-18T21:09:25Z","abstract_excerpt":"Designing a search heuristic for constraint programming that is reliable across problem domains has been an important research topic in recent years. This paper concentrates on one family of candidates: counting-based search. Such heuristics seek to make branching decisions that preserve most of the solutions by determining what proportion of solutions to each individual constraint agree with that decision. Whereas most generic search heuristics in constraint programming rely on local information at the level of the individual variable, our search heuristics are based on more global informatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4601","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.4601","created_at":"2026-05-18T03:01:45.276936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4601v1","created_at":"2026-05-18T03:01:45.276936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4601","created_at":"2026-05-18T03:01:45.276936+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPK6KW2PRZDF","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPK6KW2PRZDFWB24","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPK6KW2P","created_at":"2026-05-18T12:28:41.024544+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/NPK6KW2PRZDFWB24ZMWYBOT7QL","json":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL.json","graph_json":"https://pith.science/api/pith-number/NPK6KW2PRZDFWB24ZMWYBOT7QL/graph.json","events_json":"https://pith.science/api/pith-number/NPK6KW2PRZDFWB24ZMWYBOT7QL/events.json","paper":"https://pith.science/paper/NPK6KW2P"},"agent_actions":{"view_html":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL","download_json":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL.json","view_paper":"https://pith.science/paper/NPK6KW2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4601&json=true","fetch_graph":"https://pith.science/api/pith-number/NPK6KW2PRZDFWB24ZMWYBOT7QL/graph.json","fetch_events":"https://pith.science/api/pith-number/NPK6KW2PRZDFWB24ZMWYBOT7QL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL/action/storage_attestation","attest_author":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL/action/author_attestation","sign_citation":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL/action/citation_signature","submit_replication":"https://pith.science/pith/NPK6KW2PRZDFWB24ZMWYBOT7QL/action/replication_record"}},"created_at":"2026-05-18T03:01:45.276936+00:00","updated_at":"2026-05-18T03:01:45.276936+00:00"}