{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MAA5R5U7A5EGMG6XLXMGORBTXU","short_pith_number":"pith:MAA5R5U7","schema_version":"1.0","canonical_sha256":"6001d8f69f0748661bd75dd8674433bd0f7418efea87c00f59120352dce73345","source":{"kind":"arxiv","id":"2605.24092","version":1},"attestation_state":"computed","paper":{"title":"Enumerating Pattern Avoiding Parking Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Adenbaum","submitted_at":"2026-05-22T18:00:07Z","abstract_excerpt":"In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we provide explicit growth rates for the number of parking functions of length $n$ avoiding a monotonic pattern of any length. As a consequence of our techniques we additionally provide a combinatorial enumeration for the number of equivalence classes of words with a fixed content under the Sylvester congruence."},"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.24092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T18:00:07Z","cross_cats_sorted":[],"title_canon_sha256":"6514f51745ad55cdcbb0495dcf1a6367788093c2ded3469f033f8308504bafc5","abstract_canon_sha256":"3221512d976a0f4d01162521ee74e7cf468149e38267dd881b3d78cf8baaef2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:02:45.350918Z","signature_b64":"R7I/aLv1v2VEdAXBWdqCNrJEAPlFTwqrtgKIXFCk2m/z+jxGa5GJKfpq8yQKzmmbllSlzwv63irXKW4ob6++AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6001d8f69f0748661bd75dd8674433bd0f7418efea87c00f59120352dce73345","last_reissued_at":"2026-05-26T01:02:45.350117Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:02:45.350117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating Pattern Avoiding Parking Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Adenbaum","submitted_at":"2026-05-22T18:00:07Z","abstract_excerpt":"In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we provide explicit growth rates for the number of parking functions of length $n$ avoiding a monotonic pattern of any length. As a consequence of our techniques we additionally provide a combinatorial enumeration for the number of equivalence classes of words with a fixed content under the Sylvester congruence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24092","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.24092/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.24092","created_at":"2026-05-26T01:02:45.350235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24092v1","created_at":"2026-05-26T01:02:45.350235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24092","created_at":"2026-05-26T01:02:45.350235+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAA5R5U7A5EG","created_at":"2026-05-26T01:02:45.350235+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAA5R5U7A5EGMG6X","created_at":"2026-05-26T01:02:45.350235+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAA5R5U7","created_at":"2026-05-26T01:02:45.350235+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/MAA5R5U7A5EGMG6XLXMGORBTXU","json":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU.json","graph_json":"https://pith.science/api/pith-number/MAA5R5U7A5EGMG6XLXMGORBTXU/graph.json","events_json":"https://pith.science/api/pith-number/MAA5R5U7A5EGMG6XLXMGORBTXU/events.json","paper":"https://pith.science/paper/MAA5R5U7"},"agent_actions":{"view_html":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU","download_json":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU.json","view_paper":"https://pith.science/paper/MAA5R5U7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24092&json=true","fetch_graph":"https://pith.science/api/pith-number/MAA5R5U7A5EGMG6XLXMGORBTXU/graph.json","fetch_events":"https://pith.science/api/pith-number/MAA5R5U7A5EGMG6XLXMGORBTXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU/action/storage_attestation","attest_author":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU/action/author_attestation","sign_citation":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU/action/citation_signature","submit_replication":"https://pith.science/pith/MAA5R5U7A5EGMG6XLXMGORBTXU/action/replication_record"}},"created_at":"2026-05-26T01:02:45.350235+00:00","updated_at":"2026-05-26T01:02:45.350235+00:00"}