{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OT7MQVEQZM6HZLDSEUCBZFJ5MS","short_pith_number":"pith:OT7MQVEQ","canonical_record":{"source":{"id":"1405.3365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-05-14T05:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"bafb2b11e24e440730dca3f4be04b74d477eda0a3711ca45db3866786347c1b5","abstract_canon_sha256":"3530ce1b2fe3e5a622bb4f2453ccf2e6f4eca8e06e6819c413bad38af911a32a"},"schema_version":"1.0"},"canonical_sha256":"74fec85490cb3c7cac7225041c953d64a799dcae73b7b3cea9cfc49952605608","source":{"kind":"arxiv","id":"1405.3365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.3365","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1405.3365v1","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3365","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"OT7MQVEQZM6H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OT7MQVEQZM6HZLDS","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OT7MQVEQ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OT7MQVEQZM6HZLDSEUCBZFJ5MS","target":"record","payload":{"canonical_record":{"source":{"id":"1405.3365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-05-14T05:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"bafb2b11e24e440730dca3f4be04b74d477eda0a3711ca45db3866786347c1b5","abstract_canon_sha256":"3530ce1b2fe3e5a622bb4f2453ccf2e6f4eca8e06e6819c413bad38af911a32a"},"schema_version":"1.0"},"canonical_sha256":"74fec85490cb3c7cac7225041c953d64a799dcae73b7b3cea9cfc49952605608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:56.242595Z","signature_b64":"9H+FEPj5s9m8mj4GM3Xp/Ojj/gK5p8oejVGBFLlMEM7EdhsBuICkf2Xl4gR9ADZKMyXb7+2AIiD6dQGcr5Y9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74fec85490cb3c7cac7225041c953d64a799dcae73b7b3cea9cfc49952605608","last_reissued_at":"2026-05-18T02:51:56.242061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:56.242061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.3365","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-18T02:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99BTWmHyhPO1agJOJ9+Dvu2539CCFjMtvtddyetwVn2qmwHWMmXeO3SyvhIIBMLimmrQ8EbvbBDpazwZDsOKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:14:08.288744Z"},"content_sha256":"d22432c817ab0793a94d1b8e2e95846953c49911e1878a368d23eba093a2dfa0","schema_version":"1.0","event_id":"sha256:d22432c817ab0793a94d1b8e2e95846953c49911e1878a368d23eba093a2dfa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OT7MQVEQZM6HZLDSEUCBZFJ5MS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Well-Founded Semantics for FOL-Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jia-Huai You, Yi Bi, Zhiyong Feng","submitted_at":"2014-05-14T05:29:40Z","abstract_excerpt":"An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsistent sets of literals, and study some of its properties. The semantics is defined for all FOL-programs, including those where it is necessary to represent inconsistencies explicitly. The semantics suppor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3365","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-18T02:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3ADbVe8/pjm9ALYvh4QcwLIrj6/o7zOBHvgv3eVHoXUoW2OzH8ZAH1hDMwY6fB9GocOruX9h5Oa8oZRhiWADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:14:08.289421Z"},"content_sha256":"5c8c7c71811252f56c62b4d1a18130cd7db9dab555ec3cda78b574f597b15540","schema_version":"1.0","event_id":"sha256:5c8c7c71811252f56c62b4d1a18130cd7db9dab555ec3cda78b574f597b15540"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/bundle.json","state_url":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/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-05-27T06:14:08Z","links":{"resolver":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS","bundle":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/bundle.json","state":"https://pith.science/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OT7MQVEQZM6HZLDSEUCBZFJ5MS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OT7MQVEQZM6HZLDSEUCBZFJ5MS","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":"3530ce1b2fe3e5a622bb4f2453ccf2e6f4eca8e06e6819c413bad38af911a32a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-05-14T05:29:40Z","title_canon_sha256":"bafb2b11e24e440730dca3f4be04b74d477eda0a3711ca45db3866786347c1b5"},"schema_version":"1.0","source":{"id":"1405.3365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.3365","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1405.3365v1","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3365","created_at":"2026-05-18T02:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"OT7MQVEQZM6H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OT7MQVEQZM6HZLDS","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OT7MQVEQ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:5c8c7c71811252f56c62b4d1a18130cd7db9dab555ec3cda78b574f597b15540","target":"graph","created_at":"2026-05-18T02:51:56Z","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":"An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsistent sets of literals, and study some of its properties. The semantics is defined for all FOL-programs, including those where it is necessary to represent inconsistencies explicitly. The semantics suppor","authors_text":"Jia-Huai You, Yi Bi, Zhiyong Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-05-14T05:29:40Z","title":"A Well-Founded Semantics for FOL-Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3365","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:d22432c817ab0793a94d1b8e2e95846953c49911e1878a368d23eba093a2dfa0","target":"record","created_at":"2026-05-18T02:51:56Z","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":"3530ce1b2fe3e5a622bb4f2453ccf2e6f4eca8e06e6819c413bad38af911a32a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-05-14T05:29:40Z","title_canon_sha256":"bafb2b11e24e440730dca3f4be04b74d477eda0a3711ca45db3866786347c1b5"},"schema_version":"1.0","source":{"id":"1405.3365","kind":"arxiv","version":1}},"canonical_sha256":"74fec85490cb3c7cac7225041c953d64a799dcae73b7b3cea9cfc49952605608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74fec85490cb3c7cac7225041c953d64a799dcae73b7b3cea9cfc49952605608","first_computed_at":"2026-05-18T02:51:56.242061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:56.242061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9H+FEPj5s9m8mj4GM3Xp/Ojj/gK5p8oejVGBFLlMEM7EdhsBuICkf2Xl4gR9ADZKMyXb7+2AIiD6dQGcr5Y9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:56.242595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.3365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d22432c817ab0793a94d1b8e2e95846953c49911e1878a368d23eba093a2dfa0","sha256:5c8c7c71811252f56c62b4d1a18130cd7db9dab555ec3cda78b574f597b15540"],"state_sha256":"a0a1aedf18f9f14ecfa757f5b26cfba1d91f0011a405d8f34c73c791d26e4540"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uvBY4LehEJJj+S6UQQzDSU1iOKbYH55+RB3d1cYCMKLVRidBN7qLWac/ZHg7PhRWrzrFCc8xF+Hx3DzXwCfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:14:08.292297Z","bundle_sha256":"82baff53e046c784fab49619c2915b3d36e5d4005b4d905426567cf15e2132bd"}}