{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XR6CBIHZJIREEDJINDCHUJT27C","short_pith_number":"pith:XR6CBIHZ","schema_version":"1.0","canonical_sha256":"bc7c20a0f94a22420d2868c47a267af8895416f43dcecaae6aa515f65c5eb6a6","source":{"kind":"arxiv","id":"1711.06720","version":1},"attestation_state":"computed","paper":{"title":"Quarnet inference rules for level-1 networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Charles Semple, Katharine T. Huber, Taoyang Wu, Vincent Moulton","submitted_at":"2017-11-17T20:48:25Z","abstract_excerpt":"An important problem in phylogenetics is the construction of phylogenetic trees. One way to approach this problem, known as the supertree method, involves inferring a phylogenetic tree with leaves consisting of a set $X$ of species from a collection of trees, each having leaf-set some subset of $X$. In the 1980's characterizations, certain inference rules were given for when a collection of 4-leaved trees, one for each 4-element subset of $X$, can all be simultaneously displayed by a single supertree with leaf-set $X$. Recently, it has become of interest to extend such results to phylogenetic "},"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":"1711.06720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-17T20:48:25Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"067c7545a608ce302eb11fa2966106ea57316c4261bdbd7f938d83cf9f06c40c","abstract_canon_sha256":"8acd495e4100b55f2c97c3493b0a89e02cc7d969a448592dfa648ce73a87e9ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:15.837649Z","signature_b64":"06IG6yEndYQJKZr7AKcuQ6NkXJvcvOsSn8DZ/JjA008azH9MBHVQZNpFh8zUNfBcoaW8Aq7htwgwdTbpGmx+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7c20a0f94a22420d2868c47a267af8895416f43dcecaae6aa515f65c5eb6a6","last_reissued_at":"2026-05-18T00:30:15.836881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:15.836881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quarnet inference rules for level-1 networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"q-bio.PE","authors_text":"Charles Semple, Katharine T. Huber, Taoyang Wu, Vincent Moulton","submitted_at":"2017-11-17T20:48:25Z","abstract_excerpt":"An important problem in phylogenetics is the construction of phylogenetic trees. One way to approach this problem, known as the supertree method, involves inferring a phylogenetic tree with leaves consisting of a set $X$ of species from a collection of trees, each having leaf-set some subset of $X$. In the 1980's characterizations, certain inference rules were given for when a collection of 4-leaved trees, one for each 4-element subset of $X$, can all be simultaneously displayed by a single supertree with leaf-set $X$. Recently, it has become of interest to extend such results to phylogenetic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06720","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.06720","created_at":"2026-05-18T00:30:15.836984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06720v1","created_at":"2026-05-18T00:30:15.836984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06720","created_at":"2026-05-18T00:30:15.836984+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR6CBIHZJIRE","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR6CBIHZJIREEDJI","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR6CBIHZ","created_at":"2026-05-18T12:31:56.362134+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/XR6CBIHZJIREEDJINDCHUJT27C","json":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C.json","graph_json":"https://pith.science/api/pith-number/XR6CBIHZJIREEDJINDCHUJT27C/graph.json","events_json":"https://pith.science/api/pith-number/XR6CBIHZJIREEDJINDCHUJT27C/events.json","paper":"https://pith.science/paper/XR6CBIHZ"},"agent_actions":{"view_html":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C","download_json":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C.json","view_paper":"https://pith.science/paper/XR6CBIHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06720&json=true","fetch_graph":"https://pith.science/api/pith-number/XR6CBIHZJIREEDJINDCHUJT27C/graph.json","fetch_events":"https://pith.science/api/pith-number/XR6CBIHZJIREEDJINDCHUJT27C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/action/storage_attestation","attest_author":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/action/author_attestation","sign_citation":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/action/citation_signature","submit_replication":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/action/replication_record"}},"created_at":"2026-05-18T00:30:15.836984+00:00","updated_at":"2026-05-18T00:30:15.836984+00:00"}