{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2G7O5YQJ4NSGXEYVF5EWGRG6R5","short_pith_number":"pith:2G7O5YQJ","schema_version":"1.0","canonical_sha256":"d1beeee209e3646b93152f496344de8f423289f3634c3423c5dda5eda19c0ca7","source":{"kind":"arxiv","id":"1805.05317","version":1},"attestation_state":"computed","paper":{"title":"Fuss-Schr\\\"oder Paths and Rooted Plane Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Kural","submitted_at":"2018-05-14T17:59:05Z","abstract_excerpt":"We describe a bijection between $(k,k)$-Fuss-Schr\\\"oder paths of type $\\lambda$ and certain rooted plane forests with $n(k+1)+2$ vertices. This yields a recursion which allows us to analytically enumerate the number of large $(k,r)$-Fuss-Schr\\\"oder paths of type $\\lambda$, solving an open question posed by An, Jung, and Kim. Furthermore, we generalize the concept of $(k,r)$-Fuss-Schr\\\"oder paths to $(k,S)$-Fuss-Schr\\\"oder paths, in which $r$ can take any value in a given set $S$, and enumerate these paths as well."},"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":"1805.05317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-14T17:59:05Z","cross_cats_sorted":[],"title_canon_sha256":"0747429130e6c65111d137e9f934cfeffc3802fcd9e8bd2aa3f62e14577f1efb","abstract_canon_sha256":"376826e820765448de25950143c5e6f8234679c122fc21c2f9a0ba68deabcf91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.474499Z","signature_b64":"ykHHflzyueHXbYLa939BkD8TEIX3ufFOyqmVM0/J8bTcsp91oBkxEEaM6aTavRQOELQg4kxndpCMmVcnsK+rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1beeee209e3646b93152f496344de8f423289f3634c3423c5dda5eda19c0ca7","last_reissued_at":"2026-05-18T00:16:03.474100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.474100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fuss-Schr\\\"oder Paths and Rooted Plane Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Kural","submitted_at":"2018-05-14T17:59:05Z","abstract_excerpt":"We describe a bijection between $(k,k)$-Fuss-Schr\\\"oder paths of type $\\lambda$ and certain rooted plane forests with $n(k+1)+2$ vertices. This yields a recursion which allows us to analytically enumerate the number of large $(k,r)$-Fuss-Schr\\\"oder paths of type $\\lambda$, solving an open question posed by An, Jung, and Kim. Furthermore, we generalize the concept of $(k,r)$-Fuss-Schr\\\"oder paths to $(k,S)$-Fuss-Schr\\\"oder paths, in which $r$ can take any value in a given set $S$, and enumerate these paths as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05317","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.05317","created_at":"2026-05-18T00:16:03.474155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05317v1","created_at":"2026-05-18T00:16:03.474155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05317","created_at":"2026-05-18T00:16:03.474155+00:00"},{"alias_kind":"pith_short_12","alias_value":"2G7O5YQJ4NSG","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2G7O5YQJ4NSGXEYV","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2G7O5YQJ","created_at":"2026-05-18T12:32:02.567920+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/2G7O5YQJ4NSGXEYVF5EWGRG6R5","json":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5.json","graph_json":"https://pith.science/api/pith-number/2G7O5YQJ4NSGXEYVF5EWGRG6R5/graph.json","events_json":"https://pith.science/api/pith-number/2G7O5YQJ4NSGXEYVF5EWGRG6R5/events.json","paper":"https://pith.science/paper/2G7O5YQJ"},"agent_actions":{"view_html":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5","download_json":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5.json","view_paper":"https://pith.science/paper/2G7O5YQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05317&json=true","fetch_graph":"https://pith.science/api/pith-number/2G7O5YQJ4NSGXEYVF5EWGRG6R5/graph.json","fetch_events":"https://pith.science/api/pith-number/2G7O5YQJ4NSGXEYVF5EWGRG6R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5/action/storage_attestation","attest_author":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5/action/author_attestation","sign_citation":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5/action/citation_signature","submit_replication":"https://pith.science/pith/2G7O5YQJ4NSGXEYVF5EWGRG6R5/action/replication_record"}},"created_at":"2026-05-18T00:16:03.474155+00:00","updated_at":"2026-05-18T00:16:03.474155+00:00"}