{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L54F64ZPQVD6Y22KBQXNXXRO7H","short_pith_number":"pith:L54F64ZP","canonical_record":{"source":{"id":"1402.5436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-21T22:17:39Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"382c38d547534f73806fc26b426fec0260ee525437596e688ad54795729ca06b","abstract_canon_sha256":"9649727390387b9e59e2ccd47f3b9487762cc435fe9a6dd134c52cbc3ee1c56c"},"schema_version":"1.0"},"canonical_sha256":"5f785f732f8547ec6b4a0c2edbde2ef9e52982d98915e952562ece0576086184","source":{"kind":"arxiv","id":"1402.5436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5436","created_at":"2026-05-18T02:58:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5436v1","created_at":"2026-05-18T02:58:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5436","created_at":"2026-05-18T02:58:21Z"},{"alias_kind":"pith_short_12","alias_value":"L54F64ZPQVD6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L54F64ZPQVD6Y22K","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L54F64ZP","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L54F64ZPQVD6Y22KBQXNXXRO7H","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-21T22:17:39Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"382c38d547534f73806fc26b426fec0260ee525437596e688ad54795729ca06b","abstract_canon_sha256":"9649727390387b9e59e2ccd47f3b9487762cc435fe9a6dd134c52cbc3ee1c56c"},"schema_version":"1.0"},"canonical_sha256":"5f785f732f8547ec6b4a0c2edbde2ef9e52982d98915e952562ece0576086184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:21.143156Z","signature_b64":"EQOnI4kHe+YdFSG5ciWSzVha6aUIs50YbUF+jTOguMeuO2y6rGdaTlWGGU6YulUkYn17IpTfgKHwHEXAtL8fAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f785f732f8547ec6b4a0c2edbde2ef9e52982d98915e952562ece0576086184","last_reissued_at":"2026-05-18T02:58:21.142478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:21.142478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5436","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:58:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlcic8Qp07m0N4sYGRsL4tkUWsBqPlmkWak/0BeOjZUsje5zdwfYD4wVA77o+Xswn0CtY9Q2mjlFIfe34nu8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:00.083661Z"},"content_sha256":"06ed9e1661f820498f096ad64ead6e8e217229888044b900ed0965486e64f996","schema_version":"1.0","event_id":"sha256:06ed9e1661f820498f096ad64ead6e8e217229888044b900ed0965486e64f996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L54F64ZPQVD6Y22KBQXNXXRO7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing and computing stable models of logic programs: The non-stratified case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Alessandro Provetti, Gianpaolo Brignoli, Ottavio D'Antona, Stefania Costantini","submitted_at":"2014-02-21T22:17:39Z","abstract_excerpt":"Stable Logic Programming (SLP) is an emergent, alternative style of logic programming: each solution to a problem is represented by a stable model of a deductive database/function-free logic program encoding the problem itself. Several implementations now exist for stable logic programming, and their performance is rapidly improving. To make SLP generally applicable, it should be possible to check for consistency (i.e., existence of stable models) of the input program before attempting to answer queries. In the literature, only rather strong sufficient conditions have been proposed for consist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5436","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:58:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmIGm3j6m+6M32+9mT6yCY3eFJIOZWQT6jVkgIY7UaLiW5V2ii9ZQcymQcspsBVrHkBk5j7/KVC2THjJo8KEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:00.084270Z"},"content_sha256":"a07ab7944d4de77235cd6d7853a7be89a1a61ad282fc39e479286ca80beefddc","schema_version":"1.0","event_id":"sha256:a07ab7944d4de77235cd6d7853a7be89a1a61ad282fc39e479286ca80beefddc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L54F64ZPQVD6Y22KBQXNXXRO7H/bundle.json","state_url":"https://pith.science/pith/L54F64ZPQVD6Y22KBQXNXXRO7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L54F64ZPQVD6Y22KBQXNXXRO7H/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-08T17:02:00Z","links":{"resolver":"https://pith.science/pith/L54F64ZPQVD6Y22KBQXNXXRO7H","bundle":"https://pith.science/pith/L54F64ZPQVD6Y22KBQXNXXRO7H/bundle.json","state":"https://pith.science/pith/L54F64ZPQVD6Y22KBQXNXXRO7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L54F64ZPQVD6Y22KBQXNXXRO7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L54F64ZPQVD6Y22KBQXNXXRO7H","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":"9649727390387b9e59e2ccd47f3b9487762cc435fe9a6dd134c52cbc3ee1c56c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-21T22:17:39Z","title_canon_sha256":"382c38d547534f73806fc26b426fec0260ee525437596e688ad54795729ca06b"},"schema_version":"1.0","source":{"id":"1402.5436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5436","created_at":"2026-05-18T02:58:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5436v1","created_at":"2026-05-18T02:58:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5436","created_at":"2026-05-18T02:58:21Z"},{"alias_kind":"pith_short_12","alias_value":"L54F64ZPQVD6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L54F64ZPQVD6Y22K","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L54F64ZP","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:a07ab7944d4de77235cd6d7853a7be89a1a61ad282fc39e479286ca80beefddc","target":"graph","created_at":"2026-05-18T02:58:21Z","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":"Stable Logic Programming (SLP) is an emergent, alternative style of logic programming: each solution to a problem is represented by a stable model of a deductive database/function-free logic program encoding the problem itself. Several implementations now exist for stable logic programming, and their performance is rapidly improving. To make SLP generally applicable, it should be possible to check for consistency (i.e., existence of stable models) of the input program before attempting to answer queries. In the literature, only rather strong sufficient conditions have been proposed for consist","authors_text":"Alessandro Provetti, Gianpaolo Brignoli, Ottavio D'Antona, Stefania Costantini","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-21T22:17:39Z","title":"Characterizing and computing stable models of logic programs: The non-stratified case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5436","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:06ed9e1661f820498f096ad64ead6e8e217229888044b900ed0965486e64f996","target":"record","created_at":"2026-05-18T02:58:21Z","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":"9649727390387b9e59e2ccd47f3b9487762cc435fe9a6dd134c52cbc3ee1c56c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-21T22:17:39Z","title_canon_sha256":"382c38d547534f73806fc26b426fec0260ee525437596e688ad54795729ca06b"},"schema_version":"1.0","source":{"id":"1402.5436","kind":"arxiv","version":1}},"canonical_sha256":"5f785f732f8547ec6b4a0c2edbde2ef9e52982d98915e952562ece0576086184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f785f732f8547ec6b4a0c2edbde2ef9e52982d98915e952562ece0576086184","first_computed_at":"2026-05-18T02:58:21.142478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:21.142478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EQOnI4kHe+YdFSG5ciWSzVha6aUIs50YbUF+jTOguMeuO2y6rGdaTlWGGU6YulUkYn17IpTfgKHwHEXAtL8fAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:21.143156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06ed9e1661f820498f096ad64ead6e8e217229888044b900ed0965486e64f996","sha256:a07ab7944d4de77235cd6d7853a7be89a1a61ad282fc39e479286ca80beefddc"],"state_sha256":"06596582a91d7465e9ed9b511bc00c2b62c3e04c23e7a8205b32475e21e33a4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugsEokHCJOy8BUTu7Mne2aJ47Qi3HEGiBM9SF39PDx8nBXDG811stNIWoZGYMXnvx0eCOtWiiVPPHkRBqNquDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:02:00.088220Z","bundle_sha256":"77c0e7842fd3896e43eafe0597a7775b00a3229662dc0a7ad54bd8cd7c79a5b1"}}