{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J54NM2KPAZK2BFHPBNNTH26DEQ","short_pith_number":"pith:J54NM2KP","canonical_record":{"source":{"id":"1706.06884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-21T13:16:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b3b7e5fa8ad7a8f3174c82cf0740c8bad8a04dd58f8e61a7b5ae9e98e769029","abstract_canon_sha256":"b33373ff6d5f5699f7b6cfcc1f9b6118466863fd3825582b243bc08db64642ae"},"schema_version":"1.0"},"canonical_sha256":"4f78d6694f0655a094ef0b5b33ebc3243c6428b9ebd14ac5d53416fe9d6a9241","source":{"kind":"arxiv","id":"1706.06884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06884","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06884v1","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06884","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"J54NM2KPAZK2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J54NM2KPAZK2BFHP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J54NM2KP","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J54NM2KPAZK2BFHPBNNTH26DEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-21T13:16:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b3b7e5fa8ad7a8f3174c82cf0740c8bad8a04dd58f8e61a7b5ae9e98e769029","abstract_canon_sha256":"b33373ff6d5f5699f7b6cfcc1f9b6118466863fd3825582b243bc08db64642ae"},"schema_version":"1.0"},"canonical_sha256":"4f78d6694f0655a094ef0b5b33ebc3243c6428b9ebd14ac5d53416fe9d6a9241","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:56.656522Z","signature_b64":"tFf/bwGrAkC4KcrfA0f265dEegH0m2+UJzXHdAvp695XPeRTK76wlGbaLIF9qcJELyUqDJ1AThp/0AM23VwyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f78d6694f0655a094ef0b5b33ebc3243c6428b9ebd14ac5d53416fe9d6a9241","last_reissued_at":"2026-05-18T00:41:56.655942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:56.655942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06884","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-18T00:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnhXP+yiFJzJGFQgfZpzz7wFQMpc4yMvkFKObqwjWf2CfsvYpS9mj/ULjXNDwfKV63k8cFDuIfSBingDCcjeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:07:33.148545Z"},"content_sha256":"977f91e0b7bdc1cf8872e7f12c4443dffd8f6fd49b559d3e5c623bf76b5bd22a","schema_version":"1.0","event_id":"sha256:977f91e0b7bdc1cf8872e7f12c4443dffd8f6fd49b559d3e5c623bf76b5bd22a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J54NM2KPAZK2BFHPBNNTH26DEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The monoids of the patience sorting algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Alan J. Cain, Ant\\'onio Malheiro, F\\'abio M. Silva","submitted_at":"2017-06-21T13:16:47Z","abstract_excerpt":"The left patience sorting (lPS) monoid, also known in the literature as the Bell monoid, and the right patient sorting (rPS) monoid are introduced by defining certain congruences on words. Such congruences are constructed using insertion algorithms based on the concept of decreasing subsequences. Presentations for these monoids are given.\n  Each finite-rank rPS monoid is shown to have polynomial growth and to satisfy a non-trivial identity (dependent on its rank), while the infinite rank rPS monoid does not satisfy a non-trivial identity. The lPS monoids of finite rank have exponential growth "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06884","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-18T00:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/qDsqeor15eKvsjxYlZZcskqixsRLhb3up9exhoEptirJ/+1UbnNsw5pf1+Z4evtAHTD/MMK7yasfz1j0WECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:07:33.148898Z"},"content_sha256":"81f0b43e18788033262bdfedb377234c6814f54d018d2ae05902e99e92c9c862","schema_version":"1.0","event_id":"sha256:81f0b43e18788033262bdfedb377234c6814f54d018d2ae05902e99e92c9c862"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J54NM2KPAZK2BFHPBNNTH26DEQ/bundle.json","state_url":"https://pith.science/pith/J54NM2KPAZK2BFHPBNNTH26DEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J54NM2KPAZK2BFHPBNNTH26DEQ/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-23T16:07:33Z","links":{"resolver":"https://pith.science/pith/J54NM2KPAZK2BFHPBNNTH26DEQ","bundle":"https://pith.science/pith/J54NM2KPAZK2BFHPBNNTH26DEQ/bundle.json","state":"https://pith.science/pith/J54NM2KPAZK2BFHPBNNTH26DEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J54NM2KPAZK2BFHPBNNTH26DEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J54NM2KPAZK2BFHPBNNTH26DEQ","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":"b33373ff6d5f5699f7b6cfcc1f9b6118466863fd3825582b243bc08db64642ae","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-21T13:16:47Z","title_canon_sha256":"2b3b7e5fa8ad7a8f3174c82cf0740c8bad8a04dd58f8e61a7b5ae9e98e769029"},"schema_version":"1.0","source":{"id":"1706.06884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06884","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06884v1","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06884","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"J54NM2KPAZK2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J54NM2KPAZK2BFHP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J54NM2KP","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:81f0b43e18788033262bdfedb377234c6814f54d018d2ae05902e99e92c9c862","target":"graph","created_at":"2026-05-18T00:41:56Z","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":"The left patience sorting (lPS) monoid, also known in the literature as the Bell monoid, and the right patient sorting (rPS) monoid are introduced by defining certain congruences on words. Such congruences are constructed using insertion algorithms based on the concept of decreasing subsequences. Presentations for these monoids are given.\n  Each finite-rank rPS monoid is shown to have polynomial growth and to satisfy a non-trivial identity (dependent on its rank), while the infinite rank rPS monoid does not satisfy a non-trivial identity. The lPS monoids of finite rank have exponential growth ","authors_text":"Alan J. Cain, Ant\\'onio Malheiro, F\\'abio M. Silva","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-21T13:16:47Z","title":"The monoids of the patience sorting algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06884","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:977f91e0b7bdc1cf8872e7f12c4443dffd8f6fd49b559d3e5c623bf76b5bd22a","target":"record","created_at":"2026-05-18T00:41:56Z","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":"b33373ff6d5f5699f7b6cfcc1f9b6118466863fd3825582b243bc08db64642ae","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-21T13:16:47Z","title_canon_sha256":"2b3b7e5fa8ad7a8f3174c82cf0740c8bad8a04dd58f8e61a7b5ae9e98e769029"},"schema_version":"1.0","source":{"id":"1706.06884","kind":"arxiv","version":1}},"canonical_sha256":"4f78d6694f0655a094ef0b5b33ebc3243c6428b9ebd14ac5d53416fe9d6a9241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f78d6694f0655a094ef0b5b33ebc3243c6428b9ebd14ac5d53416fe9d6a9241","first_computed_at":"2026-05-18T00:41:56.655942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:56.655942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tFf/bwGrAkC4KcrfA0f265dEegH0m2+UJzXHdAvp695XPeRTK76wlGbaLIF9qcJELyUqDJ1AThp/0AM23VwyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:56.656522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:977f91e0b7bdc1cf8872e7f12c4443dffd8f6fd49b559d3e5c623bf76b5bd22a","sha256:81f0b43e18788033262bdfedb377234c6814f54d018d2ae05902e99e92c9c862"],"state_sha256":"9814531f89557e3997ae63170c88b9b0b19f7e0bec35d94210c4c4c995ec2d1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2txP7YlaP2Qbd8jL4omiCyVJR3sUfzwcWjAV8jjyZSofxSGqnnVKjZxyol75EdHK3udaEmU8YaQcyR7sa8nOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:07:33.150877Z","bundle_sha256":"350843c1d9ff4934480646b20ff6461cbce967c29ca8c061b4b2192b05e2489d"}}