{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:53B6ZHG3PEB55F23AZGAOAEELI","short_pith_number":"pith:53B6ZHG3","schema_version":"1.0","canonical_sha256":"eec3ec9cdb7903de975b064c0700845a3a650d5a4d35c2b9e7367074d1fbd9f0","source":{"kind":"arxiv","id":"2605.18274","version":1},"attestation_state":"computed","paper":{"title":"Max-tree for d-permutations and pattern avoidance","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Muller","submitted_at":"2026-05-18T12:08:19Z","abstract_excerpt":"Higher dimensional permutations are tuples of d-1 permutations that can be identified with a point set in a d-dimensional grid. In N. Bonichon and P.-J. Morel, {\\it J. Integer Sequences} 25 (2022), several conjectures regarding the enumeration of pattern avoiding d-permutations were stated.\n  In this paper, we consider a mapping from d-permutations to $2^{d-1}-$ary trees that naturally generalizes the classical max-tree construction for permutations. We then show that, when restricted to d-permutations avoiding (21,12) and 231, this mapping yields a bijection with d-ary trees. This result reso"},"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.18274","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T12:08:19Z","cross_cats_sorted":[],"title_canon_sha256":"8663c4c0d61f386367e53912eb1fdf5d4f766d77bdaa074bafe4a84e54271e39","abstract_canon_sha256":"16143f17689e82d6b577997096914982e7afb1539c10fac0a909189341a6a5d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:52.941653Z","signature_b64":"avXRRS4NHAhQLuf8pyVqY3giyR6OyFoYHowcZ9dMAWi1tjEPzmPxe8eK/tzQOURkv8yWixnvnGHpzc8XUr7jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eec3ec9cdb7903de975b064c0700845a3a650d5a4d35c2b9e7367074d1fbd9f0","last_reissued_at":"2026-05-20T00:05:52.941172Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:52.941172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-tree for d-permutations and pattern avoidance","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Muller","submitted_at":"2026-05-18T12:08:19Z","abstract_excerpt":"Higher dimensional permutations are tuples of d-1 permutations that can be identified with a point set in a d-dimensional grid. In N. Bonichon and P.-J. Morel, {\\it J. Integer Sequences} 25 (2022), several conjectures regarding the enumeration of pattern avoiding d-permutations were stated.\n  In this paper, we consider a mapping from d-permutations to $2^{d-1}-$ary trees that naturally generalizes the classical max-tree construction for permutations. We then show that, when restricted to d-permutations avoiding (21,12) and 231, this mapping yields a bijection with d-ary trees. This result reso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18274","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.18274/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.241732Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.949441Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0b656480c7be82532a970ab7e64b031f6a72b849843ae59f988192cfee679fce"},"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.18274","created_at":"2026-05-20T00:05:52.941236+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18274v1","created_at":"2026-05-20T00:05:52.941236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18274","created_at":"2026-05-20T00:05:52.941236+00:00"},{"alias_kind":"pith_short_12","alias_value":"53B6ZHG3PEB5","created_at":"2026-05-20T00:05:52.941236+00:00"},{"alias_kind":"pith_short_16","alias_value":"53B6ZHG3PEB55F23","created_at":"2026-05-20T00:05:52.941236+00:00"},{"alias_kind":"pith_short_8","alias_value":"53B6ZHG3","created_at":"2026-05-20T00:05:52.941236+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/53B6ZHG3PEB55F23AZGAOAEELI","json":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI.json","graph_json":"https://pith.science/api/pith-number/53B6ZHG3PEB55F23AZGAOAEELI/graph.json","events_json":"https://pith.science/api/pith-number/53B6ZHG3PEB55F23AZGAOAEELI/events.json","paper":"https://pith.science/paper/53B6ZHG3"},"agent_actions":{"view_html":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI","download_json":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI.json","view_paper":"https://pith.science/paper/53B6ZHG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18274&json=true","fetch_graph":"https://pith.science/api/pith-number/53B6ZHG3PEB55F23AZGAOAEELI/graph.json","fetch_events":"https://pith.science/api/pith-number/53B6ZHG3PEB55F23AZGAOAEELI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI/action/storage_attestation","attest_author":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI/action/author_attestation","sign_citation":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI/action/citation_signature","submit_replication":"https://pith.science/pith/53B6ZHG3PEB55F23AZGAOAEELI/action/replication_record"}},"created_at":"2026-05-20T00:05:52.941236+00:00","updated_at":"2026-05-20T00:05:52.941236+00:00"}