{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QN7TYUWKKELKNFOCEQR3HXVQ64","short_pith_number":"pith:QN7TYUWK","canonical_record":{"source":{"id":"1501.00648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-04T07:45:25Z","cross_cats_sorted":[],"title_canon_sha256":"64fea19130e8f0a0b5d938faf15fcc7136f4c7f8e22dad64563fe51f4390bd9d","abstract_canon_sha256":"ceec5e12c2aaa8c804840b782d038c2ac3fcd98b27894da2821c1f1b69e8259f"},"schema_version":"1.0"},"canonical_sha256":"837f3c52ca5116a695c22423b3deb0f708652319ea68ee0aadc35d56c911514f","source":{"kind":"arxiv","id":"1501.00648","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00648","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00648v2","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00648","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"QN7TYUWKKELK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QN7TYUWKKELKNFOC","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QN7TYUWK","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QN7TYUWKKELKNFOCEQR3HXVQ64","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-04T07:45:25Z","cross_cats_sorted":[],"title_canon_sha256":"64fea19130e8f0a0b5d938faf15fcc7136f4c7f8e22dad64563fe51f4390bd9d","abstract_canon_sha256":"ceec5e12c2aaa8c804840b782d038c2ac3fcd98b27894da2821c1f1b69e8259f"},"schema_version":"1.0"},"canonical_sha256":"837f3c52ca5116a695c22423b3deb0f708652319ea68ee0aadc35d56c911514f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:00.533025Z","signature_b64":"77ZA9Sy4RPzh5xYAuZKHolJk6AWc1djP0E1dBK9JISPklOZmLeAaG/oNn0gxW67yJnS0n7wagEqEbticQwCKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837f3c52ca5116a695c22423b3deb0f708652319ea68ee0aadc35d56c911514f","last_reissued_at":"2026-05-18T02:19:00.532545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:00.532545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00648","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:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1vFBAIEBj1ug4f/nnlH2pQ39lQrwbXp1H2URu/6kBQtjfPUjJWomjUFd63oJ3jmQdNqetLIFpzI+OCC8/dNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:23:02.942254Z"},"content_sha256":"cbfc6dd110a4a5e563f390853293eaf7680a9be5918ac6617acb54c6f6316e1b","schema_version":"1.0","event_id":"sha256:cbfc6dd110a4a5e563f390853293eaf7680a9be5918ac6617acb54c6f6316e1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QN7TYUWKKELKNFOCEQR3HXVQ64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of maximal intersecting k-uniform families and further applications of Tuza's set pair method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2015-01-04T07:45:25Z","abstract_excerpt":"We study the function $M(n,k)$ which denotes the number of maximal $k$-uniform intersecting families $F\\subseteq \\binom{[n]}{k}$. Improving a bound of Balogh at al. on $M(n,k)$, we determine the order of magnitude of $\\log M(n,k)$ by proving that for any fixed $k$, $M(n,k) =n^{\\Theta(\\binom{2k}{k})}$ holds. Our proof is based on Tuza's set pair approach.\n  The main idea is to bound the size of the largest possible point set of a cross-intersecting system. We also introduce and investigate some related functions and parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00648","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:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJjAvA+rXphAyQnaZ9mhUE+cbkiUiynqE3dXR+6VC+89d4z4rGosqvz9XS0iwlsBksvCE5TZJAL39eAWKtgmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:23:02.942620Z"},"content_sha256":"a6de959131fd9550b03030169b53d4a382f7f8bb2dd4b9644482535e32786706","schema_version":"1.0","event_id":"sha256:a6de959131fd9550b03030169b53d4a382f7f8bb2dd4b9644482535e32786706"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/bundle.json","state_url":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/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-05T16:23:02Z","links":{"resolver":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64","bundle":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/bundle.json","state":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QN7TYUWKKELKNFOCEQR3HXVQ64","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":"ceec5e12c2aaa8c804840b782d038c2ac3fcd98b27894da2821c1f1b69e8259f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-04T07:45:25Z","title_canon_sha256":"64fea19130e8f0a0b5d938faf15fcc7136f4c7f8e22dad64563fe51f4390bd9d"},"schema_version":"1.0","source":{"id":"1501.00648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00648","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00648v2","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00648","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"QN7TYUWKKELK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QN7TYUWKKELKNFOC","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QN7TYUWK","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:a6de959131fd9550b03030169b53d4a382f7f8bb2dd4b9644482535e32786706","target":"graph","created_at":"2026-05-18T02:19: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":"We study the function $M(n,k)$ which denotes the number of maximal $k$-uniform intersecting families $F\\subseteq \\binom{[n]}{k}$. Improving a bound of Balogh at al. on $M(n,k)$, we determine the order of magnitude of $\\log M(n,k)$ by proving that for any fixed $k$, $M(n,k) =n^{\\Theta(\\binom{2k}{k})}$ holds. Our proof is based on Tuza's set pair approach.\n  The main idea is to bound the size of the largest possible point set of a cross-intersecting system. We also introduce and investigate some related functions and parameters.","authors_text":"Bal\\'azs Patk\\'os, Zolt\\'an L\\'or\\'ant Nagy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-04T07:45:25Z","title":"On the number of maximal intersecting k-uniform families and further applications of Tuza's set pair method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00648","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:cbfc6dd110a4a5e563f390853293eaf7680a9be5918ac6617acb54c6f6316e1b","target":"record","created_at":"2026-05-18T02:19: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":"ceec5e12c2aaa8c804840b782d038c2ac3fcd98b27894da2821c1f1b69e8259f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-04T07:45:25Z","title_canon_sha256":"64fea19130e8f0a0b5d938faf15fcc7136f4c7f8e22dad64563fe51f4390bd9d"},"schema_version":"1.0","source":{"id":"1501.00648","kind":"arxiv","version":2}},"canonical_sha256":"837f3c52ca5116a695c22423b3deb0f708652319ea68ee0aadc35d56c911514f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"837f3c52ca5116a695c22423b3deb0f708652319ea68ee0aadc35d56c911514f","first_computed_at":"2026-05-18T02:19:00.532545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:00.532545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77ZA9Sy4RPzh5xYAuZKHolJk6AWc1djP0E1dBK9JISPklOZmLeAaG/oNn0gxW67yJnS0n7wagEqEbticQwCKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:00.533025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbfc6dd110a4a5e563f390853293eaf7680a9be5918ac6617acb54c6f6316e1b","sha256:a6de959131fd9550b03030169b53d4a382f7f8bb2dd4b9644482535e32786706"],"state_sha256":"c6642fa0170ba34eded264f0c17b507f07d5a0fd7dff6dcd0fa4d2104433dd7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWf4ww0ns3W02oi1lGVx3RDubpqdYy3Fx66x4Jwpt58WpMzRJA348KuqZoHv07xrqNfRhDWYEX/a1t6hPMd5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:23:02.944675Z","bundle_sha256":"44fdcc48e2c6196d5e51be11ac27a39a4149e90007618e637f5e4a021459d2aa"}}