{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4SC7KLON5BMSTZ2I6MPOLPOJVG","short_pith_number":"pith:4SC7KLON","canonical_record":{"source":{"id":"2107.00072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-30T19:45:18Z","cross_cats_sorted":["cs.CC","math.CO","q-bio.PE"],"title_canon_sha256":"c7cd6809baf3a71cd60122e6b6caaba3b5f31735db325006a517a83055d3d4d6","abstract_canon_sha256":"82438ad8133a5abc97ccb0f78db661dff5af57a1c853a322f9c7675a76fc11b7"},"schema_version":"1.0"},"canonical_sha256":"e485f52dcde85929e748f31ee5bdc9a98cc58abb4d6bbe04a0c7d867ca8a5316","source":{"kind":"arxiv","id":"2107.00072","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.00072","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"2107.00072v2","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00072","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"4SC7KLON5BMS","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"4SC7KLON5BMSTZ2I","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"4SC7KLON","created_at":"2026-07-05T03:17:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4SC7KLON5BMSTZ2I6MPOLPOJVG","target":"record","payload":{"canonical_record":{"source":{"id":"2107.00072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-30T19:45:18Z","cross_cats_sorted":["cs.CC","math.CO","q-bio.PE"],"title_canon_sha256":"c7cd6809baf3a71cd60122e6b6caaba3b5f31735db325006a517a83055d3d4d6","abstract_canon_sha256":"82438ad8133a5abc97ccb0f78db661dff5af57a1c853a322f9c7675a76fc11b7"},"schema_version":"1.0"},"canonical_sha256":"e485f52dcde85929e748f31ee5bdc9a98cc58abb4d6bbe04a0c7d867ca8a5316","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:03.798859Z","signature_b64":"j6co7RmG/IrywUFbKuOfx9XJQyTJvrl9Bz44IxJxHzIsQ55s8F4GQNz5QbLQh6uOHpRgz5nICrwKV4Uka6pVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e485f52dcde85929e748f31ee5bdc9a98cc58abb4d6bbe04a0c7d867ca8a5316","last_reissued_at":"2026-07-05T03:17:03.798344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:03.798344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.00072","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-07-05T03:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sVoX6qONlGk4m8gJ7NNASlfVfYmdZRs0Ry9Y3mnAo4mDUEYzgRP8vn1TVcdrfjgiT762tJui4GNkLOjGQfJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:10:54.131523Z"},"content_sha256":"bfb637312326fc4c765c85c8e852a6436551731872aa902a3930e6eb18dc4605","schema_version":"1.0","event_id":"sha256:bfb637312326fc4c765c85c8e852a6436551731872aa902a3930e6eb18dc4605"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4SC7KLON5BMSTZ2I6MPOLPOJVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","q-bio.PE"],"primary_cat":"cs.DS","authors_text":"David Schaller, Marc Hellmuth, Peter F. Stadler","submitted_at":"2021-06-30T19:45:18Z","abstract_excerpt":"Background. The supertree problem, i.e., the task of finding a common refinement of a set of rooted trees is an important topic in mathematical phylogenetics. The special case of a common leaf set $L$ is known to be solvable in linear time. Existing approaches refine one input tree using information of the others and then test whether the results are isomorphic.\n  Results. A linear-time algorithm, LinCR, for constructing the common refinement $T$ of $k$ input trees with a common leaf set is proposed that explicitly computes the parent function of $T$ in a bottom-up approach.\n  Conclusion. LinC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00072","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.00072/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"},"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-07-05T03:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZVWyakH3s05tam4xS800rNGh8fCDs2a4wy48TUrUJ1H8SaUC9IIdO9YommeypSmaDRkAk1YawYTdZ//H9AdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:10:54.131922Z"},"content_sha256":"54ce05d066098a8e32b704d10ba2a16815bae82265f8d0079f016c4842e05680","schema_version":"1.0","event_id":"sha256:54ce05d066098a8e32b704d10ba2a16815bae82265f8d0079f016c4842e05680"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SC7KLON5BMSTZ2I6MPOLPOJVG/bundle.json","state_url":"https://pith.science/pith/4SC7KLON5BMSTZ2I6MPOLPOJVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SC7KLON5BMSTZ2I6MPOLPOJVG/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-07-06T21:10:54Z","links":{"resolver":"https://pith.science/pith/4SC7KLON5BMSTZ2I6MPOLPOJVG","bundle":"https://pith.science/pith/4SC7KLON5BMSTZ2I6MPOLPOJVG/bundle.json","state":"https://pith.science/pith/4SC7KLON5BMSTZ2I6MPOLPOJVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SC7KLON5BMSTZ2I6MPOLPOJVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4SC7KLON5BMSTZ2I6MPOLPOJVG","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":"82438ad8133a5abc97ccb0f78db661dff5af57a1c853a322f9c7675a76fc11b7","cross_cats_sorted":["cs.CC","math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-30T19:45:18Z","title_canon_sha256":"c7cd6809baf3a71cd60122e6b6caaba3b5f31735db325006a517a83055d3d4d6"},"schema_version":"1.0","source":{"id":"2107.00072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.00072","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"2107.00072v2","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00072","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"4SC7KLON5BMS","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"4SC7KLON5BMSTZ2I","created_at":"2026-07-05T03:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"4SC7KLON","created_at":"2026-07-05T03:17:03Z"}],"graph_snapshots":[{"event_id":"sha256:54ce05d066098a8e32b704d10ba2a16815bae82265f8d0079f016c4842e05680","target":"graph","created_at":"2026-07-05T03:17:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.00072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Background. The supertree problem, i.e., the task of finding a common refinement of a set of rooted trees is an important topic in mathematical phylogenetics. The special case of a common leaf set $L$ is known to be solvable in linear time. Existing approaches refine one input tree using information of the others and then test whether the results are isomorphic.\n  Results. A linear-time algorithm, LinCR, for constructing the common refinement $T$ of $k$ input trees with a common leaf set is proposed that explicitly computes the parent function of $T$ in a bottom-up approach.\n  Conclusion. LinC","authors_text":"David Schaller, Marc Hellmuth, Peter F. Stadler","cross_cats":["cs.CC","math.CO","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-30T19:45:18Z","title":"A Simple Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00072","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:bfb637312326fc4c765c85c8e852a6436551731872aa902a3930e6eb18dc4605","target":"record","created_at":"2026-07-05T03:17:03Z","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":"82438ad8133a5abc97ccb0f78db661dff5af57a1c853a322f9c7675a76fc11b7","cross_cats_sorted":["cs.CC","math.CO","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-30T19:45:18Z","title_canon_sha256":"c7cd6809baf3a71cd60122e6b6caaba3b5f31735db325006a517a83055d3d4d6"},"schema_version":"1.0","source":{"id":"2107.00072","kind":"arxiv","version":2}},"canonical_sha256":"e485f52dcde85929e748f31ee5bdc9a98cc58abb4d6bbe04a0c7d867ca8a5316","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e485f52dcde85929e748f31ee5bdc9a98cc58abb4d6bbe04a0c7d867ca8a5316","first_computed_at":"2026-07-05T03:17:03.798344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:17:03.798344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j6co7RmG/IrywUFbKuOfx9XJQyTJvrl9Bz44IxJxHzIsQ55s8F4GQNz5QbLQh6uOHpRgz5nICrwKV4Uka6pVCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:17:03.798859Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.00072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfb637312326fc4c765c85c8e852a6436551731872aa902a3930e6eb18dc4605","sha256:54ce05d066098a8e32b704d10ba2a16815bae82265f8d0079f016c4842e05680"],"state_sha256":"df9a9721162f5f18e9bfbaae59b70db968bef99f8887966e2580819ee0b65299"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3RRznSSffmK91+IIFEQ965WFP2qGzpuYNQoYSAF+aPGxiTGsLv6kuKH8InG70CsMDxoR1RRf+kOqAUBXSPdXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T21:10:54.133899Z","bundle_sha256":"23fe964cabfd72b965c74a89a94b301a8a575dc93d09ed86ae1c6c01e05af985"}}