{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O7CZYE5WBOFJA4PKMSRZN5DPEF","short_pith_number":"pith:O7CZYE5W","canonical_record":{"source":{"id":"1610.06023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T14:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"4184e6fae3f497b3391a41ecae9528e3ab1e9ebf215fcc8d2ed2fe88ae475748","abstract_canon_sha256":"df6107c044b3ce77ef46bf1db59ff0d584c6df9bd672a2e9f4fa1fa9b985ce7e"},"schema_version":"1.0"},"canonical_sha256":"77c59c13b60b8a9071ea64a396f46f21724a1994082114d5c8e9a4d08981adc7","source":{"kind":"arxiv","id":"1610.06023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06023","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06023v1","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06023","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"O7CZYE5WBOFJ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O7CZYE5WBOFJA4PK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O7CZYE5W","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O7CZYE5WBOFJA4PKMSRZN5DPEF","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T14:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"4184e6fae3f497b3391a41ecae9528e3ab1e9ebf215fcc8d2ed2fe88ae475748","abstract_canon_sha256":"df6107c044b3ce77ef46bf1db59ff0d584c6df9bd672a2e9f4fa1fa9b985ce7e"},"schema_version":"1.0"},"canonical_sha256":"77c59c13b60b8a9071ea64a396f46f21724a1994082114d5c8e9a4d08981adc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:50.373359Z","signature_b64":"fqLTXAoqE6zc4enUGhKl/Uq8UqGYFqrvfihrDuHI3zKkUq4gpIVFxcvivODtodp0uAgHNxzC2RSvJf3MM6ZnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77c59c13b60b8a9071ea64a396f46f21724a1994082114d5c8e9a4d08981adc7","last_reissued_at":"2026-05-18T01:01:50.372685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:50.372685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06023","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-18T01:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyRrklr7x6M/fKarwhduddhaQXZfXDICl2XFljDAHgn7IFVCLmAAo2N3IOPlbFnnI7oz9jKRvLmqo19BAKogCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:55:58.595921Z"},"content_sha256":"f4675b1c353ca096c55befe107b5e6804b649ef4ce8e71a1c6e46453f182d36c","schema_version":"1.0","event_id":"sha256:f4675b1c353ca096c55befe107b5e6804b649ef4ce8e71a1c6e46453f182d36c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O7CZYE5WBOFJA4PKMSRZN5DPEF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical estimation of rotation distance and induced partial order for binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jarek Duda","submitted_at":"2016-10-19T14:17:15Z","abstract_excerpt":"Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of rotations, the optimal minimal number is called the rotation distance. Such distance could be used for instance to quantify similarity between two trees for various machine learning problems, for example to compare hierarchical clusterings or arbitrarily chosen spanning trees of two graphs, like in SMILES notation popular for describing chemical molecules.\n  Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06023","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-18T01:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MeieYWZzTLI0gNWkr15B33yn7YtVH7/gji4p2W7Olx4NY+Lr7Q/ruM8yyQO/YQmePwXUIsHx4cZNW+uq5RFzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:55:58.596747Z"},"content_sha256":"d71ba3cc9dd72dea39dc9e4528560b6f5c02f8eb4ec8e1c93236c473c8d67cd0","schema_version":"1.0","event_id":"sha256:d71ba3cc9dd72dea39dc9e4528560b6f5c02f8eb4ec8e1c93236c473c8d67cd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7CZYE5WBOFJA4PKMSRZN5DPEF/bundle.json","state_url":"https://pith.science/pith/O7CZYE5WBOFJA4PKMSRZN5DPEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7CZYE5WBOFJA4PKMSRZN5DPEF/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-08-23T22:55:58Z","links":{"resolver":"https://pith.science/pith/O7CZYE5WBOFJA4PKMSRZN5DPEF","bundle":"https://pith.science/pith/O7CZYE5WBOFJA4PKMSRZN5DPEF/bundle.json","state":"https://pith.science/pith/O7CZYE5WBOFJA4PKMSRZN5DPEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7CZYE5WBOFJA4PKMSRZN5DPEF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O7CZYE5WBOFJA4PKMSRZN5DPEF","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":"df6107c044b3ce77ef46bf1db59ff0d584c6df9bd672a2e9f4fa1fa9b985ce7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T14:17:15Z","title_canon_sha256":"4184e6fae3f497b3391a41ecae9528e3ab1e9ebf215fcc8d2ed2fe88ae475748"},"schema_version":"1.0","source":{"id":"1610.06023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06023","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06023v1","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06023","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"O7CZYE5WBOFJ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O7CZYE5WBOFJA4PK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O7CZYE5W","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:d71ba3cc9dd72dea39dc9e4528560b6f5c02f8eb4ec8e1c93236c473c8d67cd0","target":"graph","created_at":"2026-05-18T01:01:50Z","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":"Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of rotations, the optimal minimal number is called the rotation distance. Such distance could be used for instance to quantify similarity between two trees for various machine learning problems, for example to compare hierarchical clusterings or arbitrarily chosen spanning trees of two graphs, like in SMILES notation popular for describing chemical molecules.\n  Th","authors_text":"Jarek Duda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T14:17:15Z","title":"Practical estimation of rotation distance and induced partial order for binary trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06023","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:f4675b1c353ca096c55befe107b5e6804b649ef4ce8e71a1c6e46453f182d36c","target":"record","created_at":"2026-05-18T01:01:50Z","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":"df6107c044b3ce77ef46bf1db59ff0d584c6df9bd672a2e9f4fa1fa9b985ce7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-19T14:17:15Z","title_canon_sha256":"4184e6fae3f497b3391a41ecae9528e3ab1e9ebf215fcc8d2ed2fe88ae475748"},"schema_version":"1.0","source":{"id":"1610.06023","kind":"arxiv","version":1}},"canonical_sha256":"77c59c13b60b8a9071ea64a396f46f21724a1994082114d5c8e9a4d08981adc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77c59c13b60b8a9071ea64a396f46f21724a1994082114d5c8e9a4d08981adc7","first_computed_at":"2026-05-18T01:01:50.372685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:50.372685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fqLTXAoqE6zc4enUGhKl/Uq8UqGYFqrvfihrDuHI3zKkUq4gpIVFxcvivODtodp0uAgHNxzC2RSvJf3MM6ZnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:50.373359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4675b1c353ca096c55befe107b5e6804b649ef4ce8e71a1c6e46453f182d36c","sha256:d71ba3cc9dd72dea39dc9e4528560b6f5c02f8eb4ec8e1c93236c473c8d67cd0"],"state_sha256":"4f309c3f8932d23eecd2b1d26fdba76b6608c4ab74388e1056553ff99abefa15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kf422Kwptvk8VBz42RuyJ4+EbOouVrQxBlSJYwm6DLMMhhf59+qr1N68xuEp9dgSLUP5DSjOXz5QexNcdicoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:55:58.603742Z","bundle_sha256":"2b941fa06a399ab66c928d692c00477b301fe8c49165d897184023cb02d1934d"}}