{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WSFJUP5ZWQBGQJWOHE44KDF6QQ","short_pith_number":"pith:WSFJUP5Z","canonical_record":{"source":{"id":"2605.05286","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-06T17:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"05ac1a7188eb7185baa2eab81ad51e9494a43855a13c424aec50d843107ff26a","abstract_canon_sha256":"cda8591e4b593d66ac3c849aeecfe170c0a127d5e4d6c0326df35d911c9fdbc9"},"schema_version":"1.0"},"canonical_sha256":"b48a9a3fb9b4026826ce3939c50cbe843fea20278ca7700313c92b0c4f120f5f","source":{"kind":"arxiv","id":"2605.05286","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.05286","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.05286v2","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.05286","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"WSFJUP5ZWQBG","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"WSFJUP5ZWQBGQJWO","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"WSFJUP5Z","created_at":"2026-05-25T02:02:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WSFJUP5ZWQBGQJWOHE44KDF6QQ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.05286","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-06T17:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"05ac1a7188eb7185baa2eab81ad51e9494a43855a13c424aec50d843107ff26a","abstract_canon_sha256":"cda8591e4b593d66ac3c849aeecfe170c0a127d5e4d6c0326df35d911c9fdbc9"},"schema_version":"1.0"},"canonical_sha256":"b48a9a3fb9b4026826ce3939c50cbe843fea20278ca7700313c92b0c4f120f5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:16.304516Z","signature_b64":"fPf6ifPQWdqKpb0SRLGhwDkNLUeoTyTVw6mI6LF9AYM7g+jtD6rZZ5mpJPTH2tqpApU+Zr3eA/9h8WI/TU/6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b48a9a3fb9b4026826ce3939c50cbe843fea20278ca7700313c92b0c4f120f5f","last_reissued_at":"2026-05-25T02:02:16.303878Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:16.303878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.05286","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-25T02:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxRluuoofnUXkHwL+v3+bA4ERwQ82iUex7b6vJeUYfVq0UEiFasAA5qxAC5lDv3BqY5iruhBCOB/Zxc8zJveBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:22.767289Z"},"content_sha256":"1cee6b31571b33987473d3111475c99d1356786b401a888b4a6b6b7119bf2de9","schema_version":"1.0","event_id":"sha256:1cee6b31571b33987473d3111475c99d1356786b401a888b4a6b6b7119bf2de9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WSFJUP5ZWQBGQJWOHE44KDF6QQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Approximating fixpoint theory defines paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hannes Strass, Jeroen Spaans, Jesse Heyninck, Pascal Kettmann","submitted_at":"2026-05-06T17:55:28Z","abstract_excerpt":"In logic programming, negation can be interpreted in various ways. Probably best known is the concept of \"negation as failure\", where \"$\\mathit{not}\\, p$\" is true if we have no evidence for $p$. On the other hand, strong negation requires that we have evidence for $p$ being false. Defining semantics for logic programs containing both kinds of negation is a challenging task, and this becomes even more challenging when combining this with other extensions of logic programming, e.g. fuzziness. In this work, we use the framework of approximating fixpoint theory to formulate well-behaved semantics "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we use the framework of approximating fixpoint theory to formulate well-behaved semantics for fuzzy logic programs containing both 'by-failure' and strong negation. We show that this framework generalizes several existing semantics as well as giving rise to a host of new semantics.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That approximation fixpoint theory can be directly applied to fuzzy logic programs with both kinds of negation while ensuring the resulting semantics are well-behaved and paraconsistent without additional unstated restrictions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation are formulated using approximation fixpoint theory, generalizing prior semantics and yielding new ones.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Approximating fixpoint theory defines paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7decede107f3b79544d22180ca4c04fd1cc1492fdf7086bd82afc2c8bb060e00"},"source":{"id":"2605.05286","kind":"arxiv","version":2},"verdict":{"id":"df44afb7-55f0-4e0c-bcd8-f153d5c5ce70","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T15:52:44.096071Z","strongest_claim":"we use the framework of approximating fixpoint theory to formulate well-behaved semantics for fuzzy logic programs containing both 'by-failure' and strong negation. We show that this framework generalizes several existing semantics as well as giving rise to a host of new semantics.","one_line_summary":"Paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation are formulated using approximation fixpoint theory, generalizing prior semantics and yielding new ones.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That approximation fixpoint theory can be directly applied to fuzzy logic programs with both kinds of negation while ensuring the resulting semantics are well-behaved and paraconsistent without additional unstated restrictions.","pith_extraction_headline":"Approximating fixpoint theory defines paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.05286/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T10:35:26.013986Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.731738Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T13:47:12.011728Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6475afe1ef7d62ab93890bef9c0ba6d7470eb61e34530ac598e1d29eb4a22b40"},"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":"df44afb7-55f0-4e0c-bcd8-f153d5c5ce70"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJOUAG5n0YzsHFaOSus3BZpmkTieTwwQDQupzZXHzhV9qHYa1zr7EY4NpCSQbEP5Gr7hUQFk8SZofdkK865pCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:22.767806Z"},"content_sha256":"940159b97123fcb39ef8256115c6339038ca0088a2e355087f6f7a6a1f84fbc9","schema_version":"1.0","event_id":"sha256:940159b97123fcb39ef8256115c6339038ca0088a2e355087f6f7a6a1f84fbc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSFJUP5ZWQBGQJWOHE44KDF6QQ/bundle.json","state_url":"https://pith.science/pith/WSFJUP5ZWQBGQJWOHE44KDF6QQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSFJUP5ZWQBGQJWOHE44KDF6QQ/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-10T21:49:22Z","links":{"resolver":"https://pith.science/pith/WSFJUP5ZWQBGQJWOHE44KDF6QQ","bundle":"https://pith.science/pith/WSFJUP5ZWQBGQJWOHE44KDF6QQ/bundle.json","state":"https://pith.science/pith/WSFJUP5ZWQBGQJWOHE44KDF6QQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSFJUP5ZWQBGQJWOHE44KDF6QQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WSFJUP5ZWQBGQJWOHE44KDF6QQ","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":"cda8591e4b593d66ac3c849aeecfe170c0a127d5e4d6c0326df35d911c9fdbc9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-06T17:55:28Z","title_canon_sha256":"05ac1a7188eb7185baa2eab81ad51e9494a43855a13c424aec50d843107ff26a"},"schema_version":"1.0","source":{"id":"2605.05286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.05286","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.05286v2","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.05286","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"WSFJUP5ZWQBG","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"WSFJUP5ZWQBGQJWO","created_at":"2026-05-25T02:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"WSFJUP5Z","created_at":"2026-05-25T02:02:16Z"}],"graph_snapshots":[{"event_id":"sha256:940159b97123fcb39ef8256115c6339038ca0088a2e355087f6f7a6a1f84fbc9","target":"graph","created_at":"2026-05-25T02:02:16Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we use the framework of approximating fixpoint theory to formulate well-behaved semantics for fuzzy logic programs containing both 'by-failure' and strong negation. We show that this framework generalizes several existing semantics as well as giving rise to a host of new semantics."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That approximation fixpoint theory can be directly applied to fuzzy logic programs with both kinds of negation while ensuring the resulting semantics are well-behaved and paraconsistent without additional unstated restrictions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation are formulated using approximation fixpoint theory, generalizing prior semantics and yielding new ones."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Approximating fixpoint theory defines paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation."}],"snapshot_sha256":"7decede107f3b79544d22180ca4c04fd1cc1492fdf7086bd82afc2c8bb060e00"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T10:35:26.013986Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.731738Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T13:47:12.011728Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.05286/integrity.json","findings":[],"snapshot_sha256":"6475afe1ef7d62ab93890bef9c0ba6d7470eb61e34530ac598e1d29eb4a22b40","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In logic programming, negation can be interpreted in various ways. Probably best known is the concept of \"negation as failure\", where \"$\\mathit{not}\\, p$\" is true if we have no evidence for $p$. On the other hand, strong negation requires that we have evidence for $p$ being false. Defining semantics for logic programs containing both kinds of negation is a challenging task, and this becomes even more challenging when combining this with other extensions of logic programming, e.g. fuzziness. In this work, we use the framework of approximating fixpoint theory to formulate well-behaved semantics ","authors_text":"Hannes Strass, Jeroen Spaans, Jesse Heyninck, Pascal Kettmann","cross_cats":[],"headline":"Approximating fixpoint theory defines paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-06T17:55:28Z","title":"Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.05286","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T15:52:44.096071Z","id":"df44afb7-55f0-4e0c-bcd8-f153d5c5ce70","model_set":{"reader":"grok-4.3"},"one_line_summary":"Paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation are formulated using approximation fixpoint theory, generalizing prior semantics and yielding new ones.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Approximating fixpoint theory defines paraconsistent semantics for fuzzy logic programs containing both negation as failure and strong negation.","strongest_claim":"we use the framework of approximating fixpoint theory to formulate well-behaved semantics for fuzzy logic programs containing both 'by-failure' and strong negation. We show that this framework generalizes several existing semantics as well as giving rise to a host of new semantics.","weakest_assumption":"That approximation fixpoint theory can be directly applied to fuzzy logic programs with both kinds of negation while ensuring the resulting semantics are well-behaved and paraconsistent without additional unstated restrictions."}},"verdict_id":"df44afb7-55f0-4e0c-bcd8-f153d5c5ce70"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1cee6b31571b33987473d3111475c99d1356786b401a888b4a6b6b7119bf2de9","target":"record","created_at":"2026-05-25T02:02:16Z","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":"cda8591e4b593d66ac3c849aeecfe170c0a127d5e4d6c0326df35d911c9fdbc9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-06T17:55:28Z","title_canon_sha256":"05ac1a7188eb7185baa2eab81ad51e9494a43855a13c424aec50d843107ff26a"},"schema_version":"1.0","source":{"id":"2605.05286","kind":"arxiv","version":2}},"canonical_sha256":"b48a9a3fb9b4026826ce3939c50cbe843fea20278ca7700313c92b0c4f120f5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b48a9a3fb9b4026826ce3939c50cbe843fea20278ca7700313c92b0c4f120f5f","first_computed_at":"2026-05-25T02:02:16.303878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:16.303878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fPf6ifPQWdqKpb0SRLGhwDkNLUeoTyTVw6mI6LF9AYM7g+jtD6rZZ5mpJPTH2tqpApU+Zr3eA/9h8WI/TU/6DQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:16.304516Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.05286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cee6b31571b33987473d3111475c99d1356786b401a888b4a6b6b7119bf2de9","sha256:940159b97123fcb39ef8256115c6339038ca0088a2e355087f6f7a6a1f84fbc9"],"state_sha256":"ff29194ed7457f9b476d43a2c87d41616d6d3e2d0a6094a29824407bbcde4cd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHo0EujC1FeHb8VCTrAMElEoEP9bCvXtMFqRgID4xa3496ZDnrC4rudUYf+3Aa7QD6cZOtUr5s2TmmH0vjcwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:49:22.770051Z","bundle_sha256":"23e3a6a48a0a91bcf865bdf73a1cc592a46eade8dc107132cadb9874e9b137b4"}}