{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:54YBOLGUWNTF4VCQ4FQRAIA2GM","short_pith_number":"pith:54YBOLGU","schema_version":"1.0","canonical_sha256":"ef30172cd4b3665e5450e16110201a333089ce1557b646990ddbe3208cb3edc7","source":{"kind":"arxiv","id":"1304.3187","version":1},"attestation_state":"computed","paper":{"title":"Ordered Partitions Avoiding a Permutation of Length 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alvin Y.L. Dai, Robin D.P. Zhou, William Y.C. Chen","submitted_at":"2013-04-11T03:49:20Z","abstract_excerpt":"An ordered partition of $[n]=\\{1, 2, \\ldots, n\\}$ is a partition whose blocks are endowed with a linear order. Let $\\mathcal{OP}_{n,k}$ be set of ordered partitions of $[n]$ with $k$ blocks and $\\mathcal{OP}_{n,k}(\\sigma)$ be set of ordered partitions in $\\mathcal{OP}_{n,k}$ that avoid a pattern $\\sigma$. Recently, Godbole, Goyt, Herdan and Pudwell obtained formulas for the number of ordered partitions of $[n]$ with 3 blocks and the number of ordered partitions of $[n]$ with $n-1$ blocks avoiding a permutation pattern of length 3. They showed that $|\\mathcal{OP}_{n,k}(\\sigma)|=|\\mathcal{OP}_{n"},"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":"1304.3187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-11T03:49:20Z","cross_cats_sorted":[],"title_canon_sha256":"91dff0e3048b234cee82c6b82cad6a11e343949abfaf79edcfa62cd90837ce54","abstract_canon_sha256":"724f130e79e293815d0cb42769f4b92f378d9f1787cc35bca9eb55bac53f8b3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:18.397780Z","signature_b64":"tpu4XjZiJAnflZ3gHwwuITsZZE+A7wsy3LQE+t8xTripJ7BsOonciui8vDnGWhWrDbLNDb1U431RP80K0j5gAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef30172cd4b3665e5450e16110201a333089ce1557b646990ddbe3208cb3edc7","last_reissued_at":"2026-05-18T03:28:18.397220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:18.397220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered Partitions Avoiding a Permutation of Length 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alvin Y.L. Dai, Robin D.P. Zhou, William Y.C. Chen","submitted_at":"2013-04-11T03:49:20Z","abstract_excerpt":"An ordered partition of $[n]=\\{1, 2, \\ldots, n\\}$ is a partition whose blocks are endowed with a linear order. Let $\\mathcal{OP}_{n,k}$ be set of ordered partitions of $[n]$ with $k$ blocks and $\\mathcal{OP}_{n,k}(\\sigma)$ be set of ordered partitions in $\\mathcal{OP}_{n,k}$ that avoid a pattern $\\sigma$. Recently, Godbole, Goyt, Herdan and Pudwell obtained formulas for the number of ordered partitions of $[n]$ with 3 blocks and the number of ordered partitions of $[n]$ with $n-1$ blocks avoiding a permutation pattern of length 3. They showed that $|\\mathcal{OP}_{n,k}(\\sigma)|=|\\mathcal{OP}_{n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3187","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":"1304.3187","created_at":"2026-05-18T03:28:18.397307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3187v1","created_at":"2026-05-18T03:28:18.397307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3187","created_at":"2026-05-18T03:28:18.397307+00:00"},{"alias_kind":"pith_short_12","alias_value":"54YBOLGUWNTF","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"54YBOLGUWNTF4VCQ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"54YBOLGU","created_at":"2026-05-18T12:27:34.582898+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/54YBOLGUWNTF4VCQ4FQRAIA2GM","json":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM.json","graph_json":"https://pith.science/api/pith-number/54YBOLGUWNTF4VCQ4FQRAIA2GM/graph.json","events_json":"https://pith.science/api/pith-number/54YBOLGUWNTF4VCQ4FQRAIA2GM/events.json","paper":"https://pith.science/paper/54YBOLGU"},"agent_actions":{"view_html":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM","download_json":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM.json","view_paper":"https://pith.science/paper/54YBOLGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3187&json=true","fetch_graph":"https://pith.science/api/pith-number/54YBOLGUWNTF4VCQ4FQRAIA2GM/graph.json","fetch_events":"https://pith.science/api/pith-number/54YBOLGUWNTF4VCQ4FQRAIA2GM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM/action/storage_attestation","attest_author":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM/action/author_attestation","sign_citation":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM/action/citation_signature","submit_replication":"https://pith.science/pith/54YBOLGUWNTF4VCQ4FQRAIA2GM/action/replication_record"}},"created_at":"2026-05-18T03:28:18.397307+00:00","updated_at":"2026-05-18T03:28:18.397307+00:00"}