{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DHPNHTLYO6XSPCSYMOPGPG7JZU","short_pith_number":"pith:DHPNHTLY","schema_version":"1.0","canonical_sha256":"19ded3cd7877af278a58639e679be9cd0c7a1944a554e320b5cc718c4523a9cd","source":{"kind":"arxiv","id":"1204.5929","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.5929","created_at":"2026-05-18T03:56:59.015076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5929v1","created_at":"2026-05-18T03:56:59.015076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5929","created_at":"2026-05-18T03:56:59.015076+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHPNHTLYO6XS","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHPNHTLYO6XSPCSY","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHPNHTLY","created_at":"2026-05-18T12:27:04.183437+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/DHPNHTLYO6XSPCSYMOPGPG7JZU","json":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU.json","graph_json":"https://pith.science/api/pith-number/DHPNHTLYO6XSPCSYMOPGPG7JZU/graph.json","events_json":"https://pith.science/api/pith-number/DHPNHTLYO6XSPCSYMOPGPG7JZU/events.json","paper":"https://pith.science/paper/DHPNHTLY"},"agent_actions":{"view_html":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU","download_json":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU.json","view_paper":"https://pith.science/paper/DHPNHTLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5929&json=true","fetch_graph":"https://pith.science/api/pith-number/DHPNHTLYO6XSPCSYMOPGPG7JZU/graph.json","fetch_events":"https://pith.science/api/pith-number/DHPNHTLYO6XSPCSYMOPGPG7JZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/action/storage_attestation","attest_author":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/action/author_attestation","sign_citation":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/action/citation_signature","submit_replication":"https://pith.science/pith/DHPNHTLYO6XSPCSYMOPGPG7JZU/action/replication_record"}},"created_at":"2026-05-18T03:56:59.015076+00:00","updated_at":"2026-05-18T03:56:59.015076+00:00"}