{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:J4BZI26TWWFJULSSWDX2XQ6LEQ","short_pith_number":"pith:J4BZI26T","schema_version":"1.0","canonical_sha256":"4f03946bd3b58a9a2e52b0efabc3cb242b41156b44dac6dce67ac4325dd9d261","source":{"kind":"arxiv","id":"1012.4892","version":1},"attestation_state":"computed","paper":{"title":"A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"James Caldwell (University of Wyoming), Sunil Kothari (University of Wyoming)","submitted_at":"2010-12-22T07:07:52Z","abstract_excerpt":"We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been formalized in the Coq theorem prover.  Our proofs show that finite maps produced by the unification algorithm provide a model of the axioms characterizing idempotent MGUs of lists of constraints.  The axioms that serve as the basis for our verification are derived from a standard set by extending them to lists of constraints.  For us, constraints are equalities bet"},"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":"1012.4892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-12-22T07:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"127c666a8730d33d7131c52220328735c5ab95893cebe62b713124adc5d320c9","abstract_canon_sha256":"80402078b83e2f3fd9414dc27eb32a102dd583afef31d5f89f49624e7361483c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:45.014246Z","signature_b64":"9XVzFim/A2vO2m+6QQdnMIJG9LSnJtknthkUv06BVPja9xfqpMYInEXeHQJ9L5dD5THXdwpJcDp8yDKUiM0XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f03946bd3b58a9a2e52b0efabc3cb242b41156b44dac6dce67ac4325dd9d261","last_reissued_at":"2026-05-18T04:32:45.013781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:45.013781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"James Caldwell (University of Wyoming), Sunil Kothari (University of Wyoming)","submitted_at":"2010-12-22T07:07:52Z","abstract_excerpt":"We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been formalized in the Coq theorem prover.  Our proofs show that finite maps produced by the unification algorithm provide a model of the axioms characterizing idempotent MGUs of lists of constraints.  The axioms that serve as the basis for our verification are derived from a standard set by extending them to lists of constraints.  For us, constraints are equalities bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4892","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":"1012.4892","created_at":"2026-05-18T04:32:45.013854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4892v1","created_at":"2026-05-18T04:32:45.013854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4892","created_at":"2026-05-18T04:32:45.013854+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4BZI26TWWFJ","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4BZI26TWWFJULSS","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4BZI26T","created_at":"2026-05-18T12:26:09.077623+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/J4BZI26TWWFJULSSWDX2XQ6LEQ","json":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ.json","graph_json":"https://pith.science/api/pith-number/J4BZI26TWWFJULSSWDX2XQ6LEQ/graph.json","events_json":"https://pith.science/api/pith-number/J4BZI26TWWFJULSSWDX2XQ6LEQ/events.json","paper":"https://pith.science/paper/J4BZI26T"},"agent_actions":{"view_html":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ","download_json":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ.json","view_paper":"https://pith.science/paper/J4BZI26T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4892&json=true","fetch_graph":"https://pith.science/api/pith-number/J4BZI26TWWFJULSSWDX2XQ6LEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/J4BZI26TWWFJULSSWDX2XQ6LEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ/action/storage_attestation","attest_author":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ/action/author_attestation","sign_citation":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ/action/citation_signature","submit_replication":"https://pith.science/pith/J4BZI26TWWFJULSSWDX2XQ6LEQ/action/replication_record"}},"created_at":"2026-05-18T04:32:45.013854+00:00","updated_at":"2026-05-18T04:32:45.013854+00:00"}