{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IDIE6OR52CFDRPWWBTQCWZEJDA","short_pith_number":"pith:IDIE6OR5","schema_version":"1.0","canonical_sha256":"40d04f3a3dd08a38bed60ce02b6489182886afec59b64046eb8ffafe105746a9","source":{"kind":"arxiv","id":"1709.00964","version":4},"attestation_state":"computed","paper":{"title":"Lattice Operations on Terms over Similar Signatures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Gabriella Pasi, Hassan A\\\"it-Kaci","submitted_at":"2017-09-04T13:57:25Z","abstract_excerpt":"Unification and generalization are operations on two terms computing respectively their greatest lower bound and least upper bound when the terms are quasi-ordered by subsumption up to variable renaming (i.e., $t_1\\preceq t_2$ iff $t_1 = t_2\\sigma$ for some variable substitution $\\sigma$). When term signatures are such that distinct functor symbols may be related with a fuzzy equivalence (called a similarity), these operations can be formally extended to tolerate mismatches on functor names and/or arity or argument order. We reformulate and extend previous work with a declarative approach defi"},"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":"1709.00964","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-04T13:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"134e97f72956026ae72ff90c3d9c9d2a961bd66a52b174e26fadc990fd945f10","abstract_canon_sha256":"c1547470bffd3b57efcbab3eaa455d8931dc1d7df7333b74157330c0ea16d221"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:39.147076Z","signature_b64":"uQdVXwAvpR8kBviJM2nhJ+Mi+FlqHQEJyrgpb5uRuotRBJjk8I6QRfWm/7tcQSHeV9jd4S6LucEFmgmfp+bRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d04f3a3dd08a38bed60ce02b6489182886afec59b64046eb8ffafe105746a9","last_reissued_at":"2026-05-18T00:32:39.146439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:39.146439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice Operations on Terms over Similar Signatures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Gabriella Pasi, Hassan A\\\"it-Kaci","submitted_at":"2017-09-04T13:57:25Z","abstract_excerpt":"Unification and generalization are operations on two terms computing respectively their greatest lower bound and least upper bound when the terms are quasi-ordered by subsumption up to variable renaming (i.e., $t_1\\preceq t_2$ iff $t_1 = t_2\\sigma$ for some variable substitution $\\sigma$). When term signatures are such that distinct functor symbols may be related with a fuzzy equivalence (called a similarity), these operations can be formally extended to tolerate mismatches on functor names and/or arity or argument order. We reformulate and extend previous work with a declarative approach defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00964","kind":"arxiv","version":4},"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":"1709.00964","created_at":"2026-05-18T00:32:39.146539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00964v4","created_at":"2026-05-18T00:32:39.146539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00964","created_at":"2026-05-18T00:32:39.146539+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDIE6OR52CFD","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDIE6OR52CFDRPWW","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDIE6OR5","created_at":"2026-05-18T12:31:21.493067+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/IDIE6OR52CFDRPWWBTQCWZEJDA","json":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA.json","graph_json":"https://pith.science/api/pith-number/IDIE6OR52CFDRPWWBTQCWZEJDA/graph.json","events_json":"https://pith.science/api/pith-number/IDIE6OR52CFDRPWWBTQCWZEJDA/events.json","paper":"https://pith.science/paper/IDIE6OR5"},"agent_actions":{"view_html":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA","download_json":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA.json","view_paper":"https://pith.science/paper/IDIE6OR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00964&json=true","fetch_graph":"https://pith.science/api/pith-number/IDIE6OR52CFDRPWWBTQCWZEJDA/graph.json","fetch_events":"https://pith.science/api/pith-number/IDIE6OR52CFDRPWWBTQCWZEJDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA/action/storage_attestation","attest_author":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA/action/author_attestation","sign_citation":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA/action/citation_signature","submit_replication":"https://pith.science/pith/IDIE6OR52CFDRPWWBTQCWZEJDA/action/replication_record"}},"created_at":"2026-05-18T00:32:39.146539+00:00","updated_at":"2026-05-18T00:32:39.146539+00:00"}