{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KDDESUWSSOE6BB5CW6AV62DBYT","short_pith_number":"pith:KDDESUWS","schema_version":"1.0","canonical_sha256":"50c64952d29389e087a2b7815f6861c4c2d2f50e80f62fb385d97f3624c491b9","source":{"kind":"arxiv","id":"1510.07462","version":2},"attestation_state":"computed","paper":{"title":"Recognizing Union-Find trees is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2015-10-26T12:59:22Z","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). In this paper we provide such a characterization and show that the decision problem whether a given tree is a Union-Find tree is $\\NP$-complete."},"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":"1510.07462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-26T12:59:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac6a94a31ebd2c839138b05136b17b5854d19590fafe9f80840a9bc412af6f9d","abstract_canon_sha256":"e3447ca4493de0ec43ca39a206d880218a0b7489a972ff06049a79f4e6f0dd8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.080659Z","signature_b64":"YGDUo0FLdXvKn8UcK+SXwVw/Fr3Ko02i8y0aS554GHux92CkIxzYF9dmYHkTRJZzw1+nIUgoR+IEIhmQ7qGqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50c64952d29389e087a2b7815f6861c4c2d2f50e80f62fb385d97f3624c491b9","last_reissued_at":"2026-05-18T00:53:21.080207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.080207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing Union-Find trees is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2015-10-26T12:59:22Z","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). In this paper we provide such a characterization and show that the decision problem whether a given tree is a Union-Find tree is $\\NP$-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07462","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":"1510.07462","created_at":"2026-05-18T00:53:21.080270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07462v2","created_at":"2026-05-18T00:53:21.080270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07462","created_at":"2026-05-18T00:53:21.080270+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDDESUWSSOE6","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDDESUWSSOE6BB5C","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDDESUWS","created_at":"2026-05-18T12:29:27.538025+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/KDDESUWSSOE6BB5CW6AV62DBYT","json":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT.json","graph_json":"https://pith.science/api/pith-number/KDDESUWSSOE6BB5CW6AV62DBYT/graph.json","events_json":"https://pith.science/api/pith-number/KDDESUWSSOE6BB5CW6AV62DBYT/events.json","paper":"https://pith.science/paper/KDDESUWS"},"agent_actions":{"view_html":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT","download_json":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT.json","view_paper":"https://pith.science/paper/KDDESUWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07462&json=true","fetch_graph":"https://pith.science/api/pith-number/KDDESUWSSOE6BB5CW6AV62DBYT/graph.json","fetch_events":"https://pith.science/api/pith-number/KDDESUWSSOE6BB5CW6AV62DBYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT/action/storage_attestation","attest_author":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT/action/author_attestation","sign_citation":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT/action/citation_signature","submit_replication":"https://pith.science/pith/KDDESUWSSOE6BB5CW6AV62DBYT/action/replication_record"}},"created_at":"2026-05-18T00:53:21.080270+00:00","updated_at":"2026-05-18T00:53:21.080270+00:00"}