{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZMKVSBW6ZQQVI2IKCJ2I7ZYI75","short_pith_number":"pith:ZMKVSBW6","schema_version":"1.0","canonical_sha256":"cb155906decc2154690a12748fe708ff7828275b958e36f27f11b305961b20d1","source":{"kind":"arxiv","id":"2602.22281","version":3},"attestation_state":"computed","paper":{"title":"A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.CO","authors_text":"Leo van Iersel, Ruben Meuwese, Steven Kelk","submitted_at":"2026-02-25T11:20:18Z","abstract_excerpt":"The maximum agreement forest (MAF) problem in phylogenetics takes as input a set t >= 2 of binary phylogenetic trees T on the same set of taxa X. It asks for a partition of X into the smallest number of blocks such that the subtrees induced by these blocks are disjoint and have common topology across all the trees in T. We produce a modified version of the well-known chain reduction rule in order to prove that after exhaustive application of reduction rules each tree has O( t * r * k ) leaves, where k is the natural parameter (the number of blocks) and r=min{max{k,3},t+1}}. We prove this bound"},"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":"2602.22281","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-02-25T11:20:18Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"a68788920b08f2d181e5cdbade325dc7f4cd606799c49dd4fce7641e4b2e62a2","abstract_canon_sha256":"6ddec220b8932e33ac35370f35933c0fd4018ce0ad7fae3acdf63b3ff1207dbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:19.969333Z","signature_b64":"yIN+a8n7rBj2G/XMtn7sfGrm3bQm/l8VBGZMZpGcjetEgu5BZ8aYg2jfhUgAZ/pZ4cVDxxbU6hTFwTyXXg4mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb155906decc2154690a12748fe708ff7828275b958e36f27f11b305961b20d1","last_reissued_at":"2026-06-12T01:10:19.968551Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:19.968551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.CO","authors_text":"Leo van Iersel, Ruben Meuwese, Steven Kelk","submitted_at":"2026-02-25T11:20:18Z","abstract_excerpt":"The maximum agreement forest (MAF) problem in phylogenetics takes as input a set t >= 2 of binary phylogenetic trees T on the same set of taxa X. It asks for a partition of X into the smallest number of blocks such that the subtrees induced by these blocks are disjoint and have common topology across all the trees in T. We produce a modified version of the well-known chain reduction rule in order to prove that after exhaustive application of reduction rules each tree has O( t * r * k ) leaves, where k is the natural parameter (the number of blocks) and r=min{max{k,3},t+1}}. We prove this bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.22281","kind":"arxiv","version":3},"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/2602.22281/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":"2602.22281","created_at":"2026-06-12T01:10:19.968682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.22281v3","created_at":"2026-06-12T01:10:19.968682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.22281","created_at":"2026-06-12T01:10:19.968682+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMKVSBW6ZQQV","created_at":"2026-06-12T01:10:19.968682+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMKVSBW6ZQQVI2IK","created_at":"2026-06-12T01:10:19.968682+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMKVSBW6","created_at":"2026-06-12T01:10:19.968682+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/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75","json":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75.json","graph_json":"https://pith.science/api/pith-number/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/graph.json","events_json":"https://pith.science/api/pith-number/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/events.json","paper":"https://pith.science/paper/ZMKVSBW6"},"agent_actions":{"view_html":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75","download_json":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75.json","view_paper":"https://pith.science/paper/ZMKVSBW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.22281&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/action/storage_attestation","attest_author":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/action/author_attestation","sign_citation":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/action/citation_signature","submit_replication":"https://pith.science/pith/ZMKVSBW6ZQQVI2IKCJ2I7ZYI75/action/replication_record"}},"created_at":"2026-06-12T01:10:19.968682+00:00","updated_at":"2026-06-12T01:10:19.968682+00:00"}