{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:63AJVBAPHTJ65W3WFO62KFLP5Q","short_pith_number":"pith:63AJVBAP","schema_version":"1.0","canonical_sha256":"f6c09a840f3cd3eedb762bbda5156fec2ae9f4a6010728f2b05f5cc9ffa948ae","source":{"kind":"arxiv","id":"1402.7158","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of points in a maximal intersecting family of finite sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaushik Majumder","submitted_at":"2014-02-28T08:00:16Z","abstract_excerpt":"Paul Erd\\H{o}s and L\\'{a}szl\\'{o} Lov\\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the problem of determining or estimating the largest number $N(k)$ of the points in such a family. They also proved by means of an example that $N(k)\\geq2k-2+\\frac{1}{2}\\binom{2k-2}{k-1}$. Much later, Zsolt Tuza proved that the bound is best possible up to a multiplicative constant by showing that asymptotically $N(k)$ is at most $4$ times this lower bound. In t"},"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":"1402.7158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-28T08:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"0a416364b94294999923427e5ee252c5d870d20828de24e774d10b2415d7122b","abstract_canon_sha256":"97ee6f84099588becda9866beeaf21cfd50e77b9b9860d793266c61fda3147b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:34.824646Z","signature_b64":"4LjXO2jqlBst4EkcUmoQtKpkZuvgKgOgAXGOOcXvNsaZCmpIkSIRYzwq94vkyZ5N8egayEUrkoknLNnahy4tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c09a840f3cd3eedb762bbda5156fec2ae9f4a6010728f2b05f5cc9ffa948ae","last_reissued_at":"2026-05-18T02:57:34.823936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:34.823936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of points in a maximal intersecting family of finite sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaushik Majumder","submitted_at":"2014-02-28T08:00:16Z","abstract_excerpt":"Paul Erd\\H{o}s and L\\'{a}szl\\'{o} Lov\\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the problem of determining or estimating the largest number $N(k)$ of the points in such a family. They also proved by means of an example that $N(k)\\geq2k-2+\\frac{1}{2}\\binom{2k-2}{k-1}$. Much later, Zsolt Tuza proved that the bound is best possible up to a multiplicative constant by showing that asymptotically $N(k)$ is at most $4$ times this lower bound. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7158","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.7158","created_at":"2026-05-18T02:57:34.824040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7158v1","created_at":"2026-05-18T02:57:34.824040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7158","created_at":"2026-05-18T02:57:34.824040+00:00"},{"alias_kind":"pith_short_12","alias_value":"63AJVBAPHTJ6","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"63AJVBAPHTJ65W3W","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"63AJVBAP","created_at":"2026-05-18T12:28:16.859392+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/63AJVBAPHTJ65W3WFO62KFLP5Q","json":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q.json","graph_json":"https://pith.science/api/pith-number/63AJVBAPHTJ65W3WFO62KFLP5Q/graph.json","events_json":"https://pith.science/api/pith-number/63AJVBAPHTJ65W3WFO62KFLP5Q/events.json","paper":"https://pith.science/paper/63AJVBAP"},"agent_actions":{"view_html":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q","download_json":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q.json","view_paper":"https://pith.science/paper/63AJVBAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7158&json=true","fetch_graph":"https://pith.science/api/pith-number/63AJVBAPHTJ65W3WFO62KFLP5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/63AJVBAPHTJ65W3WFO62KFLP5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/action/storage_attestation","attest_author":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/action/author_attestation","sign_citation":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/action/citation_signature","submit_replication":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/action/replication_record"}},"created_at":"2026-05-18T02:57:34.824040+00:00","updated_at":"2026-05-18T02:57:34.824040+00:00"}