{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QL3FCRZXTVEJIHUYISXKWER7ZP","short_pith_number":"pith:QL3FCRZX","canonical_record":{"source":{"id":"1808.03159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T05:50:46Z","cross_cats_sorted":[],"title_canon_sha256":"516cb5bc76fec7236b003bf0ce9f3bf2cd1607ae6a8cbe7e319bd707dbf3a0be","abstract_canon_sha256":"2122f8051e4b5bb704e86974b709d86fb82039aa8de912dccc0417b1adee7b3b"},"schema_version":"1.0"},"canonical_sha256":"82f65147379d48941e9844aeab123fcbf7b5ccc59cb79dbca6114f43fd8a44c8","source":{"kind":"arxiv","id":"1808.03159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03159","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03159v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03159","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"QL3FCRZXTVEJ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QL3FCRZXTVEJIHUY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QL3FCRZX","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QL3FCRZXTVEJIHUYISXKWER7ZP","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T05:50:46Z","cross_cats_sorted":[],"title_canon_sha256":"516cb5bc76fec7236b003bf0ce9f3bf2cd1607ae6a8cbe7e319bd707dbf3a0be","abstract_canon_sha256":"2122f8051e4b5bb704e86974b709d86fb82039aa8de912dccc0417b1adee7b3b"},"schema_version":"1.0"},"canonical_sha256":"82f65147379d48941e9844aeab123fcbf7b5ccc59cb79dbca6114f43fd8a44c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.050465Z","signature_b64":"jqLZwzrlZPbVtEnGWg38xbT34SGeC5hL2J1jLabR4h/m4sNaPzeyCCrVR1IHi1ldmiEgom70jghsd3VdyNCNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f65147379d48941e9844aeab123fcbf7b5ccc59cb79dbca6114f43fd8a44c8","last_reissued_at":"2026-05-18T00:08:30.050060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.050060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03159","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:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33UDwNXEmBOPwuizLrhKWyVpv01w5gR5y3bwS5bmUkpgAAWflPx+q61wdE8WoIxymD8G86ALp5lcsqi267HJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:15:36.539006Z"},"content_sha256":"4f94afb97d34216e97b375fd3d9991507d6448a9335c50b67f241d16f6dc2cbd","schema_version":"1.0","event_id":"sha256:4f94afb97d34216e97b375fd3d9991507d6448a9335c50b67f241d16f6dc2cbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QL3FCRZXTVEJIHUYISXKWER7ZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Suitable sets of permutations, packings of triples, and Ramsey's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiande Zhang","submitted_at":"2018-08-08T05:50:46Z","abstract_excerpt":"A set of $N$ permutations of $\\{1,2,\\ldots,v\\}$ is $t$-suitable, if each symbol precedes each subset of $t-1$ others in at least one permutation. The extremal problem of determining the smallest size $N$ of such sets for given $v$ and $t$ was the subject of classical studies by Dushnik in 1950 and Spencer in 1971. Colbourn recently introduced the concept of suitable cores as equivalent objects of suitable sets of permutations, and studied the dual problem of determining the largest $v=\\text{SCN}(t,N)$ such that a suitable core exists for given $t$ and $N$. Chan and Jedwab showed that when $N=\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03159","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:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+fLlYFM5sMf/jkL4RRsGGYHX/e9d+W+G6/u1ec1AOqGg+I4kN8YSDtNA21BR0r9XYRLBMEoGK9yHjladlUmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:15:36.539752Z"},"content_sha256":"afaedee15377398c8f24798de0be20899471fdd7a24b4f3274beddec186cf324","schema_version":"1.0","event_id":"sha256:afaedee15377398c8f24798de0be20899471fdd7a24b4f3274beddec186cf324"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QL3FCRZXTVEJIHUYISXKWER7ZP/bundle.json","state_url":"https://pith.science/pith/QL3FCRZXTVEJIHUYISXKWER7ZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QL3FCRZXTVEJIHUYISXKWER7ZP/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-11T06:15:36Z","links":{"resolver":"https://pith.science/pith/QL3FCRZXTVEJIHUYISXKWER7ZP","bundle":"https://pith.science/pith/QL3FCRZXTVEJIHUYISXKWER7ZP/bundle.json","state":"https://pith.science/pith/QL3FCRZXTVEJIHUYISXKWER7ZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QL3FCRZXTVEJIHUYISXKWER7ZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QL3FCRZXTVEJIHUYISXKWER7ZP","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":"2122f8051e4b5bb704e86974b709d86fb82039aa8de912dccc0417b1adee7b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T05:50:46Z","title_canon_sha256":"516cb5bc76fec7236b003bf0ce9f3bf2cd1607ae6a8cbe7e319bd707dbf3a0be"},"schema_version":"1.0","source":{"id":"1808.03159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03159","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03159v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03159","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"QL3FCRZXTVEJ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QL3FCRZXTVEJIHUY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QL3FCRZX","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:afaedee15377398c8f24798de0be20899471fdd7a24b4f3274beddec186cf324","target":"graph","created_at":"2026-05-18T00:08:30Z","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":"A set of $N$ permutations of $\\{1,2,\\ldots,v\\}$ is $t$-suitable, if each symbol precedes each subset of $t-1$ others in at least one permutation. The extremal problem of determining the smallest size $N$ of such sets for given $v$ and $t$ was the subject of classical studies by Dushnik in 1950 and Spencer in 1971. Colbourn recently introduced the concept of suitable cores as equivalent objects of suitable sets of permutations, and studied the dual problem of determining the largest $v=\\text{SCN}(t,N)$ such that a suitable core exists for given $t$ and $N$. Chan and Jedwab showed that when $N=\\","authors_text":"Xiande Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T05:50:46Z","title":"Suitable sets of permutations, packings of triples, and Ramsey's theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03159","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:4f94afb97d34216e97b375fd3d9991507d6448a9335c50b67f241d16f6dc2cbd","target":"record","created_at":"2026-05-18T00:08:30Z","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":"2122f8051e4b5bb704e86974b709d86fb82039aa8de912dccc0417b1adee7b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T05:50:46Z","title_canon_sha256":"516cb5bc76fec7236b003bf0ce9f3bf2cd1607ae6a8cbe7e319bd707dbf3a0be"},"schema_version":"1.0","source":{"id":"1808.03159","kind":"arxiv","version":1}},"canonical_sha256":"82f65147379d48941e9844aeab123fcbf7b5ccc59cb79dbca6114f43fd8a44c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82f65147379d48941e9844aeab123fcbf7b5ccc59cb79dbca6114f43fd8a44c8","first_computed_at":"2026-05-18T00:08:30.050060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:30.050060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jqLZwzrlZPbVtEnGWg38xbT34SGeC5hL2J1jLabR4h/m4sNaPzeyCCrVR1IHi1ldmiEgom70jghsd3VdyNCNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:30.050465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f94afb97d34216e97b375fd3d9991507d6448a9335c50b67f241d16f6dc2cbd","sha256:afaedee15377398c8f24798de0be20899471fdd7a24b4f3274beddec186cf324"],"state_sha256":"e6e2874c74ab35fcf296b21b4aa7b47158ed3e145ba2273bcbd714d40ec0ccf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jvcqYh1Y8ueTLEvhpLN4pGRkJVdzl34Ro8J0rYx8vCQwu/BlpDNUdzg33dezClqFnp+6KG3YGbsWXFc380QaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:15:36.543670Z","bundle_sha256":"4e0492f1a4cf3ab346ee1088fc05b53ee21e3f3a9fab66c9fc9042eb5606191e"}}