{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BSRNSNRZIL6664KVFTQLJXTZ6S","short_pith_number":"pith:BSRNSNRZ","schema_version":"1.0","canonical_sha256":"0ca2d9363942fdef71552ce0b4de79f4aaf0c5ac39991bb54a4c4ab247b4e530","source":{"kind":"arxiv","id":"1203.6160","version":1},"attestation_state":"computed","paper":{"title":"A Formalization of the Theorem of Existence of First-Order Most General Unifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andr\\'eia B Avelar (Universidade de Bras\\'ilia), Andr\\'e L Galdino (Universidade Federal de Goi\\'as), Fl\\'avio LC de Moura (Universidade de Bras\\'ilia), Mauricio Ayala-Rinc\\'on (Universidade de Bras\\'ilia)","submitted_at":"2012-03-28T05:06:30Z","abstract_excerpt":"This work presents a formalization of the theorem of existence of  most general unifiers in first-order signatures in the higher-order  proof assistant PVS. The distinguishing feature of this  formalization is that it remains close to the textbook proofs that  are based on proving the correctness of the well-known Robinson's first-order unification algorithm. The formalization was applied  inside a PVS development for term rewriting systems that provides a  complete formalization of the Knuth-Bendix Critical Pair theorem,  among other relevant theorems of the theory of rewriting. In  addition,"},"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":"1203.6160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-28T05:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"285a7cb1ece182fb5f1dd178f6e4503a807eb87dbc2e5cf29e94b1223050ac3d","abstract_canon_sha256":"0238f62d62110853b24d473dcaa05c0c22a08fa01ed7311680cbae4046e21738"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:03.993260Z","signature_b64":"73tOMhp9eZKoR1JjWP10TXuHAUWyz5erPZV6wMfVqAL560YDRTlRgfzwmMrq0Qi+tMn1RqmHDnkJEuUf+K/TCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ca2d9363942fdef71552ce0b4de79f4aaf0c5ac39991bb54a4c4ab247b4e530","last_reissued_at":"2026-05-18T03:59:03.992755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:03.992755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Formalization of the Theorem of Existence of First-Order Most General Unifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andr\\'eia B Avelar (Universidade de Bras\\'ilia), Andr\\'e L Galdino (Universidade Federal de Goi\\'as), Fl\\'avio LC de Moura (Universidade de Bras\\'ilia), Mauricio Ayala-Rinc\\'on (Universidade de Bras\\'ilia)","submitted_at":"2012-03-28T05:06:30Z","abstract_excerpt":"This work presents a formalization of the theorem of existence of  most general unifiers in first-order signatures in the higher-order  proof assistant PVS. The distinguishing feature of this  formalization is that it remains close to the textbook proofs that  are based on proving the correctness of the well-known Robinson's first-order unification algorithm. The formalization was applied  inside a PVS development for term rewriting systems that provides a  complete formalization of the Knuth-Bendix Critical Pair theorem,  among other relevant theorems of the theory of rewriting. In  addition,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6160","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":"1203.6160","created_at":"2026-05-18T03:59:03.992831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6160v1","created_at":"2026-05-18T03:59:03.992831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6160","created_at":"2026-05-18T03:59:03.992831+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSRNSNRZIL66","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSRNSNRZIL6664KV","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSRNSNRZ","created_at":"2026-05-18T12:27:01.376967+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/BSRNSNRZIL6664KVFTQLJXTZ6S","json":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S.json","graph_json":"https://pith.science/api/pith-number/BSRNSNRZIL6664KVFTQLJXTZ6S/graph.json","events_json":"https://pith.science/api/pith-number/BSRNSNRZIL6664KVFTQLJXTZ6S/events.json","paper":"https://pith.science/paper/BSRNSNRZ"},"agent_actions":{"view_html":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S","download_json":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S.json","view_paper":"https://pith.science/paper/BSRNSNRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6160&json=true","fetch_graph":"https://pith.science/api/pith-number/BSRNSNRZIL6664KVFTQLJXTZ6S/graph.json","fetch_events":"https://pith.science/api/pith-number/BSRNSNRZIL6664KVFTQLJXTZ6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S/action/storage_attestation","attest_author":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S/action/author_attestation","sign_citation":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S/action/citation_signature","submit_replication":"https://pith.science/pith/BSRNSNRZIL6664KVFTQLJXTZ6S/action/replication_record"}},"created_at":"2026-05-18T03:59:03.992831+00:00","updated_at":"2026-05-18T03:59:03.992831+00:00"}