{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JFEZ4C5N35QQIHDSAC4W53DAG4","short_pith_number":"pith:JFEZ4C5N","schema_version":"1.0","canonical_sha256":"49499e0baddf61041c7200b96eec6037196794081ee5c12ad3f072b953ade5b2","source":{"kind":"arxiv","id":"1303.6555","version":1},"attestation_state":"computed","paper":{"title":"Index sets for Finite Normal Predicate Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"D. Cenzer, J.B. Remmel, V.W. Marek","submitted_at":"2013-03-26T16:41:25Z","abstract_excerpt":"<Q>_e is the effective list of all finite predicate logic programs. <T_e> is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i) there is a one-to-one degree preserving correspondence between the set of stable models of Q_e and the set of infinite paths through T_{f(e)} and (ii) there is a one-to-one degree preserving correspondence between the set of infinite paths through T_e and the set of stable models of Q_{g(e)}. We use these two recursive functions to reduce the problem of findin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1303.6555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-26T16:41:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ae3c5b694bd3e44d026a91152bcf144407a728c46aabc620a9f7dddca242fd26","abstract_canon_sha256":"e0e5c5b70ab2ccc3292991e48a3b61c6083e001b7d78a387541fb72a9b3cc8c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:49.064686Z","signature_b64":"CqJJzWpBx9uuWYtwM48K4NAYC6gO1K23tD1mRb8SV4ZF/HTYRwOfwhHnRlB82hujlnTFFdQbmazojL/6rQ9kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49499e0baddf61041c7200b96eec6037196794081ee5c12ad3f072b953ade5b2","last_reissued_at":"2026-05-18T03:29:49.064133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:49.064133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Index sets for Finite Normal Predicate Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"D. Cenzer, J.B. Remmel, V.W. Marek","submitted_at":"2013-03-26T16:41:25Z","abstract_excerpt":"<Q>_e is the effective list of all finite predicate logic programs. <T_e> is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i) there is a one-to-one degree preserving correspondence between the set of stable models of Q_e and the set of infinite paths through T_{f(e)} and (ii) there is a one-to-one degree preserving correspondence between the set of infinite paths through T_e and the set of stable models of Q_{g(e)}. We use these two recursive functions to reduce the problem of findin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6555","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.6555","created_at":"2026-05-18T03:29:49.064246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6555v1","created_at":"2026-05-18T03:29:49.064246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6555","created_at":"2026-05-18T03:29:49.064246+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFEZ4C5N35QQ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFEZ4C5N35QQIHDS","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFEZ4C5N","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4","json":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4.json","graph_json":"https://pith.science/api/pith-number/JFEZ4C5N35QQIHDSAC4W53DAG4/graph.json","events_json":"https://pith.science/api/pith-number/JFEZ4C5N35QQIHDSAC4W53DAG4/events.json","paper":"https://pith.science/paper/JFEZ4C5N"},"agent_actions":{"view_html":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4","download_json":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4.json","view_paper":"https://pith.science/paper/JFEZ4C5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6555&json=true","fetch_graph":"https://pith.science/api/pith-number/JFEZ4C5N35QQIHDSAC4W53DAG4/graph.json","fetch_events":"https://pith.science/api/pith-number/JFEZ4C5N35QQIHDSAC4W53DAG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/action/storage_attestation","attest_author":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/action/author_attestation","sign_citation":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/action/citation_signature","submit_replication":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/action/replication_record"}},"created_at":"2026-05-18T03:29:49.064246+00:00","updated_at":"2026-05-18T03:29:49.064246+00:00"}