{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CXWKHVINYSQGXFAEWJHJRBUVKL","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":"aeda23955a48d13968423b138e1d255f00a9bbd4e1226605a93cd6024aa95b9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-16T03:50:00Z","title_canon_sha256":"d236e26004621805806094c87fb2de5808b34d3fd659a5bf562d00fe33154661"},"schema_version":"1.0","source":{"id":"1604.04686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04686","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04686v1","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04686","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"pith_short_12","alias_value":"CXWKHVINYSQG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CXWKHVINYSQGXFAE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CXWKHVIN","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:b98845c2a5a7745d1490083c4d84a4cd55d6f62bef15c15db28d33e759254aa5","target":"graph","created_at":"2026-05-18T01:16:58Z","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":"Let $r(k)$ denote the maximum number of edges in a $k$-uniform intersecting family with covering number $k$. Erd\\H{o}s and Lov\\'asz proved that $ \\lfloor k! (e-1) \\rfloor \\leq r(k) \\leq k^k.$ Frankl, Ota, and Tokushige improved the lower bound to $r(k) \\geq \\left( k/2 \\right)^{k-1}$, and Tuza improved the upper bound to $r(k) \\leq (1-e^{-1}+o(1))k^k$. We establish that $ r(k) \\leq (1 + o(1)) k^{k-1}$.","authors_text":"Andrii Arman, Troy Retter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-16T03:50:00Z","title":"An upper bound for the size of a $k$-uniform intersecting family with covering number $k$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04686","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:4a541b51568a08e46c66ed72e13270204a4e76f3577c5afbfd6f4746ec9b49a8","target":"record","created_at":"2026-05-18T01:16:58Z","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":"aeda23955a48d13968423b138e1d255f00a9bbd4e1226605a93cd6024aa95b9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-16T03:50:00Z","title_canon_sha256":"d236e26004621805806094c87fb2de5808b34d3fd659a5bf562d00fe33154661"},"schema_version":"1.0","source":{"id":"1604.04686","kind":"arxiv","version":1}},"canonical_sha256":"15eca3d50dc4a06b9404b24e98869552fc3785be5df016d4d4aebe7af7351321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15eca3d50dc4a06b9404b24e98869552fc3785be5df016d4d4aebe7af7351321","first_computed_at":"2026-05-18T01:16:58.960245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:58.960245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TtiYSAT+cEg7dQ+vEWcVLjjZpFcC7IrcUVEJruDCGGx8up0gNWd3SLODviJNC8xoNM3bbHzCVps5IPkOfyJJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:58.960952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a541b51568a08e46c66ed72e13270204a4e76f3577c5afbfd6f4746ec9b49a8","sha256:b98845c2a5a7745d1490083c4d84a4cd55d6f62bef15c15db28d33e759254aa5"],"state_sha256":"1f3c5b47dc360a4e9614b3c2b170c5aa5318ae7a16f48f610c514e0c9eeff5f0"}