{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W7B7YJLUT3TTS3MIOZJNVZFAGU","short_pith_number":"pith:W7B7YJLU","canonical_record":{"source":{"id":"2606.28539","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T18:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"da9c3053c517a7a6d075bd7e22155e88e1548ee6508eea17c2a64e2b84374294","abstract_canon_sha256":"74b61ae08f6de2dcef0aca3bf16694b3f276548cc6fe358911414a62231369c1"},"schema_version":"1.0"},"canonical_sha256":"b7c3fc25749ee7396d887652dae4a03508440d335de17c794ea41efe2d219d38","source":{"kind":"arxiv","id":"2606.28539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28539","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28539v1","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28539","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"W7B7YJLUT3TT","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"pith_short_16","alias_value":"W7B7YJLUT3TTS3MI","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"pith_short_8","alias_value":"W7B7YJLU","created_at":"2026-06-30T00:15:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W7B7YJLUT3TTS3MIOZJNVZFAGU","target":"record","payload":{"canonical_record":{"source":{"id":"2606.28539","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T18:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"da9c3053c517a7a6d075bd7e22155e88e1548ee6508eea17c2a64e2b84374294","abstract_canon_sha256":"74b61ae08f6de2dcef0aca3bf16694b3f276548cc6fe358911414a62231369c1"},"schema_version":"1.0"},"canonical_sha256":"b7c3fc25749ee7396d887652dae4a03508440d335de17c794ea41efe2d219d38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T00:15:17.472002Z","signature_b64":"onsEDZY9+zDM7WMT+Sqw3fsFCo085GVk8ZOpG0KeHcX0DkRLci6aJV2cWsZz9jC6LQa4iMU9EBRxBKV2JvOrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7c3fc25749ee7396d887652dae4a03508440d335de17c794ea41efe2d219d38","last_reissued_at":"2026-06-30T00:15:17.471632Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T00:15:17.471632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.28539","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-06-30T00:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ctTQ6AFWEcQR9SbOi6DEmMbM+emIdEFK37bm0xe7K3iw28lLybAElr1ePKHAdM4wMr9CStdBA+Kw9XcrI3xlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:41:11.062658Z"},"content_sha256":"4b5914d560324e156d8db2ab2662adf80819b274fa5206105cccedd42633fbc2","schema_version":"1.0","event_id":"sha256:4b5914d560324e156d8db2ab2662adf80819b274fa5206105cccedd42633fbc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W7B7YJLUT3TTS3MIOZJNVZFAGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal ranks of unlabeled multifurcating rooted trees in a bijective encoding by the positive integers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alessandra R. P. Maranca, Michael R. Doboli, Noah A. Rosenberg","submitted_at":"2026-06-26T18:44:50Z","abstract_excerpt":"Maranca and Rosenberg (2024) devised a ranking scheme for unlabeled multifurcating rooted trees, in which the trees are bijectively associated with the positive integers. Here, generalizing earlier results for bifurcating trees, we determine, for trees with a fixed number of leaves, which multifurcating trees obtain the maximal and minimal ranks. We identify these maximizing and minimizing trees for each of two sets of unlabeled multifurcating rooted trees: strictly $k$-furcating trees, in which each internal node possesses exactly $k$ descendants, and at-most-$k$-furcating trees, in which int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28539","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.28539/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"},"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-06-30T00:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMusisWkesLt3gKavnW1NBPdboOJuZZCe7ZnrPMD8Sq+rzqxG3xRtaipAz82SfG9nllwkZyPDpPjU1Janv9QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:41:11.063037Z"},"content_sha256":"69f485b91d370a20706eae30c364861b8449a11f3385d17bc7311d43d89727a7","schema_version":"1.0","event_id":"sha256:69f485b91d370a20706eae30c364861b8449a11f3385d17bc7311d43d89727a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7B7YJLUT3TTS3MIOZJNVZFAGU/bundle.json","state_url":"https://pith.science/pith/W7B7YJLUT3TTS3MIOZJNVZFAGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7B7YJLUT3TTS3MIOZJNVZFAGU/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-30T22:41:11Z","links":{"resolver":"https://pith.science/pith/W7B7YJLUT3TTS3MIOZJNVZFAGU","bundle":"https://pith.science/pith/W7B7YJLUT3TTS3MIOZJNVZFAGU/bundle.json","state":"https://pith.science/pith/W7B7YJLUT3TTS3MIOZJNVZFAGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7B7YJLUT3TTS3MIOZJNVZFAGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W7B7YJLUT3TTS3MIOZJNVZFAGU","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":"74b61ae08f6de2dcef0aca3bf16694b3f276548cc6fe358911414a62231369c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T18:44:50Z","title_canon_sha256":"da9c3053c517a7a6d075bd7e22155e88e1548ee6508eea17c2a64e2b84374294"},"schema_version":"1.0","source":{"id":"2606.28539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28539","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28539v1","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28539","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"W7B7YJLUT3TT","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"pith_short_16","alias_value":"W7B7YJLUT3TTS3MI","created_at":"2026-06-30T00:15:17Z"},{"alias_kind":"pith_short_8","alias_value":"W7B7YJLU","created_at":"2026-06-30T00:15:17Z"}],"graph_snapshots":[{"event_id":"sha256:69f485b91d370a20706eae30c364861b8449a11f3385d17bc7311d43d89727a7","target":"graph","created_at":"2026-06-30T00:15:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.28539/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maranca and Rosenberg (2024) devised a ranking scheme for unlabeled multifurcating rooted trees, in which the trees are bijectively associated with the positive integers. Here, generalizing earlier results for bifurcating trees, we determine, for trees with a fixed number of leaves, which multifurcating trees obtain the maximal and minimal ranks. We identify these maximizing and minimizing trees for each of two sets of unlabeled multifurcating rooted trees: strictly $k$-furcating trees, in which each internal node possesses exactly $k$ descendants, and at-most-$k$-furcating trees, in which int","authors_text":"Alessandra R. P. Maranca, Michael R. Doboli, Noah A. Rosenberg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T18:44:50Z","title":"Extremal ranks of unlabeled multifurcating rooted trees in a bijective encoding by the positive integers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28539","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:4b5914d560324e156d8db2ab2662adf80819b274fa5206105cccedd42633fbc2","target":"record","created_at":"2026-06-30T00:15:17Z","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":"74b61ae08f6de2dcef0aca3bf16694b3f276548cc6fe358911414a62231369c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T18:44:50Z","title_canon_sha256":"da9c3053c517a7a6d075bd7e22155e88e1548ee6508eea17c2a64e2b84374294"},"schema_version":"1.0","source":{"id":"2606.28539","kind":"arxiv","version":1}},"canonical_sha256":"b7c3fc25749ee7396d887652dae4a03508440d335de17c794ea41efe2d219d38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7c3fc25749ee7396d887652dae4a03508440d335de17c794ea41efe2d219d38","first_computed_at":"2026-06-30T00:15:17.471632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T00:15:17.471632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"onsEDZY9+zDM7WMT+Sqw3fsFCo085GVk8ZOpG0KeHcX0DkRLci6aJV2cWsZz9jC6LQa4iMU9EBRxBKV2JvOrBQ==","signature_status":"signed_v1","signed_at":"2026-06-30T00:15:17.472002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b5914d560324e156d8db2ab2662adf80819b274fa5206105cccedd42633fbc2","sha256:69f485b91d370a20706eae30c364861b8449a11f3385d17bc7311d43d89727a7"],"state_sha256":"990f3b212f514aa51290984d2a7ca7449a110f5eacee0d99e1e5a8b3a492c7bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgvEqUB8rYmormYX0tiaPV3MkdrmQJeZD9wUjnwF07CqH+5RyQinOr/0YOrcs3Ae/ShMP+RImXPi1GEUPLgpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:41:11.065139Z","bundle_sha256":"934d1bc3896b540a23e34ca4149b3194c7f199f75bd9cd752512925088d5f90f"}}