{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FRYNBGGXHMK6EN74FX6SLCX2BN","short_pith_number":"pith:FRYNBGGX","canonical_record":{"source":{"id":"1503.02971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-10T16:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"95b1195e8fb0ca3c7afabe458d5af9db35347cfc05a5514e90a8aca0d7d4d3b2","abstract_canon_sha256":"71be271462996b0ea257b4401d7e76a806dabf2a8e4b05759cc1256ac1565b55"},"schema_version":"1.0"},"canonical_sha256":"2c70d098d73b15e237fc2dfd258afa0b51d65f46bd07d793a123b52a208b7eb1","source":{"kind":"arxiv","id":"1503.02971","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02971","created_at":"2026-05-18T02:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02971v2","created_at":"2026-05-18T02:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02971","created_at":"2026-05-18T02:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"FRYNBGGXHMK6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FRYNBGGXHMK6EN74","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FRYNBGGX","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FRYNBGGXHMK6EN74FX6SLCX2BN","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-10T16:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"95b1195e8fb0ca3c7afabe458d5af9db35347cfc05a5514e90a8aca0d7d4d3b2","abstract_canon_sha256":"71be271462996b0ea257b4401d7e76a806dabf2a8e4b05759cc1256ac1565b55"},"schema_version":"1.0"},"canonical_sha256":"2c70d098d73b15e237fc2dfd258afa0b51d65f46bd07d793a123b52a208b7eb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:54.766249Z","signature_b64":"5zbmqGKYEmHa99V1emPR5RMh5PvkaGNh4Nvbn3decpLdpW3m2gRFZ9dbpZZcfCmrtL0o9WC12PRI41RUm5EoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c70d098d73b15e237fc2dfd258afa0b51d65f46bd07d793a123b52a208b7eb1","last_reissued_at":"2026-05-18T02:03:54.765437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:54.765437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02971","source_version":2,"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-18T02:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4UyZwuSpElqZN2kXvb0eRN47deEDNeIPnLPbDTvuAGP3Mx6Mf4Zur8x0P7jrLWhao0g30pjCD3r5223B7CbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:29:07.720919Z"},"content_sha256":"efad02b7d69af964e555826715bee351990f2b2e12fca01585c2386faad7fda6","schema_version":"1.0","event_id":"sha256:efad02b7d69af964e555826715bee351990f2b2e12fca01585c2386faad7fda6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FRYNBGGXHMK6EN74FX6SLCX2BN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Teucke, Christoph Weidenbach","submitted_at":"2015-03-10T16:16:56Z","abstract_excerpt":"In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it gu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02971","kind":"arxiv","version":2},"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-18T02:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaKOa3VCvBHpo8liRD/y4YVhVaNwplqKdYajvTSVVxizayCq8fndNyKhnvFJ/tQjEjaO97vgM3F5gFCsTOClBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:29:07.721265Z"},"content_sha256":"242e3aff3e395e49adf8ad8c1a123e78f07e749d8086449e447e66eee2e3655d","schema_version":"1.0","event_id":"sha256:242e3aff3e395e49adf8ad8c1a123e78f07e749d8086449e447e66eee2e3655d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/bundle.json","state_url":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/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-02T20:29:07Z","links":{"resolver":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN","bundle":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/bundle.json","state":"https://pith.science/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRYNBGGXHMK6EN74FX6SLCX2BN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FRYNBGGXHMK6EN74FX6SLCX2BN","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":"71be271462996b0ea257b4401d7e76a806dabf2a8e4b05759cc1256ac1565b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-10T16:16:56Z","title_canon_sha256":"95b1195e8fb0ca3c7afabe458d5af9db35347cfc05a5514e90a8aca0d7d4d3b2"},"schema_version":"1.0","source":{"id":"1503.02971","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02971","created_at":"2026-05-18T02:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02971v2","created_at":"2026-05-18T02:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02971","created_at":"2026-05-18T02:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"FRYNBGGXHMK6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FRYNBGGXHMK6EN74","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FRYNBGGX","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:242e3aff3e395e49adf8ad8c1a123e78f07e749d8086449e447e66eee2e3655d","target":"graph","created_at":"2026-05-18T02:03:54Z","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 this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it gu","authors_text":"Andreas Teucke, Christoph Weidenbach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-10T16:16:56Z","title":"First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02971","kind":"arxiv","version":2},"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:efad02b7d69af964e555826715bee351990f2b2e12fca01585c2386faad7fda6","target":"record","created_at":"2026-05-18T02:03:54Z","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":"71be271462996b0ea257b4401d7e76a806dabf2a8e4b05759cc1256ac1565b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-10T16:16:56Z","title_canon_sha256":"95b1195e8fb0ca3c7afabe458d5af9db35347cfc05a5514e90a8aca0d7d4d3b2"},"schema_version":"1.0","source":{"id":"1503.02971","kind":"arxiv","version":2}},"canonical_sha256":"2c70d098d73b15e237fc2dfd258afa0b51d65f46bd07d793a123b52a208b7eb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c70d098d73b15e237fc2dfd258afa0b51d65f46bd07d793a123b52a208b7eb1","first_computed_at":"2026-05-18T02:03:54.765437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:54.765437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5zbmqGKYEmHa99V1emPR5RMh5PvkaGNh4Nvbn3decpLdpW3m2gRFZ9dbpZZcfCmrtL0o9WC12PRI41RUm5EoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:54.766249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02971","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efad02b7d69af964e555826715bee351990f2b2e12fca01585c2386faad7fda6","sha256:242e3aff3e395e49adf8ad8c1a123e78f07e749d8086449e447e66eee2e3655d"],"state_sha256":"b609b5bd1098ea7ce3b3379bd3f89e03084ff973ac2fb2dbceff5d3b9b140b78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QjpbSfVf+FarHKz3L1im+wWO14GhgXN4wXj+gzcfxEqaa3f4DmXmTqoA72S0lbXKOlU5quv4ZXNx6E/d+nOADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:29:07.723231Z","bundle_sha256":"fdf2d88a03a9c604bbcf83877d8ace4cdfc045b93fea71bbd5048e6f46a7c7df"}}