{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","short_pith_number":"pith:BCF6NMLJ","schema_version":"1.0","canonical_sha256":"088be6b169e45cb27cd9dc2c6b9490e2f6ad6b2e7d1666fdb984d3a69d7135a1","source":{"kind":"arxiv","id":"1106.1290","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.1290","created_at":"2026-07-05T04:06:38.682138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1290v2","created_at":"2026-07-05T04:06:38.682138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1290","created_at":"2026-07-05T04:06:38.682138+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCF6NMLJ4ROL","created_at":"2026-07-05T04:06:38.682138+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCF6NMLJ4ROLE7GZ","created_at":"2026-07-05T04:06:38.682138+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCF6NMLJ","created_at":"2026-07-05T04:06:38.682138+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/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","json":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L.json","graph_json":"https://pith.science/api/pith-number/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/graph.json","events_json":"https://pith.science/api/pith-number/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/events.json","paper":"https://pith.science/paper/BCF6NMLJ"},"agent_actions":{"view_html":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L","download_json":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L.json","view_paper":"https://pith.science/paper/BCF6NMLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1290&json=true","fetch_graph":"https://pith.science/api/pith-number/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/graph.json","fetch_events":"https://pith.science/api/pith-number/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/action/storage_attestation","attest_author":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/action/author_attestation","sign_citation":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/action/citation_signature","submit_replication":"https://pith.science/pith/BCF6NMLJ4ROLE7GZ3QWGXFEQ4L/action/replication_record"}},"created_at":"2026-07-05T04:06:38.682138+00:00","updated_at":"2026-07-05T04:06:38.682138+00:00"}