{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JLHHFBAMHBZUJIGYJEGODO53EV","short_pith_number":"pith:JLHHFBAM","schema_version":"1.0","canonical_sha256":"4ace72840c387344a0d8490ce1bbbb2570dac5407c434c17c9f75a8e511c44cc","source":{"kind":"arxiv","id":"1611.04014","version":2},"attestation_state":"computed","paper":{"title":"On super-strong Wilf equivalence classes of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Savvidou, Demetris Hadjiloucas, Ioannis Michos","submitted_at":"2016-11-12T16:28:31Z","abstract_excerpt":"Super-strong (elsewhere referred to as strong) Wilf equivalence is a type of Wilf equivalence on words that was introduced by Kitaev et al. in 2009. We provide a necessary and sufficient condition for two permutations in $n$ letters to be super-strongly Wilf equivalent, using distances between letters within a permutation. Furthermore, we give a characterization of such equivalence classes via two-colored binary trees. This allows us to prove, in the case of super-strong Wilf equivalence, the conjecture stated in (Kitaev et al., 2009) that the cardinality of each Wilf equivalence class is a po"},"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":"1611.04014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-12T16:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"399c6fb9652bc1084b2cc06bd21e37045c77ab4573a1fb3a7baca20fa85a48ea","abstract_canon_sha256":"7552f15af1ef0c3e2537357f13f1c9be262b331a71868fe0b7697b4b833878b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:53.373712Z","signature_b64":"HliZ4GlbcGzYPuacZZtUd+k4kLb8DewbPlJRdz/llQkhqaTG1DqAT+Rfwg/RsXMUmkhRNqOrBzNE81Vd7nBhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ace72840c387344a0d8490ce1bbbb2570dac5407c434c17c9f75a8e511c44cc","last_reissued_at":"2026-05-18T00:41:53.373188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:53.373188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On super-strong Wilf equivalence classes of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Savvidou, Demetris Hadjiloucas, Ioannis Michos","submitted_at":"2016-11-12T16:28:31Z","abstract_excerpt":"Super-strong (elsewhere referred to as strong) Wilf equivalence is a type of Wilf equivalence on words that was introduced by Kitaev et al. in 2009. We provide a necessary and sufficient condition for two permutations in $n$ letters to be super-strongly Wilf equivalent, using distances between letters within a permutation. Furthermore, we give a characterization of such equivalence classes via two-colored binary trees. This allows us to prove, in the case of super-strong Wilf equivalence, the conjecture stated in (Kitaev et al., 2009) that the cardinality of each Wilf equivalence class is a po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04014","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":"1611.04014","created_at":"2026-05-18T00:41:53.373272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04014v2","created_at":"2026-05-18T00:41:53.373272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04014","created_at":"2026-05-18T00:41:53.373272+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLHHFBAMHBZU","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLHHFBAMHBZUJIGY","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLHHFBAM","created_at":"2026-05-18T12:30:25.849896+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/JLHHFBAMHBZUJIGYJEGODO53EV","json":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV.json","graph_json":"https://pith.science/api/pith-number/JLHHFBAMHBZUJIGYJEGODO53EV/graph.json","events_json":"https://pith.science/api/pith-number/JLHHFBAMHBZUJIGYJEGODO53EV/events.json","paper":"https://pith.science/paper/JLHHFBAM"},"agent_actions":{"view_html":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV","download_json":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV.json","view_paper":"https://pith.science/paper/JLHHFBAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04014&json=true","fetch_graph":"https://pith.science/api/pith-number/JLHHFBAMHBZUJIGYJEGODO53EV/graph.json","fetch_events":"https://pith.science/api/pith-number/JLHHFBAMHBZUJIGYJEGODO53EV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV/action/storage_attestation","attest_author":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV/action/author_attestation","sign_citation":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV/action/citation_signature","submit_replication":"https://pith.science/pith/JLHHFBAMHBZUJIGYJEGODO53EV/action/replication_record"}},"created_at":"2026-05-18T00:41:53.373272+00:00","updated_at":"2026-05-18T00:41:53.373272+00:00"}