{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EYTJ3R337OSHO2IFP4PH5OHNZ3","short_pith_number":"pith:EYTJ3R33","canonical_record":{"source":{"id":"1504.06657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-24T22:28:58Z","cross_cats_sorted":[],"title_canon_sha256":"3c2e5a0c6cdf865388bc0774a12a5badc4356cedb5c9b1b7041b96c138a9ed35","abstract_canon_sha256":"5e257e3dc1d03c62c4798000c052aa79f0c919a7dbbea5af1915bbd11e1386b3"},"schema_version":"1.0"},"canonical_sha256":"26269dc77bfba47769057f1e7eb8edcef1e3b3a522910a2e4863e231e697d79f","source":{"kind":"arxiv","id":"1504.06657","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06657","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06657v2","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06657","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"EYTJ3R337OSH","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EYTJ3R337OSHO2IF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EYTJ3R33","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EYTJ3R337OSHO2IFP4PH5OHNZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-24T22:28:58Z","cross_cats_sorted":[],"title_canon_sha256":"3c2e5a0c6cdf865388bc0774a12a5badc4356cedb5c9b1b7041b96c138a9ed35","abstract_canon_sha256":"5e257e3dc1d03c62c4798000c052aa79f0c919a7dbbea5af1915bbd11e1386b3"},"schema_version":"1.0"},"canonical_sha256":"26269dc77bfba47769057f1e7eb8edcef1e3b3a522910a2e4863e231e697d79f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:07.639902Z","signature_b64":"SBCpDWu73/FlD0aqIeoBXK5Adov1PCkHfsWZL8blcitp0uYqClc7AVnj6kgx0tA+ZptDGB+kiT3jUir+tUhWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26269dc77bfba47769057f1e7eb8edcef1e3b3a522910a2e4863e231e697d79f","last_reissued_at":"2026-05-18T02:02:07.639241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:07.639241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06657","source_version":2,"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-18T02:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+hUXIhH1fOy2pckj82qu+jM2aP5Mh1/rp2jRRVSIFr+4hAxwnubEJkZxHQ/xcbo221A9xfXIzYXdYxpOjxrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:15:34.010341Z"},"content_sha256":"d8a0252951be8bbe79695dc02112440fe89df14d032b517631a8cb21e50f2078","schema_version":"1.0","event_id":"sha256:d8a0252951be8bbe79695dc02112440fe89df14d032b517631a8cb21e50f2078"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EYTJ3R337OSHO2IFP4PH5OHNZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intersection theorems for multisets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alison Purdy, Karen Meagher","submitted_at":"2015-04-24T22:28:58Z","abstract_excerpt":"Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\\{1,...,m\\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting and $t$-intersecting $k$-set systems to prove new results for intersecting and $t$-intersecting families of $k$-multisets. These results include a multiset version of the Hilton-Milner theorem and a theorem giving the size and structure of the largest $t$-intersecting family of $k$-multisets of an $m$-set when $m \\leq 2k-t$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06657","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"},"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-18T02:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31/dBtXDLSn82u5lQCBqXeV1bnfbHsdjIzYIeApprLS6G9Y3BUsMrDy4FfxFN6MQno5t6MjqqnHUpUul3bkIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:15:34.010755Z"},"content_sha256":"3b31bcd1515b592e493d9753fe4faec6417495fd83396aed1b06342ce21cdec6","schema_version":"1.0","event_id":"sha256:3b31bcd1515b592e493d9753fe4faec6417495fd83396aed1b06342ce21cdec6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYTJ3R337OSHO2IFP4PH5OHNZ3/bundle.json","state_url":"https://pith.science/pith/EYTJ3R337OSHO2IFP4PH5OHNZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYTJ3R337OSHO2IFP4PH5OHNZ3/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-05-24T11:15:34Z","links":{"resolver":"https://pith.science/pith/EYTJ3R337OSHO2IFP4PH5OHNZ3","bundle":"https://pith.science/pith/EYTJ3R337OSHO2IFP4PH5OHNZ3/bundle.json","state":"https://pith.science/pith/EYTJ3R337OSHO2IFP4PH5OHNZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYTJ3R337OSHO2IFP4PH5OHNZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EYTJ3R337OSHO2IFP4PH5OHNZ3","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":"5e257e3dc1d03c62c4798000c052aa79f0c919a7dbbea5af1915bbd11e1386b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-24T22:28:58Z","title_canon_sha256":"3c2e5a0c6cdf865388bc0774a12a5badc4356cedb5c9b1b7041b96c138a9ed35"},"schema_version":"1.0","source":{"id":"1504.06657","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06657","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06657v2","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06657","created_at":"2026-05-18T02:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"EYTJ3R337OSH","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EYTJ3R337OSHO2IF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EYTJ3R33","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:3b31bcd1515b592e493d9753fe4faec6417495fd83396aed1b06342ce21cdec6","target":"graph","created_at":"2026-05-18T02:02:07Z","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 $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\\{1,...,m\\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting and $t$-intersecting $k$-set systems to prove new results for intersecting and $t$-intersecting families of $k$-multisets. These results include a multiset version of the Hilton-Milner theorem and a theorem giving the size and structure of the largest $t$-intersecting family of $k$-multisets of an $m$-set when $m \\leq 2k-t$.","authors_text":"Alison Purdy, Karen Meagher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-24T22:28:58Z","title":"Intersection theorems for multisets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06657","kind":"arxiv","version":2},"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:d8a0252951be8bbe79695dc02112440fe89df14d032b517631a8cb21e50f2078","target":"record","created_at":"2026-05-18T02:02:07Z","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":"5e257e3dc1d03c62c4798000c052aa79f0c919a7dbbea5af1915bbd11e1386b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-24T22:28:58Z","title_canon_sha256":"3c2e5a0c6cdf865388bc0774a12a5badc4356cedb5c9b1b7041b96c138a9ed35"},"schema_version":"1.0","source":{"id":"1504.06657","kind":"arxiv","version":2}},"canonical_sha256":"26269dc77bfba47769057f1e7eb8edcef1e3b3a522910a2e4863e231e697d79f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26269dc77bfba47769057f1e7eb8edcef1e3b3a522910a2e4863e231e697d79f","first_computed_at":"2026-05-18T02:02:07.639241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:07.639241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SBCpDWu73/FlD0aqIeoBXK5Adov1PCkHfsWZL8blcitp0uYqClc7AVnj6kgx0tA+ZptDGB+kiT3jUir+tUhWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:07.639902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06657","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8a0252951be8bbe79695dc02112440fe89df14d032b517631a8cb21e50f2078","sha256:3b31bcd1515b592e493d9753fe4faec6417495fd83396aed1b06342ce21cdec6"],"state_sha256":"e38432e1678af36b9775dfeff8a058faae421d2135441326d6ba374f0c4c0511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7nZFP54ejNvAmHs5cRqFXxoupsnlpddkCw77w4cQUL9jepcueWQLsqVpix9636x97JgbbGx8bNTyQjWDJb5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:15:34.013920Z","bundle_sha256":"1d1bb805b1f8fe75262e26d251c0ab0e785ec96df51ecd48e9c254f48436ab7e"}}