{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QBDKVWAN2CSIVZKRMYMUUNBBDW","short_pith_number":"pith:QBDKVWAN","schema_version":"1.0","canonical_sha256":"8046aad80dd0a48ae55166194a34211db1aeaeac3e91563a2a643fdf962b9e02","source":{"kind":"arxiv","id":"1008.0660","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Branching for Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kostas Stergiou, Thanasis Balafoutis","submitted_at":"2010-08-03T21:10:15Z","abstract_excerpt":"The two standard branching schemes for CSPs are d-way and 2-way branching. Although it has been shown that in theory the latter can be exponentially more effective than the former, there is a lack of empirical evidence showing such differences. To investigate this, we initially make an experimental comparison of the two branching schemes over a wide range of benchmarks. Experimental results verify the theoretical gap between d-way and 2-way branching as we move from a simple variable ordering heuristic like dom to more sophisticated ones like dom/ddeg. However, perhaps surprisingly, experiment"},"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":"1008.0660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-03T21:10:15Z","cross_cats_sorted":[],"title_canon_sha256":"fcd8e407b36d630c879c2f2bc619eb479dabcdf3b203517ac33525a70f8e5861","abstract_canon_sha256":"2a2956ce4f26c46fde10d6d260c10e708a339fdcdaaac6d1558418c953ad20d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.009111Z","signature_b64":"5LMp4kbr9ojGIh6Q59bPtB0YdphUuS2w2asQgbWEuE5LJvee0pkKPiSAPBMiO6Va0ehrTwMd/tzB9e+2apHSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8046aad80dd0a48ae55166194a34211db1aeaeac3e91563a2a643fdf962b9e02","last_reissued_at":"2026-05-18T04:41:26.008627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.008627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Branching for Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kostas Stergiou, Thanasis Balafoutis","submitted_at":"2010-08-03T21:10:15Z","abstract_excerpt":"The two standard branching schemes for CSPs are d-way and 2-way branching. Although it has been shown that in theory the latter can be exponentially more effective than the former, there is a lack of empirical evidence showing such differences. To investigate this, we initially make an experimental comparison of the two branching schemes over a wide range of benchmarks. Experimental results verify the theoretical gap between d-way and 2-way branching as we move from a simple variable ordering heuristic like dom to more sophisticated ones like dom/ddeg. However, perhaps surprisingly, experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0660","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":"1008.0660","created_at":"2026-05-18T04:41:26.008704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.0660v1","created_at":"2026-05-18T04:41:26.008704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0660","created_at":"2026-05-18T04:41:26.008704+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBDKVWAN2CSI","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBDKVWAN2CSIVZKR","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBDKVWAN","created_at":"2026-05-18T12:26:12.377268+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/QBDKVWAN2CSIVZKRMYMUUNBBDW","json":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW.json","graph_json":"https://pith.science/api/pith-number/QBDKVWAN2CSIVZKRMYMUUNBBDW/graph.json","events_json":"https://pith.science/api/pith-number/QBDKVWAN2CSIVZKRMYMUUNBBDW/events.json","paper":"https://pith.science/paper/QBDKVWAN"},"agent_actions":{"view_html":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW","download_json":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW.json","view_paper":"https://pith.science/paper/QBDKVWAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.0660&json=true","fetch_graph":"https://pith.science/api/pith-number/QBDKVWAN2CSIVZKRMYMUUNBBDW/graph.json","fetch_events":"https://pith.science/api/pith-number/QBDKVWAN2CSIVZKRMYMUUNBBDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW/action/storage_attestation","attest_author":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW/action/author_attestation","sign_citation":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW/action/citation_signature","submit_replication":"https://pith.science/pith/QBDKVWAN2CSIVZKRMYMUUNBBDW/action/replication_record"}},"created_at":"2026-05-18T04:41:26.008704+00:00","updated_at":"2026-05-18T04:41:26.008704+00:00"}