{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZJD7EIIZ2J42NJBPZ2C5MGUSO3","short_pith_number":"pith:ZJD7EIIZ","schema_version":"1.0","canonical_sha256":"ca47f22119d279a6a42fce85d61a9276d9c6abfc3fbfc1f9e5c25231122a4d90","source":{"kind":"arxiv","id":"1510.08036","version":4},"attestation_state":"computed","paper":{"title":"Pattern avoidance in forests of binary shrubs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Bevan, Derek Levin, Jay Pantone, Lara Pudwell, Manda Riehl, ML Tlachac, Peter Nugent","submitted_at":"2015-10-27T19:36:38Z","abstract_excerpt":"We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoiding patterns of length three. In four of the five non-equivalent cases, we present explicit enumerations by exhibiting bijections with certain lattice paths bounded above by the line $y=\\ell x$, for some $\\ell\\in\\mathbb{Q}^+$, one of these being the celebrated Duchon's club paths with $\\ell=2/3$. In t"},"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":"1510.08036","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-27T19:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"dde7f948412e4e33e1286179624d18dda32a1312e0743fcbc4919d6c0510aca8","abstract_canon_sha256":"7d200a89a01322d92a7ad91ad6fca94c0eb57ac7febc51ee29352e2d9528d91b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:15.992988Z","signature_b64":"EtTHgVQm8Q4gRotBLahrZkjfinUJCm7aB4LA2ev6jv7FoA05Y0lVvArFpgDiRIPitidNz5vo/seytgflCSuHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca47f22119d279a6a42fce85d61a9276d9c6abfc3fbfc1f9e5c25231122a4d90","last_reissued_at":"2026-07-05T06:23:15.992586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:15.992586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern avoidance in forests of binary shrubs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Bevan, Derek Levin, Jay Pantone, Lara Pudwell, Manda Riehl, ML Tlachac, Peter Nugent","submitted_at":"2015-10-27T19:36:38Z","abstract_excerpt":"We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoiding patterns of length three. In four of the five non-equivalent cases, we present explicit enumerations by exhibiting bijections with certain lattice paths bounded above by the line $y=\\ell x$, for some $\\ell\\in\\mathbb{Q}^+$, one of these being the celebrated Duchon's club paths with $\\ell=2/3$. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08036","kind":"arxiv","version":4},"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/1510.08036/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":"1510.08036","created_at":"2026-07-05T06:23:15.992650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08036v4","created_at":"2026-07-05T06:23:15.992650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08036","created_at":"2026-07-05T06:23:15.992650+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJD7EIIZ2J42","created_at":"2026-07-05T06:23:15.992650+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJD7EIIZ2J42NJBP","created_at":"2026-07-05T06:23:15.992650+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJD7EIIZ","created_at":"2026-07-05T06:23:15.992650+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/ZJD7EIIZ2J42NJBPZ2C5MGUSO3","json":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3.json","graph_json":"https://pith.science/api/pith-number/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/graph.json","events_json":"https://pith.science/api/pith-number/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/events.json","paper":"https://pith.science/paper/ZJD7EIIZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3","download_json":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3.json","view_paper":"https://pith.science/paper/ZJD7EIIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08036&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/action/storage_attestation","attest_author":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/action/author_attestation","sign_citation":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/action/citation_signature","submit_replication":"https://pith.science/pith/ZJD7EIIZ2J42NJBPZ2C5MGUSO3/action/replication_record"}},"created_at":"2026-07-05T06:23:15.992650+00:00","updated_at":"2026-07-05T06:23:15.992650+00:00"}