{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UJ4CHB6JHCB3YFXZGSLHQUFFWZ","short_pith_number":"pith:UJ4CHB6J","schema_version":"1.0","canonical_sha256":"a2782387c93883bc16f934967850a5b6797eebb2cb3bfc9348f8808e183535e0","source":{"kind":"arxiv","id":"1603.02807","version":2},"attestation_state":"computed","paper":{"title":"Constructions and nonexistence results for suitable sets of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Jedwab, Justin H.C. Chan","submitted_at":"2016-03-09T08:16:20Z","abstract_excerpt":"A set of $N$ permutations of $\\{1,2,\\dots,v\\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for given $v$ and $t$, and to determine the largest $v$ for which such a set exists for given $N$ and $t$. These extremal problems were the subject of classical studies by Dushnik in 1950 and Spencer in 1971. We give examples of suitable sets of permutations for new parameter triples $(N,v,t)$. We relate certain suitable sets of permutations with parameter $t$ to o"},"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":"1603.02807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-09T08:16:20Z","cross_cats_sorted":[],"title_canon_sha256":"3c3876d5950c23144f16a02c2793d4d61104d705abf874e1c1657603d74e6e15","abstract_canon_sha256":"47c9c3546e70d2c7504654107efa5e59f0b136fbf3bf5c84709d56dd0e524d98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:06.420362Z","signature_b64":"fqdT5MCQGH7pefmE5QHdOIRjpH2q2wZD4gHVzIw73kfT9/5F0PRiRuJPIragPp6utUVYNy65R37Sm6CIj109Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2782387c93883bc16f934967850a5b6797eebb2cb3bfc9348f8808e183535e0","last_reissued_at":"2026-05-18T00:56:06.419827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:06.419827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions and nonexistence results for suitable sets of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Jedwab, Justin H.C. Chan","submitted_at":"2016-03-09T08:16:20Z","abstract_excerpt":"A set of $N$ permutations of $\\{1,2,\\dots,v\\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for given $v$ and $t$, and to determine the largest $v$ for which such a set exists for given $N$ and $t$. These extremal problems were the subject of classical studies by Dushnik in 1950 and Spencer in 1971. We give examples of suitable sets of permutations for new parameter triples $(N,v,t)$. We relate certain suitable sets of permutations with parameter $t$ to o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02807","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":"1603.02807","created_at":"2026-05-18T00:56:06.419911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02807v2","created_at":"2026-05-18T00:56:06.419911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02807","created_at":"2026-05-18T00:56:06.419911+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJ4CHB6JHCB3","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJ4CHB6JHCB3YFXZ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJ4CHB6J","created_at":"2026-05-18T12:30:46.583412+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/UJ4CHB6JHCB3YFXZGSLHQUFFWZ","json":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ.json","graph_json":"https://pith.science/api/pith-number/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/graph.json","events_json":"https://pith.science/api/pith-number/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/events.json","paper":"https://pith.science/paper/UJ4CHB6J"},"agent_actions":{"view_html":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ","download_json":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ.json","view_paper":"https://pith.science/paper/UJ4CHB6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02807&json=true","fetch_graph":"https://pith.science/api/pith-number/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/action/storage_attestation","attest_author":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/action/author_attestation","sign_citation":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/action/citation_signature","submit_replication":"https://pith.science/pith/UJ4CHB6JHCB3YFXZGSLHQUFFWZ/action/replication_record"}},"created_at":"2026-05-18T00:56:06.419911+00:00","updated_at":"2026-05-18T00:56:06.419911+00:00"}