{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:52BSG7VUI4Y5COKKCNSGG673XD","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":"ff20bbff63dcd81660b8a74f7121c4cd5adb162e18ff2930f9caccbef5fea760","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-26T21:46:50Z","title_canon_sha256":"62f6f3789ea10c60c1bd867ba5de5712528ec2a5d2c956afe931d246c943193f"},"schema_version":"1.0","source":{"id":"1802.09622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09622","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09622v1","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09622","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"52BSG7VUI4Y5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"52BSG7VUI4Y5COKK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"52BSG7VU","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:b1d3101972270d205f8b6eaf00d7f09127f22bee262ef75ca5ae6016bcb2df28","target":"graph","created_at":"2026-05-18T00:22: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":"For a finite set $X$, we say that a set $H\\subseteq X$ crosses a partition ${\\cal P}=(X_1,\\dots,X_k)$ of $X$ if $H$ intersects $\\min (|H|,k)$ partition classes. If $|H|\\geq k$, this means that $H$ meets all classes $X_i$, whilst for $|H|\\leq k$ the elements of the crossing set $H$ belong to mutually distinct classes. A set system ${\\cal H}$ crosses ${\\cal P}$, if so does some $H\\in {\\cal H}$. The minimum number of $r$-element subsets, such that every $k$-partition of an $n$-element set $X$ is crossed by at least one of them, is denoted by $f(n,k,r)$.\n  The problem of determining these minimum ","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-26T21:46:50Z","title":"Partition-crossing hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09622","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:1b844741048d3c2301af4f99329afccaf6920dbba44c7a2179e7e06415c791eb","target":"record","created_at":"2026-05-18T00:22: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":"ff20bbff63dcd81660b8a74f7121c4cd5adb162e18ff2930f9caccbef5fea760","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-26T21:46:50Z","title_canon_sha256":"62f6f3789ea10c60c1bd867ba5de5712528ec2a5d2c956afe931d246c943193f"},"schema_version":"1.0","source":{"id":"1802.09622","kind":"arxiv","version":1}},"canonical_sha256":"ee83237eb44731d1394a1364637bfbb8c8d422c02db0a2a7986914e24c71733b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee83237eb44731d1394a1364637bfbb8c8d422c02db0a2a7986914e24c71733b","first_computed_at":"2026-05-18T00:22:30.607235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:30.607235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QGJ+qNPa9EDfQht/7LK5tgFuXZfKklCEtMD6jjOEJpn+zn9rKTjjyhM6UgfteQSSfUGh1Sk/pWC7iRcQgPY1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:30.608059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b844741048d3c2301af4f99329afccaf6920dbba44c7a2179e7e06415c791eb","sha256:b1d3101972270d205f8b6eaf00d7f09127f22bee262ef75ca5ae6016bcb2df28"],"state_sha256":"093c2e2ec19637f414dd99ff8399ac72dd5472e96b74c62c663f7020fce2e184"}