{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UWHSQTXL2XRX3SRLX3YXDDM3CC","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":"b68007b54e613cf5894c5ce570ca31e6c11e2fd9026ac752fadf4b50fad8d6ed","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T16:24:30Z","title_canon_sha256":"ab84307fcdbd2bd333382365205637d13656fc12118e45ac8514a58bb66ad681"},"schema_version":"1.0","source":{"id":"1907.08142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08142","created_at":"2026-05-17T23:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08142v1","created_at":"2026-05-17T23:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08142","created_at":"2026-05-17T23:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"UWHSQTXL2XRX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UWHSQTXL2XRX3SRL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UWHSQTXL","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:7dc3f3f93679041bbcbcb1f7eea442be4a14f0d86d199280f5ac1a72572ef2b2","target":"graph","created_at":"2026-05-17T23:40:14Z","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 (classical) problem of characterizing and enumerating permutations that can be sorted using two stacks connected in series is still largely open. In the present paper we address a related problem, in which we impose restrictions both on the procedure and on the stacks. More precisely, we consider a greedy algorithm where we perform the rightmost legal operation (here \"rightmost\" refers to the usual representation of stack sorting problems). Moreover, the first stack is required to be $\\sigma$-avoiding, for some permutation $\\sigma$, meaning that, at each step, the elements maintained in th","authors_text":"Anders Claesson, Giulio Cerbai, Luca Ferrari","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T16:24:30Z","title":"Stack sorting with restricted stacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08142","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:e812fad1e6fd0f90270dcbc1502f0131ab2f9404f468214c62be2712efb3ef11","target":"record","created_at":"2026-05-17T23:40:14Z","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":"b68007b54e613cf5894c5ce570ca31e6c11e2fd9026ac752fadf4b50fad8d6ed","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T16:24:30Z","title_canon_sha256":"ab84307fcdbd2bd333382365205637d13656fc12118e45ac8514a58bb66ad681"},"schema_version":"1.0","source":{"id":"1907.08142","kind":"arxiv","version":1}},"canonical_sha256":"a58f284eebd5e37dca2bbef1718d9b108abdfa8aac7a3f456dba5f2e6759686d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a58f284eebd5e37dca2bbef1718d9b108abdfa8aac7a3f456dba5f2e6759686d","first_computed_at":"2026-05-17T23:40:14.952024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:14.952024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VgEALmDDx0hLHKYry4BaksAXcwEf6o4jEx6NuXMFGZ+NtHrqQ9GuKF0X9tJsAc0+r79RQ+l9ZH5N68t3ovf6Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:14.952789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e812fad1e6fd0f90270dcbc1502f0131ab2f9404f468214c62be2712efb3ef11","sha256:7dc3f3f93679041bbcbcb1f7eea442be4a14f0d86d199280f5ac1a72572ef2b2"],"state_sha256":"fc9db648fb4db98ad1fa09362966e86c3d8f0ea95680c973593abf4fe9770e06"}