{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RSIOAKROEQS2CAKQOWR27O5XE5","short_pith_number":"pith:RSIOAKRO","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"},"canonical_sha256":"8c90e02a2e2425a1015075a3afbbb7277600ef98ea3d0c3d3df0728662556856","source":{"kind":"arxiv","id":"1801.08262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08262","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08262v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08262","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"RSIOAKROEQS2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RSIOAKROEQS2CAKQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RSIOAKRO","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RSIOAKROEQS2CAKQOWR27O5XE5","target":"record","payload":{"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"},"canonical_sha256":"8c90e02a2e2425a1015075a3afbbb7277600ef98ea3d0c3d3df0728662556856","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"},"source_kind":"arxiv","source_id":"1801.08262","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQTdte/xIAwqJFNgKKoFSXF5zuXNr4rMFfWfgwr8xn9KS2lbJkMF566Q6YM8wp5bS2h+wwXu8quttpX/9Q42BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:25:33.884645Z"},"content_sha256":"9f81030ea3a2a95b2fa322d8fd348f6144f6af88546bd334731e5967328058f5","schema_version":"1.0","event_id":"sha256:9f81030ea3a2a95b2fa322d8fd348f6144f6af88546bd334731e5967328058f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RSIOAKROEQS2CAKQOWR27O5XE5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaZj5L8T+zOT/6VIWakhpRg/OR+31+3s5M9nlX4+b726NpmNIp9T/H+/0kpDs7OXZ8FEE65f4+ZyqXixxIhSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:25:33.885344Z"},"content_sha256":"5ca57f32a459d066803178200e176c63a6a58a7d493fb8d2b7d2467b8d869502","schema_version":"1.0","event_id":"sha256:5ca57f32a459d066803178200e176c63a6a58a7d493fb8d2b7d2467b8d869502"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/bundle.json","state_url":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSIOAKROEQS2CAKQOWR27O5XE5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T00:25:33Z","links":{"resolver":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5","bundle":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/bundle.json","state":"https://pith.science/pith/RSIOAKROEQS2CAKQOWR27O5XE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSIOAKROEQS2CAKQOWR27O5XE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RSIOAKROEQS2CAKQOWR27O5XE5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"93f3c550f5e552224903adeeb8ef740f915c07b3415a2560d49af68447fd1e12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-25T03:02:31Z","title_canon_sha256":"c05bfe336e4246371f08615efadcf9444376f3a660cae9323629682d47a101f4"},"schema_version":"1.0","source":{"id":"1801.08262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08262","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08262v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08262","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"RSIOAKROEQS2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RSIOAKROEQS2CAKQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RSIOAKRO","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:5ca57f32a459d066803178200e176c63a6a58a7d493fb8d2b7d2467b8d869502","target":"graph","created_at":"2026-05-18T00:25:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Sergi Elizalde, Tim Dwyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-25T03:02:31Z","title":"Wilf equivalence relations for consecutive patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08262","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f81030ea3a2a95b2fa322d8fd348f6144f6af88546bd334731e5967328058f5","target":"record","created_at":"2026-05-18T00:25:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"93f3c550f5e552224903adeeb8ef740f915c07b3415a2560d49af68447fd1e12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-25T03:02:31Z","title_canon_sha256":"c05bfe336e4246371f08615efadcf9444376f3a660cae9323629682d47a101f4"},"schema_version":"1.0","source":{"id":"1801.08262","kind":"arxiv","version":1}},"canonical_sha256":"8c90e02a2e2425a1015075a3afbbb7277600ef98ea3d0c3d3df0728662556856","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c90e02a2e2425a1015075a3afbbb7277600ef98ea3d0c3d3df0728662556856","first_computed_at":"2026-05-18T00:25:06.707863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:06.707863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3b+HG0S7RHONgnQNP1YyoqHxBiulmT09qEm3Ut1vQelRE3kOoO0HjA/aalDiUhV14Npwjm54KePHM7r2x0/UAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:06.708333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f81030ea3a2a95b2fa322d8fd348f6144f6af88546bd334731e5967328058f5","sha256:5ca57f32a459d066803178200e176c63a6a58a7d493fb8d2b7d2467b8d869502"],"state_sha256":"405ea40b9d7bb165438c265311d2565048724ebcc6b67d33bb439d6847846fbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6MO9xYp2QjD+k4uHl1O4a9mE6waJMLf1vBLC27+xjXHcH7L62U61djkCKn5zHUV9ct4P2iirra2Nc5gJjsEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T00:25:33.888926Z","bundle_sha256":"d566aa7f5111ae8fe7db60c0d640790c725ed0394b094f25c40690f7d8134fb4"}}