{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HGBSBLQYCP62L6E2P6JXWDI43X","short_pith_number":"pith:HGBSBLQY","schema_version":"1.0","canonical_sha256":"398320ae1813fda5f89a7f937b0d1cdde956904fc222dbdcf6b7e0e50fa9d714","source":{"kind":"arxiv","id":"2411.00708","version":3},"attestation_state":"computed","paper":{"title":"Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Anna Lindeberg, Marc Hellmuth","submitted_at":"2024-11-01T16:18:33Z","abstract_excerpt":"Rooted phylogenetic networks, or more generally, directed acyclic graphs (DAGs), are widely used to model species or gene relationships that traditional rooted trees cannot fully capture, especially in the presence of reticulate processes or horizontal gene transfers. Such networks or DAGs are typically inferred from observable data (e.g. genomic sequences of extant species), providing only an estimate of the true evolutionary history. However, these inferred DAGs are often complex and difficult to interpret. In particular, many contain vertices that do not serve as least common ancestors (LCA"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.00708","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"q-bio.PE","submitted_at":"2024-11-01T16:18:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"5c89a6382f90c2e6ea5f5e82369bca5694c78f1f49c32ece6912f80720dda7a6","abstract_canon_sha256":"2684ab1e63b9e4f9d9c9c8f0cd7ab78067ec1a2e79fe7eed36f158148de7517e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:19.236249Z","signature_b64":"sOAQOVEfRXe9Tb+2qIx2LgTCKyAn/Y4b/ynGkgQQ7i0IuJ+dSxpmbnJkVi0Ij9O8fleU7/eW4WVou7Xn3lvpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"398320ae1813fda5f89a7f937b0d1cdde956904fc222dbdcf6b7e0e50fa9d714","last_reissued_at":"2026-07-05T10:04:19.235741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:19.235741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Anna Lindeberg, Marc Hellmuth","submitted_at":"2024-11-01T16:18:33Z","abstract_excerpt":"Rooted phylogenetic networks, or more generally, directed acyclic graphs (DAGs), are widely used to model species or gene relationships that traditional rooted trees cannot fully capture, especially in the presence of reticulate processes or horizontal gene transfers. Such networks or DAGs are typically inferred from observable data (e.g. genomic sequences of extant species), providing only an estimate of the true evolutionary history. However, these inferred DAGs are often complex and difficult to interpret. In particular, many contain vertices that do not serve as least common ancestors (LCA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00708","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.00708/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.00708","created_at":"2026-07-05T10:04:19.235801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.00708v3","created_at":"2026-07-05T10:04:19.235801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00708","created_at":"2026-07-05T10:04:19.235801+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGBSBLQYCP62","created_at":"2026-07-05T10:04:19.235801+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGBSBLQYCP62L6E2","created_at":"2026-07-05T10:04:19.235801+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGBSBLQY","created_at":"2026-07-05T10:04:19.235801+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X","json":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X.json","graph_json":"https://pith.science/api/pith-number/HGBSBLQYCP62L6E2P6JXWDI43X/graph.json","events_json":"https://pith.science/api/pith-number/HGBSBLQYCP62L6E2P6JXWDI43X/events.json","paper":"https://pith.science/paper/HGBSBLQY"},"agent_actions":{"view_html":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X","download_json":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X.json","view_paper":"https://pith.science/paper/HGBSBLQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.00708&json=true","fetch_graph":"https://pith.science/api/pith-number/HGBSBLQYCP62L6E2P6JXWDI43X/graph.json","fetch_events":"https://pith.science/api/pith-number/HGBSBLQYCP62L6E2P6JXWDI43X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X/action/storage_attestation","attest_author":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X/action/author_attestation","sign_citation":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X/action/citation_signature","submit_replication":"https://pith.science/pith/HGBSBLQYCP62L6E2P6JXWDI43X/action/replication_record"}},"created_at":"2026-07-05T10:04:19.235801+00:00","updated_at":"2026-07-05T10:04:19.235801+00:00"}