{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7BJ7OAOJ77AXCNSNGRZD53W6GX","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":"741bf44bb66402e8e3904ab3b08b74909e15d636e96f3c651f6a17a6af25294a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:16:11Z","title_canon_sha256":"3385681766058c1464a617aab57ddc0227049db34443cfb8d68cbb90a619947a"},"schema_version":"1.0","source":{"id":"1009.2060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2060","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2060v1","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2060","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"7BJ7OAOJ77AX","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7BJ7OAOJ77AXCNSN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7BJ7OAOJ","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:02bb4c65e88b09f51971872c0f8af58fd073a34875d32fb5958c2de81010da6f","target":"graph","created_at":"2026-05-18T04:41:05Z","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":"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","authors_text":"Jeffrey B. Remmel, S. Gill Williamson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:16:11Z","title":"Ranking and unranking trees with a given number or a given set of leaves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2060","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:4dc82c03ddcebacc1458d28d9683a58c5cb13f66b35b2fe1ace8e9780ffcf3d1","target":"record","created_at":"2026-05-18T04:41:05Z","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":"741bf44bb66402e8e3904ab3b08b74909e15d636e96f3c651f6a17a6af25294a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:16:11Z","title_canon_sha256":"3385681766058c1464a617aab57ddc0227049db34443cfb8d68cbb90a619947a"},"schema_version":"1.0","source":{"id":"1009.2060","kind":"arxiv","version":1}},"canonical_sha256":"f853f701c9ffc171364d34723eeede35c4f140eb99811ebc917cf3e8e3591edf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f853f701c9ffc171364d34723eeede35c4f140eb99811ebc917cf3e8e3591edf","first_computed_at":"2026-05-18T04:41:05.517129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:05.517129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HvGIQX0cfe/2WJfK6ansT0wBrY/oXqggf7mtJvZkm2SO7iKvSAv6IrobDEaRn+xvd9ITpSDWWSi47zn8EOZKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:05.517554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc82c03ddcebacc1458d28d9683a58c5cb13f66b35b2fe1ace8e9780ffcf3d1","sha256:02bb4c65e88b09f51971872c0f8af58fd073a34875d32fb5958c2de81010da6f"],"state_sha256":"e62e23a3ab551409b3d5f10d0528a8eda71ec2b000c2479390b8c18be2beed05"}