{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KYDHWWZG2JA77LNCSY2YBU2MGO","short_pith_number":"pith:KYDHWWZG","canonical_record":{"source":{"id":"1201.0940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-04T17:28:57Z","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"title_canon_sha256":"ce2442762cc3f00ca8d2e61620561c86102645a16abe92a28c3358838a6e2ca3","abstract_canon_sha256":"5c0944f4178ff2f7acfb85d8588b83cf7ea8655234e4666d0febec07c3b65eb2"},"schema_version":"1.0"},"canonical_sha256":"56067b5b26d241ffada2963580d34c33a112e2d0a17ba60e99d2644b7ffe53a3","source":{"kind":"arxiv","id":"1201.0940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0940","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0940v1","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0940","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"KYDHWWZG2JA7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KYDHWWZG2JA77LNC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KYDHWWZG","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KYDHWWZG2JA77LNCSY2YBU2MGO","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-04T17:28:57Z","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"title_canon_sha256":"ce2442762cc3f00ca8d2e61620561c86102645a16abe92a28c3358838a6e2ca3","abstract_canon_sha256":"5c0944f4178ff2f7acfb85d8588b83cf7ea8655234e4666d0febec07c3b65eb2"},"schema_version":"1.0"},"canonical_sha256":"56067b5b26d241ffada2963580d34c33a112e2d0a17ba60e99d2644b7ffe53a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:15.421993Z","signature_b64":"mn9JndZCnIevWr9FUfmjYWYQW8/LpoAN4nY3O54dqcqq3EWLbe+1ZOYSSu7cQFgq5dBMiQdIismZ8iSe+9dIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56067b5b26d241ffada2963580d34c33a112e2d0a17ba60e99d2644b7ffe53a3","last_reissued_at":"2026-05-18T04:05:15.421393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:15.421393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0940","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-18T04:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUy4hPju0bIFJsC3L5nZXfxXhJ58VfDX0QEoFGRh5x5ZXyjOz/lP8KUCMPyXl1wCMWlbYZ4doP28y33fHOX6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:38:29.629550Z"},"content_sha256":"4453819dacd39c5a2a5baa7f0fd765bdf04b16a70821c6baf22292698e53986f","schema_version":"1.0","event_id":"sha256:4453819dacd39c5a2a5baa7f0fd765bdf04b16a70821c6baf22292698e53986f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KYDHWWZG2JA77LNCSY2YBU2MGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average-case analysis of perfect sorting by reversals (Journal Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","q-bio.QM"],"primary_cat":"cs.DM","authors_text":"Cedric Chauve, Dominique Rossin, Marni Mishna, Mathilde Bouvel","submitted_at":"2012-01-04T17:28:57Z","abstract_excerpt":"Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval. B\\'erard et al. (2007) make use of strong interval trees to describe an algorithm for sorting signed permutations by reversals. Combinatorial properties of this family of trees are essential to the algorithm analysis. Here, we use the expected value of certain tree parameters to prove that the average run-time of the algorithm is at worst, po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0940","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-18T04:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pftekzriPDaQ9pi285xoVGXEIxkEcLvo0Xtj5GZ4rpqiCE+ePN59DwZDDCtHqnyk8smaGSnr05z6Pnh0DbJvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:38:29.629902Z"},"content_sha256":"88e2e112b02d7a63fbf5059eee0bdbea25c75f96a93b469cc9549d67675e7777","schema_version":"1.0","event_id":"sha256:88e2e112b02d7a63fbf5059eee0bdbea25c75f96a93b469cc9549d67675e7777"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYDHWWZG2JA77LNCSY2YBU2MGO/bundle.json","state_url":"https://pith.science/pith/KYDHWWZG2JA77LNCSY2YBU2MGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYDHWWZG2JA77LNCSY2YBU2MGO/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-03T08:38:29Z","links":{"resolver":"https://pith.science/pith/KYDHWWZG2JA77LNCSY2YBU2MGO","bundle":"https://pith.science/pith/KYDHWWZG2JA77LNCSY2YBU2MGO/bundle.json","state":"https://pith.science/pith/KYDHWWZG2JA77LNCSY2YBU2MGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYDHWWZG2JA77LNCSY2YBU2MGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KYDHWWZG2JA77LNCSY2YBU2MGO","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":"5c0944f4178ff2f7acfb85d8588b83cf7ea8655234e4666d0febec07c3b65eb2","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-04T17:28:57Z","title_canon_sha256":"ce2442762cc3f00ca8d2e61620561c86102645a16abe92a28c3358838a6e2ca3"},"schema_version":"1.0","source":{"id":"1201.0940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0940","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0940v1","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0940","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"KYDHWWZG2JA7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KYDHWWZG2JA77LNC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KYDHWWZG","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:88e2e112b02d7a63fbf5059eee0bdbea25c75f96a93b469cc9549d67675e7777","target":"graph","created_at":"2026-05-18T04:05:15Z","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":"Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval. B\\'erard et al. (2007) make use of strong interval trees to describe an algorithm for sorting signed permutations by reversals. Combinatorial properties of this family of trees are essential to the algorithm analysis. Here, we use the expected value of certain tree parameters to prove that the average run-time of the algorithm is at worst, po","authors_text":"Cedric Chauve, Dominique Rossin, Marni Mishna, Mathilde Bouvel","cross_cats":["cs.DS","math.CO","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-04T17:28:57Z","title":"Average-case analysis of perfect sorting by reversals (Journal Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0940","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:4453819dacd39c5a2a5baa7f0fd765bdf04b16a70821c6baf22292698e53986f","target":"record","created_at":"2026-05-18T04:05:15Z","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":"5c0944f4178ff2f7acfb85d8588b83cf7ea8655234e4666d0febec07c3b65eb2","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-04T17:28:57Z","title_canon_sha256":"ce2442762cc3f00ca8d2e61620561c86102645a16abe92a28c3358838a6e2ca3"},"schema_version":"1.0","source":{"id":"1201.0940","kind":"arxiv","version":1}},"canonical_sha256":"56067b5b26d241ffada2963580d34c33a112e2d0a17ba60e99d2644b7ffe53a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56067b5b26d241ffada2963580d34c33a112e2d0a17ba60e99d2644b7ffe53a3","first_computed_at":"2026-05-18T04:05:15.421393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:15.421393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mn9JndZCnIevWr9FUfmjYWYQW8/LpoAN4nY3O54dqcqq3EWLbe+1ZOYSSu7cQFgq5dBMiQdIismZ8iSe+9dIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:15.421993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4453819dacd39c5a2a5baa7f0fd765bdf04b16a70821c6baf22292698e53986f","sha256:88e2e112b02d7a63fbf5059eee0bdbea25c75f96a93b469cc9549d67675e7777"],"state_sha256":"b89976c2e3313bf51280079a03144a79668f522c610446d4124f17f3641a408f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5O4TyC+j5o7QQ+PfnuSEOVimQNiZCf3gMjS5q4dXGzrk4F0wfR/RYgfTTk+zFeopKdJFwsRxoscf2CFjrX0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:38:29.631867Z","bundle_sha256":"f373dfb405dc306f393dbae1e7be79a38330be99e029a7d1099c8d4a7379e6e6"}}