{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IOIVLBPBOAZZEK6ZOYIITLOEXF","short_pith_number":"pith:IOIVLBPB","canonical_record":{"source":{"id":"1408.5783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T14:56:01Z","cross_cats_sorted":[],"title_canon_sha256":"d2099af480781bfe9733116264a21a8b0a9a6bd30e737f2bd4a9c6012452f5ff","abstract_canon_sha256":"877221bd603a318f425b92e873ed9b2c2573bed617a5825592f35b946c017da2"},"schema_version":"1.0"},"canonical_sha256":"43915585e17033922bd9761089adc4b961229c3629713dd8a296587d77ea884f","source":{"kind":"arxiv","id":"1408.5783","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5783","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5783v2","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5783","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"IOIVLBPBOAZZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IOIVLBPBOAZZEK6Z","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IOIVLBPB","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IOIVLBPBOAZZEK6ZOYIITLOEXF","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T14:56:01Z","cross_cats_sorted":[],"title_canon_sha256":"d2099af480781bfe9733116264a21a8b0a9a6bd30e737f2bd4a9c6012452f5ff","abstract_canon_sha256":"877221bd603a318f425b92e873ed9b2c2573bed617a5825592f35b946c017da2"},"schema_version":"1.0"},"canonical_sha256":"43915585e17033922bd9761089adc4b961229c3629713dd8a296587d77ea884f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:18.564991Z","signature_b64":"OVL5vUNCX8LeMkwblVRTjrOzSPlKoP52MgKJC/2WAMrU9DAAfrfKm3ZD6HVldzQqa0DCPsAKlVrFd/S7ZHi7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43915585e17033922bd9761089adc4b961229c3629713dd8a296587d77ea884f","last_reissued_at":"2026-05-18T01:18:18.564299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:18.564299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5783","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-18T01:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0W0xGuq3hqYkTIKT6Mj19NEBvR031nlnYxY7sqXhzbIrfnb4nwPt80PCPdusyX3+xgKcv9Np4RqiHIJFNS8jDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:37:39.006300Z"},"content_sha256":"4b2851182b138baffcd98057bd3ce731556a84a9fdd7daf3d536588acb21933f","schema_version":"1.0","event_id":"sha256:4b2851182b138baffcd98057bd3ce731556a84a9fdd7daf3d536588acb21933f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IOIVLBPBOAZZEK6ZOYIITLOEXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improvement of the general bound on the largest family of subsets avoiding a subposet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","submitted_at":"2014-08-25T14:56:01Z","abstract_excerpt":"Let $La(n,P)$ be the maximum size of a family of subsets of $[n]= \\{1,2, ..., n \\}$ not containing $P$ as a (weak) subposet, and let $h(P)$ be the length of a longest chain in $P$. The best known upper bound for $La(n,P)$ in terms of $|P|$ and $h(P)$ is due to Chen and Li, who showed that $La(n,P) \\le \\frac{1}{m+1} \\left(|P| + \\frac{1}{2}(m^2 +3m-2)(h(P)-1) -1 \\right) {\\binom {n} {\\lfloor n/2 \\rfloor}}$ for any fixed $m \\ge 1$.\n  In this paper we show that $La(n,P) \\le \\frac{1}{2^{k-1}} (|P| + (3k-5)2^{k-2}(h(P)-1) - 1 ) {n \\choose {\\lfloor n/2\\rfloor} }$ for any fixed $k \\ge 2$, improving the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5783","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-18T01:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9inU4BDGuzRIvQsVfzlCukVm1mHbgrDqzzb/Y0QffxX98HaQ1HMgiuG2GnbMafpVOkgxlSyrqoNI8QDQHciCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:37:39.006978Z"},"content_sha256":"800ef88e67375bfa577effbfbfc3742f1d06d2d316ec63de8cdb3d92058e73b2","schema_version":"1.0","event_id":"sha256:800ef88e67375bfa577effbfbfc3742f1d06d2d316ec63de8cdb3d92058e73b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOIVLBPBOAZZEK6ZOYIITLOEXF/bundle.json","state_url":"https://pith.science/pith/IOIVLBPBOAZZEK6ZOYIITLOEXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOIVLBPBOAZZEK6ZOYIITLOEXF/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-05-27T14:37:39Z","links":{"resolver":"https://pith.science/pith/IOIVLBPBOAZZEK6ZOYIITLOEXF","bundle":"https://pith.science/pith/IOIVLBPBOAZZEK6ZOYIITLOEXF/bundle.json","state":"https://pith.science/pith/IOIVLBPBOAZZEK6ZOYIITLOEXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOIVLBPBOAZZEK6ZOYIITLOEXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IOIVLBPBOAZZEK6ZOYIITLOEXF","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":"877221bd603a318f425b92e873ed9b2c2573bed617a5825592f35b946c017da2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T14:56:01Z","title_canon_sha256":"d2099af480781bfe9733116264a21a8b0a9a6bd30e737f2bd4a9c6012452f5ff"},"schema_version":"1.0","source":{"id":"1408.5783","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5783","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5783v2","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5783","created_at":"2026-05-18T01:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"IOIVLBPBOAZZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IOIVLBPBOAZZEK6Z","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IOIVLBPB","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:800ef88e67375bfa577effbfbfc3742f1d06d2d316ec63de8cdb3d92058e73b2","target":"graph","created_at":"2026-05-18T01:18:18Z","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 $La(n,P)$ be the maximum size of a family of subsets of $[n]= \\{1,2, ..., n \\}$ not containing $P$ as a (weak) subposet, and let $h(P)$ be the length of a longest chain in $P$. The best known upper bound for $La(n,P)$ in terms of $|P|$ and $h(P)$ is due to Chen and Li, who showed that $La(n,P) \\le \\frac{1}{m+1} \\left(|P| + \\frac{1}{2}(m^2 +3m-2)(h(P)-1) -1 \\right) {\\binom {n} {\\lfloor n/2 \\rfloor}}$ for any fixed $m \\ge 1$.\n  In this paper we show that $La(n,P) \\le \\frac{1}{2^{k-1}} (|P| + (3k-5)2^{k-2}(h(P)-1) - 1 ) {n \\choose {\\lfloor n/2\\rfloor} }$ for any fixed $k \\ge 2$, improving the","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Gr\\'osz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T14:56:01Z","title":"An improvement of the general bound on the largest family of subsets avoiding a subposet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5783","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:4b2851182b138baffcd98057bd3ce731556a84a9fdd7daf3d536588acb21933f","target":"record","created_at":"2026-05-18T01:18:18Z","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":"877221bd603a318f425b92e873ed9b2c2573bed617a5825592f35b946c017da2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T14:56:01Z","title_canon_sha256":"d2099af480781bfe9733116264a21a8b0a9a6bd30e737f2bd4a9c6012452f5ff"},"schema_version":"1.0","source":{"id":"1408.5783","kind":"arxiv","version":2}},"canonical_sha256":"43915585e17033922bd9761089adc4b961229c3629713dd8a296587d77ea884f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43915585e17033922bd9761089adc4b961229c3629713dd8a296587d77ea884f","first_computed_at":"2026-05-18T01:18:18.564299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:18.564299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OVL5vUNCX8LeMkwblVRTjrOzSPlKoP52MgKJC/2WAMrU9DAAfrfKm3ZD6HVldzQqa0DCPsAKlVrFd/S7ZHi7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:18.564991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5783","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b2851182b138baffcd98057bd3ce731556a84a9fdd7daf3d536588acb21933f","sha256:800ef88e67375bfa577effbfbfc3742f1d06d2d316ec63de8cdb3d92058e73b2"],"state_sha256":"6488060ece4738fe6db4d838e94d573bf821e2d05a7bf7b01fdf879a90097a07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgA9wUYBl0dsb4riKWkzgfdYBnrxOd69t0HM/JnYi7LEnpQmR7reEm0qp9N6m2NeGYbaHCNVzQ4PhmXc+fqaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:37:39.010408Z","bundle_sha256":"9483a41fc7e22c26bd3d08d47f146c920d896434530cfa2faf2b63fc7548139d"}}