{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JPNUGHML5QXB3WXUKO6743PHMM","short_pith_number":"pith:JPNUGHML","schema_version":"1.0","canonical_sha256":"4bdb431d8bec2e1ddaf453bdfe6de76301e806910fdf78fb9a6bda3fe434371d","source":{"kind":"arxiv","id":"1810.02254","version":1},"attestation_state":"computed","paper":{"title":"Deriving sorting algorithms via abductive logic program transformation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Manuel Hern\\'andez","submitted_at":"2018-10-04T14:51:58Z","abstract_excerpt":"Logic program transformation by the unfold/fold method ad- vocates the writing of correct logic programs via the application of some rules to a naive program. This work focuses on how to overcome subgoal- introduction difficulties in synthesizing efficient sorting algorithms from an naive sorting algorithm, through logic program transformation and abductive reasoning."},"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":"1810.02254","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-04T14:51:58Z","cross_cats_sorted":[],"title_canon_sha256":"e4691860f7ac091926cb705b0af28b6bcfe6395bc30c4b6721cf227f7d24ad39","abstract_canon_sha256":"f27ba1b97ac76c58bcbce93523728ff4326648f8dfc716d0031e5c5f0f3d817c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:05.813504Z","signature_b64":"SU7FiV9wSgrCmh5tr6d8dfx2E/YK/XupH2000IzcrW6HvSZEohcrR+YE+YTUu4g71TJnDOllMXtpw51EVchfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bdb431d8bec2e1ddaf453bdfe6de76301e806910fdf78fb9a6bda3fe434371d","last_reissued_at":"2026-05-18T00:04:05.812854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:05.812854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deriving sorting algorithms via abductive logic program transformation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Manuel Hern\\'andez","submitted_at":"2018-10-04T14:51:58Z","abstract_excerpt":"Logic program transformation by the unfold/fold method ad- vocates the writing of correct logic programs via the application of some rules to a naive program. This work focuses on how to overcome subgoal- introduction difficulties in synthesizing efficient sorting algorithms from an naive sorting algorithm, through logic program transformation and abductive reasoning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02254","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":"1810.02254","created_at":"2026-05-18T00:04:05.812943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02254v1","created_at":"2026-05-18T00:04:05.812943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02254","created_at":"2026-05-18T00:04:05.812943+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPNUGHML5QXB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPNUGHML5QXB3WXU","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPNUGHML","created_at":"2026-05-18T12:32:31.084164+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/JPNUGHML5QXB3WXUKO6743PHMM","json":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM.json","graph_json":"https://pith.science/api/pith-number/JPNUGHML5QXB3WXUKO6743PHMM/graph.json","events_json":"https://pith.science/api/pith-number/JPNUGHML5QXB3WXUKO6743PHMM/events.json","paper":"https://pith.science/paper/JPNUGHML"},"agent_actions":{"view_html":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM","download_json":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM.json","view_paper":"https://pith.science/paper/JPNUGHML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02254&json=true","fetch_graph":"https://pith.science/api/pith-number/JPNUGHML5QXB3WXUKO6743PHMM/graph.json","fetch_events":"https://pith.science/api/pith-number/JPNUGHML5QXB3WXUKO6743PHMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM/action/storage_attestation","attest_author":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM/action/author_attestation","sign_citation":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM/action/citation_signature","submit_replication":"https://pith.science/pith/JPNUGHML5QXB3WXUKO6743PHMM/action/replication_record"}},"created_at":"2026-05-18T00:04:05.812943+00:00","updated_at":"2026-05-18T00:04:05.812943+00:00"}