{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YA2V3NAETBOLGZS7HT3INGUHN3","short_pith_number":"pith:YA2V3NAE","canonical_record":{"source":{"id":"1602.00778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T03:26:52Z","cross_cats_sorted":[],"title_canon_sha256":"8cae67694cf40560058dfa7f19f2e1e0231bd355e2e8414bc3b55399c9a1d0eb","abstract_canon_sha256":"6c4ed946eefd4ea079cf238ef96c826cbaac04e8a2ed2cbca19db93557f174b9"},"schema_version":"1.0"},"canonical_sha256":"c0355db404985cb3665f3cf6869a876efefc536fc1a19819ba881e5d2f4d2e5b","source":{"kind":"arxiv","id":"1602.00778","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00778","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00778v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00778","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"YA2V3NAETBOL","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YA2V3NAETBOLGZS7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YA2V3NAE","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YA2V3NAETBOLGZS7HT3INGUHN3","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T03:26:52Z","cross_cats_sorted":[],"title_canon_sha256":"8cae67694cf40560058dfa7f19f2e1e0231bd355e2e8414bc3b55399c9a1d0eb","abstract_canon_sha256":"6c4ed946eefd4ea079cf238ef96c826cbaac04e8a2ed2cbca19db93557f174b9"},"schema_version":"1.0"},"canonical_sha256":"c0355db404985cb3665f3cf6869a876efefc536fc1a19819ba881e5d2f4d2e5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:53.772636Z","signature_b64":"K1qxRQmF2zO4fLePzdWoyuWDMGy0VF1/1g3jx+XUn3t/9UICjtOn7e+mKb1Tr0ZkrU2ui/9jTDCVar11CpdNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0355db404985cb3665f3cf6869a876efefc536fc1a19819ba881e5d2f4d2e5b","last_reissued_at":"2026-05-18T00:41:53.771819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:53.771819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00778","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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3g/Y6PPn6nnNC/rdFTaL14bUV/O7SDH6tyH5CGjZm3rHNFjgUPczXbxfuEFrOb5jU8+gG03+r2OwQ31+fxCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:18:09.817118Z"},"content_sha256":"e3cd0c4ba804cb2a3755506991f37b083588de79bed7d0aaaffdcf9804d70846","schema_version":"1.0","event_id":"sha256:e3cd0c4ba804cb2a3755506991f37b083588de79bed7d0aaaffdcf9804d70846"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YA2V3NAETBOLGZS7HT3INGUHN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a lower bound for sorting signed permutations by reversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrei C. Bura, Christian M. Reidys, Ricky X. F. Chen","submitted_at":"2016-02-02T03:26:52Z","abstract_excerpt":"Computing the reversal distances of signed permutations is an important topic in Bioinformatics. Recently, a new lower bound for the reversal distance was obtained via the plane permutation framework. This lower bound appears different from the existing lower bound obtained by Bafna and Pevzner through breakpoint graphs. In this paper, we prove that the two lower bounds are equal. Moreover, we confirm a related conjecture on skew-symmetric plane permutations, which can be restated as follows: let $p=(0,-1,-2,\\ldots -n,n,n-1,\\ldots 1)$ and let\n  $$\n  \\tilde{s}=(0,a_1,a_2,\\ldots a_n,-a_n,-a_{n-1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00778","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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHRclOy7j6eDngmB8Yo/OFimPp37+DgoVhUKkFjvjVoUxHzxUFzn1mvyYyA5F+QkFeZZ01e4KrEEXJhR3iu9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:18:09.817469Z"},"content_sha256":"f544bdb9547fbc9c2491ee39c75bb8bf310a8ee135adf128c0b1d31e3cceb662","schema_version":"1.0","event_id":"sha256:f544bdb9547fbc9c2491ee39c75bb8bf310a8ee135adf128c0b1d31e3cceb662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YA2V3NAETBOLGZS7HT3INGUHN3/bundle.json","state_url":"https://pith.science/pith/YA2V3NAETBOLGZS7HT3INGUHN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YA2V3NAETBOLGZS7HT3INGUHN3/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-05T13:18:09Z","links":{"resolver":"https://pith.science/pith/YA2V3NAETBOLGZS7HT3INGUHN3","bundle":"https://pith.science/pith/YA2V3NAETBOLGZS7HT3INGUHN3/bundle.json","state":"https://pith.science/pith/YA2V3NAETBOLGZS7HT3INGUHN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YA2V3NAETBOLGZS7HT3INGUHN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YA2V3NAETBOLGZS7HT3INGUHN3","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":"6c4ed946eefd4ea079cf238ef96c826cbaac04e8a2ed2cbca19db93557f174b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T03:26:52Z","title_canon_sha256":"8cae67694cf40560058dfa7f19f2e1e0231bd355e2e8414bc3b55399c9a1d0eb"},"schema_version":"1.0","source":{"id":"1602.00778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00778","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00778v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00778","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"YA2V3NAETBOL","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YA2V3NAETBOLGZS7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YA2V3NAE","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:f544bdb9547fbc9c2491ee39c75bb8bf310a8ee135adf128c0b1d31e3cceb662","target":"graph","created_at":"2026-05-18T00:41:53Z","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":"Computing the reversal distances of signed permutations is an important topic in Bioinformatics. Recently, a new lower bound for the reversal distance was obtained via the plane permutation framework. This lower bound appears different from the existing lower bound obtained by Bafna and Pevzner through breakpoint graphs. In this paper, we prove that the two lower bounds are equal. Moreover, we confirm a related conjecture on skew-symmetric plane permutations, which can be restated as follows: let $p=(0,-1,-2,\\ldots -n,n,n-1,\\ldots 1)$ and let\n  $$\n  \\tilde{s}=(0,a_1,a_2,\\ldots a_n,-a_n,-a_{n-1","authors_text":"Andrei C. Bura, Christian M. Reidys, Ricky X. F. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T03:26:52Z","title":"On a lower bound for sorting signed permutations by reversals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00778","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:e3cd0c4ba804cb2a3755506991f37b083588de79bed7d0aaaffdcf9804d70846","target":"record","created_at":"2026-05-18T00:41:53Z","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":"6c4ed946eefd4ea079cf238ef96c826cbaac04e8a2ed2cbca19db93557f174b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T03:26:52Z","title_canon_sha256":"8cae67694cf40560058dfa7f19f2e1e0231bd355e2e8414bc3b55399c9a1d0eb"},"schema_version":"1.0","source":{"id":"1602.00778","kind":"arxiv","version":2}},"canonical_sha256":"c0355db404985cb3665f3cf6869a876efefc536fc1a19819ba881e5d2f4d2e5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0355db404985cb3665f3cf6869a876efefc536fc1a19819ba881e5d2f4d2e5b","first_computed_at":"2026-05-18T00:41:53.771819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:53.771819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K1qxRQmF2zO4fLePzdWoyuWDMGy0VF1/1g3jx+XUn3t/9UICjtOn7e+mKb1Tr0ZkrU2ui/9jTDCVar11CpdNAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:53.772636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3cd0c4ba804cb2a3755506991f37b083588de79bed7d0aaaffdcf9804d70846","sha256:f544bdb9547fbc9c2491ee39c75bb8bf310a8ee135adf128c0b1d31e3cceb662"],"state_sha256":"98d788e1f26b194e905d4524dcf7fc426d3a260bf458a49ce47761e38fccb91b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fl6bDGYj2mJtvrRd91qJl8YmUpdKXs1MLJPPVDRoloHBEJpJWzICm4b5DuAsAA4qiLffENUrz9MCn0JeJO9aDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:18:09.819374Z","bundle_sha256":"1b73297950faa9e876aaf506035c4a8a4d4baae0e4bc3f47364289b4cba9f4f6"}}