{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GI5XCAOD4YKRXFPUSE2CFHNHN7","short_pith_number":"pith:GI5XCAOD","canonical_record":{"source":{"id":"1208.2698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-13T20:03:11Z","cross_cats_sorted":["cs.DM","q-bio.QM"],"title_canon_sha256":"ea1c0fd8bce63d28b3f1bdcf519f3fd0684926db308034935eabf40422ced381","abstract_canon_sha256":"a14089ea6f797407248bff6bbc9dbe0a1ae4519a4663397c42edf8527a8b2688"},"schema_version":"1.0"},"canonical_sha256":"323b7101c3e6151b95f49134229da76fd43944543f3bd6de2c23bd05348cc220","source":{"kind":"arxiv","id":"1208.2698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2698","created_at":"2026-05-18T03:48:47Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2698v1","created_at":"2026-05-18T03:48:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2698","created_at":"2026-05-18T03:48:47Z"},{"alias_kind":"pith_short_12","alias_value":"GI5XCAOD4YKR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GI5XCAOD4YKRXFPU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GI5XCAOD","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GI5XCAOD4YKRXFPUSE2CFHNHN7","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-13T20:03:11Z","cross_cats_sorted":["cs.DM","q-bio.QM"],"title_canon_sha256":"ea1c0fd8bce63d28b3f1bdcf519f3fd0684926db308034935eabf40422ced381","abstract_canon_sha256":"a14089ea6f797407248bff6bbc9dbe0a1ae4519a4663397c42edf8527a8b2688"},"schema_version":"1.0"},"canonical_sha256":"323b7101c3e6151b95f49134229da76fd43944543f3bd6de2c23bd05348cc220","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:47.598388Z","signature_b64":"MRPR8eJuBEg1vuqPrBvPFPMszHf/SOy/29T/y7E9J/pTtdxNz4AKeTGyDT3BvCduuUxOrHk4Wpq4cRLPDZXPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323b7101c3e6151b95f49134229da76fd43944543f3bd6de2c23bd05348cc220","last_reissued_at":"2026-05-18T03:48:47.597589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:47.597589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2698","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-18T03:48:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gw+0iC6UVhkQu/8Ry8sG0x5pV+cQtLa4zEATp1axzuQKmMfPZnVAjn75PfTIgI+iA0UZ8U9Zgj+986RTt78lBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:39:19.414691Z"},"content_sha256":"af83b8385cbb388ad540a4bf7ad7374e6a2807c8c223265b67a97f2a01923063","schema_version":"1.0","event_id":"sha256:af83b8385cbb388ad540a4bf7ad7374e6a2807c8c223265b67a97f2a01923063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GI5XCAOD4YKRXFPUSE2CFHNHN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Branch-and-Cut Algorithm for the 2-Species Duplication-Loss Phylogeny Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","q-bio.QM"],"primary_cat":"math.CO","authors_text":"Sandro Andreotti, Stefan Canzar","submitted_at":"2012-08-13T20:03:11Z","abstract_excerpt":"The reconstruction of the history of evolutionary genome-wide events among a set of related organisms is of great biological interest. A simplified model that captures only content modifying operations was introduced recently. It allows the small phylogeny problem to be formulated as an alignment problem. In this work we present a branch-and-cut algorithm for this so-called duplication-loss alignment problem. Our method clearly outperforms the existing ILP based method by several orders of magnitude. We define classes of valid inequalities and provide algorithms to separate them efficiently an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2698","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-18T03:48:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7krebhG/sKus4P9vFuUTN6j2p6CgsT6zmrE2VTEeslUbgN6VaPxjcAGKRxnw8GtjrJvfZs3ob9WEQdNryPWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:39:19.415034Z"},"content_sha256":"192ff802588e84072cdb724a88bf4658fb68326976b774b182f5ec0fc7061b0d","schema_version":"1.0","event_id":"sha256:192ff802588e84072cdb724a88bf4658fb68326976b774b182f5ec0fc7061b0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI5XCAOD4YKRXFPUSE2CFHNHN7/bundle.json","state_url":"https://pith.science/pith/GI5XCAOD4YKRXFPUSE2CFHNHN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI5XCAOD4YKRXFPUSE2CFHNHN7/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-28T20:39:19Z","links":{"resolver":"https://pith.science/pith/GI5XCAOD4YKRXFPUSE2CFHNHN7","bundle":"https://pith.science/pith/GI5XCAOD4YKRXFPUSE2CFHNHN7/bundle.json","state":"https://pith.science/pith/GI5XCAOD4YKRXFPUSE2CFHNHN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI5XCAOD4YKRXFPUSE2CFHNHN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GI5XCAOD4YKRXFPUSE2CFHNHN7","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":"a14089ea6f797407248bff6bbc9dbe0a1ae4519a4663397c42edf8527a8b2688","cross_cats_sorted":["cs.DM","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-13T20:03:11Z","title_canon_sha256":"ea1c0fd8bce63d28b3f1bdcf519f3fd0684926db308034935eabf40422ced381"},"schema_version":"1.0","source":{"id":"1208.2698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2698","created_at":"2026-05-18T03:48:47Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2698v1","created_at":"2026-05-18T03:48:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2698","created_at":"2026-05-18T03:48:47Z"},{"alias_kind":"pith_short_12","alias_value":"GI5XCAOD4YKR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GI5XCAOD4YKRXFPU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GI5XCAOD","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:192ff802588e84072cdb724a88bf4658fb68326976b774b182f5ec0fc7061b0d","target":"graph","created_at":"2026-05-18T03:48:47Z","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 reconstruction of the history of evolutionary genome-wide events among a set of related organisms is of great biological interest. A simplified model that captures only content modifying operations was introduced recently. It allows the small phylogeny problem to be formulated as an alignment problem. In this work we present a branch-and-cut algorithm for this so-called duplication-loss alignment problem. Our method clearly outperforms the existing ILP based method by several orders of magnitude. We define classes of valid inequalities and provide algorithms to separate them efficiently an","authors_text":"Sandro Andreotti, Stefan Canzar","cross_cats":["cs.DM","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-13T20:03:11Z","title":"A Branch-and-Cut Algorithm for the 2-Species Duplication-Loss Phylogeny Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2698","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:af83b8385cbb388ad540a4bf7ad7374e6a2807c8c223265b67a97f2a01923063","target":"record","created_at":"2026-05-18T03:48:47Z","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":"a14089ea6f797407248bff6bbc9dbe0a1ae4519a4663397c42edf8527a8b2688","cross_cats_sorted":["cs.DM","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-13T20:03:11Z","title_canon_sha256":"ea1c0fd8bce63d28b3f1bdcf519f3fd0684926db308034935eabf40422ced381"},"schema_version":"1.0","source":{"id":"1208.2698","kind":"arxiv","version":1}},"canonical_sha256":"323b7101c3e6151b95f49134229da76fd43944543f3bd6de2c23bd05348cc220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323b7101c3e6151b95f49134229da76fd43944543f3bd6de2c23bd05348cc220","first_computed_at":"2026-05-18T03:48:47.597589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:47.597589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRPR8eJuBEg1vuqPrBvPFPMszHf/SOy/29T/y7E9J/pTtdxNz4AKeTGyDT3BvCduuUxOrHk4Wpq4cRLPDZXPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:47.598388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af83b8385cbb388ad540a4bf7ad7374e6a2807c8c223265b67a97f2a01923063","sha256:192ff802588e84072cdb724a88bf4658fb68326976b774b182f5ec0fc7061b0d"],"state_sha256":"4660b4876783834de3dd56e7390cb77d8b6b3e0d84397ea99a437ec2c177ba99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SwaLYJM1JBkGnwu7fjo/1yniK/Ahmt23RWGGyqvGOO9kzuYwPa+X60ov3FQTtYyyecGpdjH053+e61iGaK7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:39:19.416906Z","bundle_sha256":"0e1725d3896086c223425bd903a8492dab51989eb3c4b244aee4d62a386b5ef9"}}