{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WLAVDIANN2ZWY5VWGF3PNSVHQW","short_pith_number":"pith:WLAVDIAN","schema_version":"1.0","canonical_sha256":"b2c151a00d6eb36c76b63176f6caa785a996618f525340fada715ba564330a3b","source":{"kind":"arxiv","id":"2606.08412","version":1},"attestation_state":"computed","paper":{"title":"Complexity and Algorithms for Unary Translocation Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Adrian Micl\\u{a}u\\c{s}, Alexandru Popa, Andrei Popa, Maria Constantin","submitted_at":"2026-06-07T02:26:12Z","abstract_excerpt":"Given a finite set of integers $A$, a \\emph{unary translocation} produces a new set $A' = A \\cup \\{u,v\\}$, where $u$ and $v$ are nonnegative integers satisfying $x+y=u+v$ for some $x,y\\in A$. For an input set $A$ and a target set $B$, the \\emph{unary translocation distance} is the minimum number of unary translocations required to obtain a superset containing $B$. In this paper, we study this problem from both theoretical and computational perspectives. We prove that computing the unary translocation distance is strongly NP-hard, thereby answering an open question raised by \\citet{ConstantinMi"},"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":"2606.08412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-07T02:26:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"835b8710f4d48914d494e2330f4a6e53e7a1cbc0b0b10e969ca4b96831c7b7ee","abstract_canon_sha256":"56c3b93376165a70a38b9571ba015ba43c82f8f39249168aa17a6435277c86df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:35.959961Z","signature_b64":"kRR+m4UREaKBr6AcJPhJ4OLj7DCZRSyZTxdqvgoXMo6dfmUmwbL4nJ/+CibB3dn8RiXCMvwDysnNJdoj5YQNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2c151a00d6eb36c76b63176f6caa785a996618f525340fada715ba564330a3b","last_reissued_at":"2026-06-09T01:05:35.959487Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:35.959487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Algorithms for Unary Translocation Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Adrian Micl\\u{a}u\\c{s}, Alexandru Popa, Andrei Popa, Maria Constantin","submitted_at":"2026-06-07T02:26:12Z","abstract_excerpt":"Given a finite set of integers $A$, a \\emph{unary translocation} produces a new set $A' = A \\cup \\{u,v\\}$, where $u$ and $v$ are nonnegative integers satisfying $x+y=u+v$ for some $x,y\\in A$. For an input set $A$ and a target set $B$, the \\emph{unary translocation distance} is the minimum number of unary translocations required to obtain a superset containing $B$. In this paper, we study this problem from both theoretical and computational perspectives. We prove that computing the unary translocation distance is strongly NP-hard, thereby answering an open question raised by \\citet{ConstantinMi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08412","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.08412/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.08412","created_at":"2026-06-09T01:05:35.959562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08412v1","created_at":"2026-06-09T01:05:35.959562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08412","created_at":"2026-06-09T01:05:35.959562+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLAVDIANN2ZW","created_at":"2026-06-09T01:05:35.959562+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLAVDIANN2ZWY5VW","created_at":"2026-06-09T01:05:35.959562+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLAVDIAN","created_at":"2026-06-09T01:05:35.959562+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/WLAVDIANN2ZWY5VWGF3PNSVHQW","json":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW.json","graph_json":"https://pith.science/api/pith-number/WLAVDIANN2ZWY5VWGF3PNSVHQW/graph.json","events_json":"https://pith.science/api/pith-number/WLAVDIANN2ZWY5VWGF3PNSVHQW/events.json","paper":"https://pith.science/paper/WLAVDIAN"},"agent_actions":{"view_html":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW","download_json":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW.json","view_paper":"https://pith.science/paper/WLAVDIAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08412&json=true","fetch_graph":"https://pith.science/api/pith-number/WLAVDIANN2ZWY5VWGF3PNSVHQW/graph.json","fetch_events":"https://pith.science/api/pith-number/WLAVDIANN2ZWY5VWGF3PNSVHQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW/action/storage_attestation","attest_author":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW/action/author_attestation","sign_citation":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW/action/citation_signature","submit_replication":"https://pith.science/pith/WLAVDIANN2ZWY5VWGF3PNSVHQW/action/replication_record"}},"created_at":"2026-06-09T01:05:35.959562+00:00","updated_at":"2026-06-09T01:05:35.959562+00:00"}