{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A27OFJBGVQ5ACQ5EOKQEU3ELG4","short_pith_number":"pith:A27OFJBG","canonical_record":{"source":{"id":"1307.0495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-01T19:53:38Z","cross_cats_sorted":[],"title_canon_sha256":"ad6ffb001db3f048a10f768763428bc28d418cc591a2c769734743ce9eaf554b","abstract_canon_sha256":"dd2022e10015bc65fc8316466983c8a52bda37912a73b1604459b90da4f41298"},"schema_version":"1.0"},"canonical_sha256":"06bee2a426ac3a0143a472a04a6c8b373be100f949a770581f09dfef89fcac44","source":{"kind":"arxiv","id":"1307.0495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0495","created_at":"2026-05-18T03:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0495v1","created_at":"2026-05-18T03:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0495","created_at":"2026-05-18T03:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"A27OFJBGVQ5A","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A27OFJBGVQ5ACQ5E","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A27OFJBG","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A27OFJBGVQ5ACQ5EOKQEU3ELG4","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-01T19:53:38Z","cross_cats_sorted":[],"title_canon_sha256":"ad6ffb001db3f048a10f768763428bc28d418cc591a2c769734743ce9eaf554b","abstract_canon_sha256":"dd2022e10015bc65fc8316466983c8a52bda37912a73b1604459b90da4f41298"},"schema_version":"1.0"},"canonical_sha256":"06bee2a426ac3a0143a472a04a6c8b373be100f949a770581f09dfef89fcac44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:33.261341Z","signature_b64":"G4oAmRiEWvg4QgnrYfpUP+YfleYbgSycIK9eYfxdK/TcrzLFgebmXcAJ+AjKVXSuqw9cSBicBRknB9H5zyT4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06bee2a426ac3a0143a472a04a6c8b373be100f949a770581f09dfef89fcac44","last_reissued_at":"2026-05-18T03:19:33.260808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:33.260808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0495","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrnpUNwX3YHqpoHNMCldkxotg6lSVZlE8OHIZgeMSelKss5GEaYQDlzfS9b2sVyBGdocp0Ay4D8wcOwi0r8+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:36:40.098305Z"},"content_sha256":"0dc707b18b46a8ebfb64d9d8466b18bd0fa7d695d5bcc4e6b9427fc4060d6f2e","schema_version":"1.0","event_id":"sha256:0dc707b18b46a8ebfb64d9d8466b18bd0fa7d695d5bcc4e6b9427fc4060d6f2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A27OFJBGVQ5ACQ5EOKQEU3ELG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pattern avoidance in ordered set partitions and words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anisse Kasraoui","submitted_at":"2013-07-01T19:53:38Z","abstract_excerpt":"We consider the enumeration of ordered set partitions avoiding a permutation pattern, as introduced by Godbole, Goyt, Herdan and Pudwell. Let $\\op_{n,k}(p)$ be the number of ordered set partitions of $\\{1,2,\\ldots,n\\}$ into $k$ blocks that avoid a permutation pattern $p$. We establish an explicit identity between the number $\\op_{n,k}(p)$ and the numbers of words avoiding the inverse of $p$. This identity allows us to easily translate results on pattern-avoiding words obtained in earlier works into equivalent results on pattern-avoiding ordered set partitions. In particular, \\emph{(a)} we dete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0495","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y721aNZs9PfswLirkMv3sgrqlOmpyaijc+fu4o0sMWRVcyQ4G5TpRshhsYaAQ1lZw4v8Tqn2xK5OabQi8XPKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:36:40.098687Z"},"content_sha256":"f703d0645b75eaf70ac8003ccc3a68b9b9cee8e24a1b302571f600044dff26c4","schema_version":"1.0","event_id":"sha256:f703d0645b75eaf70ac8003ccc3a68b9b9cee8e24a1b302571f600044dff26c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A27OFJBGVQ5ACQ5EOKQEU3ELG4/bundle.json","state_url":"https://pith.science/pith/A27OFJBGVQ5ACQ5EOKQEU3ELG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A27OFJBGVQ5ACQ5EOKQEU3ELG4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T22:36:40Z","links":{"resolver":"https://pith.science/pith/A27OFJBGVQ5ACQ5EOKQEU3ELG4","bundle":"https://pith.science/pith/A27OFJBGVQ5ACQ5EOKQEU3ELG4/bundle.json","state":"https://pith.science/pith/A27OFJBGVQ5ACQ5EOKQEU3ELG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A27OFJBGVQ5ACQ5EOKQEU3ELG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A27OFJBGVQ5ACQ5EOKQEU3ELG4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dd2022e10015bc65fc8316466983c8a52bda37912a73b1604459b90da4f41298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-01T19:53:38Z","title_canon_sha256":"ad6ffb001db3f048a10f768763428bc28d418cc591a2c769734743ce9eaf554b"},"schema_version":"1.0","source":{"id":"1307.0495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0495","created_at":"2026-05-18T03:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0495v1","created_at":"2026-05-18T03:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0495","created_at":"2026-05-18T03:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"A27OFJBGVQ5A","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A27OFJBGVQ5ACQ5E","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A27OFJBG","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:f703d0645b75eaf70ac8003ccc3a68b9b9cee8e24a1b302571f600044dff26c4","target":"graph","created_at":"2026-05-18T03:19:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the enumeration of ordered set partitions avoiding a permutation pattern, as introduced by Godbole, Goyt, Herdan and Pudwell. Let $\\op_{n,k}(p)$ be the number of ordered set partitions of $\\{1,2,\\ldots,n\\}$ into $k$ blocks that avoid a permutation pattern $p$. We establish an explicit identity between the number $\\op_{n,k}(p)$ and the numbers of words avoiding the inverse of $p$. This identity allows us to easily translate results on pattern-avoiding words obtained in earlier works into equivalent results on pattern-avoiding ordered set partitions. In particular, \\emph{(a)} we dete","authors_text":"Anisse Kasraoui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-01T19:53:38Z","title":"Pattern avoidance in ordered set partitions and words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0495","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0dc707b18b46a8ebfb64d9d8466b18bd0fa7d695d5bcc4e6b9427fc4060d6f2e","target":"record","created_at":"2026-05-18T03:19:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dd2022e10015bc65fc8316466983c8a52bda37912a73b1604459b90da4f41298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-01T19:53:38Z","title_canon_sha256":"ad6ffb001db3f048a10f768763428bc28d418cc591a2c769734743ce9eaf554b"},"schema_version":"1.0","source":{"id":"1307.0495","kind":"arxiv","version":1}},"canonical_sha256":"06bee2a426ac3a0143a472a04a6c8b373be100f949a770581f09dfef89fcac44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06bee2a426ac3a0143a472a04a6c8b373be100f949a770581f09dfef89fcac44","first_computed_at":"2026-05-18T03:19:33.260808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:33.260808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G4oAmRiEWvg4QgnrYfpUP+YfleYbgSycIK9eYfxdK/TcrzLFgebmXcAJ+AjKVXSuqw9cSBicBRknB9H5zyT4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:33.261341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dc707b18b46a8ebfb64d9d8466b18bd0fa7d695d5bcc4e6b9427fc4060d6f2e","sha256:f703d0645b75eaf70ac8003ccc3a68b9b9cee8e24a1b302571f600044dff26c4"],"state_sha256":"13a7887f242f4695fdfd6f5e5b8297de0c74fc37cdf09626311aa9640557dfb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+U58DSvSHSXH+SiXT2d6uIfWj56vwM1nKk4d46fd8NP6pjiTEjM8q2CKWJj4C6A5/CNkNSZ4z7Cg8KMZCC6QCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:36:40.100619Z","bundle_sha256":"e09454d8e55a12615b28ad707e720b5c5c875c0f649256972275b00e1e7217a8"}}