{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZFBPJ5RWJXOPK6S5LI6YDJONVR","short_pith_number":"pith:ZFBPJ5RW","canonical_record":{"source":{"id":"1401.3878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T05:11:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"889b8495c201b12b05d26168d58ab064fdadacc2722ae401f8db5ac4f93029e9","abstract_canon_sha256":"c46994edfc3be4fef2e395e95f110ae92d6f3afdad3eee85e27e2102be171455"},"schema_version":"1.0"},"canonical_sha256":"c942f4f6364ddcf57a5d5a3d81a5cdac5c20154d1062782a6b18d3eda16a30ff","source":{"kind":"arxiv","id":"1401.3878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3878","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3878v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3878","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZFBPJ5RWJXOP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFBPJ5RWJXOPK6S5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFBPJ5RW","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZFBPJ5RWJXOPK6S5LI6YDJONVR","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T05:11:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"889b8495c201b12b05d26168d58ab064fdadacc2722ae401f8db5ac4f93029e9","abstract_canon_sha256":"c46994edfc3be4fef2e395e95f110ae92d6f3afdad3eee85e27e2102be171455"},"schema_version":"1.0"},"canonical_sha256":"c942f4f6364ddcf57a5d5a3d81a5cdac5c20154d1062782a6b18d3eda16a30ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.307068Z","signature_b64":"9ch5+dUTIctFcp2qcZXvDEbuvG47knh5705jyA/ltI4yqTmP3k+uhGhmSbvL2Wsfg38ZoLdZ4NnkvAxahA2vAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c942f4f6364ddcf57a5d5a3d81a5cdac5c20154d1062782a6b18d3eda16a30ff","last_reissued_at":"2026-05-18T03:02:06.306379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.306379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3878","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtrKcMPlRhFvC17UAMzDEO7NBdZT+EHW/y/vMjYlz7HGQ58+2D/EMUsT8f1qOVCVtbr3NrAG4bpy6pLVg54XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:31:03.033109Z"},"content_sha256":"dacca05575034db98d12c350b536d5b4f3e1410e45e1a2b4549bba7fb69cee5c","schema_version":"1.0","event_id":"sha256:dacca05575034db98d12c350b536d5b4f3e1410e45e1a2b4549bba7fb69cee5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZFBPJ5RWJXOPK6S5LI6YDJONVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Alberto Griggio, Alessandro Cimatti, Roberto Sebastiani","submitted_at":"2014-01-16T05:11:40Z","abstract_excerpt":"The problem of finding small unsatisfiable cores for SAT formulas has  recently received a lot of interest, mostly for its applications in formal verification.  However, propositional logic is often not expressive  enough for representing many interesting verification problems, which can be more naturally addressed in the framework of Satisfiability Modulo Theories, SMT.  Surprisingly, the problem of finding unsatisfiable cores in SMT has received very little attention in the literature.\nIn this paper we present a novel approach to this problem, called the Lemma-Lifting approach. The main idea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3878","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDjY9kzGESn3ecT1aqf1YMaLqBQAAH4wriS5C/2PktnIJENt5I3NSnxGl53bYAC+7qrc/AQoNy12VoNoNqGKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:31:03.033479Z"},"content_sha256":"1a04ca175c349c6310065c8115331d3ddfab53c687a960f5b79e269112cc5c12","schema_version":"1.0","event_id":"sha256:1a04ca175c349c6310065c8115331d3ddfab53c687a960f5b79e269112cc5c12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFBPJ5RWJXOPK6S5LI6YDJONVR/bundle.json","state_url":"https://pith.science/pith/ZFBPJ5RWJXOPK6S5LI6YDJONVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFBPJ5RWJXOPK6S5LI6YDJONVR/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-22T18:31:03Z","links":{"resolver":"https://pith.science/pith/ZFBPJ5RWJXOPK6S5LI6YDJONVR","bundle":"https://pith.science/pith/ZFBPJ5RWJXOPK6S5LI6YDJONVR/bundle.json","state":"https://pith.science/pith/ZFBPJ5RWJXOPK6S5LI6YDJONVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFBPJ5RWJXOPK6S5LI6YDJONVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZFBPJ5RWJXOPK6S5LI6YDJONVR","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":"c46994edfc3be4fef2e395e95f110ae92d6f3afdad3eee85e27e2102be171455","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T05:11:40Z","title_canon_sha256":"889b8495c201b12b05d26168d58ab064fdadacc2722ae401f8db5ac4f93029e9"},"schema_version":"1.0","source":{"id":"1401.3878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3878","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3878v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3878","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZFBPJ5RWJXOP","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFBPJ5RWJXOPK6S5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFBPJ5RW","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:1a04ca175c349c6310065c8115331d3ddfab53c687a960f5b79e269112cc5c12","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"The problem of finding small unsatisfiable cores for SAT formulas has  recently received a lot of interest, mostly for its applications in formal verification.  However, propositional logic is often not expressive  enough for representing many interesting verification problems, which can be more naturally addressed in the framework of Satisfiability Modulo Theories, SMT.  Surprisingly, the problem of finding unsatisfiable cores in SMT has received very little attention in the literature.\nIn this paper we present a novel approach to this problem, called the Lemma-Lifting approach. The main idea","authors_text":"Alberto Griggio, Alessandro Cimatti, Roberto Sebastiani","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T05:11:40Z","title":"Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3878","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:dacca05575034db98d12c350b536d5b4f3e1410e45e1a2b4549bba7fb69cee5c","target":"record","created_at":"2026-05-18T03:02:06Z","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":"c46994edfc3be4fef2e395e95f110ae92d6f3afdad3eee85e27e2102be171455","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-16T05:11:40Z","title_canon_sha256":"889b8495c201b12b05d26168d58ab064fdadacc2722ae401f8db5ac4f93029e9"},"schema_version":"1.0","source":{"id":"1401.3878","kind":"arxiv","version":1}},"canonical_sha256":"c942f4f6364ddcf57a5d5a3d81a5cdac5c20154d1062782a6b18d3eda16a30ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c942f4f6364ddcf57a5d5a3d81a5cdac5c20154d1062782a6b18d3eda16a30ff","first_computed_at":"2026-05-18T03:02:06.306379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.306379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ch5+dUTIctFcp2qcZXvDEbuvG47knh5705jyA/ltI4yqTmP3k+uhGhmSbvL2Wsfg38ZoLdZ4NnkvAxahA2vAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.307068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dacca05575034db98d12c350b536d5b4f3e1410e45e1a2b4549bba7fb69cee5c","sha256:1a04ca175c349c6310065c8115331d3ddfab53c687a960f5b79e269112cc5c12"],"state_sha256":"a7d258193a594e2086d72e00f9b9b032de34fbed96e9ac3d2cdb78bdb0fecbcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/soegIoL45NDenpIb8tN4rTLXc+MGqgBBrn0oCQZosM/lsAvlWUSgnEqHUH7ZV923Fh+qs0oiQ+mcYnyt9W5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:31:03.035366Z","bundle_sha256":"ac3e152475a9305e17a55ac39987a4e3f3ab9f8a1cda33eb7ae409fb9affc459"}}