{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SFXBMP2PQWMWZWBYHQEIU5ASIO","short_pith_number":"pith:SFXBMP2P","schema_version":"1.0","canonical_sha256":"916e163f4f85996cd8383c088a741243add21a12d646d93a4c6409d3f27c5161","source":{"kind":"arxiv","id":"1907.00227","version":1},"attestation_state":"computed","paper":{"title":"On Asymmetric Unification for the Theory of XOR with a Homomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Andrew M. Marshall, Catherine Meadows, Christopher Lynch, Paliath Narendran, Veena Ravishankar","submitted_at":"2019-06-29T15:57:54Z","abstract_excerpt":"Asymmetric unification, or unification with irreducibility constraints, is a newly developed paradigm that arose out of the automated analysis of cryptographic protocols. However, there are still relatively few asymmetric unification algorithms. In this paper we address this lack by exploring the application of automata-based unification methods. We examine the theory of xor with a homomorphism, ACUNh, from the point of view of asymmetric unification, and develop a new automata-based decision procedure. Then, we adapt a recently developed asymmetric combination procedure to produce a general a"},"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":"1907.00227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-06-29T15:57:54Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"aa9ba2321d3ce7d3d6896f3c807f9423d1b4b0cd24db0c513ced05d9afed9750","abstract_canon_sha256":"407dc2c32986a4df586de86bcabfd2953287ffbdbaa0e94b91453549a6951b95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.440067Z","signature_b64":"KCmMOw1nU+k3NDaMVxrttLxRPqtxv8q/uhzazGwKqOuYkHQlWQCfsU9ypdZ9f1Ngm2Qiccnhot59mQ6VlfwmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"916e163f4f85996cd8383c088a741243add21a12d646d93a4c6409d3f27c5161","last_reissued_at":"2026-05-17T23:41:52.439428Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.439428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Asymmetric Unification for the Theory of XOR with a Homomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Andrew M. Marshall, Catherine Meadows, Christopher Lynch, Paliath Narendran, Veena Ravishankar","submitted_at":"2019-06-29T15:57:54Z","abstract_excerpt":"Asymmetric unification, or unification with irreducibility constraints, is a newly developed paradigm that arose out of the automated analysis of cryptographic protocols. However, there are still relatively few asymmetric unification algorithms. In this paper we address this lack by exploring the application of automata-based unification methods. We examine the theory of xor with a homomorphism, ACUNh, from the point of view of asymmetric unification, and develop a new automata-based decision procedure. Then, we adapt a recently developed asymmetric combination procedure to produce a general a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00227","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":"1907.00227","created_at":"2026-05-17T23:41:52.439529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00227v1","created_at":"2026-05-17T23:41:52.439529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00227","created_at":"2026-05-17T23:41:52.439529+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFXBMP2PQWMW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFXBMP2PQWMWZWBY","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFXBMP2P","created_at":"2026-05-18T12:33:27.125529+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/SFXBMP2PQWMWZWBYHQEIU5ASIO","json":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO.json","graph_json":"https://pith.science/api/pith-number/SFXBMP2PQWMWZWBYHQEIU5ASIO/graph.json","events_json":"https://pith.science/api/pith-number/SFXBMP2PQWMWZWBYHQEIU5ASIO/events.json","paper":"https://pith.science/paper/SFXBMP2P"},"agent_actions":{"view_html":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO","download_json":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO.json","view_paper":"https://pith.science/paper/SFXBMP2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00227&json=true","fetch_graph":"https://pith.science/api/pith-number/SFXBMP2PQWMWZWBYHQEIU5ASIO/graph.json","fetch_events":"https://pith.science/api/pith-number/SFXBMP2PQWMWZWBYHQEIU5ASIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO/action/storage_attestation","attest_author":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO/action/author_attestation","sign_citation":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO/action/citation_signature","submit_replication":"https://pith.science/pith/SFXBMP2PQWMWZWBYHQEIU5ASIO/action/replication_record"}},"created_at":"2026-05-17T23:41:52.439529+00:00","updated_at":"2026-05-17T23:41:52.439529+00:00"}