{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:N3BIZEO63U74MXGJ4NPMZ7NRQX","short_pith_number":"pith:N3BIZEO6","canonical_record":{"source":{"id":"1610.05068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T12:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"acb0ff4e66d131b6a4944a3307149da9b6882e335158684ffebed370d6337cbe","abstract_canon_sha256":"5420ac1e7fba147f87717d284f44449d160290a93637ae9b4be41bffbd194fa3"},"schema_version":"1.0"},"canonical_sha256":"6ec28c91dedd3fc65cc9e35eccfdb185cb9950c485bf386346a5e0abce42005d","source":{"kind":"arxiv","id":"1610.05068","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05068","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05068v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05068","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"N3BIZEO63U74","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N3BIZEO63U74MXGJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N3BIZEO6","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:N3BIZEO63U74MXGJ4NPMZ7NRQX","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T12:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"acb0ff4e66d131b6a4944a3307149da9b6882e335158684ffebed370d6337cbe","abstract_canon_sha256":"5420ac1e7fba147f87717d284f44449d160290a93637ae9b4be41bffbd194fa3"},"schema_version":"1.0"},"canonical_sha256":"6ec28c91dedd3fc65cc9e35eccfdb185cb9950c485bf386346a5e0abce42005d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.619705Z","signature_b64":"vmq4fSqb9T1r56dvjC4uvSzCTMu2dWtgJTbivmKefYM4XCtYz4WKHImJk6W5XSAmhivqHCkSPTzSiSupjy/iAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec28c91dedd3fc65cc9e35eccfdb185cb9950c485bf386346a5e0abce42005d","last_reissued_at":"2026-05-18T01:01:35.619038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.619038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05068","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-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNACUmiPFRF0endEGVZTluwdmUDXNsczqCl0W1ZPZYcgs7begxX4Ruhd6CcbX3UCAU7w9aEm3gyNrbplQNURBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:31:13.168796Z"},"content_sha256":"7e8fe1db2a89acf4a1326c2e3f78756670d102b6be67f182c1cf01a3c46bcced","schema_version":"1.0","event_id":"sha256:7e8fe1db2a89acf4a1326c2e3f78756670d102b6be67f182c1cf01a3c46bcced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:N3BIZEO63U74MXGJ4NPMZ7NRQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gene Tree Construction and Correction using SuperTree and Reconciliation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A\\\"ida Ouangraoua, C\\'edric Chauve, Manuel Lafond, Nadia El-Mabrouk","submitted_at":"2016-10-17T12:13:01Z","abstract_excerpt":"The supertree problem asking for a tree displaying a set of consistent input trees has been largely considered for the reconstruction of species trees. Here, we rather explore this framework for the sake of reconstructing a gene tree from a set of input gene trees on partial data. In this perspective, the phylogenetic tree for the species containing the genes of interest can be used to choose among the many possible compatible \"supergenetrees\", the most natural criteria being to minimize a reconciliation cost. We develop a variety of algorithmic solutions for the construction and correction of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05068","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-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrF9t65M2mm5FpRs4Nc7ukwpG/yJ5j1xyRYQwO67X6hszO/vc7Uv0bKIpttr0GzUAT+bOhZeGyPbrortRPNnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:31:13.169491Z"},"content_sha256":"22aa55bda99425cfeb5dc958bb163ac1323e2438220fe5bbac672e7a9618e79e","schema_version":"1.0","event_id":"sha256:22aa55bda99425cfeb5dc958bb163ac1323e2438220fe5bbac672e7a9618e79e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3BIZEO63U74MXGJ4NPMZ7NRQX/bundle.json","state_url":"https://pith.science/pith/N3BIZEO63U74MXGJ4NPMZ7NRQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3BIZEO63U74MXGJ4NPMZ7NRQX/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-25T18:31:13Z","links":{"resolver":"https://pith.science/pith/N3BIZEO63U74MXGJ4NPMZ7NRQX","bundle":"https://pith.science/pith/N3BIZEO63U74MXGJ4NPMZ7NRQX/bundle.json","state":"https://pith.science/pith/N3BIZEO63U74MXGJ4NPMZ7NRQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3BIZEO63U74MXGJ4NPMZ7NRQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N3BIZEO63U74MXGJ4NPMZ7NRQX","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":"5420ac1e7fba147f87717d284f44449d160290a93637ae9b4be41bffbd194fa3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T12:13:01Z","title_canon_sha256":"acb0ff4e66d131b6a4944a3307149da9b6882e335158684ffebed370d6337cbe"},"schema_version":"1.0","source":{"id":"1610.05068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05068","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05068v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05068","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"N3BIZEO63U74","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N3BIZEO63U74MXGJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N3BIZEO6","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:22aa55bda99425cfeb5dc958bb163ac1323e2438220fe5bbac672e7a9618e79e","target":"graph","created_at":"2026-05-18T01:01:35Z","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 supertree problem asking for a tree displaying a set of consistent input trees has been largely considered for the reconstruction of species trees. Here, we rather explore this framework for the sake of reconstructing a gene tree from a set of input gene trees on partial data. In this perspective, the phylogenetic tree for the species containing the genes of interest can be used to choose among the many possible compatible \"supergenetrees\", the most natural criteria being to minimize a reconciliation cost. We develop a variety of algorithmic solutions for the construction and correction of","authors_text":"A\\\"ida Ouangraoua, C\\'edric Chauve, Manuel Lafond, Nadia El-Mabrouk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T12:13:01Z","title":"Gene Tree Construction and Correction using SuperTree and Reconciliation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05068","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:7e8fe1db2a89acf4a1326c2e3f78756670d102b6be67f182c1cf01a3c46bcced","target":"record","created_at":"2026-05-18T01:01:35Z","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":"5420ac1e7fba147f87717d284f44449d160290a93637ae9b4be41bffbd194fa3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T12:13:01Z","title_canon_sha256":"acb0ff4e66d131b6a4944a3307149da9b6882e335158684ffebed370d6337cbe"},"schema_version":"1.0","source":{"id":"1610.05068","kind":"arxiv","version":2}},"canonical_sha256":"6ec28c91dedd3fc65cc9e35eccfdb185cb9950c485bf386346a5e0abce42005d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ec28c91dedd3fc65cc9e35eccfdb185cb9950c485bf386346a5e0abce42005d","first_computed_at":"2026-05-18T01:01:35.619038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:35.619038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vmq4fSqb9T1r56dvjC4uvSzCTMu2dWtgJTbivmKefYM4XCtYz4WKHImJk6W5XSAmhivqHCkSPTzSiSupjy/iAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:35.619705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e8fe1db2a89acf4a1326c2e3f78756670d102b6be67f182c1cf01a3c46bcced","sha256:22aa55bda99425cfeb5dc958bb163ac1323e2438220fe5bbac672e7a9618e79e"],"state_sha256":"1ca7ba3680610a78b8e9a0a3deca75f434585d7d80eea982a7950dc6fc02e285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OwcUJwH+bMGKTQZNuskUmMg7hashgZRIoeNIG7vIKRt1RbgcbgOktyh4gX2+9m3sijNRGxr+ejIkbR1zUYLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:31:13.173273Z","bundle_sha256":"6795fa18a4d0ec4ebc4e1215b3c530d9abcd7a3cf42b18f9b9fb6d941a33e557"}}