{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SL5SPXS5A3WBXSWQ3VOULFOPHI","short_pith_number":"pith:SL5SPXS5","canonical_record":{"source":{"id":"1701.05030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T12:21:07Z","cross_cats_sorted":[],"title_canon_sha256":"e846d3054c428c3af749a4f5a8faa1bbf916f9e2c9732176c9fe87512dc2f986","abstract_canon_sha256":"d0244e4dff657ef966475619bf914d9d2cd8dd9126ccf9f142fc627490befd31"},"schema_version":"1.0"},"canonical_sha256":"92fb27de5d06ec1bcad0dd5d4595cf3a0ee9f12d2cdee29ce28af596eea1c081","source":{"kind":"arxiv","id":"1701.05030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05030","created_at":"2026-05-18T00:38:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05030v2","created_at":"2026-05-18T00:38:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05030","created_at":"2026-05-18T00:38:30Z"},{"alias_kind":"pith_short_12","alias_value":"SL5SPXS5A3WB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SL5SPXS5A3WBXSWQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SL5SPXS5","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SL5SPXS5A3WBXSWQ3VOULFOPHI","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T12:21:07Z","cross_cats_sorted":[],"title_canon_sha256":"e846d3054c428c3af749a4f5a8faa1bbf916f9e2c9732176c9fe87512dc2f986","abstract_canon_sha256":"d0244e4dff657ef966475619bf914d9d2cd8dd9126ccf9f142fc627490befd31"},"schema_version":"1.0"},"canonical_sha256":"92fb27de5d06ec1bcad0dd5d4595cf3a0ee9f12d2cdee29ce28af596eea1c081","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:30.502452Z","signature_b64":"ile3gfNpf1mjgEVpPtdJ71lUJTRcC74yN6hDrlWwpBt3sjCI0LNjmEBnTkaTLyxmDleTTs4z4rX5B5crC/CDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92fb27de5d06ec1bcad0dd5d4595cf3a0ee9f12d2cdee29ce28af596eea1c081","last_reissued_at":"2026-05-18T00:38:30.501593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:30.501593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05030","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-18T00:38:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxtsmJPHBoa4BmG+aIMCgHXeltr9qahqH02uclDLj0bZpKOl91shjbrnrK/XvJSgJ9NQLHlh3A74uZkknpZhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:46:46.770070Z"},"content_sha256":"5de4d4a7cf561385f7c0641b11b05b867cfe478c5c647b0d5ef932b2605579fe","schema_version":"1.0","event_id":"sha256:5de4d4a7cf561385f7c0641b11b05b867cfe478c5c647b0d5ef932b2605579fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SL5SPXS5A3WBXSWQ3VOULFOPHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized forbidden subposet problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Balazs Keszegh, Balazs Patkos, Daniel Gerbner","submitted_at":"2017-01-18T12:21:07Z","abstract_excerpt":"A subfamily $\\{F_1,F_2,\\dots,F_{|P|}\\}\\subseteq {\\cal F}$ of sets is a copy of a poset $P$ in ${\\cal F}$ if there exists a bijection $\\phi:P\\rightarrow \\{F_1,F_2,\\dots,F_{|P|}\\}$ such that whenever $x \\le_P x'$ holds, then so does $\\phi(x)\\subseteq \\phi(x')$. For a family ${\\cal F}$ of sets, let $c(P,{\\cal F})$ denote the number of copies of $P$ in ${\\cal F}$, and we say that ${\\cal F}$ is $P$-free if $c(P,{\\cal F})=0$ holds. For any two posets $P,Q$ let us denote by $La(n,P,Q)$ the maximum number of copies of $Q$ over all $P$-free families ${\\cal F} \\subseteq 2^{[n]}$, i.e. $\\max\\{c(Q,{\\cal F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05030","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-18T00:38:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBrkeO/7ikgDyEWgu4mePVedXPAerYAkDn/+7VhjjWA1yuS0LiwW7I4Ar83KtS7LRmRZBQU9nKEdLTs0/hjTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:46:46.770425Z"},"content_sha256":"a4adb7cfd7fdfee27447f5b0c59ce5541b6cb3ca1c90768049e451fa814acc6d","schema_version":"1.0","event_id":"sha256:a4adb7cfd7fdfee27447f5b0c59ce5541b6cb3ca1c90768049e451fa814acc6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SL5SPXS5A3WBXSWQ3VOULFOPHI/bundle.json","state_url":"https://pith.science/pith/SL5SPXS5A3WBXSWQ3VOULFOPHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SL5SPXS5A3WBXSWQ3VOULFOPHI/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-01T06:46:46Z","links":{"resolver":"https://pith.science/pith/SL5SPXS5A3WBXSWQ3VOULFOPHI","bundle":"https://pith.science/pith/SL5SPXS5A3WBXSWQ3VOULFOPHI/bundle.json","state":"https://pith.science/pith/SL5SPXS5A3WBXSWQ3VOULFOPHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SL5SPXS5A3WBXSWQ3VOULFOPHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SL5SPXS5A3WBXSWQ3VOULFOPHI","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":"d0244e4dff657ef966475619bf914d9d2cd8dd9126ccf9f142fc627490befd31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T12:21:07Z","title_canon_sha256":"e846d3054c428c3af749a4f5a8faa1bbf916f9e2c9732176c9fe87512dc2f986"},"schema_version":"1.0","source":{"id":"1701.05030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05030","created_at":"2026-05-18T00:38:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05030v2","created_at":"2026-05-18T00:38:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05030","created_at":"2026-05-18T00:38:30Z"},{"alias_kind":"pith_short_12","alias_value":"SL5SPXS5A3WB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SL5SPXS5A3WBXSWQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SL5SPXS5","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:a4adb7cfd7fdfee27447f5b0c59ce5541b6cb3ca1c90768049e451fa814acc6d","target":"graph","created_at":"2026-05-18T00:38:30Z","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 {\\cal F}$ of sets is a copy of a poset $P$ in ${\\cal F}$ if there exists a bijection $\\phi:P\\rightarrow \\{F_1,F_2,\\dots,F_{|P|}\\}$ such that whenever $x \\le_P x'$ holds, then so does $\\phi(x)\\subseteq \\phi(x')$. For a family ${\\cal F}$ of sets, let $c(P,{\\cal F})$ denote the number of copies of $P$ in ${\\cal F}$, and we say that ${\\cal F}$ is $P$-free if $c(P,{\\cal F})=0$ holds. For any two posets $P,Q$ let us denote by $La(n,P,Q)$ the maximum number of copies of $Q$ over all $P$-free families ${\\cal F} \\subseteq 2^{[n]}$, i.e. $\\max\\{c(Q,{\\cal F","authors_text":"Balazs Keszegh, Balazs Patkos, Daniel Gerbner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T12:21:07Z","title":"Generalized forbidden subposet problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05030","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:5de4d4a7cf561385f7c0641b11b05b867cfe478c5c647b0d5ef932b2605579fe","target":"record","created_at":"2026-05-18T00:38:30Z","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":"d0244e4dff657ef966475619bf914d9d2cd8dd9126ccf9f142fc627490befd31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T12:21:07Z","title_canon_sha256":"e846d3054c428c3af749a4f5a8faa1bbf916f9e2c9732176c9fe87512dc2f986"},"schema_version":"1.0","source":{"id":"1701.05030","kind":"arxiv","version":2}},"canonical_sha256":"92fb27de5d06ec1bcad0dd5d4595cf3a0ee9f12d2cdee29ce28af596eea1c081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92fb27de5d06ec1bcad0dd5d4595cf3a0ee9f12d2cdee29ce28af596eea1c081","first_computed_at":"2026-05-18T00:38:30.501593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:30.501593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ile3gfNpf1mjgEVpPtdJ71lUJTRcC74yN6hDrlWwpBt3sjCI0LNjmEBnTkaTLyxmDleTTs4z4rX5B5crC/CDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:30.502452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5de4d4a7cf561385f7c0641b11b05b867cfe478c5c647b0d5ef932b2605579fe","sha256:a4adb7cfd7fdfee27447f5b0c59ce5541b6cb3ca1c90768049e451fa814acc6d"],"state_sha256":"3ede1fcfa8b01d420613321f7842256c32cb6ebcb5dcdbefce8de4650e0df708"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hf0/DlJ+yRq2XcO4OX9Jkt08mnUqgaAOxnp5X9EhAApTFwwZsKV+tHZeXFO++Bn1yXrOfilUVFBJ0Pqne7OjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:46:46.772342Z","bundle_sha256":"b20dd5396d3d9ec8d5c44218bad14d660c76dbfc302125b595a0d47d431adf85"}}