{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NA7JIWVKHEKWVBAM7PZ3ZFGNC5","short_pith_number":"pith:NA7JIWVK","schema_version":"1.0","canonical_sha256":"683e945aaa39156a840cfbf3bc94cd175770439d9b64ea12de7a30a8e2b44920","source":{"kind":"arxiv","id":"2009.08549","version":5},"attestation_state":"computed","paper":{"title":"Bounds on Sweep-Covers by Raney Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Blake Wilson","submitted_at":"2020-09-17T22:54:58Z","abstract_excerpt":"In this work, we introduce a vertex separator in trees known as a sweep-cover that is defined by an ancestor-descendent relationship with all nodes in the tree. We prove the recurrence relation of sweep-covers with $n$ subcovers $P_{\\Delta, \\gamma}(n)$ on a class of infinite $\\Delta$-ary trees with constant path lengths $\\gamma$ between the $\\Delta$-star internal nodes. Then, we provide recurrence relations for Raney numbers over integer compositions and show that they provide a lower-bound for sweep-covers such that $P_{\\Delta, \\gamma}(n) = \\Omega\\left( \\frac{\\sqrt{2 \\pi} n^{\\Delta n + \\Delta"},"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":"2009.08549","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-17T22:54:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"33a1c885e81eb772ce31ac241543dac788ce25801d3c5ee72f40bab3ba4ed58f","abstract_canon_sha256":"e0f42a172fdf465fdc214a6d29c4233bb440033693b5dfcac3269a94a81878d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:47:50.206911Z","signature_b64":"9dGrpfTpSssEiQAM5Nai/ckfbOeLkoMvb7qORA2ORASlSUVI2Ctt5Myloi8yuR6Npb7tWafj8elBgbgJUWVbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"683e945aaa39156a840cfbf3bc94cd175770439d9b64ea12de7a30a8e2b44920","last_reissued_at":"2026-07-05T03:47:50.206566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:47:50.206566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on Sweep-Covers by Raney Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Blake Wilson","submitted_at":"2020-09-17T22:54:58Z","abstract_excerpt":"In this work, we introduce a vertex separator in trees known as a sweep-cover that is defined by an ancestor-descendent relationship with all nodes in the tree. We prove the recurrence relation of sweep-covers with $n$ subcovers $P_{\\Delta, \\gamma}(n)$ on a class of infinite $\\Delta$-ary trees with constant path lengths $\\gamma$ between the $\\Delta$-star internal nodes. Then, we provide recurrence relations for Raney numbers over integer compositions and show that they provide a lower-bound for sweep-covers such that $P_{\\Delta, \\gamma}(n) = \\Omega\\left( \\frac{\\sqrt{2 \\pi} n^{\\Delta n + \\Delta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.08549","kind":"arxiv","version":5},"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/2009.08549/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":"2009.08549","created_at":"2026-07-05T03:47:50.206623+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.08549v5","created_at":"2026-07-05T03:47:50.206623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.08549","created_at":"2026-07-05T03:47:50.206623+00:00"},{"alias_kind":"pith_short_12","alias_value":"NA7JIWVKHEKW","created_at":"2026-07-05T03:47:50.206623+00:00"},{"alias_kind":"pith_short_16","alias_value":"NA7JIWVKHEKWVBAM","created_at":"2026-07-05T03:47:50.206623+00:00"},{"alias_kind":"pith_short_8","alias_value":"NA7JIWVK","created_at":"2026-07-05T03:47:50.206623+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/NA7JIWVKHEKWVBAM7PZ3ZFGNC5","json":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5.json","graph_json":"https://pith.science/api/pith-number/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/graph.json","events_json":"https://pith.science/api/pith-number/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/events.json","paper":"https://pith.science/paper/NA7JIWVK"},"agent_actions":{"view_html":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5","download_json":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5.json","view_paper":"https://pith.science/paper/NA7JIWVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.08549&json=true","fetch_graph":"https://pith.science/api/pith-number/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/graph.json","fetch_events":"https://pith.science/api/pith-number/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/action/storage_attestation","attest_author":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/action/author_attestation","sign_citation":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/action/citation_signature","submit_replication":"https://pith.science/pith/NA7JIWVKHEKWVBAM7PZ3ZFGNC5/action/replication_record"}},"created_at":"2026-07-05T03:47:50.206623+00:00","updated_at":"2026-07-05T03:47:50.206623+00:00"}