{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NF3LYUWSABO2MDP6FTQ4FYMQ2Q","short_pith_number":"pith:NF3LYUWS","schema_version":"1.0","canonical_sha256":"6976bc52d2005da60dfe2ce1c2e190d40f3908c2d2f3a5d36bdc8cb809bd27af","source":{"kind":"arxiv","id":"1704.07254","version":1},"attestation_state":"computed","paper":{"title":"Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2017-04-24T14:29:28Z","abstract_excerpt":"Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression) for the case assuming union-by-rank strategy for merging. In this paper we provide such a characterization by means of a simple push operation and show that the decision problem whether a given tree (along with the rank info of its nodes) is a Union-Find tree is NP"},"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":"1704.07254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T14:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"1cdf8e841d29ddd7e0895fbd703cfdecd02d065d918e36c09d2abdd4cbc95acf","abstract_canon_sha256":"df2d02a6406e27b8790aec2fb3ba6ffbb9b2e0bf9ff79fcb8be69cfa02f73132"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.068254Z","signature_b64":"FJ8v242h0mHhjjGG2dzq7Fcrziw0IDStr8s+vHhuKhoZVkit/0mm2WOzDP1DEsFVpDTAw5pN1W1ovi2scPJhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6976bc52d2005da60dfe2ce1c2e190d40f3908c2d2f3a5d36bdc8cb809bd27af","last_reissued_at":"2026-05-18T00:45:53.067576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.067576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2017-04-24T14:29:28Z","abstract_excerpt":"Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression) for the case assuming union-by-rank strategy for merging. In this paper we provide such a characterization by means of a simple push operation and show that the decision problem whether a given tree (along with the rank info of its nodes) is a Union-Find tree is NP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07254","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":"1704.07254","created_at":"2026-05-18T00:45:53.067666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07254v1","created_at":"2026-05-18T00:45:53.067666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07254","created_at":"2026-05-18T00:45:53.067666+00:00"},{"alias_kind":"pith_short_12","alias_value":"NF3LYUWSABO2","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NF3LYUWSABO2MDP6","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NF3LYUWS","created_at":"2026-05-18T12:31:31.346846+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/NF3LYUWSABO2MDP6FTQ4FYMQ2Q","json":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q.json","graph_json":"https://pith.science/api/pith-number/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/graph.json","events_json":"https://pith.science/api/pith-number/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/events.json","paper":"https://pith.science/paper/NF3LYUWS"},"agent_actions":{"view_html":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q","download_json":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q.json","view_paper":"https://pith.science/paper/NF3LYUWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07254&json=true","fetch_graph":"https://pith.science/api/pith-number/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/action/storage_attestation","attest_author":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/action/author_attestation","sign_citation":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/action/citation_signature","submit_replication":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/action/replication_record"}},"created_at":"2026-05-18T00:45:53.067666+00:00","updated_at":"2026-05-18T00:45:53.067666+00:00"}