{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7BJ7OAOJ77AXCNSNGRZD53W6GX","short_pith_number":"pith:7BJ7OAOJ","schema_version":"1.0","canonical_sha256":"f853f701c9ffc171364d34723eeede35c4f140eb99811ebc917cf3e8e3591edf","source":{"kind":"arxiv","id":"1009.2060","version":1},"attestation_state":"computed","paper":{"title":"Ranking and unranking trees with a given number or a given set of leaves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey B. Remmel, S. Gill Williamson","submitted_at":"2010-09-10T17:16:11Z","abstract_excerpt":"In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed number k of leaves. For fixed k, the number of Cayley trees with n vertices and k leaves grows roughly as n! and hence the ranks have O(nlog_2(n)) bits. Our ranking and unranking algorithms require at most O(n^2) comparisons of numbers less than or equal to n plus O(n) operations of multiplication, division, addition, substraction and comparision on numbers"},"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":"1009.2060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"3385681766058c1464a617aab57ddc0227049db34443cfb8d68cbb90a619947a","abstract_canon_sha256":"741bf44bb66402e8e3904ab3b08b74909e15d636e96f3c651f6a17a6af25294a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:05.517554Z","signature_b64":"HvGIQX0cfe/2WJfK6ansT0wBrY/oXqggf7mtJvZkm2SO7iKvSAv6IrobDEaRn+xvd9ITpSDWWSi47zn8EOZKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f853f701c9ffc171364d34723eeede35c4f140eb99811ebc917cf3e8e3591edf","last_reissued_at":"2026-05-18T04:41:05.517129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:05.517129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking and unranking trees with a given number or a given set of leaves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey B. Remmel, S. Gill Williamson","submitted_at":"2010-09-10T17:16:11Z","abstract_excerpt":"In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed number k of leaves. For fixed k, the number of Cayley trees with n vertices and k leaves grows roughly as n! and hence the ranks have O(nlog_2(n)) bits. Our ranking and unranking algorithms require at most O(n^2) comparisons of numbers less than or equal to n plus O(n) operations of multiplication, division, addition, substraction and comparision on numbers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2060","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":"1009.2060","created_at":"2026-05-18T04:41:05.517199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2060v1","created_at":"2026-05-18T04:41:05.517199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2060","created_at":"2026-05-18T04:41:05.517199+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BJ7OAOJ77AX","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BJ7OAOJ77AXCNSN","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BJ7OAOJ","created_at":"2026-05-18T12:26:04.259169+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/7BJ7OAOJ77AXCNSNGRZD53W6GX","json":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX.json","graph_json":"https://pith.science/api/pith-number/7BJ7OAOJ77AXCNSNGRZD53W6GX/graph.json","events_json":"https://pith.science/api/pith-number/7BJ7OAOJ77AXCNSNGRZD53W6GX/events.json","paper":"https://pith.science/paper/7BJ7OAOJ"},"agent_actions":{"view_html":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX","download_json":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX.json","view_paper":"https://pith.science/paper/7BJ7OAOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2060&json=true","fetch_graph":"https://pith.science/api/pith-number/7BJ7OAOJ77AXCNSNGRZD53W6GX/graph.json","fetch_events":"https://pith.science/api/pith-number/7BJ7OAOJ77AXCNSNGRZD53W6GX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX/action/storage_attestation","attest_author":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX/action/author_attestation","sign_citation":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX/action/citation_signature","submit_replication":"https://pith.science/pith/7BJ7OAOJ77AXCNSNGRZD53W6GX/action/replication_record"}},"created_at":"2026-05-18T04:41:05.517199+00:00","updated_at":"2026-05-18T04:41:05.517199+00:00"}