{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZXHR4JRVOW36TMBYURV7Z7GP32","short_pith_number":"pith:ZXHR4JRV","schema_version":"1.0","canonical_sha256":"cdcf1e263575b7e9b038a46bfcfccfdebb6e7ef92684b9d337b55b30d341eaea","source":{"kind":"arxiv","id":"1709.05384","version":1},"attestation_state":"computed","paper":{"title":"Nominal C-Unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Daniele Nantes-Sobrinho, Maribel Fern\\'andez, Mauricio Ayala-Rinc\\'on, Washington de Carvalho-Segundo","submitted_at":"2017-09-15T20:09:44Z","abstract_excerpt":"Nominal unification is an extension of first-order unification that takes into account the \\alpha-equivalence relation generated by binding operators, following the nominal approach. We propose a sound and complete procedure for nominal unification with commutative operators, or nominal C-unification for short, which has been formalised in Coq. The procedure transforms nominal C-unification problems into simpler (finite families) of fixpoint problems, whose solutions can be generated by algebraic techniques on combinatorics of permutations."},"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.05384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-15T20:09:44Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4c01355f90ce10f2aa454e7af96e81ca2e8bd97f82713ee021ea21fed1227bb0","abstract_canon_sha256":"5439d6170d386e46a6158d808c34826dd1f8c13fc2cdf5a494c4d51f7a9d434e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:00.963429Z","signature_b64":"g54keIBQqEkKdLD9NoJ2De92TEcTMmtPSwG9FvVDqI12OuAcMd5NCHlFiN2Hje5/X7B5CpTjuVnncjYAvnkhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdcf1e263575b7e9b038a46bfcfccfdebb6e7ef92684b9d337b55b30d341eaea","last_reissued_at":"2026-05-18T00:35:00.962464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:00.962464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nominal C-Unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Daniele Nantes-Sobrinho, Maribel Fern\\'andez, Mauricio Ayala-Rinc\\'on, Washington de Carvalho-Segundo","submitted_at":"2017-09-15T20:09:44Z","abstract_excerpt":"Nominal unification is an extension of first-order unification that takes into account the \\alpha-equivalence relation generated by binding operators, following the nominal approach. We propose a sound and complete procedure for nominal unification with commutative operators, or nominal C-unification for short, which has been formalised in Coq. The procedure transforms nominal C-unification problems into simpler (finite families) of fixpoint problems, whose solutions can be generated by algebraic techniques on combinatorics of permutations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05384","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":"1709.05384","created_at":"2026-05-18T00:35:00.962632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05384v1","created_at":"2026-05-18T00:35:00.962632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05384","created_at":"2026-05-18T00:35:00.962632+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXHR4JRVOW36","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXHR4JRVOW36TMBY","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXHR4JRV","created_at":"2026-05-18T12:31:59.375834+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/ZXHR4JRVOW36TMBYURV7Z7GP32","json":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32.json","graph_json":"https://pith.science/api/pith-number/ZXHR4JRVOW36TMBYURV7Z7GP32/graph.json","events_json":"https://pith.science/api/pith-number/ZXHR4JRVOW36TMBYURV7Z7GP32/events.json","paper":"https://pith.science/paper/ZXHR4JRV"},"agent_actions":{"view_html":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32","download_json":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32.json","view_paper":"https://pith.science/paper/ZXHR4JRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05384&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXHR4JRVOW36TMBYURV7Z7GP32/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXHR4JRVOW36TMBYURV7Z7GP32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32/action/storage_attestation","attest_author":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32/action/author_attestation","sign_citation":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32/action/citation_signature","submit_replication":"https://pith.science/pith/ZXHR4JRVOW36TMBYURV7Z7GP32/action/replication_record"}},"created_at":"2026-05-18T00:35:00.962632+00:00","updated_at":"2026-05-18T00:35:00.962632+00:00"}