{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IOZGGEUFE4QJIMT4U232HVRFCO","short_pith_number":"pith:IOZGGEUF","canonical_record":{"source":{"id":"1607.06126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T21:05:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff84557f3d9e857ae9e0cb26671146dc053a9a4ffcd4fd5e295a786d995b07a2","abstract_canon_sha256":"bca20b5692a72e59b5dde1fac012e6e0e509b9d1bcce66a32745e7a799fc5dc0"},"schema_version":"1.0"},"canonical_sha256":"43b2631285272094327ca6b7a3d62513b737e82c5d0426953a0c006b4dfe8090","source":{"kind":"arxiv","id":"1607.06126","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06126","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06126v3","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06126","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"IOZGGEUFE4QJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IOZGGEUFE4QJIMT4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IOZGGEUF","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IOZGGEUFE4QJIMT4U232HVRFCO","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T21:05:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff84557f3d9e857ae9e0cb26671146dc053a9a4ffcd4fd5e295a786d995b07a2","abstract_canon_sha256":"bca20b5692a72e59b5dde1fac012e6e0e509b9d1bcce66a32745e7a799fc5dc0"},"schema_version":"1.0"},"canonical_sha256":"43b2631285272094327ca6b7a3d62513b737e82c5d0426953a0c006b4dfe8090","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:20.010453Z","signature_b64":"Ld6wR/ZWwqrLzvLR0lNi893PeUgXDNTWx85WGQciMAOi7NXsFJ+lfHxbIpqBRYiD6I6RTuA70C+YsyB4pwWmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43b2631285272094327ca6b7a3d62513b737e82c5d0426953a0c006b4dfe8090","last_reissued_at":"2026-05-18T00:03:20.009875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:20.009875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06126","source_version":3,"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:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkdRYJiQ+8DcCk4I/hwFgv8mL08XWjPtgI+UJJnFkgfckGmeiepN3Ha6H4K5VG7lh5mlA5p8JDb5RyuI+gm6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:30:50.149510Z"},"content_sha256":"507d39b9a6b8e76018884237c6a8983e573548c594201a7592291df353fb815e","schema_version":"1.0","event_id":"sha256:507d39b9a6b8e76018884237c6a8983e573548c594201a7592291df353fb815e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IOZGGEUFE4QJIMT4U232HVRFCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two problems on matchings in set families - in the footsteps of Erd\\H{o}s and Kleitman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2016-07-20T21:05:50Z","abstract_excerpt":"The families $\\mathcal F_1,\\ldots, \\mathcal F_s\\subset 2^{[n]}$ are called $q$-dependent if there are no pairwise disjoint $F_1\\in \\mathcal F_1,\\ldots, F_s\\in\\mathcal F_s$ satisfying $|F_1\\cup\\ldots\\cup F_s|\\le q.$ We determine $\\max |\\mathcal F_1|+\\ldots +|\\mathcal F_s| $ for all values $n\\ge q,s\\ge 2$. The result provides a far-reaching generalization of an important classical result of Kleitman.\n  The well-known Erd\\H os Matching Conjecture suggests the largest size of a family $\\mathcal F\\subset {[n]\\choose k}$ with no $s$ pairwise disjoint sets. After more than 50 years its full solution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06126","kind":"arxiv","version":3},"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:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WpPILu/NTG9noCqwYL1ujhq9cthkTppvt36lbBc5EsmXZxT1i3FA+AeohsHg5REzZj6y70Zg4rQUCUi4J9kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:30:50.150089Z"},"content_sha256":"53471a247c1c76614f59e1065561c1372ae3f29f0cf889d1fb82965c4d019b00","schema_version":"1.0","event_id":"sha256:53471a247c1c76614f59e1065561c1372ae3f29f0cf889d1fb82965c4d019b00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOZGGEUFE4QJIMT4U232HVRFCO/bundle.json","state_url":"https://pith.science/pith/IOZGGEUFE4QJIMT4U232HVRFCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOZGGEUFE4QJIMT4U232HVRFCO/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-19T01:30:50Z","links":{"resolver":"https://pith.science/pith/IOZGGEUFE4QJIMT4U232HVRFCO","bundle":"https://pith.science/pith/IOZGGEUFE4QJIMT4U232HVRFCO/bundle.json","state":"https://pith.science/pith/IOZGGEUFE4QJIMT4U232HVRFCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOZGGEUFE4QJIMT4U232HVRFCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IOZGGEUFE4QJIMT4U232HVRFCO","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":"bca20b5692a72e59b5dde1fac012e6e0e509b9d1bcce66a32745e7a799fc5dc0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T21:05:50Z","title_canon_sha256":"ff84557f3d9e857ae9e0cb26671146dc053a9a4ffcd4fd5e295a786d995b07a2"},"schema_version":"1.0","source":{"id":"1607.06126","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06126","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06126v3","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06126","created_at":"2026-05-18T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"IOZGGEUFE4QJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IOZGGEUFE4QJIMT4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IOZGGEUF","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:53471a247c1c76614f59e1065561c1372ae3f29f0cf889d1fb82965c4d019b00","target":"graph","created_at":"2026-05-18T00:03:20Z","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":"The families $\\mathcal F_1,\\ldots, \\mathcal F_s\\subset 2^{[n]}$ are called $q$-dependent if there are no pairwise disjoint $F_1\\in \\mathcal F_1,\\ldots, F_s\\in\\mathcal F_s$ satisfying $|F_1\\cup\\ldots\\cup F_s|\\le q.$ We determine $\\max |\\mathcal F_1|+\\ldots +|\\mathcal F_s| $ for all values $n\\ge q,s\\ge 2$. The result provides a far-reaching generalization of an important classical result of Kleitman.\n  The well-known Erd\\H os Matching Conjecture suggests the largest size of a family $\\mathcal F\\subset {[n]\\choose k}$ with no $s$ pairwise disjoint sets. After more than 50 years its full solution ","authors_text":"Andrey Kupavskii, Peter Frankl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T21:05:50Z","title":"Two problems on matchings in set families - in the footsteps of Erd\\H{o}s and Kleitman"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06126","kind":"arxiv","version":3},"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:507d39b9a6b8e76018884237c6a8983e573548c594201a7592291df353fb815e","target":"record","created_at":"2026-05-18T00:03:20Z","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":"bca20b5692a72e59b5dde1fac012e6e0e509b9d1bcce66a32745e7a799fc5dc0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T21:05:50Z","title_canon_sha256":"ff84557f3d9e857ae9e0cb26671146dc053a9a4ffcd4fd5e295a786d995b07a2"},"schema_version":"1.0","source":{"id":"1607.06126","kind":"arxiv","version":3}},"canonical_sha256":"43b2631285272094327ca6b7a3d62513b737e82c5d0426953a0c006b4dfe8090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43b2631285272094327ca6b7a3d62513b737e82c5d0426953a0c006b4dfe8090","first_computed_at":"2026-05-18T00:03:20.009875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:20.009875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ld6wR/ZWwqrLzvLR0lNi893PeUgXDNTWx85WGQciMAOi7NXsFJ+lfHxbIpqBRYiD6I6RTuA70C+YsyB4pwWmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:20.010453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06126","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:507d39b9a6b8e76018884237c6a8983e573548c594201a7592291df353fb815e","sha256:53471a247c1c76614f59e1065561c1372ae3f29f0cf889d1fb82965c4d019b00"],"state_sha256":"c0c2d1ee0544f3d31439a61a865227d92eb8a02621f03a65047a374fb213f955"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eN8n3oJ74M5PK0DX7/kPiSmws8B+bpW8JRbqY50c0Fpp5PiVWvggDvQFsZArc9owip1Y0gX1fCHWf6JIF0R1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T01:30:50.151893Z","bundle_sha256":"21ae40562f746921917a4eb906211dddb4e58a973fc1a64eda8b6caf74688cb7"}}