{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N64MNKDZ2QT2KB4RMUECGBAHHR","short_pith_number":"pith:N64MNKDZ","schema_version":"1.0","canonical_sha256":"6fb8c6a879d427a5079165082304073c4383fba414dce0ea412f839cd9dcae44","source":{"kind":"arxiv","id":"1804.07087","version":3},"attestation_state":"computed","paper":{"title":"Patterns in words of ordered set partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dun Qiu, Jeffrey Remmel","submitted_at":"2018-04-19T11:10:27Z","abstract_excerpt":"An ordered set partition of $\\{1,2,\\ldots,n\\}$ is a partition with an ordering on the parts. Let $\\mathcal{OP}_{n,k}$ be the set of ordered set partitions of $[n]$ with $k$ blocks. Godbole, Goyt, Herdan and Pudwell defined $\\mathcal{OP}_{n,k}(\\sigma)$ to be the set of ordered set partitions in $\\mathcal{OP}_{n,k}$ avoiding a permutation pattern $\\sigma$ and obtained the formula for $|\\mathcal{OP}_{n,k}(\\sigma)|$ when the pattern $\\sigma$ is of length $2$. Later, Chen, Dai and Zhou found a formula algebraically for $|\\mathcal{OP}_{n,k}(\\sigma)|$ when the pattern $\\sigma$ is of length $3$.\n  In "},"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":"1804.07087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-19T11:10:27Z","cross_cats_sorted":[],"title_canon_sha256":"f325e3d4d32178c13a93e798d34bcf904bd1d4b62f37208d86c9f75b04c316e9","abstract_canon_sha256":"52e1427619937654aeba0caee245cc41f07b2d150286bc20b6a7c8a73510706e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.378704Z","signature_b64":"5B2muEBPnMCp5sY1sl9nj/BuOVTNpeDEyxCfCPHnodMVm5JuHp3IdWgRHO5ee0C4IQr3aXMOnjzgEUSBHDB1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fb8c6a879d427a5079165082304073c4383fba414dce0ea412f839cd9dcae44","last_reissued_at":"2026-05-17T23:58:14.378217Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.378217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Patterns in words of ordered set partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dun Qiu, Jeffrey Remmel","submitted_at":"2018-04-19T11:10:27Z","abstract_excerpt":"An ordered set partition of $\\{1,2,\\ldots,n\\}$ is a partition with an ordering on the parts. Let $\\mathcal{OP}_{n,k}$ be the set of ordered set partitions of $[n]$ with $k$ blocks. Godbole, Goyt, Herdan and Pudwell defined $\\mathcal{OP}_{n,k}(\\sigma)$ to be the set of ordered set partitions in $\\mathcal{OP}_{n,k}$ avoiding a permutation pattern $\\sigma$ and obtained the formula for $|\\mathcal{OP}_{n,k}(\\sigma)|$ when the pattern $\\sigma$ is of length $2$. Later, Chen, Dai and Zhou found a formula algebraically for $|\\mathcal{OP}_{n,k}(\\sigma)|$ when the pattern $\\sigma$ is of length $3$.\n  In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07087","kind":"arxiv","version":3},"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":"1804.07087","created_at":"2026-05-17T23:58:14.378283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07087v3","created_at":"2026-05-17T23:58:14.378283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07087","created_at":"2026-05-17T23:58:14.378283+00:00"},{"alias_kind":"pith_short_12","alias_value":"N64MNKDZ2QT2","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N64MNKDZ2QT2KB4R","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N64MNKDZ","created_at":"2026-05-18T12:32:40.477152+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/N64MNKDZ2QT2KB4RMUECGBAHHR","json":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR.json","graph_json":"https://pith.science/api/pith-number/N64MNKDZ2QT2KB4RMUECGBAHHR/graph.json","events_json":"https://pith.science/api/pith-number/N64MNKDZ2QT2KB4RMUECGBAHHR/events.json","paper":"https://pith.science/paper/N64MNKDZ"},"agent_actions":{"view_html":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR","download_json":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR.json","view_paper":"https://pith.science/paper/N64MNKDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07087&json=true","fetch_graph":"https://pith.science/api/pith-number/N64MNKDZ2QT2KB4RMUECGBAHHR/graph.json","fetch_events":"https://pith.science/api/pith-number/N64MNKDZ2QT2KB4RMUECGBAHHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR/action/storage_attestation","attest_author":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR/action/author_attestation","sign_citation":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR/action/citation_signature","submit_replication":"https://pith.science/pith/N64MNKDZ2QT2KB4RMUECGBAHHR/action/replication_record"}},"created_at":"2026-05-17T23:58:14.378283+00:00","updated_at":"2026-05-17T23:58:14.378283+00:00"}