{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3C3XLDPTKTICHW3GUGN4ZBGKZL","short_pith_number":"pith:3C3XLDPT","schema_version":"1.0","canonical_sha256":"d8b7758df354d023db66a19bcc84cacadf0d8a4095d849d66da3a7712d602c9d","source":{"kind":"arxiv","id":"2605.23519","version":1},"attestation_state":"computed","paper":{"title":"Finite-state enumeration of adjacency-constrained 132-avoiding permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dai Akita, Teruki Mayama","submitted_at":"2026-05-22T11:34:27Z","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"},"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":"2605.23519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T11:34:27Z","cross_cats_sorted":[],"title_canon_sha256":"e66ae02e5a24c54676c64d9b27520abc4bac31752e49648b59303a7b5aad1709","abstract_canon_sha256":"0255a7520a0582c9a27a6b3c1cb85356dcdf9730aebdb8640113e91f53f719ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:58.973103Z","signature_b64":"v+C8oCzT5vIq8i9N4c/jz7zYhX6Env5jB09EnhbeH832qmMeM16i2YaVuh7D3tUzLafRDDAzofdsrgIHYAMJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8b7758df354d023db66a19bcc84cacadf0d8a4095d849d66da3a7712d602c9d","last_reissued_at":"2026-05-25T02:01:58.972391Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:58.972391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-state enumeration of adjacency-constrained 132-avoiding permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dai Akita, Teruki Mayama","submitted_at":"2026-05-22T11:34:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23519","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/2605.23519/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":"2605.23519","created_at":"2026-05-25T02:01:58.972504+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23519v1","created_at":"2026-05-25T02:01:58.972504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23519","created_at":"2026-05-25T02:01:58.972504+00:00"},{"alias_kind":"pith_short_12","alias_value":"3C3XLDPTKTIC","created_at":"2026-05-25T02:01:58.972504+00:00"},{"alias_kind":"pith_short_16","alias_value":"3C3XLDPTKTICHW3G","created_at":"2026-05-25T02:01:58.972504+00:00"},{"alias_kind":"pith_short_8","alias_value":"3C3XLDPT","created_at":"2026-05-25T02:01:58.972504+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/3C3XLDPTKTICHW3GUGN4ZBGKZL","json":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL.json","graph_json":"https://pith.science/api/pith-number/3C3XLDPTKTICHW3GUGN4ZBGKZL/graph.json","events_json":"https://pith.science/api/pith-number/3C3XLDPTKTICHW3GUGN4ZBGKZL/events.json","paper":"https://pith.science/paper/3C3XLDPT"},"agent_actions":{"view_html":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL","download_json":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL.json","view_paper":"https://pith.science/paper/3C3XLDPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23519&json=true","fetch_graph":"https://pith.science/api/pith-number/3C3XLDPTKTICHW3GUGN4ZBGKZL/graph.json","fetch_events":"https://pith.science/api/pith-number/3C3XLDPTKTICHW3GUGN4ZBGKZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/action/storage_attestation","attest_author":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/action/author_attestation","sign_citation":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/action/citation_signature","submit_replication":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/action/replication_record"}},"created_at":"2026-05-25T02:01:58.972504+00:00","updated_at":"2026-05-25T02:01:58.972504+00:00"}