{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZOGGIK5VNNIHWDSMDUWECH4HMY","short_pith_number":"pith:ZOGGIK5V","schema_version":"1.0","canonical_sha256":"cb8c642bb56b507b0e4c1d2c411f87662ee506c5b20271b2095c0b8d5b2e35e8","source":{"kind":"arxiv","id":"1506.06166","version":1},"attestation_state":"computed","paper":{"title":"A Type-Theoretic Approach to Structural Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ekaterina Komendantskaya, Peng Fu","submitted_at":"2015-06-19T21:52:13Z","abstract_excerpt":"Structural resolution (or S-resolution) is a newly proposed alternative to SLD-resolution that allows a systematic separation of derivations into term-matching and unification steps. Productive logic programs are those for which term-matching reduction on any query must terminate. For productive programs with coinductive meaning, finite term-rewriting reductions can be seen as measures of observation in an infinite derivation. Ability of handling corecursion in a productive way is an attractive computational feature of S-resolution.\n  In this paper, we make first steps towards a better concept"},"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":"1506.06166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-19T21:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"cc229470f912e66d6cccbafb83c51251d3e39624bb503bcea1fd4d94a58f2f00","abstract_canon_sha256":"c0aa8cc6ff67604de59ca22f1199209d7373e4a8c1a9a285d78f5b0f0d24eb11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:58.573204Z","signature_b64":"gMpBZQyB/8n20VUHiWHcFC1wzI/4QCtEzBNQyt7TDRinq0UoPHw4zcJ1XCFMJcJtASfMuMowsiJ2u3VcBeBTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb8c642bb56b507b0e4c1d2c411f87662ee506c5b20271b2095c0b8d5b2e35e8","last_reissued_at":"2026-05-18T01:41:58.572564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:58.572564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Type-Theoretic Approach to Structural Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ekaterina Komendantskaya, Peng Fu","submitted_at":"2015-06-19T21:52:13Z","abstract_excerpt":"Structural resolution (or S-resolution) is a newly proposed alternative to SLD-resolution that allows a systematic separation of derivations into term-matching and unification steps. Productive logic programs are those for which term-matching reduction on any query must terminate. For productive programs with coinductive meaning, finite term-rewriting reductions can be seen as measures of observation in an infinite derivation. Ability of handling corecursion in a productive way is an attractive computational feature of S-resolution.\n  In this paper, we make first steps towards a better concept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06166","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":"1506.06166","created_at":"2026-05-18T01:41:58.572662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06166v1","created_at":"2026-05-18T01:41:58.572662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06166","created_at":"2026-05-18T01:41:58.572662+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOGGIK5VNNIH","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOGGIK5VNNIHWDSM","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOGGIK5V","created_at":"2026-05-18T12:29:52.810259+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/ZOGGIK5VNNIHWDSMDUWECH4HMY","json":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY.json","graph_json":"https://pith.science/api/pith-number/ZOGGIK5VNNIHWDSMDUWECH4HMY/graph.json","events_json":"https://pith.science/api/pith-number/ZOGGIK5VNNIHWDSMDUWECH4HMY/events.json","paper":"https://pith.science/paper/ZOGGIK5V"},"agent_actions":{"view_html":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY","download_json":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY.json","view_paper":"https://pith.science/paper/ZOGGIK5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06166&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOGGIK5VNNIHWDSMDUWECH4HMY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOGGIK5VNNIHWDSMDUWECH4HMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY/action/storage_attestation","attest_author":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY/action/author_attestation","sign_citation":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY/action/citation_signature","submit_replication":"https://pith.science/pith/ZOGGIK5VNNIHWDSMDUWECH4HMY/action/replication_record"}},"created_at":"2026-05-18T01:41:58.572662+00:00","updated_at":"2026-05-18T01:41:58.572662+00:00"}