{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WTEQQIMHET2CVUAV6ALYEWFIRC","short_pith_number":"pith:WTEQQIMH","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"},"canonical_sha256":"b4c908218724f42ad015f0178258a888995f0b93d01b88e59c93778dd3e3e35f","source":{"kind":"arxiv","id":"1507.01512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01512","created_at":"2026-05-18T01:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01512v2","created_at":"2026-05-18T01:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01512","created_at":"2026-05-18T01:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"WTEQQIMHET2C","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WTEQQIMHET2CVUAV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WTEQQIMH","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WTEQQIMHET2CVUAV6ALYEWFIRC","target":"record","payload":{"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"},"canonical_sha256":"b4c908218724f42ad015f0178258a888995f0b93d01b88e59c93778dd3e3e35f","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"},"source_kind":"arxiv","source_id":"1507.01512","source_version":2,"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:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LyavHdEHnv8+6MHVD7fZjTTmU7brgMiFO1MM0N1CIXfASttFgVzfIzxSZXY2uuNMMmc5Vc5+/h6jxnvEMnB5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:19:02.399043Z"},"content_sha256":"03e4bc3945da0739dfdfd3e7e832dcedc57dd8da33b6c914ff609042ed883982","schema_version":"1.0","event_id":"sha256:03e4bc3945da0739dfdfd3e7e832dcedc57dd8da33b6c914ff609042ed883982"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WTEQQIMHET2CVUAV6ALYEWFIRC","target":"graph","payload":{"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"},"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:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBl2JBZ9VqHjs2y6jbr3ds98v1MITsP9pPevGTDHflLKNFKIyCaYu9/evnRGmiOLqMnBDRYkUzWRpD1+jKzSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:19:02.399708Z"},"content_sha256":"f3c6afe58e6f95b83e99870d53c8af25cfce2466cbe26e60b3f592f3d5d9aa33","schema_version":"1.0","event_id":"sha256:f3c6afe58e6f95b83e99870d53c8af25cfce2466cbe26e60b3f592f3d5d9aa33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/bundle.json","state_url":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/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-04T07:19:02Z","links":{"resolver":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC","bundle":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/bundle.json","state":"https://pith.science/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTEQQIMHET2CVUAV6ALYEWFIRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WTEQQIMHET2CVUAV6ALYEWFIRC","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":"8afe3866bfd9c8db67d1922d077fddfd0baa3f1a433f0770917662012fe7b0df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T15:58:14Z","title_canon_sha256":"dd15ec77a0eb3c40022e101cb03318a5c5499fd3691be4fae246effc39ee3e74"},"schema_version":"1.0","source":{"id":"1507.01512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01512","created_at":"2026-05-18T01:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01512v2","created_at":"2026-05-18T01:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01512","created_at":"2026-05-18T01:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"WTEQQIMHET2C","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WTEQQIMHET2CVUAV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WTEQQIMH","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:f3c6afe58e6f95b83e99870d53c8af25cfce2466cbe26e60b3f592f3d5d9aa33","target":"graph","created_at":"2026-05-18T01:28:38Z","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":"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","authors_text":"Irena Rusu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T15:58:14Z","title":"Log-Lists and Their Applications to Sorting by Transpositions, Reversals and Block-Interchanges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01512","kind":"arxiv","version":2},"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:03e4bc3945da0739dfdfd3e7e832dcedc57dd8da33b6c914ff609042ed883982","target":"record","created_at":"2026-05-18T01:28:38Z","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":"8afe3866bfd9c8db67d1922d077fddfd0baa3f1a433f0770917662012fe7b0df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-06T15:58:14Z","title_canon_sha256":"dd15ec77a0eb3c40022e101cb03318a5c5499fd3691be4fae246effc39ee3e74"},"schema_version":"1.0","source":{"id":"1507.01512","kind":"arxiv","version":2}},"canonical_sha256":"b4c908218724f42ad015f0178258a888995f0b93d01b88e59c93778dd3e3e35f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4c908218724f42ad015f0178258a888995f0b93d01b88e59c93778dd3e3e35f","first_computed_at":"2026-05-18T01:28:38.185392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:38.185392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x6NC5vw/mY0RLPthVmbZlmFW8otgsJdSOeN2cvsuqhUSACie1jM21xEM48qcUfPiaejsdCe4h7kwJc/eEsssCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:38.186187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03e4bc3945da0739dfdfd3e7e832dcedc57dd8da33b6c914ff609042ed883982","sha256:f3c6afe58e6f95b83e99870d53c8af25cfce2466cbe26e60b3f592f3d5d9aa33"],"state_sha256":"7f16bdc8962411d4e79c0b2c0f7c3cb4babe8f1239314ff121bd9753171243ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EoixeLE4wNNK5KSWdH36uhysekqCk9bAjOZAB6ka0HMr/DXB5lx6YvPkWhciu0jHqo6gGzv9ztEr+h5HenVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T07:19:02.402628Z","bundle_sha256":"b9a22974d109fe2023914556180bacd1edde08b7ce7480eccd326f645066da73"}}