{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S4X3VJC63HAU2DPLBPT7AHLJWO","short_pith_number":"pith:S4X3VJC6","canonical_record":{"source":{"id":"1606.03289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:24:35Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"91af31927ca7b85ae21cc2a7f618eac8c339070a62cc28c48a8b85826f401a85","abstract_canon_sha256":"f0088bcd41978c443b3f89c6d729d1263da0f027dae44a4321824149ca937cc4"},"schema_version":"1.0"},"canonical_sha256":"972fbaa45ed9c14d0deb0be7f01d69b38d1b2eaa484918d907f9285f427132f2","source":{"kind":"arxiv","id":"1606.03289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03289","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03289v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03289","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"S4X3VJC63HAU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S4X3VJC63HAU2DPL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S4X3VJC6","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S4X3VJC63HAU2DPLBPT7AHLJWO","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:24:35Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"91af31927ca7b85ae21cc2a7f618eac8c339070a62cc28c48a8b85826f401a85","abstract_canon_sha256":"f0088bcd41978c443b3f89c6d729d1263da0f027dae44a4321824149ca937cc4"},"schema_version":"1.0"},"canonical_sha256":"972fbaa45ed9c14d0deb0be7f01d69b38d1b2eaa484918d907f9285f427132f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.218997Z","signature_b64":"4oO3qBWqiy8eoG0zOCve3H1TXfBC8CU1XxLOwIUfeeuZq7f9KnJur3vVIDqf+80nVTU7oMI/sges7LhqXV6DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"972fbaa45ed9c14d0deb0be7f01d69b38d1b2eaa484918d907f9285f427132f2","last_reissued_at":"2026-05-18T01:12:37.218504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.218504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03289","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-18T01:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3jbg5p34jIxMx7cGPHACRUdeKNSrTQ+4Fx3r8T5cplSX98c+TYobnE8LtjyR3ngrV2y0L/3t1JoQlcJcXi3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:25:51.569667Z"},"content_sha256":"379772c59fc34c56005d60ff759b199ba4146bd2a9044ff80914a173ce37e90c","schema_version":"1.0","event_id":"sha256:379772c59fc34c56005d60ff759b199ba4146bd2a9044ff80914a173ce37e90c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S4X3VJC63HAU2DPLBPT7AHLJWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tunable Online MUS/MSS Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ivana Cerna, Jaroslav Bendik, Jiri Barnat, Nikola Benes","submitted_at":"2016-06-10T12:24:35Z","abstract_excerpt":"In various areas of computer science, the problem of dealing with a set of constraints arises. If the set of constraints is unsatisfiable, one may ask for a minimal description of the reason for this unsatisifi- ability. Minimal unsatisifable subsets (MUSes) and maximal satisifiable subsets (MSSes) are two kinds of such minimal descriptions. The goal of this work is the enumeration of MUSes and MSSes for a given constraint system. As such full enumeration may be intractable in general, we focus on building an online algorithm, which produces MUSes/MSSes in an on-the-fly manner as soon as they "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03289","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-18T01:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnsP60XazsdGmLocjlaIVgf3/MHQ+OLsrf5vzgxKs4euWdzj271W2qS6Quit0M/sf/Tg2q4s29HIz8vXeUDrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:25:51.570299Z"},"content_sha256":"a1e1c7dfedc5d9953733504b86e0ada52bfa707f27743e5e2e455b975cc4e0ab","schema_version":"1.0","event_id":"sha256:a1e1c7dfedc5d9953733504b86e0ada52bfa707f27743e5e2e455b975cc4e0ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4X3VJC63HAU2DPLBPT7AHLJWO/bundle.json","state_url":"https://pith.science/pith/S4X3VJC63HAU2DPLBPT7AHLJWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4X3VJC63HAU2DPLBPT7AHLJWO/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-10T10:25:51Z","links":{"resolver":"https://pith.science/pith/S4X3VJC63HAU2DPLBPT7AHLJWO","bundle":"https://pith.science/pith/S4X3VJC63HAU2DPLBPT7AHLJWO/bundle.json","state":"https://pith.science/pith/S4X3VJC63HAU2DPLBPT7AHLJWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4X3VJC63HAU2DPLBPT7AHLJWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S4X3VJC63HAU2DPLBPT7AHLJWO","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":"f0088bcd41978c443b3f89c6d729d1263da0f027dae44a4321824149ca937cc4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:24:35Z","title_canon_sha256":"91af31927ca7b85ae21cc2a7f618eac8c339070a62cc28c48a8b85826f401a85"},"schema_version":"1.0","source":{"id":"1606.03289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03289","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03289v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03289","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"S4X3VJC63HAU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S4X3VJC63HAU2DPL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S4X3VJC6","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:a1e1c7dfedc5d9953733504b86e0ada52bfa707f27743e5e2e455b975cc4e0ab","target":"graph","created_at":"2026-05-18T01:12:37Z","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":"In various areas of computer science, the problem of dealing with a set of constraints arises. If the set of constraints is unsatisfiable, one may ask for a minimal description of the reason for this unsatisifi- ability. Minimal unsatisifable subsets (MUSes) and maximal satisifiable subsets (MSSes) are two kinds of such minimal descriptions. The goal of this work is the enumeration of MUSes and MSSes for a given constraint system. As such full enumeration may be intractable in general, we focus on building an online algorithm, which produces MUSes/MSSes in an on-the-fly manner as soon as they ","authors_text":"Ivana Cerna, Jaroslav Bendik, Jiri Barnat, Nikola Benes","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:24:35Z","title":"Tunable Online MUS/MSS Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03289","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:379772c59fc34c56005d60ff759b199ba4146bd2a9044ff80914a173ce37e90c","target":"record","created_at":"2026-05-18T01:12:37Z","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":"f0088bcd41978c443b3f89c6d729d1263da0f027dae44a4321824149ca937cc4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-10T12:24:35Z","title_canon_sha256":"91af31927ca7b85ae21cc2a7f618eac8c339070a62cc28c48a8b85826f401a85"},"schema_version":"1.0","source":{"id":"1606.03289","kind":"arxiv","version":1}},"canonical_sha256":"972fbaa45ed9c14d0deb0be7f01d69b38d1b2eaa484918d907f9285f427132f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"972fbaa45ed9c14d0deb0be7f01d69b38d1b2eaa484918d907f9285f427132f2","first_computed_at":"2026-05-18T01:12:37.218504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:37.218504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4oO3qBWqiy8eoG0zOCve3H1TXfBC8CU1XxLOwIUfeeuZq7f9KnJur3vVIDqf+80nVTU7oMI/sges7LhqXV6DDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:37.218997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:379772c59fc34c56005d60ff759b199ba4146bd2a9044ff80914a173ce37e90c","sha256:a1e1c7dfedc5d9953733504b86e0ada52bfa707f27743e5e2e455b975cc4e0ab"],"state_sha256":"f52a91b2ae2d75c420b6b99d05331cabaf9eb3efede799e4fdcb1d6b6a90eedc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQHtqBD6H5B54cA31N0f3npgigJ2wgWNg4sf9DJvvCUUeH7BGtNsX3gylB34t25qvZT6pdxmz+HsKyzZiYHPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:25:51.574749Z","bundle_sha256":"c7d44ab97b6a8c4e60a2aa8f6d5fd733dc66f284f4c337985e22263ea79407c6"}}