{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FVVZJ7B63D3ESMIEZWOSHK4PHG","short_pith_number":"pith:FVVZJ7B6","canonical_record":{"source":{"id":"1705.06559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T12:53:56Z","cross_cats_sorted":["cs.CE","q-bio.GN"],"title_canon_sha256":"f451df73bd5b812f90bb73f673242ecddeb9a91145df508eca8088d83a0c5fd9","abstract_canon_sha256":"f86f4300b1bc4c4f74e744dcb1cd44d619b2940e7560679df8282df57e55b0c8"},"schema_version":"1.0"},"canonical_sha256":"2d6b94fc3ed8f6493104cd9d23ab8f39b4c2ba7b2788e24647156953674bd947","source":{"kind":"arxiv","id":"1705.06559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06559","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06559v1","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06559","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"FVVZJ7B63D3E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVVZJ7B63D3ESMIE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVVZJ7B6","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FVVZJ7B63D3ESMIEZWOSHK4PHG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T12:53:56Z","cross_cats_sorted":["cs.CE","q-bio.GN"],"title_canon_sha256":"f451df73bd5b812f90bb73f673242ecddeb9a91145df508eca8088d83a0c5fd9","abstract_canon_sha256":"f86f4300b1bc4c4f74e744dcb1cd44d619b2940e7560679df8282df57e55b0c8"},"schema_version":"1.0"},"canonical_sha256":"2d6b94fc3ed8f6493104cd9d23ab8f39b4c2ba7b2788e24647156953674bd947","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:39.093083Z","signature_b64":"ONsa/NoJFwENjei67oSt8DNo5g9VFtKPAC0FUos2d/nZFecBl/kvpvpee3WFSbfxlO4e69GfRAv7orNfwOekCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6b94fc3ed8f6493104cd9d23ab8f39b4c2ba7b2788e24647156953674bd947","last_reissued_at":"2026-05-18T00:43:39.092604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:39.092604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06559","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-18T00:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EytRHsmnVE8gTLjsH55LULnGsC4n2aUeHRd/pZ+zUp1TwxEOVv1Un9PENQaWyga6CEqf9pdQIQHc3nZlLRLhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:23:49.361946Z"},"content_sha256":"a020f71700edd76011b0a1bc6e85641f06c605f4debe70aefc451b5b70c590a2","schema_version":"1.0","event_id":"sha256:a020f71700edd76011b0a1bc6e85641f06c605f4debe70aefc451b5b70c590a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FVVZJ7B63D3ESMIEZWOSHK4PHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","q-bio.GN"],"primary_cat":"cs.DS","authors_text":"David A. Bader, Jijun Tang, Stephen W. Schaeffer, Zhaoming Yin","submitted_at":"2017-05-18T12:53:56Z","abstract_excerpt":"The edit distance under the DCJ model can be computed in linear time for genomes with equal content or with Indels. But it becomes NP-Hard in the presence of duplications, a problem largely unsolved especially when Indels are considered. In this paper, we compare two mainstream methods to deal with duplications and associate them with Indels: one by deletion, namely DCJ-Indel-Exemplar distance; versus the other by gene matching, namely DCJ-Indel-Matching distance. We design branch-and-bound algorithms with set of optimization methods to compute exact distances for both. Furthermore, median pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06559","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-18T00:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjQUE9+pVV+uwPZwuFvJU3TzRts5Fp+auSA4LPYdAEfBQnboseeWuGqWD+SNkzTwUERdbcvwHiLQfEsM2gB3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:23:49.362284Z"},"content_sha256":"b3abf31e6ee918754f07b4e8e19fd73282c6353d5c0e8466fb4bf1045be1af78","schema_version":"1.0","event_id":"sha256:b3abf31e6ee918754f07b4e8e19fd73282c6353d5c0e8466fb4bf1045be1af78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/bundle.json","state_url":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/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-02T11:23:49Z","links":{"resolver":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG","bundle":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/bundle.json","state":"https://pith.science/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVVZJ7B63D3ESMIEZWOSHK4PHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FVVZJ7B63D3ESMIEZWOSHK4PHG","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":"f86f4300b1bc4c4f74e744dcb1cd44d619b2940e7560679df8282df57e55b0c8","cross_cats_sorted":["cs.CE","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T12:53:56Z","title_canon_sha256":"f451df73bd5b812f90bb73f673242ecddeb9a91145df508eca8088d83a0c5fd9"},"schema_version":"1.0","source":{"id":"1705.06559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06559","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06559v1","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06559","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"FVVZJ7B63D3E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVVZJ7B63D3ESMIE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVVZJ7B6","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:b3abf31e6ee918754f07b4e8e19fd73282c6353d5c0e8466fb4bf1045be1af78","target":"graph","created_at":"2026-05-18T00:43:39Z","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":"The edit distance under the DCJ model can be computed in linear time for genomes with equal content or with Indels. But it becomes NP-Hard in the presence of duplications, a problem largely unsolved especially when Indels are considered. In this paper, we compare two mainstream methods to deal with duplications and associate them with Indels: one by deletion, namely DCJ-Indel-Exemplar distance; versus the other by gene matching, namely DCJ-Indel-Matching distance. We design branch-and-bound algorithms with set of optimization methods to compute exact distances for both. Furthermore, median pro","authors_text":"David A. Bader, Jijun Tang, Stephen W. Schaeffer, Zhaoming Yin","cross_cats":["cs.CE","q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T12:53:56Z","title":"Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06559","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:a020f71700edd76011b0a1bc6e85641f06c605f4debe70aefc451b5b70c590a2","target":"record","created_at":"2026-05-18T00:43:39Z","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":"f86f4300b1bc4c4f74e744dcb1cd44d619b2940e7560679df8282df57e55b0c8","cross_cats_sorted":["cs.CE","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T12:53:56Z","title_canon_sha256":"f451df73bd5b812f90bb73f673242ecddeb9a91145df508eca8088d83a0c5fd9"},"schema_version":"1.0","source":{"id":"1705.06559","kind":"arxiv","version":1}},"canonical_sha256":"2d6b94fc3ed8f6493104cd9d23ab8f39b4c2ba7b2788e24647156953674bd947","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d6b94fc3ed8f6493104cd9d23ab8f39b4c2ba7b2788e24647156953674bd947","first_computed_at":"2026-05-18T00:43:39.092604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:39.092604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ONsa/NoJFwENjei67oSt8DNo5g9VFtKPAC0FUos2d/nZFecBl/kvpvpee3WFSbfxlO4e69GfRAv7orNfwOekCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:39.093083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a020f71700edd76011b0a1bc6e85641f06c605f4debe70aefc451b5b70c590a2","sha256:b3abf31e6ee918754f07b4e8e19fd73282c6353d5c0e8466fb4bf1045be1af78"],"state_sha256":"104716ddbd41a3c988b1eaaffcf8d781c7b0d8e555d918f524685146927e1665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Px15AruFIi8k4rJefp0KJ8eGcQjfL/mu60BKIATs/Phh9os4pZNhPZw1ka4yf+hLhmxjiw/P+DOIzxn1w4GBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:23:49.364078Z","bundle_sha256":"3f75c297916ad7c466de6a7d2dc899b7eae960a75ffe4e56f15a6ad91073daf2"}}