{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SRMQVGP6Y7CCWUY73EMQ4THPWV","short_pith_number":"pith:SRMQVGP6","canonical_record":{"source":{"id":"1009.2059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:15:51Z","cross_cats_sorted":[],"title_canon_sha256":"ce9a651ace8311e0750f0aec11e17dd02f35556133ff5f21487699927f010981","abstract_canon_sha256":"369c0ef25ef5b276c72af66d14dfced51b786e151b1e8e02990ed0de16a5ca5d"},"schema_version":"1.0"},"canonical_sha256":"94590a99fec7c42b531fd9190e4cefb57c93ee6a9169a66f44f4848c264e0d36","source":{"kind":"arxiv","id":"1009.2059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2059","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2059v1","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2059","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"SRMQVGP6Y7CC","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SRMQVGP6Y7CCWUY7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SRMQVGP6","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SRMQVGP6Y7CCWUY73EMQ4THPWV","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:15:51Z","cross_cats_sorted":[],"title_canon_sha256":"ce9a651ace8311e0750f0aec11e17dd02f35556133ff5f21487699927f010981","abstract_canon_sha256":"369c0ef25ef5b276c72af66d14dfced51b786e151b1e8e02990ed0de16a5ca5d"},"schema_version":"1.0"},"canonical_sha256":"94590a99fec7c42b531fd9190e4cefb57c93ee6a9169a66f44f4848c264e0d36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:05.524156Z","signature_b64":"rrIAeu/G6i20sirIuAEvUhU/2yMZ/ljkeYyCfc01Np7Hlz6UfKW04co7ICn9jgDN9vjwcxygdh1lwsf/eQHXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94590a99fec7c42b531fd9190e4cefb57c93ee6a9169a66f44f4848c264e0d36","last_reissued_at":"2026-05-18T04:41:05.523660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:05.523660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2059","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-18T04:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6K7xkPOGD+r7z8A6eIvmeCI57grq0SJUs9i0BjVT9MLc2oq+8TG+TUE3VFuH/P2pZpTrzuIYBjztj0EAAAZ3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:51:06.411160Z"},"content_sha256":"bce8d59fbd15af0b83053e58d04e424eef19dec8c861eadeca479f9c38ec8783","schema_version":"1.0","event_id":"sha256:bce8d59fbd15af0b83053e58d04e424eef19dec8c861eadeca479f9c38ec8783"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SRMQVGP6Y7CCWUY73EMQ4THPWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking and unranking trees with given degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffery B. Remmel, S. Gill Williamson","submitted_at":"2010-09-10T17:15:51Z","abstract_excerpt":"In this paper, we provide algorithms to rank, unrank, and randomly generate certain degree-restricted classes of Cayley trees. Specifically, we consider classes of trees that have a given degree sequence or a given multiset of degrees. If the underlying set of trees have n vertices, then the largest ranks involved in each case are of order n! so that it takes O(nlog(n)) bits just to write down the ranks. Our ranking and unranking algorithms for these degree-restricted classes are as efficient as can be expected since we show that they require O(n^2log(n)) bit operations if the underlying trees"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2059","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-18T04:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LTpDc46LwEp0RIOpwhM86QU4tbmQbf7KtpW/rAexTuwa8BIgDE0pg+5jmY5p4XvWJj1pOScW/O9Wn9BXF41Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:51:06.411512Z"},"content_sha256":"29fcaec44f65fe22004981c7e95ed30aeef4668c47cef09c607c226943895d3c","schema_version":"1.0","event_id":"sha256:29fcaec44f65fe22004981c7e95ed30aeef4668c47cef09c607c226943895d3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRMQVGP6Y7CCWUY73EMQ4THPWV/bundle.json","state_url":"https://pith.science/pith/SRMQVGP6Y7CCWUY73EMQ4THPWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRMQVGP6Y7CCWUY73EMQ4THPWV/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-26T09:51:06Z","links":{"resolver":"https://pith.science/pith/SRMQVGP6Y7CCWUY73EMQ4THPWV","bundle":"https://pith.science/pith/SRMQVGP6Y7CCWUY73EMQ4THPWV/bundle.json","state":"https://pith.science/pith/SRMQVGP6Y7CCWUY73EMQ4THPWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRMQVGP6Y7CCWUY73EMQ4THPWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SRMQVGP6Y7CCWUY73EMQ4THPWV","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":"369c0ef25ef5b276c72af66d14dfced51b786e151b1e8e02990ed0de16a5ca5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:15:51Z","title_canon_sha256":"ce9a651ace8311e0750f0aec11e17dd02f35556133ff5f21487699927f010981"},"schema_version":"1.0","source":{"id":"1009.2059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2059","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2059v1","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2059","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"SRMQVGP6Y7CC","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SRMQVGP6Y7CCWUY7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SRMQVGP6","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:29fcaec44f65fe22004981c7e95ed30aeef4668c47cef09c607c226943895d3c","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, unrank, and randomly generate certain degree-restricted classes of Cayley trees. Specifically, we consider classes of trees that have a given degree sequence or a given multiset of degrees. If the underlying set of trees have n vertices, then the largest ranks involved in each case are of order n! so that it takes O(nlog(n)) bits just to write down the ranks. Our ranking and unranking algorithms for these degree-restricted classes are as efficient as can be expected since we show that they require O(n^2log(n)) bit operations if the underlying trees","authors_text":"Jeffery 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:15:51Z","title":"Ranking and unranking trees with given degree sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2059","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:bce8d59fbd15af0b83053e58d04e424eef19dec8c861eadeca479f9c38ec8783","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":"369c0ef25ef5b276c72af66d14dfced51b786e151b1e8e02990ed0de16a5ca5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-10T17:15:51Z","title_canon_sha256":"ce9a651ace8311e0750f0aec11e17dd02f35556133ff5f21487699927f010981"},"schema_version":"1.0","source":{"id":"1009.2059","kind":"arxiv","version":1}},"canonical_sha256":"94590a99fec7c42b531fd9190e4cefb57c93ee6a9169a66f44f4848c264e0d36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94590a99fec7c42b531fd9190e4cefb57c93ee6a9169a66f44f4848c264e0d36","first_computed_at":"2026-05-18T04:41:05.523660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:05.523660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rrIAeu/G6i20sirIuAEvUhU/2yMZ/ljkeYyCfc01Np7Hlz6UfKW04co7ICn9jgDN9vjwcxygdh1lwsf/eQHXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:05.524156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bce8d59fbd15af0b83053e58d04e424eef19dec8c861eadeca479f9c38ec8783","sha256:29fcaec44f65fe22004981c7e95ed30aeef4668c47cef09c607c226943895d3c"],"state_sha256":"6578d89d63f82f1399da800d5c28bb42a76689f9bab186ffecf9398e3ceb8cee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5SD0mM6vQ54RRMa84bC4WY1TGdaBCxpSBZiSyXzz7w2f6QDLsLWI5nbn8IL1757XCoWnXpv1gr6ncD81nTQvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:51:06.413354Z","bundle_sha256":"bbd6465897389fa0914353760aec2f3e5628c5356813baea5302a95fd3715626"}}