{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","short_pith_number":"pith:BCF6NMLJ","canonical_record":{"source":{"id":"1106.1290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-07T09:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"b77ef37654e5b3ea9c192c44dbc4b84cea3d81cfcc3d8b63774fdd96b5323931","abstract_canon_sha256":"c5f0ecd5955e26e72c7dae5d406d95f7c0b5f433a96b69ce8305a80839020d53"},"schema_version":"1.0"},"canonical_sha256":"088be6b169e45cb27cd9dc2c6b9490e2f6ad6b2e7d1666fdb984d3a69d7135a1","source":{"kind":"arxiv","id":"1106.1290","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1290","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1290v2","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1290","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"BCF6NMLJ4ROL","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"BCF6NMLJ4ROLE7GZ","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"BCF6NMLJ","created_at":"2026-07-05T04:06:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-07T09:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"b77ef37654e5b3ea9c192c44dbc4b84cea3d81cfcc3d8b63774fdd96b5323931","abstract_canon_sha256":"c5f0ecd5955e26e72c7dae5d406d95f7c0b5f433a96b69ce8305a80839020d53"},"schema_version":"1.0"},"canonical_sha256":"088be6b169e45cb27cd9dc2c6b9490e2f6ad6b2e7d1666fdb984d3a69d7135a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:38.682476Z","signature_b64":"vQSr0OXQkZpegpE4K7U+hwi15NzpOx/HNzdwuu08UTwtFTf9B0cKUtXFc6bHS8GROW8xD7BAR0osMgIivO3SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088be6b169e45cb27cd9dc2c6b9490e2f6ad6b2e7d1666fdb984d3a69d7135a1","last_reissued_at":"2026-07-05T04:06:38.682080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:38.682080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1290","source_version":2,"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-07-05T04:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JM1EyMGCu4uT+zrYSjqSQHPtS0p9Ti6bfj5Sz32AUu4bBIsMoO/7H1l51hxKkG639uwsPDg/nvXe/LJJRjqIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T11:36:35.014085Z"},"content_sha256":"edbb6bbcf19a24e5f1b69aa846c68aeb5c6f6696478f5ddabe4adb59476f3c35","schema_version":"1.0","event_id":"sha256:edbb6bbcf19a24e5f1b69aa846c68aeb5c6f6696478f5ddabe4adb59476f3c35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the enumeration of rooted trees with fixed size of maximal decreasing trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heesung Shin, Seunghyun Seo","submitted_at":"2011-06-07T09:17:24Z","abstract_excerpt":"Let $\\T_{n}$ be the set of rooted labeled trees on $\\set{0,...,n}$. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\\T_{n,k}$ of $\\T_n$, which is the set of rooted labeled trees whose maximal decreasing subtree has $k+1$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1290","kind":"arxiv","version":2},"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/1106.1290/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-07-05T04:06:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFBYTejltJm/adATEBsDQgrdQlhqEnLy7MfQVVw7AqzsJNX2cFGucVutokNDH0+kVBwUhAEml7TKBjgHHy+WBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T11:36:35.014468Z"},"content_sha256":"cb2832796f0c6985a0a10f7eb196e0fc03d9a47aa25cc720b21f245760781bda","schema_version":"1.0","event_id":"sha256:cb2832796f0c6985a0a10f7eb196e0fc03d9a47aa25cc720b21f245760781bda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/bundle.json","state_url":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/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-07-14T11:36:35Z","links":{"resolver":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","bundle":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/bundle.json","state":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","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":"c5f0ecd5955e26e72c7dae5d406d95f7c0b5f433a96b69ce8305a80839020d53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-07T09:17:24Z","title_canon_sha256":"b77ef37654e5b3ea9c192c44dbc4b84cea3d81cfcc3d8b63774fdd96b5323931"},"schema_version":"1.0","source":{"id":"1106.1290","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1290","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1290v2","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1290","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_12","alias_value":"BCF6NMLJ4ROL","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_16","alias_value":"BCF6NMLJ4ROLE7GZ","created_at":"2026-07-05T04:06:38Z"},{"alias_kind":"pith_short_8","alias_value":"BCF6NMLJ","created_at":"2026-07-05T04:06:38Z"}],"graph_snapshots":[{"event_id":"sha256:cb2832796f0c6985a0a10f7eb196e0fc03d9a47aa25cc720b21f245760781bda","target":"graph","created_at":"2026-07-05T04:06:38Z","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/1106.1290/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\T_{n}$ be the set of rooted labeled trees on $\\set{0,...,n}$. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\\T_{n,k}$ of $\\T_n$, which is the set of rooted labeled trees whose maximal decreasing subtree has $k+1$ vertices.","authors_text":"Heesung Shin, Seunghyun Seo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-07T09:17:24Z","title":"On the enumeration of rooted trees with fixed size of maximal decreasing trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1290","kind":"arxiv","version":2},"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:edbb6bbcf19a24e5f1b69aa846c68aeb5c6f6696478f5ddabe4adb59476f3c35","target":"record","created_at":"2026-07-05T04:06:38Z","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":"c5f0ecd5955e26e72c7dae5d406d95f7c0b5f433a96b69ce8305a80839020d53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-07T09:17:24Z","title_canon_sha256":"b77ef37654e5b3ea9c192c44dbc4b84cea3d81cfcc3d8b63774fdd96b5323931"},"schema_version":"1.0","source":{"id":"1106.1290","kind":"arxiv","version":2}},"canonical_sha256":"088be6b169e45cb27cd9dc2c6b9490e2f6ad6b2e7d1666fdb984d3a69d7135a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"088be6b169e45cb27cd9dc2c6b9490e2f6ad6b2e7d1666fdb984d3a69d7135a1","first_computed_at":"2026-07-05T04:06:38.682080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:06:38.682080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vQSr0OXQkZpegpE4K7U+hwi15NzpOx/HNzdwuu08UTwtFTf9B0cKUtXFc6bHS8GROW8xD7BAR0osMgIivO3SAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:06:38.682476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1290","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edbb6bbcf19a24e5f1b69aa846c68aeb5c6f6696478f5ddabe4adb59476f3c35","sha256:cb2832796f0c6985a0a10f7eb196e0fc03d9a47aa25cc720b21f245760781bda"],"state_sha256":"412d16bd94cedaff1f16dec801a85f5539fca84b675ba9e4f265f2c5b32488c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQS67gyrUEQmY13rcA6LaTE+HXZ0mg3tyvCH69VI17WdyY3fSrffhKUVoLsrckRMwCXTYRUdfVnNwfkbl64lDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T11:36:35.016543Z","bundle_sha256":"75d3d874c0898b1f11c04ced1bc2aff412ca29d6164b95df4c553c95e5739b5e"}}