{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XY7NBIS3DKKZC47OYLSKLB3YMB","short_pith_number":"pith:XY7NBIS3","schema_version":"1.0","canonical_sha256":"be3ed0a25b1a959173eec2e4a587786049f1fdf3289a0a486e1dffcfd69d3e96","source":{"kind":"arxiv","id":"2309.14644","version":1},"attestation_state":"computed","paper":{"title":"Deterministic stack-sorting for set partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Janabel Xia","submitted_at":"2023-09-26T03:53:58Z","abstract_excerpt":"A sock sequence is a sequence of elements, which we will refer to as socks, from a finite alphabet. A sock sequence is sorted if all occurrences of a sock appear consecutively. We define equivalence classes of sock sequences called sock patterns, which are in bijection with set partitions. The notion of stack-sorting for set partitions was originally introduced by Defant and Kravitz. In this paper, we define a new deterministic stack-sorting map $\\phi_{\\sigma}$ for sock sequences that uses a $\\sigma$-avoiding stack, where pattern containment need not be consecutive. When $\\sigma = aba$, we sho"},"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":"2309.14644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-26T03:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"b4c0bd28ac339310280dfe34538cc638e1aefe82d89eeabb00a2df5481e7a957","abstract_canon_sha256":"8f7160bf0c43ab0d7b162a5c33a23a682612f22fd26207effe82f6e877b58acf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:28.029047Z","signature_b64":"aC/wQ6MmC5FtXqNcP11VtMEPVkmKiM8yhD8CVhmUV2aZlxl3knANZLDJ3mq37ARfo9kp2/PWexziouAhAZIwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3ed0a25b1a959173eec2e4a587786049f1fdf3289a0a486e1dffcfd69d3e96","last_reissued_at":"2026-07-05T06:54:28.028597Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:28.028597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic stack-sorting for set partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Janabel Xia","submitted_at":"2023-09-26T03:53:58Z","abstract_excerpt":"A sock sequence is a sequence of elements, which we will refer to as socks, from a finite alphabet. A sock sequence is sorted if all occurrences of a sock appear consecutively. We define equivalence classes of sock sequences called sock patterns, which are in bijection with set partitions. The notion of stack-sorting for set partitions was originally introduced by Defant and Kravitz. In this paper, we define a new deterministic stack-sorting map $\\phi_{\\sigma}$ for sock sequences that uses a $\\sigma$-avoiding stack, where pattern containment need not be consecutive. When $\\sigma = aba$, we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14644","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.14644/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2309.14644","created_at":"2026-07-05T06:54:28.028662+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14644v1","created_at":"2026-07-05T06:54:28.028662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14644","created_at":"2026-07-05T06:54:28.028662+00:00"},{"alias_kind":"pith_short_12","alias_value":"XY7NBIS3DKKZ","created_at":"2026-07-05T06:54:28.028662+00:00"},{"alias_kind":"pith_short_16","alias_value":"XY7NBIS3DKKZC47O","created_at":"2026-07-05T06:54:28.028662+00:00"},{"alias_kind":"pith_short_8","alias_value":"XY7NBIS3","created_at":"2026-07-05T06:54:28.028662+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/XY7NBIS3DKKZC47OYLSKLB3YMB","json":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB.json","graph_json":"https://pith.science/api/pith-number/XY7NBIS3DKKZC47OYLSKLB3YMB/graph.json","events_json":"https://pith.science/api/pith-number/XY7NBIS3DKKZC47OYLSKLB3YMB/events.json","paper":"https://pith.science/paper/XY7NBIS3"},"agent_actions":{"view_html":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB","download_json":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB.json","view_paper":"https://pith.science/paper/XY7NBIS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14644&json=true","fetch_graph":"https://pith.science/api/pith-number/XY7NBIS3DKKZC47OYLSKLB3YMB/graph.json","fetch_events":"https://pith.science/api/pith-number/XY7NBIS3DKKZC47OYLSKLB3YMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB/action/storage_attestation","attest_author":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB/action/author_attestation","sign_citation":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB/action/citation_signature","submit_replication":"https://pith.science/pith/XY7NBIS3DKKZC47OYLSKLB3YMB/action/replication_record"}},"created_at":"2026-07-05T06:54:28.028662+00:00","updated_at":"2026-07-05T06:54:28.028662+00:00"}