{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3C3XLDPTKTICHW3GUGN4ZBGKZL","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":"0255a7520a0582c9a27a6b3c1cb85356dcdf9730aebdb8640113e91f53f719ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T11:34:27Z","title_canon_sha256":"e66ae02e5a24c54676c64d9b27520abc4bac31752e49648b59303a7b5aad1709"},"schema_version":"1.0","source":{"id":"2605.23519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23519","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23519v1","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23519","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"3C3XLDPTKTIC","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"3C3XLDPTKTICHW3G","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"3C3XLDPT","created_at":"2026-05-25T02:01:58Z"}],"graph_snapshots":[{"event_id":"sha256:6d3b61d71133737eacdc86f84719faabd565e4a4e3e037fff900876756b75426","target":"graph","created_at":"2026-05-25T02:01:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.23519/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a fixed integer $m\\ge 1$, let $\\mathcal{A}_n^{(m)}$ be the set of permutations $\\pi\\in S_n$ that avoid the pattern $132$ and satisfy the adjacency bound $|\\pi_{i+1}-\\pi_i|\\le m$ for all $i$. Here, a pattern $132$ means three indices $i<j<k$ such that $\\pi_i<\\pi_k<\\pi_j$. A recent study initiated the enumeration of these constrained 132-avoiding permutations, treating the case $m=2$ by deriving a rational ordinary generating function and asking for finite-state decompositions, rational generating functions, and explicit rational formulas for larger fixed $m$. We introduce a two-sided endpoi","authors_text":"Dai Akita, Teruki Mayama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T11:34:27Z","title":"Finite-state enumeration of adjacency-constrained 132-avoiding permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23519","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:9ed2c6250c985c65b0e6d52b9ccd8603729e548f7e0e20c4125875a780daf6ff","target":"record","created_at":"2026-05-25T02:01:58Z","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":"0255a7520a0582c9a27a6b3c1cb85356dcdf9730aebdb8640113e91f53f719ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T11:34:27Z","title_canon_sha256":"e66ae02e5a24c54676c64d9b27520abc4bac31752e49648b59303a7b5aad1709"},"schema_version":"1.0","source":{"id":"2605.23519","kind":"arxiv","version":1}},"canonical_sha256":"d8b7758df354d023db66a19bcc84cacadf0d8a4095d849d66da3a7712d602c9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8b7758df354d023db66a19bcc84cacadf0d8a4095d849d66da3a7712d602c9d","first_computed_at":"2026-05-25T02:01:58.972391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:58.972391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v+C8oCzT5vIq8i9N4c/jz7zYhX6Env5jB09EnhbeH832qmMeM16i2YaVuh7D3tUzLafRDDAzofdsrgIHYAMJAw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:58.973103Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ed2c6250c985c65b0e6d52b9ccd8603729e548f7e0e20c4125875a780daf6ff","sha256:6d3b61d71133737eacdc86f84719faabd565e4a4e3e037fff900876756b75426"],"state_sha256":"08de56064933d2d854702545274b562f24c510648b7edbef9ea01d7a3d13c2c3"}