{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JGVIT2YRQXIJED5WZSHGVLS3NE","short_pith_number":"pith:JGVIT2YR","schema_version":"1.0","canonical_sha256":"49aa89eb1185d0920fb6cc8e6aae5b6917d18bf83de14c1df2319cebfc391207","source":{"kind":"arxiv","id":"1307.7821","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Chuanqi Shen, Jesper Jansson, Wing-Kin Sung","submitted_at":"2013-07-30T05:24:12Z","abstract_excerpt":"This paper presents two new deterministic algorithms for constructing consensus trees. Given an input of k phylogenetic trees with identical leaf label sets and n leaves each, the first algorithm constructs the majority rule (+) consensus tree in O(kn) time, which is optimal since the input size is Omega(kn), and the second one constructs the frequency difference consensus tree in min(O(kn^2), O(kn (k+log^2 n))) time."},"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":"1307.7821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-30T05:24:12Z","cross_cats_sorted":["cs.CE","q-bio.QM"],"title_canon_sha256":"d5196428337c9c5f7f6e54af2d3a628d97312b1fc64c8f6c7025c60166b15c2d","abstract_canon_sha256":"df329b32c43a85984c91ba7e922917c44fec6c510421fc19fe34e65c7250106b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:39.890046Z","signature_b64":"GbtsIncTdr7za8uHZof8uDTUsRP5qWqSr88KyrEmMw/nF0WakgkDN6CPyO86MrWDdLBE13y8a43mIUdwlMBNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49aa89eb1185d0920fb6cc8e6aae5b6917d18bf83de14c1df2319cebfc391207","last_reissued_at":"2026-05-18T03:16:39.889278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:39.889278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Chuanqi Shen, Jesper Jansson, Wing-Kin Sung","submitted_at":"2013-07-30T05:24:12Z","abstract_excerpt":"This paper presents two new deterministic algorithms for constructing consensus trees. Given an input of k phylogenetic trees with identical leaf label sets and n leaves each, the first algorithm constructs the majority rule (+) consensus tree in O(kn) time, which is optimal since the input size is Omega(kn), and the second one constructs the frequency difference consensus tree in min(O(kn^2), O(kn (k+log^2 n))) time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7821","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":""},"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":"1307.7821","created_at":"2026-05-18T03:16:39.889414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7821v2","created_at":"2026-05-18T03:16:39.889414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7821","created_at":"2026-05-18T03:16:39.889414+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGVIT2YRQXIJ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGVIT2YRQXIJED5W","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGVIT2YR","created_at":"2026-05-18T12:27:49.015174+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/JGVIT2YRQXIJED5WZSHGVLS3NE","json":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE.json","graph_json":"https://pith.science/api/pith-number/JGVIT2YRQXIJED5WZSHGVLS3NE/graph.json","events_json":"https://pith.science/api/pith-number/JGVIT2YRQXIJED5WZSHGVLS3NE/events.json","paper":"https://pith.science/paper/JGVIT2YR"},"agent_actions":{"view_html":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE","download_json":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE.json","view_paper":"https://pith.science/paper/JGVIT2YR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7821&json=true","fetch_graph":"https://pith.science/api/pith-number/JGVIT2YRQXIJED5WZSHGVLS3NE/graph.json","fetch_events":"https://pith.science/api/pith-number/JGVIT2YRQXIJED5WZSHGVLS3NE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE/action/storage_attestation","attest_author":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE/action/author_attestation","sign_citation":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE/action/citation_signature","submit_replication":"https://pith.science/pith/JGVIT2YRQXIJED5WZSHGVLS3NE/action/replication_record"}},"created_at":"2026-05-18T03:16:39.889414+00:00","updated_at":"2026-05-18T03:16:39.889414+00:00"}