{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4S4PHOZJCVXCHRCZEUIVNVKIFP","short_pith_number":"pith:4S4PHOZJ","schema_version":"1.0","canonical_sha256":"e4b8f3bb29156e23c459251156d5482bef162513701f8e6072d48613d4d57ee4","source":{"kind":"arxiv","id":"1503.06687","version":2},"attestation_state":"computed","paper":{"title":"On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrew M Marshall (The University of Mary Washington), Catherine Meadows (U.S. Naval Research Laboratory), Paliath Narendran (University at Albany, SUNY)","submitted_at":"2015-03-23T15:28:19Z","abstract_excerpt":"An algorithm for unification modulo one-sided distributivity is an early result by Tid\\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this property. Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed. In addition, for some instances, there exist most general unifiers that are exponentially large with respect to the input size. In this paper we first present a new polynomial time algorithm that solve"},"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":"1503.06687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-23T15:28:19Z","cross_cats_sorted":[],"title_canon_sha256":"b64748a652de55dd109637bab5800cdef91677927643406eb5f716bcf9e6ff8c","abstract_canon_sha256":"08644d7537d2a417ca40a0845bf82814c09fd52bb1d20056bd14322ad6948f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.843244Z","signature_b64":"gnJLhKqf6WHnMxSTS7p/GmNf/u+Jzv11OzNXHgpEh3Ixt0+nWrV9vAzgm31+Omg/CV81BL/9kJEec1OSq/wzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4b8f3bb29156e23c459251156d5482bef162513701f8e6072d48613d4d57ee4","last_reissued_at":"2026-05-18T00:53:10.842701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.842701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrew M Marshall (The University of Mary Washington), Catherine Meadows (U.S. Naval Research Laboratory), Paliath Narendran (University at Albany, SUNY)","submitted_at":"2015-03-23T15:28:19Z","abstract_excerpt":"An algorithm for unification modulo one-sided distributivity is an early result by Tid\\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this property. Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed. In addition, for some instances, there exist most general unifiers that are exponentially large with respect to the input size. In this paper we first present a new polynomial time algorithm that solve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06687","kind":"arxiv","version":2},"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":"1503.06687","created_at":"2026-05-18T00:53:10.842778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06687v2","created_at":"2026-05-18T00:53:10.842778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06687","created_at":"2026-05-18T00:53:10.842778+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S4PHOZJCVXC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S4PHOZJCVXCHRCZ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S4PHOZJ","created_at":"2026-05-18T12:29:05.191682+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/4S4PHOZJCVXCHRCZEUIVNVKIFP","json":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP.json","graph_json":"https://pith.science/api/pith-number/4S4PHOZJCVXCHRCZEUIVNVKIFP/graph.json","events_json":"https://pith.science/api/pith-number/4S4PHOZJCVXCHRCZEUIVNVKIFP/events.json","paper":"https://pith.science/paper/4S4PHOZJ"},"agent_actions":{"view_html":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP","download_json":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP.json","view_paper":"https://pith.science/paper/4S4PHOZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06687&json=true","fetch_graph":"https://pith.science/api/pith-number/4S4PHOZJCVXCHRCZEUIVNVKIFP/graph.json","fetch_events":"https://pith.science/api/pith-number/4S4PHOZJCVXCHRCZEUIVNVKIFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP/action/storage_attestation","attest_author":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP/action/author_attestation","sign_citation":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP/action/citation_signature","submit_replication":"https://pith.science/pith/4S4PHOZJCVXCHRCZEUIVNVKIFP/action/replication_record"}},"created_at":"2026-05-18T00:53:10.842778+00:00","updated_at":"2026-05-18T00:53:10.842778+00:00"}