{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JHFM5LE4SBCKTJNITBW7DCWKGG","short_pith_number":"pith:JHFM5LE4","schema_version":"1.0","canonical_sha256":"49caceac9c9044a9a5a8986df18aca31a73eb6036b763749eaa53231b404b976","source":{"kind":"arxiv","id":"2504.21116","version":1},"attestation_state":"computed","paper":{"title":"Beyond level-1: Identifiability of a class of galled tree-child networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Cecile Ane, Elizabeth S. Allman, Hector Banos, John A. Rhodes","submitted_at":"2025-04-29T18:55:47Z","abstract_excerpt":"Inference of phylogenetic networks is of increasing interest in the genomic era. However, the extent to which phylogenetic networks are identifiable from various types of data remains poorly understood, despite its crucial role in justifying methods. This work obtains strong identifiability results for large sub-classes of galled tree-child semidirected networks. Some of the conditions our proofs require, such as the identifiability of a network's tree of blobs or the circular order of 4 taxa around a cycle in a level-1 network, are already known to hold for many data types. We show that all t"},"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":"2504.21116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2025-04-29T18:55:47Z","cross_cats_sorted":[],"title_canon_sha256":"8a134b9f3db4c7833c5c4961ac807dd2a00990a69d92b867c563e765dbc239be","abstract_canon_sha256":"7e7293d1ea0d2525e5f7c0029fdc3a857da7583489963bf00383cb4cdf74ea2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:56.979795Z","signature_b64":"zq/rbdWHKnGSLgqA5sQsJmc3703u5FFz9siWu90bdd+v5g4yn3W00IGC8QpzjmSWBHE5BfMaSKjyLClgWh65BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49caceac9c9044a9a5a8986df18aca31a73eb6036b763749eaa53231b404b976","last_reissued_at":"2026-07-05T10:55:56.979291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:56.979291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond level-1: Identifiability of a class of galled tree-child networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Cecile Ane, Elizabeth S. Allman, Hector Banos, John A. Rhodes","submitted_at":"2025-04-29T18:55:47Z","abstract_excerpt":"Inference of phylogenetic networks is of increasing interest in the genomic era. However, the extent to which phylogenetic networks are identifiable from various types of data remains poorly understood, despite its crucial role in justifying methods. This work obtains strong identifiability results for large sub-classes of galled tree-child semidirected networks. Some of the conditions our proofs require, such as the identifiability of a network's tree of blobs or the circular order of 4 taxa around a cycle in a level-1 network, are already known to hold for many data types. We show that all t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21116","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.21116/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":"2504.21116","created_at":"2026-07-05T10:55:56.979360+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21116v1","created_at":"2026-07-05T10:55:56.979360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21116","created_at":"2026-07-05T10:55:56.979360+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHFM5LE4SBCK","created_at":"2026-07-05T10:55:56.979360+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHFM5LE4SBCKTJNI","created_at":"2026-07-05T10:55:56.979360+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHFM5LE4","created_at":"2026-07-05T10:55:56.979360+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26673","citing_title":"Semialgebraic Conditions for Identifying Triangles in Phylogenetic Networks","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG","json":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG.json","graph_json":"https://pith.science/api/pith-number/JHFM5LE4SBCKTJNITBW7DCWKGG/graph.json","events_json":"https://pith.science/api/pith-number/JHFM5LE4SBCKTJNITBW7DCWKGG/events.json","paper":"https://pith.science/paper/JHFM5LE4"},"agent_actions":{"view_html":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG","download_json":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG.json","view_paper":"https://pith.science/paper/JHFM5LE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21116&json=true","fetch_graph":"https://pith.science/api/pith-number/JHFM5LE4SBCKTJNITBW7DCWKGG/graph.json","fetch_events":"https://pith.science/api/pith-number/JHFM5LE4SBCKTJNITBW7DCWKGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG/action/storage_attestation","attest_author":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG/action/author_attestation","sign_citation":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG/action/citation_signature","submit_replication":"https://pith.science/pith/JHFM5LE4SBCKTJNITBW7DCWKGG/action/replication_record"}},"created_at":"2026-07-05T10:55:56.979360+00:00","updated_at":"2026-07-05T10:55:56.979360+00:00"}