{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QN7TYUWKKELKNFOCEQR3HXVQ64","short_pith_number":"pith:QN7TYUWK","schema_version":"1.0","canonical_sha256":"837f3c52ca5116a695c22423b3deb0f708652319ea68ee0aadc35d56c911514f","source":{"kind":"arxiv","id":"1501.00648","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00648","created_at":"2026-05-18T02:19:00.532621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00648v2","created_at":"2026-05-18T02:19:00.532621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00648","created_at":"2026-05-18T02:19:00.532621+00:00"},{"alias_kind":"pith_short_12","alias_value":"QN7TYUWKKELK","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QN7TYUWKKELKNFOC","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QN7TYUWK","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64","json":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64.json","graph_json":"https://pith.science/api/pith-number/QN7TYUWKKELKNFOCEQR3HXVQ64/graph.json","events_json":"https://pith.science/api/pith-number/QN7TYUWKKELKNFOCEQR3HXVQ64/events.json","paper":"https://pith.science/paper/QN7TYUWK"},"agent_actions":{"view_html":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64","download_json":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64.json","view_paper":"https://pith.science/paper/QN7TYUWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00648&json=true","fetch_graph":"https://pith.science/api/pith-number/QN7TYUWKKELKNFOCEQR3HXVQ64/graph.json","fetch_events":"https://pith.science/api/pith-number/QN7TYUWKKELKNFOCEQR3HXVQ64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/action/storage_attestation","attest_author":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/action/author_attestation","sign_citation":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/action/citation_signature","submit_replication":"https://pith.science/pith/QN7TYUWKKELKNFOCEQR3HXVQ64/action/replication_record"}},"created_at":"2026-05-18T02:19:00.532621+00:00","updated_at":"2026-05-18T02:19:00.532621+00:00"}