{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JMQDIFCC3NZU2WOKKLMI7VJE7X","short_pith_number":"pith:JMQDIFCC","canonical_record":{"source":{"id":"1810.00920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T18:56:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"44f516d8e79a7cde0c34d34606328b696aa24efcab6e1c856d1af20b65c16689","abstract_canon_sha256":"53e04d45c372ef6566f328bcdda85020bfae3f71ae6e060a70cb33eac0aecac0"},"schema_version":"1.0"},"canonical_sha256":"4b20341442db734d59ca52d88fd524fdc0693e7c868e2cef02fe57d9ae7c3274","source":{"kind":"arxiv","id":"1810.00920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00920","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00920v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00920","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"JMQDIFCC3NZU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JMQDIFCC3NZU2WOK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JMQDIFCC","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JMQDIFCC3NZU2WOKKLMI7VJE7X","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T18:56:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"44f516d8e79a7cde0c34d34606328b696aa24efcab6e1c856d1af20b65c16689","abstract_canon_sha256":"53e04d45c372ef6566f328bcdda85020bfae3f71ae6e060a70cb33eac0aecac0"},"schema_version":"1.0"},"canonical_sha256":"4b20341442db734d59ca52d88fd524fdc0693e7c868e2cef02fe57d9ae7c3274","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:19.627512Z","signature_b64":"dAjaGinngNG3Hta0p6t6pliS5TEUIXPcnOQn7LQ9eUeSzOE3C43mlvcrSByuIIm1LSo0kzT9le1lyHymqhLHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b20341442db734d59ca52d88fd524fdc0693e7c868e2cef02fe57d9ae7c3274","last_reissued_at":"2026-05-18T00:04:19.626887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:19.626887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00920","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-18T00:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4w43fzyLIRa7owTqalfFcB2xnUwOHQHZ8/lfU5zLss/KOOePuihe+WXhPlH3adPGPqOex0GW2oS491kf0eQFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:50:23.869563Z"},"content_sha256":"d010c8a53add32c51459434cb337dd66c7ca8a1c17e63a22aec94a816c859343","schema_version":"1.0","event_id":"sha256:d010c8a53add32c51459434cb337dd66c7ca8a1c17e63a22aec94a816c859343"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JMQDIFCC3NZU2WOKKLMI7VJE7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure and properties of large intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii","submitted_at":"2018-10-01T18:56:08Z","abstract_excerpt":"We say that a family of $k$-subsets of an $n$-element set is intersecting if any two of its sets intersect. In this paper we study properties and structure of large intersecting families.\n  We prove a conclusive version of Frankl's theorem on intersecting families with bounded maximal degree. This theorem, along with its generalizations to cross-intersecting families, strengthens the results obtained by Frankl, Frankl and Tokushige, Kupavskii and Zakharov and others.\n  We study the structure of large intersecting families, obtaining some very general structural theorems which extend the result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00920","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-18T00:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52G8/IQFwLk8Kio/7NtWa+8OPv9twir40RezldwXP8VBTIGQRiqKHHc8LYG/mnWyYmyBF5vgCcEcJQaODO34CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:50:23.870059Z"},"content_sha256":"0556f5fd2021ae1ebefb4de3877fb52c7c749faa0fc36f0c947985ebbaa366b8","schema_version":"1.0","event_id":"sha256:0556f5fd2021ae1ebefb4de3877fb52c7c749faa0fc36f0c947985ebbaa366b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMQDIFCC3NZU2WOKKLMI7VJE7X/bundle.json","state_url":"https://pith.science/pith/JMQDIFCC3NZU2WOKKLMI7VJE7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMQDIFCC3NZU2WOKKLMI7VJE7X/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-08-05T19:50:23Z","links":{"resolver":"https://pith.science/pith/JMQDIFCC3NZU2WOKKLMI7VJE7X","bundle":"https://pith.science/pith/JMQDIFCC3NZU2WOKKLMI7VJE7X/bundle.json","state":"https://pith.science/pith/JMQDIFCC3NZU2WOKKLMI7VJE7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMQDIFCC3NZU2WOKKLMI7VJE7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JMQDIFCC3NZU2WOKKLMI7VJE7X","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":"53e04d45c372ef6566f328bcdda85020bfae3f71ae6e060a70cb33eac0aecac0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T18:56:08Z","title_canon_sha256":"44f516d8e79a7cde0c34d34606328b696aa24efcab6e1c856d1af20b65c16689"},"schema_version":"1.0","source":{"id":"1810.00920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00920","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00920v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00920","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"JMQDIFCC3NZU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JMQDIFCC3NZU2WOK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JMQDIFCC","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:0556f5fd2021ae1ebefb4de3877fb52c7c749faa0fc36f0c947985ebbaa366b8","target":"graph","created_at":"2026-05-18T00:04:19Z","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":"We say that a family of $k$-subsets of an $n$-element set is intersecting if any two of its sets intersect. In this paper we study properties and structure of large intersecting families.\n  We prove a conclusive version of Frankl's theorem on intersecting families with bounded maximal degree. This theorem, along with its generalizations to cross-intersecting families, strengthens the results obtained by Frankl, Frankl and Tokushige, Kupavskii and Zakharov and others.\n  We study the structure of large intersecting families, obtaining some very general structural theorems which extend the result","authors_text":"Andrey Kupavskii","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T18:56:08Z","title":"Structure and properties of large intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00920","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:d010c8a53add32c51459434cb337dd66c7ca8a1c17e63a22aec94a816c859343","target":"record","created_at":"2026-05-18T00:04:19Z","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":"53e04d45c372ef6566f328bcdda85020bfae3f71ae6e060a70cb33eac0aecac0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T18:56:08Z","title_canon_sha256":"44f516d8e79a7cde0c34d34606328b696aa24efcab6e1c856d1af20b65c16689"},"schema_version":"1.0","source":{"id":"1810.00920","kind":"arxiv","version":1}},"canonical_sha256":"4b20341442db734d59ca52d88fd524fdc0693e7c868e2cef02fe57d9ae7c3274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b20341442db734d59ca52d88fd524fdc0693e7c868e2cef02fe57d9ae7c3274","first_computed_at":"2026-05-18T00:04:19.626887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:19.626887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dAjaGinngNG3Hta0p6t6pliS5TEUIXPcnOQn7LQ9eUeSzOE3C43mlvcrSByuIIm1LSo0kzT9le1lyHymqhLHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:19.627512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d010c8a53add32c51459434cb337dd66c7ca8a1c17e63a22aec94a816c859343","sha256:0556f5fd2021ae1ebefb4de3877fb52c7c749faa0fc36f0c947985ebbaa366b8"],"state_sha256":"f37ce12823ca897d9333ac91a8dc6cbe213ebcf885b3d34544b9cc3df8f408a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1QFnSeQh1h1uDgH6gOjoUEXxPU2FNVCk54JInOfmElF6RX+EvoGVreIN84EHmQn4UxuKRHDEhnCO3ngv+u8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:50:23.876078Z","bundle_sha256":"1ed39f7303c89a878cff7580e903dbaf3f11e3429988c3716b2ab5ad5dbd0b90"}}