{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:BWWAWQTFV76AZ4RVVVB564SDPX","short_pith_number":"pith:BWWAWQTF","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"},"canonical_sha256":"0dac0b4265affc0cf235ad43df72437dc59c5b3566a12bbe1acd4f8d442a9e61","source":{"kind":"arxiv","id":"0705.1806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.1806","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"0705.1806v1","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1806","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"BWWAWQTFV76A","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"BWWAWQTFV76AZ4RV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"BWWAWQTF","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:BWWAWQTFV76AZ4RVVVB564SDPX","target":"record","payload":{"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"},"canonical_sha256":"0dac0b4265affc0cf235ad43df72437dc59c5b3566a12bbe1acd4f8d442a9e61","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"},"source_kind":"arxiv","source_id":"0705.1806","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-18T03:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LxL0l2d38SvjF3bp+bfGwowFwwyuw13aujoJ0uujUuWD3EZy8uF1uzrkrn5BIOao+wDmK8LAEwmglwNe9W8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:06:31.523055Z"},"content_sha256":"dfc84d784dc54f9a454777bce75401d7ae907203f71a1f2e897a6c6549aa24f6","schema_version":"1.0","event_id":"sha256:dfc84d784dc54f9a454777bce75401d7ae907203f71a1f2e897a6c6549aa24f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:BWWAWQTFV76AZ4RVVVB564SDPX","target":"graph","payload":{"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"},"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-18T03:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9URJrKE7XAybl/dMzRy5iioTBEThnJjTbsym/Ue3b8vxTSASeRIKoBjxWTKw03duwE4eIrUCZgKb1oGEfxHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:06:31.523412Z"},"content_sha256":"9b29b2091b062f870023567df4d901a2671be760a319d347d6955177171d1802","schema_version":"1.0","event_id":"sha256:9b29b2091b062f870023567df4d901a2671be760a319d347d6955177171d1802"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/bundle.json","state_url":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWWAWQTFV76AZ4RVVVB564SDPX/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-02T11:06:31Z","links":{"resolver":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX","bundle":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/bundle.json","state":"https://pith.science/pith/BWWAWQTFV76AZ4RVVVB564SDPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWWAWQTFV76AZ4RVVVB564SDPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:BWWAWQTFV76AZ4RVVVB564SDPX","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":"deb24df344fcf45498b9bc1135f5db19931a743a83b1951650a00c97a43727b2","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T01:10:38Z","title_canon_sha256":"47c8b5eb1a5aff063e908572999d8513e40c133bf25fea09d943e8297abbc4ce"},"schema_version":"1.0","source":{"id":"0705.1806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.1806","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"0705.1806v1","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1806","created_at":"2026-05-18T03:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"BWWAWQTFV76A","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"BWWAWQTFV76AZ4RV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"BWWAWQTF","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:9b29b2091b062f870023567df4d901a2671be760a319d347d6955177171d1802","target":"graph","created_at":"2026-05-18T03:15:44Z","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":"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","authors_text":"Luc Devroye, Perouz Taslakian, Vasek Chvatal, Victor Campos","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T01:10:38Z","title":"Transversals in trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1806","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:dfc84d784dc54f9a454777bce75401d7ae907203f71a1f2e897a6c6549aa24f6","target":"record","created_at":"2026-05-18T03:15:44Z","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":"deb24df344fcf45498b9bc1135f5db19931a743a83b1951650a00c97a43727b2","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T01:10:38Z","title_canon_sha256":"47c8b5eb1a5aff063e908572999d8513e40c133bf25fea09d943e8297abbc4ce"},"schema_version":"1.0","source":{"id":"0705.1806","kind":"arxiv","version":1}},"canonical_sha256":"0dac0b4265affc0cf235ad43df72437dc59c5b3566a12bbe1acd4f8d442a9e61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dac0b4265affc0cf235ad43df72437dc59c5b3566a12bbe1acd4f8d442a9e61","first_computed_at":"2026-05-18T03:15:44.193671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:44.193671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OMqBHoxyqc9GZepKl3nOTIHnSWwc+OD1CcsUS20HVZW3ZVA2JgUR1N+3+0QUao7SlpMbFib/iyaAHOtmueYqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:44.194276Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.1806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfc84d784dc54f9a454777bce75401d7ae907203f71a1f2e897a6c6549aa24f6","sha256:9b29b2091b062f870023567df4d901a2671be760a319d347d6955177171d1802"],"state_sha256":"26fe6a7b081c4a4303e55cb5fc31ccf5090206c0efefd12efd4d9f0d71e31614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jn30I4heh2TI+6YlgkqNLhKBEvQe7apQ2LCnjM9zB1D40EzCJL29h/wsh+epj2hON+HLwT+CAoVx7ILSRJTqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:06:31.525362Z","bundle_sha256":"89bbf30ab84905dd7acbf00ac790d34658304b72eb2556ce75798d436d5a7d75"}}