{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RSIOAKROEQS2CAKQOWR27O5XE5","short_pith_number":"pith:RSIOAKRO","schema_version":"1.0","canonical_sha256":"8c90e02a2e2425a1015075a3afbbb7277600ef98ea3d0c3d3df0728662556856","source":{"kind":"arxiv","id":"1801.08262","version":1},"attestation_state":"computed","paper":{"title":"Wilf equivalence relations for consecutive patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergi Elizalde, Tim Dwyer","submitted_at":"2018-01-25T03:02:31Z","abstract_excerpt":"Two permutations $\\pi$ and $\\tau$ are c-Wilf equivalent if, for each $n$, the number of permutations in $S_n$ avoiding $\\pi$ as a consecutive pattern (i.e., in adjacent positions) is the same as the number of those avoiding $\\tau$. In addition, $\\pi$ and $\\tau$ are strongly c-Wilf equivalent if, for each $n$ and $k$, the number of permutations in $S_n$ containing $k$ occurrences of $\\pi$ as a consecutive pattern is the same as for $\\tau$. In this paper we introduce a third, more restrictive equivalence relation, defining $\\pi$ and $\\tau$ to be super-strongly c-Wilf equivalent if the above cond"},"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":"1801.08262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-25T03:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"c05bfe336e4246371f08615efadcf9444376f3a660cae9323629682d47a101f4","abstract_canon_sha256":"93f3c550f5e552224903adeeb8ef740f915c07b3415a2560d49af68447fd1e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.708333Z","signature_b64":"3b+HG0S7RHONgnQNP1YyoqHxBiulmT09qEm3Ut1vQelRE3kOoO0HjA/aalDiUhV14Npwjm54KePHM7r2x0/UAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c90e02a2e2425a1015075a3afbbb7277600ef98ea3d0c3d3df0728662556856","last_reissued_at":"2026-05-18T00:25:06.707863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.707863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wilf equivalence relations for consecutive patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergi Elizalde, Tim Dwyer","submitted_at":"2018-01-25T03:02:31Z","abstract_excerpt":"Two permutations $\\pi$ and $\\tau$ are c-Wilf equivalent if, for each $n$, the number of permutations in $S_n$ avoiding $\\pi$ as a consecutive pattern (i.e., in adjacent positions) is the same as the number of those avoiding $\\tau$. In addition, $\\pi$ and $\\tau$ are strongly c-Wilf equivalent if, for each $n$ and $k$, the number of permutations in $S_n$ containing $k$ occurrences of $\\pi$ as a consecutive pattern is the same as for $\\tau$. In this paper we introduce a third, more restrictive equivalence relation, defining $\\pi$ and $\\tau$ to be super-strongly c-Wilf equivalent if the above cond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08262","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":"1801.08262","created_at":"2026-05-18T00:25:06.707934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08262v1","created_at":"2026-05-18T00:25:06.707934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08262","created_at":"2026-05-18T00:25:06.707934+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSIOAKROEQS2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSIOAKROEQS2CAKQ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSIOAKRO","created_at":"2026-05-18T12:32:50.500415+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/RSIOAKROEQS2CAKQOWR27O5XE5","json":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5.json","graph_json":"https://pith.science/api/pith-number/RSIOAKROEQS2CAKQOWR27O5XE5/graph.json","events_json":"https://pith.science/api/pith-number/RSIOAKROEQS2CAKQOWR27O5XE5/events.json","paper":"https://pith.science/paper/RSIOAKRO"},"agent_actions":{"view_html":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5","download_json":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5.json","view_paper":"https://pith.science/paper/RSIOAKRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08262&json=true","fetch_graph":"https://pith.science/api/pith-number/RSIOAKROEQS2CAKQOWR27O5XE5/graph.json","fetch_events":"https://pith.science/api/pith-number/RSIOAKROEQS2CAKQOWR27O5XE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/action/storage_attestation","attest_author":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/action/author_attestation","sign_citation":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/action/citation_signature","submit_replication":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/action/replication_record"}},"created_at":"2026-05-18T00:25:06.707934+00:00","updated_at":"2026-05-18T00:25:06.707934+00:00"}