{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JFEZ4C5N35QQIHDSAC4W53DAG4","short_pith_number":"pith:JFEZ4C5N","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"},"canonical_sha256":"49499e0baddf61041c7200b96eec6037196794081ee5c12ad3f072b953ade5b2","source":{"kind":"arxiv","id":"1303.6555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6555","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6555v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6555","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"JFEZ4C5N35QQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JFEZ4C5N35QQIHDS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JFEZ4C5N","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JFEZ4C5N35QQIHDSAC4W53DAG4","target":"record","payload":{"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"},"canonical_sha256":"49499e0baddf61041c7200b96eec6037196794081ee5c12ad3f072b953ade5b2","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"},"source_kind":"arxiv","source_id":"1303.6555","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-18T03:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4akEU4E/FEz+Tf7JIscKUUm3Ph2wrOAguWRTKnXXAEUgD8cJQ32oCqfVw1PHSPzT3DSQf7mLoyhEXIm+1IZsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:30:01.428462Z"},"content_sha256":"e357c023f63bf87dcfb6112a9b4f2253b8c5782774eb68939363898e6c0c2b1a","schema_version":"1.0","event_id":"sha256:e357c023f63bf87dcfb6112a9b4f2253b8c5782774eb68939363898e6c0c2b1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JFEZ4C5N35QQIHDSAC4W53DAG4","target":"graph","payload":{"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"},"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-18T03:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/+o+9wWcoCkIYHfl/7cK1S61ZTY4zSQeQav/GRzIPtP8Ju62rfb2BXv+Kv19vmXel/tyZQ8s6JSpzivylb2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:30:01.428874Z"},"content_sha256":"af56f2e96865c476c587ab9150ad314d7bdfab493092ad356a1eee70f210049d","schema_version":"1.0","event_id":"sha256:af56f2e96865c476c587ab9150ad314d7bdfab493092ad356a1eee70f210049d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/bundle.json","state_url":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/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-26T15:30:01Z","links":{"resolver":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4","bundle":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/bundle.json","state":"https://pith.science/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFEZ4C5N35QQIHDSAC4W53DAG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JFEZ4C5N35QQIHDSAC4W53DAG4","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":"e0e5c5b70ab2ccc3292991e48a3b61c6083e001b7d78a387541fb72a9b3cc8c8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-26T16:41:25Z","title_canon_sha256":"ae3c5b694bd3e44d026a91152bcf144407a728c46aabc620a9f7dddca242fd26"},"schema_version":"1.0","source":{"id":"1303.6555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6555","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6555v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6555","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"JFEZ4C5N35QQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JFEZ4C5N35QQIHDS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JFEZ4C5N","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:af56f2e96865c476c587ab9150ad314d7bdfab493092ad356a1eee70f210049d","target":"graph","created_at":"2026-05-18T03:29:49Z","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":"<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","authors_text":"D. Cenzer, J.B. Remmel, V.W. Marek","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-26T16:41:25Z","title":"Index sets for Finite Normal Predicate Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6555","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:e357c023f63bf87dcfb6112a9b4f2253b8c5782774eb68939363898e6c0c2b1a","target":"record","created_at":"2026-05-18T03:29:49Z","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":"e0e5c5b70ab2ccc3292991e48a3b61c6083e001b7d78a387541fb72a9b3cc8c8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-26T16:41:25Z","title_canon_sha256":"ae3c5b694bd3e44d026a91152bcf144407a728c46aabc620a9f7dddca242fd26"},"schema_version":"1.0","source":{"id":"1303.6555","kind":"arxiv","version":1}},"canonical_sha256":"49499e0baddf61041c7200b96eec6037196794081ee5c12ad3f072b953ade5b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49499e0baddf61041c7200b96eec6037196794081ee5c12ad3f072b953ade5b2","first_computed_at":"2026-05-18T03:29:49.064133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:49.064133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CqJJzWpBx9uuWYtwM48K4NAYC6gO1K23tD1mRb8SV4ZF/HTYRwOfwhHnRlB82hujlnTFFdQbmazojL/6rQ9kDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:49.064686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e357c023f63bf87dcfb6112a9b4f2253b8c5782774eb68939363898e6c0c2b1a","sha256:af56f2e96865c476c587ab9150ad314d7bdfab493092ad356a1eee70f210049d"],"state_sha256":"70fb332d5a1d3aef2e6797fd90a94663ff630ac808292caa7373a7167aeb67f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHisCrsxOs20tlPKrmD/35ysGaVJHrsy5ryd9uJbK2eQIwmEPNWSIiVuu5/UYkvdyicgcr4DNJoF0jAWhE9HBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:30:01.431995Z","bundle_sha256":"4f35bff6c263f0fc0b59318b8dbd2d7c27219d7d88800e104e07996b2bf3bc91"}}