{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y6M4HQ4MQE3VXFNWN3SETVDLK5","short_pith_number":"pith:Y6M4HQ4M","canonical_record":{"source":{"id":"1701.04107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T20:34:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ebcbbfc31b9b5ee3de439dd8b375a56f5445f9f966a598784183555592b1f33d","abstract_canon_sha256":"a72f86276665233d99972168b4cc3e950b95f6690a042cd96efbfc1be3bbb10d"},"schema_version":"1.0"},"canonical_sha256":"c799c3c38c81375b95b66ee449d46b574be78ae0bdf72a5e86e717cd9e80583b","source":{"kind":"arxiv","id":"1701.04107","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04107","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04107v2","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04107","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"Y6M4HQ4MQE3V","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6M4HQ4MQE3VXFNW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6M4HQ4M","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y6M4HQ4MQE3VXFNWN3SETVDLK5","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T20:34:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ebcbbfc31b9b5ee3de439dd8b375a56f5445f9f966a598784183555592b1f33d","abstract_canon_sha256":"a72f86276665233d99972168b4cc3e950b95f6690a042cd96efbfc1be3bbb10d"},"schema_version":"1.0"},"canonical_sha256":"c799c3c38c81375b95b66ee449d46b574be78ae0bdf72a5e86e717cd9e80583b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:00.743830Z","signature_b64":"UABTYx+MAw1ZN+2rMqS1pI6Pn1Ad5sJurGcUr2L6rF7VGd7VSfgAZ0hsbpdzIDw3TggfnAhuMtSl7fDRixd8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c799c3c38c81375b95b66ee449d46b574be78ae0bdf72a5e86e717cd9e80583b","last_reissued_at":"2026-05-18T00:09:00.743172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:00.743172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04107","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-18T00:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoXFnPR81O/pHTt4NJEBioAk5/hgW1nTdYkrDRouEzdKIum98Rdzq4eF4PPzH1I4u/tXmvNoB2YWMTwT7BA8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:12:01.361015Z"},"content_sha256":"080b49540d9f18bc30fb0b39753d228269aa7619157a3d968d3d4d811399196b","schema_version":"1.0","event_id":"sha256:080b49540d9f18bc30fb0b39753d228269aa7619157a3d968d3d4d811399196b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y6M4HQ4MQE3VXFNWN3SETVDLK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Families of sets with no matchings of sizes 3 and 4","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":"2017-01-15T20:34:10Z","abstract_excerpt":"In this paper, we study the following classical question of extremal set theory: what is the maximum size of a family of subsets of $[n]$ such that no $s$ sets from the family are pairwise disjoint? This problem was first posed by Erd\\H os and resolved for $n\\equiv 0, -1\\ (\\mathrm{mod }\\ s)$ by Kleitman in the 60s. Very little progress was made on the problem until recently. The only result was a very lengthy resolution of the case $s=3,\\ n\\equiv 1\\ (\\mathrm{mod }\\ 3)$ by Quinn, which was written in his PhD thesis and never published in a refereed journal. In this paper, we give another, much "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04107","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-18T00:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MQG3sAJ46McIGNXb7j6tIpaNRHJbp1/PGX7yNicWjf7JxkJFw0mJYtgMOENCncJqmN3/Tk22dDFXTU57U6lAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:12:01.361377Z"},"content_sha256":"dd04844e09f2d789fea996ab2287c14f65273e718bf555da7c6ea1261168a14d","schema_version":"1.0","event_id":"sha256:dd04844e09f2d789fea996ab2287c14f65273e718bf555da7c6ea1261168a14d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6M4HQ4MQE3VXFNWN3SETVDLK5/bundle.json","state_url":"https://pith.science/pith/Y6M4HQ4MQE3VXFNWN3SETVDLK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6M4HQ4MQE3VXFNWN3SETVDLK5/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-02T21:12:01Z","links":{"resolver":"https://pith.science/pith/Y6M4HQ4MQE3VXFNWN3SETVDLK5","bundle":"https://pith.science/pith/Y6M4HQ4MQE3VXFNWN3SETVDLK5/bundle.json","state":"https://pith.science/pith/Y6M4HQ4MQE3VXFNWN3SETVDLK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6M4HQ4MQE3VXFNWN3SETVDLK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y6M4HQ4MQE3VXFNWN3SETVDLK5","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":"a72f86276665233d99972168b4cc3e950b95f6690a042cd96efbfc1be3bbb10d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T20:34:10Z","title_canon_sha256":"ebcbbfc31b9b5ee3de439dd8b375a56f5445f9f966a598784183555592b1f33d"},"schema_version":"1.0","source":{"id":"1701.04107","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04107","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04107v2","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04107","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"Y6M4HQ4MQE3V","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6M4HQ4MQE3VXFNW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6M4HQ4M","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:dd04844e09f2d789fea996ab2287c14f65273e718bf555da7c6ea1261168a14d","target":"graph","created_at":"2026-05-18T00:09:00Z","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":"In this paper, we study the following classical question of extremal set theory: what is the maximum size of a family of subsets of $[n]$ such that no $s$ sets from the family are pairwise disjoint? This problem was first posed by Erd\\H os and resolved for $n\\equiv 0, -1\\ (\\mathrm{mod }\\ s)$ by Kleitman in the 60s. Very little progress was made on the problem until recently. The only result was a very lengthy resolution of the case $s=3,\\ n\\equiv 1\\ (\\mathrm{mod }\\ 3)$ by Quinn, which was written in his PhD thesis and never published in a refereed journal. In this paper, we give another, much ","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":"2017-01-15T20:34:10Z","title":"Families of sets with no matchings of sizes 3 and 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04107","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:080b49540d9f18bc30fb0b39753d228269aa7619157a3d968d3d4d811399196b","target":"record","created_at":"2026-05-18T00:09:00Z","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":"a72f86276665233d99972168b4cc3e950b95f6690a042cd96efbfc1be3bbb10d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T20:34:10Z","title_canon_sha256":"ebcbbfc31b9b5ee3de439dd8b375a56f5445f9f966a598784183555592b1f33d"},"schema_version":"1.0","source":{"id":"1701.04107","kind":"arxiv","version":2}},"canonical_sha256":"c799c3c38c81375b95b66ee449d46b574be78ae0bdf72a5e86e717cd9e80583b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c799c3c38c81375b95b66ee449d46b574be78ae0bdf72a5e86e717cd9e80583b","first_computed_at":"2026-05-18T00:09:00.743172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:00.743172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UABTYx+MAw1ZN+2rMqS1pI6Pn1Ad5sJurGcUr2L6rF7VGd7VSfgAZ0hsbpdzIDw3TggfnAhuMtSl7fDRixd8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:00.743830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04107","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:080b49540d9f18bc30fb0b39753d228269aa7619157a3d968d3d4d811399196b","sha256:dd04844e09f2d789fea996ab2287c14f65273e718bf555da7c6ea1261168a14d"],"state_sha256":"bbc8f3e0e91999bc83ed2542a87938aab0109637c985e351a8140a06444c8473"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+joGXDWxMZHVr9RhjuXYYq/hjGx4xTHdK9xEImz1ylV1jTAkFonphbsBUN/lY+MiL2b1ZpuyQLvQfp92EL7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:12:01.363305Z","bundle_sha256":"5153ad9fd2f3e022e23efcd5ea7eeb3b95bbe20937f78e348062759d3e41de49"}}