{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:BWWAWQTFV76AZ4RVVVB564SDPX","short_pith_number":"pith:BWWAWQTF","schema_version":"1.0","canonical_sha256":"0dac0b4265affc0cf235ad43df72437dc59c5b3566a12bbe1acd4f8d442a9e61","source":{"kind":"arxiv","id":"0705.1806","version":1},"attestation_state":"computed","paper":{"title":"Transversals in trees","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luc Devroye, Perouz Taslakian, Vasek Chvatal, Victor Campos","submitted_at":"2007-05-13T01:10:38Z","abstract_excerpt":"A transversal in a rooted tree is any set of nodes that meets every path from the root to a leaf. We let c(T,k) denote the number of transversals of size k in a rooted tree T. We define a partial order on the set of all rooted trees with n nodes by saying that a tree T succeeds a tree T' if c(T,k) is at least c(T',k) for all k and strictly greater than c(T',k) for at least one k. We prove that, for every choice of positive integers d and n, the set of all rooted trees on n nodes where each node has at most d children has a unique minimal element with respect to this partial order and we descri"},"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":"0705.1806","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T01:10:38Z","cross_cats_sorted":[],"title_canon_sha256":"47c8b5eb1a5aff063e908572999d8513e40c133bf25fea09d943e8297abbc4ce","abstract_canon_sha256":"deb24df344fcf45498b9bc1135f5db19931a743a83b1951650a00c97a43727b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:44.194276Z","signature_b64":"OMqBHoxyqc9GZepKl3nOTIHnSWwc+OD1CcsUS20HVZW3ZVA2JgUR1N+3+0QUao7SlpMbFib/iyaAHOtmueYqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dac0b4265affc0cf235ad43df72437dc59c5b3566a12bbe1acd4f8d442a9e61","last_reissued_at":"2026-05-18T03:15:44.193671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:44.193671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transversals in trees","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luc Devroye, Perouz Taslakian, Vasek Chvatal, Victor Campos","submitted_at":"2007-05-13T01:10:38Z","abstract_excerpt":"A transversal in a rooted tree is any set of nodes that meets every path from the root to a leaf. We let c(T,k) denote the number of transversals of size k in a rooted tree T. We define a partial order on the set of all rooted trees with n nodes by saying that a tree T succeeds a tree T' if c(T,k) is at least c(T',k) for all k and strictly greater than c(T',k) for at least one k. We prove that, for every choice of positive integers d and n, the set of all rooted trees on n nodes where each node has at most d children has a unique minimal element with respect to this partial order and we descri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1806","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":"0705.1806","created_at":"2026-05-18T03:15:44.193791+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.1806v1","created_at":"2026-05-18T03:15:44.193791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1806","created_at":"2026-05-18T03:15:44.193791+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWWAWQTFV76A","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWWAWQTFV76AZ4RV","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWWAWQTF","created_at":"2026-05-18T12:25:55.427421+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/BWWAWQTFV76AZ4RVVVB564SDPX","json":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX.json","graph_json":"https://pith.science/api/pith-number/BWWAWQTFV76AZ4RVVVB564SDPX/graph.json","events_json":"https://pith.science/api/pith-number/BWWAWQTFV76AZ4RVVVB564SDPX/events.json","paper":"https://pith.science/paper/BWWAWQTF"},"agent_actions":{"view_html":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX","download_json":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX.json","view_paper":"https://pith.science/paper/BWWAWQTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.1806&json=true","fetch_graph":"https://pith.science/api/pith-number/BWWAWQTFV76AZ4RVVVB564SDPX/graph.json","fetch_events":"https://pith.science/api/pith-number/BWWAWQTFV76AZ4RVVVB564SDPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/action/storage_attestation","attest_author":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/action/author_attestation","sign_citation":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/action/citation_signature","submit_replication":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/action/replication_record"}},"created_at":"2026-05-18T03:15:44.193791+00:00","updated_at":"2026-05-18T03:15:44.193791+00:00"}