{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7N5R5OVUSM56GPRXQXYIGXRNS5","short_pith_number":"pith:7N5R5OVU","canonical_record":{"source":{"id":"1402.0668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T09:26:47Z","cross_cats_sorted":[],"title_canon_sha256":"72400d4ad4464fcd720fca10cb5442fbf97a7fe20053c4ccb037344e43e95109","abstract_canon_sha256":"4ac3bd3545a9999f89340692c11a650c32fd9e4fdf5a8496844c3c646ba1a9f6"},"schema_version":"1.0"},"canonical_sha256":"fb7b1ebab4933be33e3785f0835e2d975d99a42d67f611ce6cee5e5aa46e59dc","source":{"kind":"arxiv","id":"1402.0668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0668","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0668v1","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0668","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"7N5R5OVUSM56","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7N5R5OVUSM56GPRX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7N5R5OVU","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7N5R5OVUSM56GPRXQXYIGXRNS5","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T09:26:47Z","cross_cats_sorted":[],"title_canon_sha256":"72400d4ad4464fcd720fca10cb5442fbf97a7fe20053c4ccb037344e43e95109","abstract_canon_sha256":"4ac3bd3545a9999f89340692c11a650c32fd9e4fdf5a8496844c3c646ba1a9f6"},"schema_version":"1.0"},"canonical_sha256":"fb7b1ebab4933be33e3785f0835e2d975d99a42d67f611ce6cee5e5aa46e59dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:13.353684Z","signature_b64":"6ccFEjIDE4FylAETVJBrfF2wuaktxIB7iSB0SknwIsuTNJZBgSv+/vowSzFTeGVKiV5a36jZzExgiV354dfNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7b1ebab4933be33e3785f0835e2d975d99a42d67f611ce6cee5e5aa46e59dc","last_reissued_at":"2026-05-18T03:00:13.353100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:13.353100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0668","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-18T03:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owTnCT1ajQiBJq0EgcXHKXNzr3KeR4v73LpsmyIMjguwZHPyFHgYQtxq7IamOM62wf/anpuJyEqrSOYAfyUMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:29:00.739280Z"},"content_sha256":"7ac063648bfeadb2839584f1f67739a580080d4e71b005799fdf8b36ab18fb5b","schema_version":"1.0","event_id":"sha256:7ac063648bfeadb2839584f1f67739a580080d4e71b005799fdf8b36ab18fb5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7N5R5OVUSM56GPRXQXYIGXRNS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Erd{\\H o}s-Ko-Rado theorem for permutations with fixed number of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Yeaw Ku, Kok Bin Wong","submitted_at":"2014-02-04T09:26:47Z","abstract_excerpt":"Let $S_{n}$ denote the set of permutations of $[n]=\\{1,2,\\dots, n\\}$. For a positive integer $k$, define $S_{n,k}$ to be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles, i.e., \\[ S_{n,k} = \\{\\pi \\in S_{n}: \\pi = c_{1}c_{2} \\cdots c_{k}\\},\\] where $c_1,c_2,\\dots ,c_k$ are disjoint cycles. The size of $S_{n,k}$ is given by $\\left [ \\begin{matrix}n\\\\ k \\end{matrix}\\right]=(-1)^{n-k}s(n,k)$, where $s(n,k)$ is the Stirling number of the first kind. A family $\\mathcal{A} \\subseteq S_{n,k}$ is said to be $t$-{\\em intersecting} if any two elements of $\\mathcal{A}$ have at least $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0668","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-18T03:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM7Jygfv3c70rw1CayGW/jCmIE1X1vYSVxLA6GRToOtxMC+kIbBAtONTAuIUWdVd9BL9/BT9fHRJR21eydINAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:29:00.739645Z"},"content_sha256":"16d8bdb273b30ca3976f72ffc86be27e7a493da7684826e252575f8a6d95a028","schema_version":"1.0","event_id":"sha256:16d8bdb273b30ca3976f72ffc86be27e7a493da7684826e252575f8a6d95a028"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7N5R5OVUSM56GPRXQXYIGXRNS5/bundle.json","state_url":"https://pith.science/pith/7N5R5OVUSM56GPRXQXYIGXRNS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7N5R5OVUSM56GPRXQXYIGXRNS5/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-28T20:29:00Z","links":{"resolver":"https://pith.science/pith/7N5R5OVUSM56GPRXQXYIGXRNS5","bundle":"https://pith.science/pith/7N5R5OVUSM56GPRXQXYIGXRNS5/bundle.json","state":"https://pith.science/pith/7N5R5OVUSM56GPRXQXYIGXRNS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7N5R5OVUSM56GPRXQXYIGXRNS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7N5R5OVUSM56GPRXQXYIGXRNS5","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":"4ac3bd3545a9999f89340692c11a650c32fd9e4fdf5a8496844c3c646ba1a9f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T09:26:47Z","title_canon_sha256":"72400d4ad4464fcd720fca10cb5442fbf97a7fe20053c4ccb037344e43e95109"},"schema_version":"1.0","source":{"id":"1402.0668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0668","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0668v1","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0668","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"7N5R5OVUSM56","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7N5R5OVUSM56GPRX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7N5R5OVU","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:16d8bdb273b30ca3976f72ffc86be27e7a493da7684826e252575f8a6d95a028","target":"graph","created_at":"2026-05-18T03:00:13Z","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":"Let $S_{n}$ denote the set of permutations of $[n]=\\{1,2,\\dots, n\\}$. For a positive integer $k$, define $S_{n,k}$ to be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles, i.e., \\[ S_{n,k} = \\{\\pi \\in S_{n}: \\pi = c_{1}c_{2} \\cdots c_{k}\\},\\] where $c_1,c_2,\\dots ,c_k$ are disjoint cycles. The size of $S_{n,k}$ is given by $\\left [ \\begin{matrix}n\\\\ k \\end{matrix}\\right]=(-1)^{n-k}s(n,k)$, where $s(n,k)$ is the Stirling number of the first kind. A family $\\mathcal{A} \\subseteq S_{n,k}$ is said to be $t$-{\\em intersecting} if any two elements of $\\mathcal{A}$ have at least $","authors_text":"Cheng Yeaw Ku, Kok Bin Wong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T09:26:47Z","title":"An Erd{\\H o}s-Ko-Rado theorem for permutations with fixed number of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0668","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:7ac063648bfeadb2839584f1f67739a580080d4e71b005799fdf8b36ab18fb5b","target":"record","created_at":"2026-05-18T03:00:13Z","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":"4ac3bd3545a9999f89340692c11a650c32fd9e4fdf5a8496844c3c646ba1a9f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T09:26:47Z","title_canon_sha256":"72400d4ad4464fcd720fca10cb5442fbf97a7fe20053c4ccb037344e43e95109"},"schema_version":"1.0","source":{"id":"1402.0668","kind":"arxiv","version":1}},"canonical_sha256":"fb7b1ebab4933be33e3785f0835e2d975d99a42d67f611ce6cee5e5aa46e59dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb7b1ebab4933be33e3785f0835e2d975d99a42d67f611ce6cee5e5aa46e59dc","first_computed_at":"2026-05-18T03:00:13.353100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:13.353100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ccFEjIDE4FylAETVJBrfF2wuaktxIB7iSB0SknwIsuTNJZBgSv+/vowSzFTeGVKiV5a36jZzExgiV354dfNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:13.353684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ac063648bfeadb2839584f1f67739a580080d4e71b005799fdf8b36ab18fb5b","sha256:16d8bdb273b30ca3976f72ffc86be27e7a493da7684826e252575f8a6d95a028"],"state_sha256":"5510a80942b28b2b92ddaf52b2896d2714dbd7992433d106e5df9368e839a1ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xlpj3l0sLBJVtMeQQO6Jpx/0vVmLeEhr4elUqTgpY856klaDABFqc9bRiIWRmarxULVXoXB+0hm2CsOx0430Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:29:00.741464Z","bundle_sha256":"658ac2a5278edcf5999a59c14775bbf88b3593682c10c350eb4a831eb1b3b09b"}}