{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3C3XLDPTKTICHW3GUGN4ZBGKZL","short_pith_number":"pith:3C3XLDPT","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"},"canonical_sha256":"d8b7758df354d023db66a19bcc84cacadf0d8a4095d849d66da3a7712d602c9d","source":{"kind":"arxiv","id":"2605.23519","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3C3XLDPTKTICHW3GUGN4ZBGKZL","target":"record","payload":{"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"},"canonical_sha256":"d8b7758df354d023db66a19bcc84cacadf0d8a4095d849d66da3a7712d602c9d","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"},"source_kind":"arxiv","source_id":"2605.23519","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-25T02:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sCMXv5PmdBG+YFmz6rquzQnXOUyYWmTnh218xF4uVLlq3lyFvv0E2rARB1k7J5cWk6cMk8NKtiRFA08r1XLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:46:21.715881Z"},"content_sha256":"9ed2c6250c985c65b0e6d52b9ccd8603729e548f7e0e20c4125875a780daf6ff","schema_version":"1.0","event_id":"sha256:9ed2c6250c985c65b0e6d52b9ccd8603729e548f7e0e20c4125875a780daf6ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3C3XLDPTKTICHW3GUGN4ZBGKZL","target":"graph","payload":{"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"},"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-25T02:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYd92JF1FvYWl5LANYIsyAmyR9qNyp94PekngEmVKk+c2y0T8Occnshy28IPjteSy6Z2/FIIM3UqapU90MlACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:46:21.716256Z"},"content_sha256":"6d3b61d71133737eacdc86f84719faabd565e4a4e3e037fff900876756b75426","schema_version":"1.0","event_id":"sha256:6d3b61d71133737eacdc86f84719faabd565e4a4e3e037fff900876756b75426"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/bundle.json","state_url":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/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-05T10:46:21Z","links":{"resolver":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL","bundle":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/bundle.json","state":"https://pith.science/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3C3XLDPTKTICHW3GUGN4ZBGKZL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVElfy1mthbyPpR2WNolldGn0fYyjXL22sbjEsZEeGsFtzIw11DVq2btt4jQGL4+rrdaJhBUzI1BRLjb9k7lBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:46:21.718457Z","bundle_sha256":"0ee7878983ee91f6efa73185dd11318d8a8f1610597850bf600e62b2444ba908"}}