{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XR6CBIHZJIREEDJINDCHUJT27C","short_pith_number":"pith:XR6CBIHZ","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"},"canonical_sha256":"bc7c20a0f94a22420d2868c47a267af8895416f43dcecaae6aa515f65c5eb6a6","source":{"kind":"arxiv","id":"1711.06720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06720","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06720v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06720","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"XR6CBIHZJIRE","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XR6CBIHZJIREEDJI","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XR6CBIHZ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XR6CBIHZJIREEDJINDCHUJT27C","target":"record","payload":{"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"},"canonical_sha256":"bc7c20a0f94a22420d2868c47a267af8895416f43dcecaae6aa515f65c5eb6a6","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"},"source_kind":"arxiv","source_id":"1711.06720","source_version":1,"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-18T00:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7tF7K/JimwzGiD2an2e/jMorWN5d1vvK+yHs/Q91M7CHHInFpD9iKCuofctZf1iRuP9blUjaL1Nvf/+1F8VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:39:54.055087Z"},"content_sha256":"fdc57e4e2cb2a0d002300b499ac5a82c33d00be4a779c0508847fc50a7b21e7f","schema_version":"1.0","event_id":"sha256:fdc57e4e2cb2a0d002300b499ac5a82c33d00be4a779c0508847fc50a7b21e7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XR6CBIHZJIREEDJINDCHUJT27C","target":"graph","payload":{"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"},"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-18T00:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ix1YkH/38D4TSWglJ5H4XQBeYdGh9jBTl761r5pHd8dzqcVK7rzZ7VTQz3qxnECF6nPcLWMiyjq1TnwN86hGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:39:54.055915Z"},"content_sha256":"3f29f38e14925eedd8aba2b1913bf6c2284fca87d5c28463631403ad2d28a36f","schema_version":"1.0","event_id":"sha256:3f29f38e14925eedd8aba2b1913bf6c2284fca87d5c28463631403ad2d28a36f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/bundle.json","state_url":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XR6CBIHZJIREEDJINDCHUJT27C/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-06-12T00:39:54Z","links":{"resolver":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C","bundle":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/bundle.json","state":"https://pith.science/pith/XR6CBIHZJIREEDJINDCHUJT27C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XR6CBIHZJIREEDJINDCHUJT27C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XR6CBIHZJIREEDJINDCHUJT27C","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":"8acd495e4100b55f2c97c3493b0a89e02cc7d969a448592dfa648ce73a87e9ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-17T20:48:25Z","title_canon_sha256":"067c7545a608ce302eb11fa2966106ea57316c4261bdbd7f938d83cf9f06c40c"},"schema_version":"1.0","source":{"id":"1711.06720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06720","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06720v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06720","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"XR6CBIHZJIRE","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XR6CBIHZJIREEDJI","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XR6CBIHZ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:3f29f38e14925eedd8aba2b1913bf6c2284fca87d5c28463631403ad2d28a36f","target":"graph","created_at":"2026-05-18T00:30:15Z","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":"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 ","authors_text":"Charles Semple, Katharine T. Huber, Taoyang Wu, Vincent Moulton","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-17T20:48:25Z","title":"Quarnet inference rules for level-1 networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06720","kind":"arxiv","version":1},"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:fdc57e4e2cb2a0d002300b499ac5a82c33d00be4a779c0508847fc50a7b21e7f","target":"record","created_at":"2026-05-18T00:30:15Z","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":"8acd495e4100b55f2c97c3493b0a89e02cc7d969a448592dfa648ce73a87e9ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2017-11-17T20:48:25Z","title_canon_sha256":"067c7545a608ce302eb11fa2966106ea57316c4261bdbd7f938d83cf9f06c40c"},"schema_version":"1.0","source":{"id":"1711.06720","kind":"arxiv","version":1}},"canonical_sha256":"bc7c20a0f94a22420d2868c47a267af8895416f43dcecaae6aa515f65c5eb6a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc7c20a0f94a22420d2868c47a267af8895416f43dcecaae6aa515f65c5eb6a6","first_computed_at":"2026-05-18T00:30:15.836881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:15.836881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"06IG6yEndYQJKZr7AKcuQ6NkXJvcvOsSn8DZ/JjA008azH9MBHVQZNpFh8zUNfBcoaW8Aq7htwgwdTbpGmx+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:15.837649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdc57e4e2cb2a0d002300b499ac5a82c33d00be4a779c0508847fc50a7b21e7f","sha256:3f29f38e14925eedd8aba2b1913bf6c2284fca87d5c28463631403ad2d28a36f"],"state_sha256":"e1391048b1492efc9f7cbd28207fbb1f93d86b91b25725dd3ffc1e545a9d3e59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jm9XD5G0/05g7Wcy1vymi/FYFZQWmMSqWYkF+OkfJiNK9GjJythwQauO2XbcWmhBhjKif0lda3v8dq4LS8XRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:39:54.060095Z","bundle_sha256":"e570b172b895cbd75fde978f6ca685c7e95f01fa621cdfbdf2dc4b241e2c78b9"}}