{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EXHB3GLIQI2CRJCJPV7JOGNEKZ","short_pith_number":"pith:EXHB3GLI","canonical_record":{"source":{"id":"1804.01606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T21:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"4b2f2687e420f1a1ca1ae82417d09de88335138a9385c6c5f04af4b45ec67706","abstract_canon_sha256":"3eac3297835dbc063f6adf6dfd1d8fd3d26b68c4714843332495c6b1a857f0c0"},"schema_version":"1.0"},"canonical_sha256":"25ce1d9968823428a4497d7e9719a4564c5079bf6df20ab702327e0b900e52de","source":{"kind":"arxiv","id":"1804.01606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01606","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01606v1","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01606","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"EXHB3GLIQI2C","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EXHB3GLIQI2CRJCJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EXHB3GLI","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EXHB3GLIQI2CRJCJPV7JOGNEKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T21:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"4b2f2687e420f1a1ca1ae82417d09de88335138a9385c6c5f04af4b45ec67706","abstract_canon_sha256":"3eac3297835dbc063f6adf6dfd1d8fd3d26b68c4714843332495c6b1a857f0c0"},"schema_version":"1.0"},"canonical_sha256":"25ce1d9968823428a4497d7e9719a4564c5079bf6df20ab702327e0b900e52de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:10.728254Z","signature_b64":"+suh2u7q94oVQ3Wxp52h47OX1jpva3sFwJrPI5d8tf/zugGddToPaySb9llCB7+qSc6e2PT/1o1WbALZZnCFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25ce1d9968823428a4497d7e9719a4564c5079bf6df20ab702327e0b900e52de","last_reissued_at":"2026-05-18T00:19:10.727603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:10.727603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01606","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-18T00:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdv3zggw7Umrh+IRcnni4eTXbIPGcbX0owIeaNo26Bhr2PR7PlyuSnFYgiVLPgh7W12+fJw16/kJ+TqmsLgVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:02:59.171350Z"},"content_sha256":"3076266ea2d205c1ca9e57ca91ca219842461f7d15e89dacc2abc858ed366a9e","schema_version":"1.0","event_id":"sha256:3076266ea2d205c1ca9e57ca91ca219842461f7d15e89dacc2abc858ed366a9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EXHB3GLIQI2CRJCJPV7JOGNEKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of containments in $P$-free families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","submitted_at":"2018-04-04T21:06:53Z","abstract_excerpt":"A subfamily $\\{F_1,F_2,\\dots,F_{|P|}\\}\\subseteq \\mathcal F$ is a copy of the poset $P$ if there exists a bijection $i:P\\rightarrow \\{F_1,F_2,\\dots,F_{|P|}\\}$ such that $p\\le_P q$ implies $i(p)\\subseteq i(q)$. A family $\\mathcal F$ is $P$-free, if it does not contain a copy of $P$. In this paper we establish basic results on the maximum possible number of $k$-chains in a $P$-free family $\\mathcal F\\subseteq 2^{[n]}$. We prove that if the height of $P$, $h(P) > k$, then this number is of the order $\\Theta(\\prod_{i=1}^{k+1}\\binom{l_{i-1}}{l_i})$, where $l_0=n$ and $l_1\\ge l_2\\ge \\dots \\ge l_{k+1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01606","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-18T00:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojQ9p3J9maJWU7cotNUK/f0XpXsZeEIR7qjdbt+jatS1mUD83z9qEZmKxZ5fZG3GGEwskH4g4KhxMXsyCYdWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:02:59.171711Z"},"content_sha256":"925e95e74f63129dc5d7942eebb6efcb17615d15f58235757e19bf8c9b44c6f1","schema_version":"1.0","event_id":"sha256:925e95e74f63129dc5d7942eebb6efcb17615d15f58235757e19bf8c9b44c6f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXHB3GLIQI2CRJCJPV7JOGNEKZ/bundle.json","state_url":"https://pith.science/pith/EXHB3GLIQI2CRJCJPV7JOGNEKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXHB3GLIQI2CRJCJPV7JOGNEKZ/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-20T06:02:59Z","links":{"resolver":"https://pith.science/pith/EXHB3GLIQI2CRJCJPV7JOGNEKZ","bundle":"https://pith.science/pith/EXHB3GLIQI2CRJCJPV7JOGNEKZ/bundle.json","state":"https://pith.science/pith/EXHB3GLIQI2CRJCJPV7JOGNEKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXHB3GLIQI2CRJCJPV7JOGNEKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EXHB3GLIQI2CRJCJPV7JOGNEKZ","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":"3eac3297835dbc063f6adf6dfd1d8fd3d26b68c4714843332495c6b1a857f0c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T21:06:53Z","title_canon_sha256":"4b2f2687e420f1a1ca1ae82417d09de88335138a9385c6c5f04af4b45ec67706"},"schema_version":"1.0","source":{"id":"1804.01606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01606","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01606v1","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01606","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"EXHB3GLIQI2C","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EXHB3GLIQI2CRJCJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EXHB3GLI","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:925e95e74f63129dc5d7942eebb6efcb17615d15f58235757e19bf8c9b44c6f1","target":"graph","created_at":"2026-05-18T00:19:10Z","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":"A subfamily $\\{F_1,F_2,\\dots,F_{|P|}\\}\\subseteq \\mathcal F$ is a copy of the poset $P$ if there exists a bijection $i:P\\rightarrow \\{F_1,F_2,\\dots,F_{|P|}\\}$ such that $p\\le_P q$ implies $i(p)\\subseteq i(q)$. A family $\\mathcal F$ is $P$-free, if it does not contain a copy of $P$. In this paper we establish basic results on the maximum possible number of $k$-chains in a $P$-free family $\\mathcal F\\subseteq 2^{[n]}$. We prove that if the height of $P$, $h(P) > k$, then this number is of the order $\\Theta(\\prod_{i=1}^{k+1}\\binom{l_{i-1}}{l_i})$, where $l_0=n$ and $l_1\\ge l_2\\ge \\dots \\ge l_{k+1}","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T21:06:53Z","title":"On the number of containments in $P$-free families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01606","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:3076266ea2d205c1ca9e57ca91ca219842461f7d15e89dacc2abc858ed366a9e","target":"record","created_at":"2026-05-18T00:19:10Z","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":"3eac3297835dbc063f6adf6dfd1d8fd3d26b68c4714843332495c6b1a857f0c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T21:06:53Z","title_canon_sha256":"4b2f2687e420f1a1ca1ae82417d09de88335138a9385c6c5f04af4b45ec67706"},"schema_version":"1.0","source":{"id":"1804.01606","kind":"arxiv","version":1}},"canonical_sha256":"25ce1d9968823428a4497d7e9719a4564c5079bf6df20ab702327e0b900e52de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25ce1d9968823428a4497d7e9719a4564c5079bf6df20ab702327e0b900e52de","first_computed_at":"2026-05-18T00:19:10.727603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:10.727603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+suh2u7q94oVQ3Wxp52h47OX1jpva3sFwJrPI5d8tf/zugGddToPaySb9llCB7+qSc6e2PT/1o1WbALZZnCFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:10.728254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3076266ea2d205c1ca9e57ca91ca219842461f7d15e89dacc2abc858ed366a9e","sha256:925e95e74f63129dc5d7942eebb6efcb17615d15f58235757e19bf8c9b44c6f1"],"state_sha256":"8eefcac38f8ba6870dd233220d3e5cb15bc5c84701ff38684739ff144c98e19e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GJGlLfVBXPxh9W97YZPPtzmjGZ4bwr1ZzD8Pm64cjg5C78kYdf+/dsilnrfpPLDc8oy4D7KMtdAkEDuA2Q6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:02:59.173659Z","bundle_sha256":"33af122c02c663a62471af7774cc0c49cd3716000701b37315a9e06d3b7dc588"}}