{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:4SQNV5KWEW4NAUGFORDQDNDO3J","short_pith_number":"pith:4SQNV5KW","schema_version":"1.0","canonical_sha256":"e4a0daf55625b8d050c5744701b46eda70679b91e18f82fb004cf62e72bde302","source":{"kind":"arxiv","id":"math/9702223","version":1},"attestation_state":"computed","paper":{"title":"Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mikl\\'os B\\'ona","submitted_at":"1997-02-11T00:00:00Z","abstract_excerpt":"Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function $H(x)$ of all 1342-avoiding permutations of length $n$ as well as an {\\em exact} formula for their number $S_n(1342)$. While achieving this, we bijectively prove that the number of indecomposable 1342-avoiding permutations of length $n$ equals that of labeled plane trees of a certain type on $n$ vertices recently enumerated by Cori, Jacquard and Schaeffer, which is in turn known to be equal to the number of rooted bicubic maps enumerated by Tutte in 1963. Moreover, $H("},"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":"math/9702223","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1997-02-11T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"ef4b05a03428a37effd5919b2d36163291b487e059fc51494b4fa62c169439f6","abstract_canon_sha256":"58a9e6d50254cae728cad666ae0c6eab6fb77f5974a7e5f9a32301f9f7c5d48d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:37.138465Z","signature_b64":"6cpJwpT4Zm5H1BEbylIbKPR5Zn2h4f7YE58tOa53cfZm/ZZKMXd3N8O/sTnVKP71VuCSP0JHsLWxIDjYmPXUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a0daf55625b8d050c5744701b46eda70679b91e18f82fb004cf62e72bde302","last_reissued_at":"2026-05-18T01:05:37.137916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:37.137916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mikl\\'os B\\'ona","submitted_at":"1997-02-11T00:00:00Z","abstract_excerpt":"Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function $H(x)$ of all 1342-avoiding permutations of length $n$ as well as an {\\em exact} formula for their number $S_n(1342)$. While achieving this, we bijectively prove that the number of indecomposable 1342-avoiding permutations of length $n$ equals that of labeled plane trees of a certain type on $n$ vertices recently enumerated by Cori, Jacquard and Schaeffer, which is in turn known to be equal to the number of rooted bicubic maps enumerated by Tutte in 1963. Moreover, $H("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9702223","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":""},"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":"math/9702223","created_at":"2026-05-18T01:05:37.138001+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9702223v1","created_at":"2026-05-18T01:05:37.138001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9702223","created_at":"2026-05-18T01:05:37.138001+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SQNV5KWEW4N","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SQNV5KWEW4NAUGF","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SQNV5KW","created_at":"2026-05-18T12:25:48.327863+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/4SQNV5KWEW4NAUGFORDQDNDO3J","json":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J.json","graph_json":"https://pith.science/api/pith-number/4SQNV5KWEW4NAUGFORDQDNDO3J/graph.json","events_json":"https://pith.science/api/pith-number/4SQNV5KWEW4NAUGFORDQDNDO3J/events.json","paper":"https://pith.science/paper/4SQNV5KW"},"agent_actions":{"view_html":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J","download_json":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J.json","view_paper":"https://pith.science/paper/4SQNV5KW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9702223&json=true","fetch_graph":"https://pith.science/api/pith-number/4SQNV5KWEW4NAUGFORDQDNDO3J/graph.json","fetch_events":"https://pith.science/api/pith-number/4SQNV5KWEW4NAUGFORDQDNDO3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J/action/storage_attestation","attest_author":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J/action/author_attestation","sign_citation":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J/action/citation_signature","submit_replication":"https://pith.science/pith/4SQNV5KWEW4NAUGFORDQDNDO3J/action/replication_record"}},"created_at":"2026-05-18T01:05:37.138001+00:00","updated_at":"2026-05-18T01:05:37.138001+00:00"}