{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YRXPXMK2DMUDUG72UHALTIBL6D","short_pith_number":"pith:YRXPXMK2","schema_version":"1.0","canonical_sha256":"c46efbb15a1b283a1bfaa1c0b9a02bf0eb7a290b3bc29cc64f34e7418f58ec37","source":{"kind":"arxiv","id":"1106.5036","version":2},"attestation_state":"computed","paper":{"title":"Set partitions with no m-nesting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Yen, Marni Mishna","submitted_at":"2011-06-24T19:00:52Z","abstract_excerpt":"A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no m-nesting and determine functional equations satisfied by the associated generating functions.\n  We use algebraic kernel method together with a linear operator to describe a coefficient extraction process. This gives rise to enumerative data, and illustrates the increasing complexity of the coefficient formulas as m increases."},"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.5036","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-24T19:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"7350aa15b89f6247126cd79c314bba303b4bc097263d96c53a3ec3ef6318528d","abstract_canon_sha256":"d25b8b4d9944f1f5584bf89514e624160a884db1eb8c64c6a2717b2c7be3a0ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:32.966773Z","signature_b64":"yg8bg3bwCIzQeU8rj8bNL++Sh3nruxx5Ga811T8D5GxaighsWjTsteSEDd22FURyI3FlRiWPCeP72YJSEwjvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c46efbb15a1b283a1bfaa1c0b9a02bf0eb7a290b3bc29cc64f34e7418f58ec37","last_reissued_at":"2026-05-18T03:03:32.965933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:32.965933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set partitions with no m-nesting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Yen, Marni Mishna","submitted_at":"2011-06-24T19:00:52Z","abstract_excerpt":"A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no m-nesting and determine functional equations satisfied by the associated generating functions.\n  We use algebraic kernel method together with a linear operator to describe a coefficient extraction process. This gives rise to enumerative data, and illustrates the increasing complexity of the coefficient formulas as m increases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5036","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":""},"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.5036","created_at":"2026-05-18T03:03:32.966081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5036v2","created_at":"2026-05-18T03:03:32.966081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5036","created_at":"2026-05-18T03:03:32.966081+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRXPXMK2DMUD","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRXPXMK2DMUDUG72","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRXPXMK2","created_at":"2026-05-18T12:26:47.523578+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/YRXPXMK2DMUDUG72UHALTIBL6D","json":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D.json","graph_json":"https://pith.science/api/pith-number/YRXPXMK2DMUDUG72UHALTIBL6D/graph.json","events_json":"https://pith.science/api/pith-number/YRXPXMK2DMUDUG72UHALTIBL6D/events.json","paper":"https://pith.science/paper/YRXPXMK2"},"agent_actions":{"view_html":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D","download_json":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D.json","view_paper":"https://pith.science/paper/YRXPXMK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5036&json=true","fetch_graph":"https://pith.science/api/pith-number/YRXPXMK2DMUDUG72UHALTIBL6D/graph.json","fetch_events":"https://pith.science/api/pith-number/YRXPXMK2DMUDUG72UHALTIBL6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D/action/storage_attestation","attest_author":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D/action/author_attestation","sign_citation":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D/action/citation_signature","submit_replication":"https://pith.science/pith/YRXPXMK2DMUDUG72UHALTIBL6D/action/replication_record"}},"created_at":"2026-05-18T03:03:32.966081+00:00","updated_at":"2026-05-18T03:03:32.966081+00:00"}