{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PUBU33QVRZ3LWWIUANSMIZQX5U","short_pith_number":"pith:PUBU33QV","canonical_record":{"source":{"id":"1811.01129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T00:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"2eba545595adc93b36113aacc1e40b9c21895c536d0a7530f75e3d628fe1b7ec","abstract_canon_sha256":"96b34182552cd5682a3d7ec775a3f4f40d26dababbcfd7501e2271c3edbe4fc0"},"schema_version":"1.0"},"canonical_sha256":"7d034dee158e76bb59140364c46617ed16f19d21900a650b1655c5999bf989a7","source":{"kind":"arxiv","id":"1811.01129","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01129","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01129v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01129","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"PUBU33QVRZ3L","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PUBU33QVRZ3LWWIU","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PUBU33QV","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PUBU33QVRZ3LWWIUANSMIZQX5U","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T00:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"2eba545595adc93b36113aacc1e40b9c21895c536d0a7530f75e3d628fe1b7ec","abstract_canon_sha256":"96b34182552cd5682a3d7ec775a3f4f40d26dababbcfd7501e2271c3edbe4fc0"},"schema_version":"1.0"},"canonical_sha256":"7d034dee158e76bb59140364c46617ed16f19d21900a650b1655c5999bf989a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:19.126686Z","signature_b64":"qoAsxrV5b2tg3vYMrvicEvrB11F56sloSGatcZlqnoFJQE/NRORVQL3K41pz6L6TcaifFLrJEy3M/npi00ybAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d034dee158e76bb59140364c46617ed16f19d21900a650b1655c5999bf989a7","last_reissued_at":"2026-05-17T23:57:19.126107Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:19.126107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01129","source_version":3,"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-17T23:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgGLXdjm687c2cTaNnnN/WH6fSI64ER3GtwQ8L90reJavLEK9+t9X0lEYBrHVM0HeZpsfmFDU0XBtp7yxa+kAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:27:19.002163Z"},"content_sha256":"0e2394781a3b295c8ce1783aaddafe87ff6dda8e0a0d1918cfcbdba48720975d","schema_version":"1.0","event_id":"sha256:0e2394781a3b295c8ce1783aaddafe87ff6dda8e0a0d1918cfcbdba48720975d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PUBU33QVRZ3LWWIUANSMIZQX5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Projection onto the Perfect Phylogeny Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bei Jia, Jos\\'e Bento, Sam Safavi, Surjyendu Ray","submitted_at":"2018-11-03T00:03:01Z","abstract_excerpt":"Several algorithms build on the perfect phylogeny model to infer evolutionary trees. This problem is particularly hard when evolutionary trees are inferred from the fraction of genomes that have mutations in different positions, across different samples. Existing algorithms might do extensive searches over the space of possible trees. At the center of these algorithms is a projection problem that assigns a fitness cost to phylogenetic trees. In order to perform a wide search over the space of the trees, it is critical to solve this projection problem fast. In this paper, we use Moreau's decomp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01129","kind":"arxiv","version":3},"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-17T23:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfP3F39GUejSDkApeGXpc2IJWtBPxDoiesD+omkMQUO+qAs5j3pidnDWR9P/znXSQ7NZ9daY99Kk2IuTqY52Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:27:19.002876Z"},"content_sha256":"a267ca8d5362af8ce0b35ad52ff9e7aec55a667791fbfc2dc4dddc7b0ba45097","schema_version":"1.0","event_id":"sha256:a267ca8d5362af8ce0b35ad52ff9e7aec55a667791fbfc2dc4dddc7b0ba45097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUBU33QVRZ3LWWIUANSMIZQX5U/bundle.json","state_url":"https://pith.science/pith/PUBU33QVRZ3LWWIUANSMIZQX5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUBU33QVRZ3LWWIUANSMIZQX5U/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-05-23T22:27:19Z","links":{"resolver":"https://pith.science/pith/PUBU33QVRZ3LWWIUANSMIZQX5U","bundle":"https://pith.science/pith/PUBU33QVRZ3LWWIUANSMIZQX5U/bundle.json","state":"https://pith.science/pith/PUBU33QVRZ3LWWIUANSMIZQX5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUBU33QVRZ3LWWIUANSMIZQX5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PUBU33QVRZ3LWWIUANSMIZQX5U","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":"96b34182552cd5682a3d7ec775a3f4f40d26dababbcfd7501e2271c3edbe4fc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T00:03:01Z","title_canon_sha256":"2eba545595adc93b36113aacc1e40b9c21895c536d0a7530f75e3d628fe1b7ec"},"schema_version":"1.0","source":{"id":"1811.01129","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01129","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01129v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01129","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"PUBU33QVRZ3L","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PUBU33QVRZ3LWWIU","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PUBU33QV","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:a267ca8d5362af8ce0b35ad52ff9e7aec55a667791fbfc2dc4dddc7b0ba45097","target":"graph","created_at":"2026-05-17T23:57:19Z","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":"Several algorithms build on the perfect phylogeny model to infer evolutionary trees. This problem is particularly hard when evolutionary trees are inferred from the fraction of genomes that have mutations in different positions, across different samples. Existing algorithms might do extensive searches over the space of possible trees. At the center of these algorithms is a projection problem that assigns a fitness cost to phylogenetic trees. In order to perform a wide search over the space of the trees, it is critical to solve this projection problem fast. In this paper, we use Moreau's decomp","authors_text":"Bei Jia, Jos\\'e Bento, Sam Safavi, Surjyendu Ray","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T00:03:01Z","title":"Efficient Projection onto the Perfect Phylogeny Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01129","kind":"arxiv","version":3},"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:0e2394781a3b295c8ce1783aaddafe87ff6dda8e0a0d1918cfcbdba48720975d","target":"record","created_at":"2026-05-17T23:57:19Z","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":"96b34182552cd5682a3d7ec775a3f4f40d26dababbcfd7501e2271c3edbe4fc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T00:03:01Z","title_canon_sha256":"2eba545595adc93b36113aacc1e40b9c21895c536d0a7530f75e3d628fe1b7ec"},"schema_version":"1.0","source":{"id":"1811.01129","kind":"arxiv","version":3}},"canonical_sha256":"7d034dee158e76bb59140364c46617ed16f19d21900a650b1655c5999bf989a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d034dee158e76bb59140364c46617ed16f19d21900a650b1655c5999bf989a7","first_computed_at":"2026-05-17T23:57:19.126107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:19.126107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qoAsxrV5b2tg3vYMrvicEvrB11F56sloSGatcZlqnoFJQE/NRORVQL3K41pz6L6TcaifFLrJEy3M/npi00ybAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:19.126686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01129","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e2394781a3b295c8ce1783aaddafe87ff6dda8e0a0d1918cfcbdba48720975d","sha256:a267ca8d5362af8ce0b35ad52ff9e7aec55a667791fbfc2dc4dddc7b0ba45097"],"state_sha256":"57cd22c9a23f75ef165d93393ea147982370fea7e94439b6fb4a1156bfe0cbac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+OG5GuCKJMrbUZU2bO4mwSaTYXhz5eWnZWM2QJ4ULBceOu2V+wD7UmNTCbGHHbErbXhucR3omDW0rAUz88+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:27:19.006497Z","bundle_sha256":"ab3c0a853e13b35e70a29e8862a2633ac05db799b7eac4291f4952dd566a9461"}}