{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OOATAXNBBLYUB4M44G5FXS4U6M","short_pith_number":"pith:OOATAXNB","canonical_record":{"source":{"id":"1908.01200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-08-03T17:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"274d904ce085f4e79a9a89b9ba5e9e5614b4a53ae46125693e805aa26d3807b8","abstract_canon_sha256":"d02c65233163ad67ac3f8a9bd9c395a0268764b7b3251feacd5a787d50529fc6"},"schema_version":"1.0"},"canonical_sha256":"7381305da10af140f19ce1ba5bcb94f30fecd95395677e5e399d0aebfc4adad7","source":{"kind":"arxiv","id":"1908.01200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01200","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01200v1","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01200","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"pith_short_12","alias_value":"OOATAXNBBLYU","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"pith_short_16","alias_value":"OOATAXNBBLYUB4M4","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"pith_short_8","alias_value":"OOATAXNB","created_at":"2026-07-04T23:51:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OOATAXNBBLYUB4M44G5FXS4U6M","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-08-03T17:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"274d904ce085f4e79a9a89b9ba5e9e5614b4a53ae46125693e805aa26d3807b8","abstract_canon_sha256":"d02c65233163ad67ac3f8a9bd9c395a0268764b7b3251feacd5a787d50529fc6"},"schema_version":"1.0"},"canonical_sha256":"7381305da10af140f19ce1ba5bcb94f30fecd95395677e5e399d0aebfc4adad7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:27.917938Z","signature_b64":"523bGVuxx3jKyvzaekGUqIRWQSh6agDhk+5Q/3Vz8h1GsGlmm8Lg0Mc+nTCYnrdxr91SF1+hWU7qFktPpAsfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7381305da10af140f19ce1ba5bcb94f30fecd95395677e5e399d0aebfc4adad7","last_reissued_at":"2026-07-04T23:51:27.917543Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:27.917543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01200","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-07-04T23:51:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/jayI78pfwMSpuAIX2VkQwU5hJwG3jmO4R5uIkmBO53jLCJvYLpPpkGMQq0zJ/O6GzMyUZjTxNSZ3dEI+z0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:31:47.514726Z"},"content_sha256":"3aa4247076e6776470973c0509d59b9ef9bf700a4f87add364f554be897e0e03","schema_version":"1.0","event_id":"sha256:3aa4247076e6776470973c0509d59b9ef9bf700a4f87add364f554be897e0e03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OOATAXNBBLYUB4M44G5FXS4U6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Finite-Valued Approximations of General Propositional Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Matthias Baaz, Richard Zach","submitted_at":"2019-08-03T17:06:48Z","abstract_excerpt":"Propositional logics in general, considered as a set of sentences, can be undecidable even if they have \"nice\" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple - at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways can be approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01200","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01200/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:51:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WDUWnVBvIJRCPgjXKlq/t41S/5l0jVcqfFFR+/VrLpnHN8ztCJ3GIFtmGqq5PeZibggl4fnMUbEUMLgPRM6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:31:47.515595Z"},"content_sha256":"6adf9812492a5000a8d2c9849ed2058506e099e9d2ed9aff9a1a2915ac961aa3","schema_version":"1.0","event_id":"sha256:6adf9812492a5000a8d2c9849ed2058506e099e9d2ed9aff9a1a2915ac961aa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOATAXNBBLYUB4M44G5FXS4U6M/bundle.json","state_url":"https://pith.science/pith/OOATAXNBBLYUB4M44G5FXS4U6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOATAXNBBLYUB4M44G5FXS4U6M/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-08-16T09:31:47Z","links":{"resolver":"https://pith.science/pith/OOATAXNBBLYUB4M44G5FXS4U6M","bundle":"https://pith.science/pith/OOATAXNBBLYUB4M44G5FXS4U6M/bundle.json","state":"https://pith.science/pith/OOATAXNBBLYUB4M44G5FXS4U6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOATAXNBBLYUB4M44G5FXS4U6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OOATAXNBBLYUB4M44G5FXS4U6M","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":"d02c65233163ad67ac3f8a9bd9c395a0268764b7b3251feacd5a787d50529fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-08-03T17:06:48Z","title_canon_sha256":"274d904ce085f4e79a9a89b9ba5e9e5614b4a53ae46125693e805aa26d3807b8"},"schema_version":"1.0","source":{"id":"1908.01200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01200","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01200v1","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01200","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"pith_short_12","alias_value":"OOATAXNBBLYU","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"pith_short_16","alias_value":"OOATAXNBBLYUB4M4","created_at":"2026-07-04T23:51:27Z"},{"alias_kind":"pith_short_8","alias_value":"OOATAXNB","created_at":"2026-07-04T23:51:27Z"}],"graph_snapshots":[{"event_id":"sha256:6adf9812492a5000a8d2c9849ed2058506e099e9d2ed9aff9a1a2915ac961aa3","target":"graph","created_at":"2026-07-04T23:51:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Propositional logics in general, considered as a set of sentences, can be undecidable even if they have \"nice\" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple - at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways can be approx","authors_text":"Matthias Baaz, Richard Zach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-08-03T17:06:48Z","title":"Effective Finite-Valued Approximations of General Propositional Logics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01200","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:3aa4247076e6776470973c0509d59b9ef9bf700a4f87add364f554be897e0e03","target":"record","created_at":"2026-07-04T23:51:27Z","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":"d02c65233163ad67ac3f8a9bd9c395a0268764b7b3251feacd5a787d50529fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-08-03T17:06:48Z","title_canon_sha256":"274d904ce085f4e79a9a89b9ba5e9e5614b4a53ae46125693e805aa26d3807b8"},"schema_version":"1.0","source":{"id":"1908.01200","kind":"arxiv","version":1}},"canonical_sha256":"7381305da10af140f19ce1ba5bcb94f30fecd95395677e5e399d0aebfc4adad7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7381305da10af140f19ce1ba5bcb94f30fecd95395677e5e399d0aebfc4adad7","first_computed_at":"2026-07-04T23:51:27.917543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:27.917543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"523bGVuxx3jKyvzaekGUqIRWQSh6agDhk+5Q/3Vz8h1GsGlmm8Lg0Mc+nTCYnrdxr91SF1+hWU7qFktPpAsfCw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:27.917938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aa4247076e6776470973c0509d59b9ef9bf700a4f87add364f554be897e0e03","sha256:6adf9812492a5000a8d2c9849ed2058506e099e9d2ed9aff9a1a2915ac961aa3"],"state_sha256":"f296520d6f3dcf58486dfd4c7b0b528f4cfab418e12863423f8166497fc547c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3CnlmXxZ2heozzNYb/NVAfmeDNcrZJVCAahjYTVEBmJiQwGRAU7TwwBh+1z9nr3D/M/EbCuAxDnURd24SaHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:31:47.520650Z","bundle_sha256":"eb5c9b51481385450f2a868d7d6b929c143912b34886ec79168753fad287907a"}}