{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NF3LYUWSABO2MDP6FTQ4FYMQ2Q","short_pith_number":"pith:NF3LYUWS","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"},"canonical_sha256":"6976bc52d2005da60dfe2ce1c2e190d40f3908c2d2f3a5d36bdc8cb809bd27af","source":{"kind":"arxiv","id":"1704.07254","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07254","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07254v1","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07254","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"NF3LYUWSABO2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NF3LYUWSABO2MDP6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NF3LYUWS","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NF3LYUWSABO2MDP6FTQ4FYMQ2Q","target":"record","payload":{"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"},"canonical_sha256":"6976bc52d2005da60dfe2ce1c2e190d40f3908c2d2f3a5d36bdc8cb809bd27af","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"},"source_kind":"arxiv","source_id":"1704.07254","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0zDQDuKIpX1Eh8JlNYVTPsyPs6/XMgZLBHwwtBOjT+kxDHd9bkvK23dYHcE+iICBUEmTFI647cq0eG4Xu8tCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:38:34.251005Z"},"content_sha256":"9d7a060b1f696b8c878ee58423639905bb71caae3202f1d06dabbac638381a57","schema_version":"1.0","event_id":"sha256:9d7a060b1f696b8c878ee58423639905bb71caae3202f1d06dabbac638381a57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NF3LYUWSABO2MDP6FTQ4FYMQ2Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZoXLo00f4LSdfUH/QPBTLLM22ko2oR4TqzJJN9cgEq8L8eYqLHp76256lIsBcwY3JVx2FenicCaBYwnHgM7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:38:34.251357Z"},"content_sha256":"17d79582125da69b1f941b424dfad9f757c1ce03d4a9fcebd67c39af533c8f84","schema_version":"1.0","event_id":"sha256:17d79582125da69b1f941b424dfad9f757c1ce03d4a9fcebd67c39af533c8f84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/bundle.json","state_url":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T05:38:34Z","links":{"resolver":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q","bundle":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/bundle.json","state":"https://pith.science/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NF3LYUWSABO2MDP6FTQ4FYMQ2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NF3LYUWSABO2MDP6FTQ4FYMQ2Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"df2d02a6406e27b8790aec2fb3ba6ffbb9b2e0bf9ff79fcb8be69cfa02f73132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T14:29:28Z","title_canon_sha256":"1cdf8e841d29ddd7e0895fbd703cfdecd02d065d918e36c09d2abdd4cbc95acf"},"schema_version":"1.0","source":{"id":"1704.07254","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07254","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07254v1","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07254","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"NF3LYUWSABO2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NF3LYUWSABO2MDP6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NF3LYUWS","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:17d79582125da69b1f941b424dfad9f757c1ce03d4a9fcebd67c39af533c8f84","target":"graph","created_at":"2026-05-18T00:45:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kitti Gelle, Szabolcs Ivan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T14:29:28Z","title":"Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07254","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d7a060b1f696b8c878ee58423639905bb71caae3202f1d06dabbac638381a57","target":"record","created_at":"2026-05-18T00:45:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"df2d02a6406e27b8790aec2fb3ba6ffbb9b2e0bf9ff79fcb8be69cfa02f73132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T14:29:28Z","title_canon_sha256":"1cdf8e841d29ddd7e0895fbd703cfdecd02d065d918e36c09d2abdd4cbc95acf"},"schema_version":"1.0","source":{"id":"1704.07254","kind":"arxiv","version":1}},"canonical_sha256":"6976bc52d2005da60dfe2ce1c2e190d40f3908c2d2f3a5d36bdc8cb809bd27af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6976bc52d2005da60dfe2ce1c2e190d40f3908c2d2f3a5d36bdc8cb809bd27af","first_computed_at":"2026-05-18T00:45:53.067576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:53.067576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FJ8v242h0mHhjjGG2dzq7Fcrziw0IDStr8s+vHhuKhoZVkit/0mm2WOzDP1DEsFVpDTAw5pN1W1ovi2scPJhBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:53.068254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07254","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d7a060b1f696b8c878ee58423639905bb71caae3202f1d06dabbac638381a57","sha256:17d79582125da69b1f941b424dfad9f757c1ce03d4a9fcebd67c39af533c8f84"],"state_sha256":"5a6420115e8f86db53e38ccf8cc36bc32bbbd85b8df7e8d08e4e176080980804"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mv5keG9F1yuZ/dxRAW1NA81sEICNU+BiG7E3fIDbmOrmdfQmL37QgVWBeVngYCMQsTHA5UGUC/hSNp79+vq6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:38:34.253287Z","bundle_sha256":"acb2820c983f5ed9d1545106a2763125c5488d1b1c981eef78b7e00e522c64a6"}}