{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7IDOKEYDSJBJVOK7IHO7JCJPCN","short_pith_number":"pith:7IDOKEYD","schema_version":"1.0","canonical_sha256":"fa06e5130392429ab95f41ddf4892f135b759c476dd141b97497bd906080d59b","source":{"kind":"arxiv","id":"1108.2642","version":2},"attestation_state":"computed","paper":{"title":"Enumeration schemes for vincular patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew M. Baxter, Lara K. Pudwell","submitted_at":"2011-08-12T15:27:40Z","abstract_excerpt":"We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called \"generalized patterns\" or \"dashed patterns\"). In particular we provide an algorithm which takes in as input a set $B$ of vincular patterns and search parameters and returns a recurrence (called a \"scheme\") to compute the number of permutations of length $n$ avoiding $B$ or confirmation that no such scheme exists within the search parameters. We also prove that if $B$ contains only consecutive patterns and patterns of the form $\\sigma_1\\sigma_2 ... \\sigma_{t-1}-\\sigma_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":"1108.2642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-12T15:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"ad7a6d029f1cd8d6db017f1bf196cc1f225a39ad517a5c5188b66392748af66f","abstract_canon_sha256":"50fea59acb63c9a8e7511617521f3e5dd0bc19283a8b4fb293c4ca824b341b5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:33.264698Z","signature_b64":"5AeN+3giQ2zsbekIlDc91pTa/xnILHx7on0kD8r1wvsLRc/wRCsA+N7OKU5Hu57YXvZPZKKRWMaaytFNOEh7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa06e5130392429ab95f41ddf4892f135b759c476dd141b97497bd906080d59b","last_reissued_at":"2026-05-18T04:04:33.264001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:33.264001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration schemes for vincular patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew M. Baxter, Lara K. Pudwell","submitted_at":"2011-08-12T15:27:40Z","abstract_excerpt":"We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called \"generalized patterns\" or \"dashed patterns\"). In particular we provide an algorithm which takes in as input a set $B$ of vincular patterns and search parameters and returns a recurrence (called a \"scheme\") to compute the number of permutations of length $n$ avoiding $B$ or confirmation that no such scheme exists within the search parameters. We also prove that if $B$ contains only consecutive patterns and patterns of the form $\\sigma_1\\sigma_2 ... \\sigma_{t-1}-\\sigma_t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2642","kind":"arxiv","version":2},"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":"1108.2642","created_at":"2026-05-18T04:04:33.264125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2642v2","created_at":"2026-05-18T04:04:33.264125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2642","created_at":"2026-05-18T04:04:33.264125+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IDOKEYDSJBJ","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IDOKEYDSJBJVOK7","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IDOKEYD","created_at":"2026-05-18T12:26:22.705136+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/7IDOKEYDSJBJVOK7IHO7JCJPCN","json":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN.json","graph_json":"https://pith.science/api/pith-number/7IDOKEYDSJBJVOK7IHO7JCJPCN/graph.json","events_json":"https://pith.science/api/pith-number/7IDOKEYDSJBJVOK7IHO7JCJPCN/events.json","paper":"https://pith.science/paper/7IDOKEYD"},"agent_actions":{"view_html":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN","download_json":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN.json","view_paper":"https://pith.science/paper/7IDOKEYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2642&json=true","fetch_graph":"https://pith.science/api/pith-number/7IDOKEYDSJBJVOK7IHO7JCJPCN/graph.json","fetch_events":"https://pith.science/api/pith-number/7IDOKEYDSJBJVOK7IHO7JCJPCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN/action/storage_attestation","attest_author":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN/action/author_attestation","sign_citation":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN/action/citation_signature","submit_replication":"https://pith.science/pith/7IDOKEYDSJBJVOK7IHO7JCJPCN/action/replication_record"}},"created_at":"2026-05-18T04:04:33.264125+00:00","updated_at":"2026-05-18T04:04:33.264125+00:00"}