{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N5U45UXWPHW6EM5CDQ2CZHUNMY","short_pith_number":"pith:N5U45UXW","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"},"canonical_sha256":"6f69ced2f679ede233a21c342c9e8d661fe8acdb51b246f3e4dbc0e7afad2ab9","source":{"kind":"arxiv","id":"1307.3585","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3585","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3585v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3585","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"N5U45UXWPHW6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N5U45UXWPHW6EM5C","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N5U45UXW","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N5U45UXWPHW6EM5CDQ2CZHUNMY","target":"record","payload":{"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"},"canonical_sha256":"6f69ced2f679ede233a21c342c9e8d661fe8acdb51b246f3e4dbc0e7afad2ab9","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"},"source_kind":"arxiv","source_id":"1307.3585","source_version":1,"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-18T03:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bynb9cOY20/+4frnFfNY76pQy//7P+vsLmd/H18YEGtB2g2cfaUXTNdFeedlfU/bPCtUrQI584I36l559FSjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:09:06.325102Z"},"content_sha256":"0f1389241265348356dae8267f9ad5d263a77494fb7f19f6096368db22830cdb","schema_version":"1.0","event_id":"sha256:0f1389241265348356dae8267f9ad5d263a77494fb7f19f6096368db22830cdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N5U45UXWPHW6EM5CDQ2CZHUNMY","target":"graph","payload":{"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"},"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-18T03:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yh9HNuaz55LcVkLSXibpqnxQ+bc6UcUn2gIqzIjmAL2vpx/qAhA/nOIYKCKcj1NXDEKp/hUVJVyYLf1yEYYNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:09:06.325460Z"},"content_sha256":"074e95fd6ee064e03441f1b410d69bb33482cc829a4921cec45018717e1619e3","schema_version":"1.0","event_id":"sha256:074e95fd6ee064e03441f1b410d69bb33482cc829a4921cec45018717e1619e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/bundle.json","state_url":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/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-27T11:09:06Z","links":{"resolver":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY","bundle":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/bundle.json","state":"https://pith.science/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5U45UXWPHW6EM5CDQ2CZHUNMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N5U45UXWPHW6EM5CDQ2CZHUNMY","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":"8c72f3dd6f5df27cbeea0f394462ef404df4ad663c9125f16ac4d57522036d20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-12T21:28:05Z","title_canon_sha256":"69a6d2a7fbcef645692e4b96c26c6cd75ef75844c42a05e0f0611b121cfe024f"},"schema_version":"1.0","source":{"id":"1307.3585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3585","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3585v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3585","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"N5U45UXWPHW6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N5U45UXWPHW6EM5C","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N5U45UXW","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:074e95fd6ee064e03441f1b410d69bb33482cc829a4921cec45018717e1619e3","target":"graph","created_at":"2026-05-18T03:18:28Z","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":"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","authors_text":"Bertrand Mazure, \\'Eric Gr\\'egoire, Jean-Marie Lagniez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-12T21:28:05Z","title":"Improving MUC extraction thanks to local search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3585","kind":"arxiv","version":1},"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:0f1389241265348356dae8267f9ad5d263a77494fb7f19f6096368db22830cdb","target":"record","created_at":"2026-05-18T03:18:28Z","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":"8c72f3dd6f5df27cbeea0f394462ef404df4ad663c9125f16ac4d57522036d20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-07-12T21:28:05Z","title_canon_sha256":"69a6d2a7fbcef645692e4b96c26c6cd75ef75844c42a05e0f0611b121cfe024f"},"schema_version":"1.0","source":{"id":"1307.3585","kind":"arxiv","version":1}},"canonical_sha256":"6f69ced2f679ede233a21c342c9e8d661fe8acdb51b246f3e4dbc0e7afad2ab9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f69ced2f679ede233a21c342c9e8d661fe8acdb51b246f3e4dbc0e7afad2ab9","first_computed_at":"2026-05-18T03:18:28.491379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:28.491379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1XCj+b7IPQheQmh0fy8sOgCniO8+KSyeSsa6eBhPGvpkM8c1xwAzpxMUg95uXCGDohQhM/dRW7skDn/5PnnkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:28.491756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f1389241265348356dae8267f9ad5d263a77494fb7f19f6096368db22830cdb","sha256:074e95fd6ee064e03441f1b410d69bb33482cc829a4921cec45018717e1619e3"],"state_sha256":"3c6d4f6a9dade295c74755890e1e4caad01aa0dc41dee8ad4d32f82f84831ad3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyBMf3DXUnnjPab7he8PZHklIGAhOVrwihnEKdyBhvF/j5uYYWt+go75fwGzB5ZLmPJEzMzb8WQCm5WQYK6ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T11:09:06.327325Z","bundle_sha256":"5bb17c85a78c156ce733127c99ad0451dea2ac274d7c219df59142385d65fc88"}}