{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DHPNHTLYO6XSPCSYMOPGPG7JZU","short_pith_number":"pith:DHPNHTLY","canonical_record":{"source":{"id":"1204.5929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T14:05:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2383c4af94f6044cc845dccad254941cb09356dcfa23cf072d97298fc9b4efc0","abstract_canon_sha256":"033b47051153799b75ef1392c035a4a2101e8e58d787e9f4cab4fbb017470698"},"schema_version":"1.0"},"canonical_sha256":"19ded3cd7877af278a58639e679be9cd0c7a1944a554e320b5cc718c4523a9cd","source":{"kind":"arxiv","id":"1204.5929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5929","created_at":"2026-05-18T03:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5929v1","created_at":"2026-05-18T03:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5929","created_at":"2026-05-18T03:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"DHPNHTLYO6XS","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DHPNHTLYO6XSPCSY","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DHPNHTLY","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DHPNHTLYO6XSPCSYMOPGPG7JZU","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T14:05:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2383c4af94f6044cc845dccad254941cb09356dcfa23cf072d97298fc9b4efc0","abstract_canon_sha256":"033b47051153799b75ef1392c035a4a2101e8e58d787e9f4cab4fbb017470698"},"schema_version":"1.0"},"canonical_sha256":"19ded3cd7877af278a58639e679be9cd0c7a1944a554e320b5cc718c4523a9cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:59.015796Z","signature_b64":"AwUrYuBpE6QKJbUXKeA1yhuA4kCrxP3CsOPd6Z626bqEbvIqBWmZjt+POp45f9D4PzdD0Ke2MQwQf4s6iOyrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19ded3cd7877af278a58639e679be9cd0c7a1944a554e320b5cc718c4523a9cd","last_reissued_at":"2026-05-18T03:56:59.014941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:59.014941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5929","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-18T03:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vNkxBMnf4o9/8T70SMz3/verIp6aR25zQUN3ZcR5KvBLUECmeo180djgVk2+XE5rkHFsRZfTcu2BsxAG9LxFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:35:47.502477Z"},"content_sha256":"3069ce0cc941f768a26a3b9ef93e04fbbdbf6f24df12275b95534e2ec4c52c12","schema_version":"1.0","event_id":"sha256:3069ce0cc941f768a26a3b9ef93e04fbbdbf6f24df12275b95534e2ec4c52c12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DHPNHTLYO6XSPCSYMOPGPG7JZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chain Rotations: a New Look at Tree Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fabrizio Luccio, Linda Pagli","submitted_at":"2012-04-26T14:05:22Z","abstract_excerpt":"As well known the rotation distance D(S,T) between two binary trees S, T of n vertices is the minimum number of rotations of pairs of vertices to transform S into T. We introduce the new operation of chain rotation on a tree, involving two chains of vertices, that requires changing exactly three pointers in the data structure as for a standard rotation, and define the corresponding chain distance C(S,T). As for D(S,T), no polynomial time algorithm to compute C(S,T) is known. We prove a constructive upper bound and an analytical lower bound on C(S,T) based on the number of maximal chains in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5929","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-18T03:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnKMeP+7mbuHIDiyWCzL4cMcIBpH2sovIvtqW5fP4JKfbfqUb4M/EfPTbGzTU7gJxgjVHj5VkPy57215RjLUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:35:47.502823Z"},"content_sha256":"276b3f819b2f2b3453f77f22bc13e13096029e791605d84c5154f7c580bb29b4","schema_version":"1.0","event_id":"sha256:276b3f819b2f2b3453f77f22bc13e13096029e791605d84c5154f7c580bb29b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/bundle.json","state_url":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/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-07-03T04:35:47Z","links":{"resolver":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU","bundle":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/bundle.json","state":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DHPNHTLYO6XSPCSYMOPGPG7JZU","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":"033b47051153799b75ef1392c035a4a2101e8e58d787e9f4cab4fbb017470698","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T14:05:22Z","title_canon_sha256":"2383c4af94f6044cc845dccad254941cb09356dcfa23cf072d97298fc9b4efc0"},"schema_version":"1.0","source":{"id":"1204.5929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5929","created_at":"2026-05-18T03:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5929v1","created_at":"2026-05-18T03:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5929","created_at":"2026-05-18T03:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"DHPNHTLYO6XS","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DHPNHTLYO6XSPCSY","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DHPNHTLY","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:276b3f819b2f2b3453f77f22bc13e13096029e791605d84c5154f7c580bb29b4","target":"graph","created_at":"2026-05-18T03:56:59Z","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":"As well known the rotation distance D(S,T) between two binary trees S, T of n vertices is the minimum number of rotations of pairs of vertices to transform S into T. We introduce the new operation of chain rotation on a tree, involving two chains of vertices, that requires changing exactly three pointers in the data structure as for a standard rotation, and define the corresponding chain distance C(S,T). As for D(S,T), no polynomial time algorithm to compute C(S,T) is known. We prove a constructive upper bound and an analytical lower bound on C(S,T) based on the number of maximal chains in the","authors_text":"Fabrizio Luccio, Linda Pagli","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T14:05:22Z","title":"Chain Rotations: a New Look at Tree Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5929","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:3069ce0cc941f768a26a3b9ef93e04fbbdbf6f24df12275b95534e2ec4c52c12","target":"record","created_at":"2026-05-18T03:56:59Z","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":"033b47051153799b75ef1392c035a4a2101e8e58d787e9f4cab4fbb017470698","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T14:05:22Z","title_canon_sha256":"2383c4af94f6044cc845dccad254941cb09356dcfa23cf072d97298fc9b4efc0"},"schema_version":"1.0","source":{"id":"1204.5929","kind":"arxiv","version":1}},"canonical_sha256":"19ded3cd7877af278a58639e679be9cd0c7a1944a554e320b5cc718c4523a9cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19ded3cd7877af278a58639e679be9cd0c7a1944a554e320b5cc718c4523a9cd","first_computed_at":"2026-05-18T03:56:59.014941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:59.014941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AwUrYuBpE6QKJbUXKeA1yhuA4kCrxP3CsOPd6Z626bqEbvIqBWmZjt+POp45f9D4PzdD0Ke2MQwQf4s6iOyrBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:59.015796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3069ce0cc941f768a26a3b9ef93e04fbbdbf6f24df12275b95534e2ec4c52c12","sha256:276b3f819b2f2b3453f77f22bc13e13096029e791605d84c5154f7c580bb29b4"],"state_sha256":"c9b8b14276331ad45feda9258134e1654c628859dda8c06e78dfe13ba773150e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"841Zm8uTrrYgGAdRyuIN1/RNA40T0mydY+C6gyJPh3Z4Ax9xDuuNfO/gFpx77p5R0l9pSpWdutUPY4sBbIonAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T04:35:47.504812Z","bundle_sha256":"3a93ecf2415ad3929281b14dfcbef99be3cd87db819dccd598e07e0fa78bf5cf"}}