{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:63AJVBAPHTJ65W3WFO62KFLP5Q","short_pith_number":"pith:63AJVBAP","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"},"canonical_sha256":"f6c09a840f3cd3eedb762bbda5156fec2ae9f4a6010728f2b05f5cc9ffa948ae","source":{"kind":"arxiv","id":"1402.7158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7158","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7158v1","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7158","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"pith_short_12","alias_value":"63AJVBAPHTJ6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"63AJVBAPHTJ65W3W","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"63AJVBAP","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:63AJVBAPHTJ65W3WFO62KFLP5Q","target":"record","payload":{"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"},"canonical_sha256":"f6c09a840f3cd3eedb762bbda5156fec2ae9f4a6010728f2b05f5cc9ffa948ae","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"},"source_kind":"arxiv","source_id":"1402.7158","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-18T02:57:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAXYmLY1UzlEhNI5qrt1sjCDFBGPuUEFKE7+zxkGXZ4NzPnISHgDwRIVa7akDv4yS43q0qVW02nX6sU15frDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:40:54.413776Z"},"content_sha256":"ecfe122be2aca8f1ca5d4df180f85bc7893a5afe6429887fe5e431a15b692855","schema_version":"1.0","event_id":"sha256:ecfe122be2aca8f1ca5d4df180f85bc7893a5afe6429887fe5e431a15b692855"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:63AJVBAPHTJ65W3WFO62KFLP5Q","target":"graph","payload":{"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"},"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:57:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y34s3RIMUQvjFxWmJBm/IkzVtbN88EGchg99V7rHy6/J7HIeYfbrs92ptOyIoUO8H2uqrgCtfJrRbFWSjodxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:40:54.414116Z"},"content_sha256":"ae0b942e66e08076db53b4a3c92574eaf4eefddf3ee2a34db5f9de3a2e0c746d","schema_version":"1.0","event_id":"sha256:ae0b942e66e08076db53b4a3c92574eaf4eefddf3ee2a34db5f9de3a2e0c746d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/bundle.json","state_url":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/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-24T04:40:54Z","links":{"resolver":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q","bundle":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/bundle.json","state":"https://pith.science/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63AJVBAPHTJ65W3WFO62KFLP5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:63AJVBAPHTJ65W3WFO62KFLP5Q","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":"97ee6f84099588becda9866beeaf21cfd50e77b9b9860d793266c61fda3147b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-28T08:00:16Z","title_canon_sha256":"0a416364b94294999923427e5ee252c5d870d20828de24e774d10b2415d7122b"},"schema_version":"1.0","source":{"id":"1402.7158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7158","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7158v1","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7158","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"pith_short_12","alias_value":"63AJVBAPHTJ6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"63AJVBAPHTJ65W3W","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"63AJVBAP","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:ae0b942e66e08076db53b4a3c92574eaf4eefddf3ee2a34db5f9de3a2e0c746d","target":"graph","created_at":"2026-05-18T02:57:34Z","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":"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","authors_text":"Kaushik Majumder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-28T08:00:16Z","title":"On the maximum number of points in a maximal intersecting family of finite sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7158","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:ecfe122be2aca8f1ca5d4df180f85bc7893a5afe6429887fe5e431a15b692855","target":"record","created_at":"2026-05-18T02:57:34Z","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":"97ee6f84099588becda9866beeaf21cfd50e77b9b9860d793266c61fda3147b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-28T08:00:16Z","title_canon_sha256":"0a416364b94294999923427e5ee252c5d870d20828de24e774d10b2415d7122b"},"schema_version":"1.0","source":{"id":"1402.7158","kind":"arxiv","version":1}},"canonical_sha256":"f6c09a840f3cd3eedb762bbda5156fec2ae9f4a6010728f2b05f5cc9ffa948ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6c09a840f3cd3eedb762bbda5156fec2ae9f4a6010728f2b05f5cc9ffa948ae","first_computed_at":"2026-05-18T02:57:34.823936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:34.823936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4LjXO2jqlBst4EkcUmoQtKpkZuvgKgOgAXGOOcXvNsaZCmpIkSIRYzwq94vkyZ5N8egayEUrkoknLNnahy4tAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:34.824646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.7158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecfe122be2aca8f1ca5d4df180f85bc7893a5afe6429887fe5e431a15b692855","sha256:ae0b942e66e08076db53b4a3c92574eaf4eefddf3ee2a34db5f9de3a2e0c746d"],"state_sha256":"0e3a67b91038aa7e8edbd3d937bc0e10463730abc9380d1a5e53fe845d0aa3ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8aTiC3MYxa/ytA9/pfivPJb2x3ZCjScjxAaOvX1wz+KRoyZR4wC1Wk1Q8n4q3tf2cYcaA3U8/pGFMZ0ZEavLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:40:54.416007Z","bundle_sha256":"3d17018eb7468f16ff2b95257efda1540f004850310bcdb22ee76250502db83f"}}