{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WTEQQIMHET2CVUAV6ALYEWFIRC","short_pith_number":"pith:WTEQQIMH","schema_version":"1.0","canonical_sha256":"b4c908218724f42ad015f0178258a888995f0b93d01b88e59c93778dd3e3e35f","source":{"kind":"arxiv","id":"1507.01512","version":2},"attestation_state":"computed","paper":{"title":"Log-Lists and Their Applications to Sorting by Transpositions, Reversals and Block-Interchanges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Irena Rusu","submitted_at":"2015-07-06T15:58:14Z","abstract_excerpt":"Link-cut trees have been introduced by D.D. Sleator and R.E. Tarjan (Journal of Computer and System Sciences, 1983) with the aim of efficiently maintaining a forest of vertex-disjoint dynamic rooted trees under cut and link operations. These operations respectively disconnect a subtree from a tree, and join two trees by an edge. Additionally, link-cut trees allow to change the root of a tree and to perform a number of updates and queries on cost values defined on the arcs of the trees. All these operations are performed in $O(\\log\\, n)$ amortized or worst-case time, depending on the implementa"},"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":"1507.01512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T15:58:14Z","cross_cats_sorted":[],"title_canon_sha256":"dd15ec77a0eb3c40022e101cb03318a5c5499fd3691be4fae246effc39ee3e74","abstract_canon_sha256":"8afe3866bfd9c8db67d1922d077fddfd0baa3f1a433f0770917662012fe7b0df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:38.186187Z","signature_b64":"x6NC5vw/mY0RLPthVmbZlmFW8otgsJdSOeN2cvsuqhUSACie1jM21xEM48qcUfPiaejsdCe4h7kwJc/eEsssCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4c908218724f42ad015f0178258a888995f0b93d01b88e59c93778dd3e3e35f","last_reissued_at":"2026-05-18T01:28:38.185392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:38.185392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log-Lists and Their Applications to Sorting by Transpositions, Reversals and Block-Interchanges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Irena Rusu","submitted_at":"2015-07-06T15:58:14Z","abstract_excerpt":"Link-cut trees have been introduced by D.D. Sleator and R.E. Tarjan (Journal of Computer and System Sciences, 1983) with the aim of efficiently maintaining a forest of vertex-disjoint dynamic rooted trees under cut and link operations. These operations respectively disconnect a subtree from a tree, and join two trees by an edge. Additionally, link-cut trees allow to change the root of a tree and to perform a number of updates and queries on cost values defined on the arcs of the trees. All these operations are performed in $O(\\log\\, n)$ amortized or worst-case time, depending on the implementa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01512","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":"1507.01512","created_at":"2026-05-18T01:28:38.185552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01512v2","created_at":"2026-05-18T01:28:38.185552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01512","created_at":"2026-05-18T01:28:38.185552+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTEQQIMHET2C","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTEQQIMHET2CVUAV","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTEQQIMH","created_at":"2026-05-18T12:29:47.479230+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/WTEQQIMHET2CVUAV6ALYEWFIRC","json":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC.json","graph_json":"https://pith.science/api/pith-number/WTEQQIMHET2CVUAV6ALYEWFIRC/graph.json","events_json":"https://pith.science/api/pith-number/WTEQQIMHET2CVUAV6ALYEWFIRC/events.json","paper":"https://pith.science/paper/WTEQQIMH"},"agent_actions":{"view_html":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC","download_json":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC.json","view_paper":"https://pith.science/paper/WTEQQIMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01512&json=true","fetch_graph":"https://pith.science/api/pith-number/WTEQQIMHET2CVUAV6ALYEWFIRC/graph.json","fetch_events":"https://pith.science/api/pith-number/WTEQQIMHET2CVUAV6ALYEWFIRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/action/storage_attestation","attest_author":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/action/author_attestation","sign_citation":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/action/citation_signature","submit_replication":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/action/replication_record"}},"created_at":"2026-05-18T01:28:38.185552+00:00","updated_at":"2026-05-18T01:28:38.185552+00:00"}