{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:N5U45UXWPHW6EM5CDQ2CZHUNMY","short_pith_number":"pith:N5U45UXW","schema_version":"1.0","canonical_sha256":"6f69ced2f679ede233a21c342c9e8d661fe8acdb51b246f3e4dbc0e7afad2ab9","source":{"kind":"arxiv","id":"1307.3585","version":1},"attestation_state":"computed","paper":{"title":"Improving MUC extraction thanks to local search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bertrand Mazure, \\'Eric Gr\\'egoire, Jean-Marie Lagniez","submitted_at":"2013-07-12T21:28:05Z","abstract_excerpt":"ExtractingMUCs(MinimalUnsatisfiableCores)fromanunsatisfiable constraint network is a useful process when causes of unsatisfiability must be understood so that the network can be re-engineered and relaxed to become sat- isfiable. Despite bad worst-case computational complexity results, various MUC- finding approaches that appear tractable for many real-life instances have been proposed. Many of them are based on the successive identification of so-called transition constraints. In this respect, we show how local search can be used to possibly extract additional transition constraints at each ma"},"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":"1307.3585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-12T21:28:05Z","cross_cats_sorted":[],"title_canon_sha256":"69a6d2a7fbcef645692e4b96c26c6cd75ef75844c42a05e0f0611b121cfe024f","abstract_canon_sha256":"8c72f3dd6f5df27cbeea0f394462ef404df4ad663c9125f16ac4d57522036d20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:28.491756Z","signature_b64":"1XCj+b7IPQheQmh0fy8sOgCniO8+KSyeSsa6eBhPGvpkM8c1xwAzpxMUg95uXCGDohQhM/dRW7skDn/5PnnkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f69ced2f679ede233a21c342c9e8d661fe8acdb51b246f3e4dbc0e7afad2ab9","last_reissued_at":"2026-05-18T03:18:28.491379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:28.491379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving MUC extraction thanks to local search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bertrand Mazure, \\'Eric Gr\\'egoire, Jean-Marie Lagniez","submitted_at":"2013-07-12T21:28:05Z","abstract_excerpt":"ExtractingMUCs(MinimalUnsatisfiableCores)fromanunsatisfiable constraint network is a useful process when causes of unsatisfiability must be understood so that the network can be re-engineered and relaxed to become sat- isfiable. Despite bad worst-case computational complexity results, various MUC- finding approaches that appear tractable for many real-life instances have been proposed. Many of them are based on the successive identification of so-called transition constraints. In this respect, we show how local search can be used to possibly extract additional transition constraints at each ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3585","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":"1307.3585","created_at":"2026-05-18T03:18:28.491434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3585v1","created_at":"2026-05-18T03:18:28.491434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3585","created_at":"2026-05-18T03:18:28.491434+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5U45UXWPHW6","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5U45UXWPHW6EM5C","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5U45UXW","created_at":"2026-05-18T12:27:52.871228+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/N5U45UXWPHW6EM5CDQ2CZHUNMY","json":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY.json","graph_json":"https://pith.science/api/pith-number/N5U45UXWPHW6EM5CDQ2CZHUNMY/graph.json","events_json":"https://pith.science/api/pith-number/N5U45UXWPHW6EM5CDQ2CZHUNMY/events.json","paper":"https://pith.science/paper/N5U45UXW"},"agent_actions":{"view_html":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY","download_json":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY.json","view_paper":"https://pith.science/paper/N5U45UXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3585&json=true","fetch_graph":"https://pith.science/api/pith-number/N5U45UXWPHW6EM5CDQ2CZHUNMY/graph.json","fetch_events":"https://pith.science/api/pith-number/N5U45UXWPHW6EM5CDQ2CZHUNMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/action/storage_attestation","attest_author":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/action/author_attestation","sign_citation":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/action/citation_signature","submit_replication":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/action/replication_record"}},"created_at":"2026-05-18T03:18:28.491434+00:00","updated_at":"2026-05-18T03:18:28.491434+00:00"}