{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OPRBCCD6PN25UG6BEDL4UF4GUY","short_pith_number":"pith:OPRBCCD6","canonical_record":{"source":{"id":"2605.14547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T08:26:12Z","cross_cats_sorted":[],"title_canon_sha256":"b95fc928dbfc9b66a204f1783cb8b9209853c2ec59f48a2a2538ea69108d68bd","abstract_canon_sha256":"4320d4d7aec82772077299adf131750d9fa0f1fe8a14b5e99eb20d2bd8952c03"},"schema_version":"1.0"},"canonical_sha256":"73e211087e7b75da1bc120d7ca1786a610dae3ab7eb66269a375f98e21b6438d","source":{"kind":"arxiv","id":"2605.14547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14547","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14547v1","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14547","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"OPRBCCD6PN25","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OPRBCCD6PN25UG6B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OPRBCCD6","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OPRBCCD6PN25UG6BEDL4UF4GUY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T08:26:12Z","cross_cats_sorted":[],"title_canon_sha256":"b95fc928dbfc9b66a204f1783cb8b9209853c2ec59f48a2a2538ea69108d68bd","abstract_canon_sha256":"4320d4d7aec82772077299adf131750d9fa0f1fe8a14b5e99eb20d2bd8952c03"},"schema_version":"1.0"},"canonical_sha256":"73e211087e7b75da1bc120d7ca1786a610dae3ab7eb66269a375f98e21b6438d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:05.751865Z","signature_b64":"xHZDgj59KnMdsCupiSdGrtqOm1YYKgWUR3Foc6gGkpSVo3FJ3BNf3tOnMChvVUU4yiuCd197iatKcD5i1pKmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e211087e7b75da1bc120d7ca1786a610dae3ab7eb66269a375f98e21b6438d","last_reissued_at":"2026-05-17T23:39:05.751126Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:05.751126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14547","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-17T23:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Os6FOXxO4FGBDT52h0tqjIfgAM6qeusgTklodBcGtqX86c/GbSBRi9tjM3jfZ5QtRlteaotZJO/Q2qCRCXWKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:07:22.740148Z"},"content_sha256":"ae10fe110a9caa9d303106d77a6a58870523e9fad77406ffca865552b485def9","schema_version":"1.0","event_id":"sha256:ae10fe110a9caa9d303106d77a6a58870523e9fad77406ffca865552b485def9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OPRBCCD6PN25UG6BEDL4UF4GUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A non-hereditary Pollyanna class that is not strongly Pollyanna","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A non-hereditary graph class exists that is Pollyanna but fails to be strongly Pollyanna for every k.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongzhang Chen, Kaiyang Lan","submitted_at":"2026-05-14T08:26:12Z","abstract_excerpt":"Chudnovsky, Cook, Davies, and Oum introduced the notion of Pollyanna graph classes: a class $\\mathcal{C}$ is Pollyanna if for every $\\chi$-bounded class $\\mathcal{F}$, the intersection $\\mathcal{C} \\cap \\mathcal{F}$ is polynomially $\\chi$-bounded. They further defined $\\mathcal{C}$ to be strongly Pollyanna if it is $k$-strongly Pollyanna for some integer $k$, meaning that $\\mathcal{C} \\cap \\mathcal{F}$ is polynomially $\\chi$-bounded for every $k$-good class $\\mathcal{F}$. They asked whether there are Pollyanna graph classes that are not strongly Pollyanna. In this note we answer this question "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We construct a class C that is Pollyanna but, for every k ≥ 1, is not k-strongly Pollyanna; in particular C is not strongly Pollyanna.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Graph classes are not required to be hereditary, allowing the construction of a non-hereditary class C that separates the Pollyanna and strongly Pollyanna properties.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A non-hereditary graph class exists that is Pollyanna but not strongly Pollyanna.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A non-hereditary graph class exists that is Pollyanna but fails to be strongly Pollyanna for every k.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"be1069629c657579fa8a33693914e1876a759f121d11a05ef92a37b54e0e6f9d"},"source":{"id":"2605.14547","kind":"arxiv","version":1},"verdict":{"id":"288cd3e9-a257-468d-bed2-05a56aaed374","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:23:29.888026Z","strongest_claim":"We construct a class C that is Pollyanna but, for every k ≥ 1, is not k-strongly Pollyanna; in particular C is not strongly Pollyanna.","one_line_summary":"A non-hereditary graph class exists that is Pollyanna but not strongly Pollyanna.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Graph classes are not required to be hereditary, allowing the construction of a non-hereditary class C that separates the Pollyanna and strongly Pollyanna properties.","pith_extraction_headline":"A non-hereditary graph class exists that is Pollyanna but fails to be strongly Pollyanna for every k."},"references":{"count":7,"sample":[{"doi":"","year":2024,"title":"M. Bria´ nski, J. Davies and B. Walczak, Separating polynomialχ-boundedness fromχ- boundedness,Combinatorica44(2024), 1–8","work_id":"0c738cc1-1933-43f0-bd4f-c329505f5503","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"M. Chudnovsky, L. Cook, J. Davies and S. Oum, Reunitingχ-boundedness with polynomial χ-boundedness,J. Combin. Theory Ser. B176(2026), 30–73. 6","work_id":"33eb6729-c40d-447a-8eb0-708ccee5d046","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Esperet, Graph colorings, flows and perfect matchings, Habilitation Thesis, Universit´ e Grenoble Alpes, 2017","work_id":"a13d5e44-c462-41c3-a4c6-a1090a8373d0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1973,"title":"Gy´ arfas, On Ramsey covering-numbers, in:Infinite and Finite Sets (Colloq., Keszthely, 1973; Dedicated to P","work_id":"34cdf834-856f-48f9-9f1d-7b9f8dcac34c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1959,"title":"Erd˝ os, Graph theory and probability,Canad","work_id":"f15e8ca4-0a0f-400a-bc62-66d9d4925b2a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":7,"snapshot_sha256":"f77cd6ff95b98e7f4c7aee9e739aa7b62588e5736e97b1f2c74dedfa20c7ab21","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e614044c597dac5eebe73693da8fa38730294ecfa0d427d9d25948a134822316"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"288cd3e9-a257-468d-bed2-05a56aaed374"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pqrWkJnHBaHbTBvAh8s+CP796WSl1JtTqAsYq2/R3pljH284LQsFPwGr4mntg7gaxs+ZjshfTrmQrc4yeAZbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:07:22.741149Z"},"content_sha256":"c5d33c81c0531e40e32e1b5401d18d5c37a374c001301218b4b45a87f8db8227","schema_version":"1.0","event_id":"sha256:c5d33c81c0531e40e32e1b5401d18d5c37a374c001301218b4b45a87f8db8227"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPRBCCD6PN25UG6BEDL4UF4GUY/bundle.json","state_url":"https://pith.science/pith/OPRBCCD6PN25UG6BEDL4UF4GUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPRBCCD6PN25UG6BEDL4UF4GUY/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-22T05:07:22Z","links":{"resolver":"https://pith.science/pith/OPRBCCD6PN25UG6BEDL4UF4GUY","bundle":"https://pith.science/pith/OPRBCCD6PN25UG6BEDL4UF4GUY/bundle.json","state":"https://pith.science/pith/OPRBCCD6PN25UG6BEDL4UF4GUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPRBCCD6PN25UG6BEDL4UF4GUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OPRBCCD6PN25UG6BEDL4UF4GUY","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":"4320d4d7aec82772077299adf131750d9fa0f1fe8a14b5e99eb20d2bd8952c03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T08:26:12Z","title_canon_sha256":"b95fc928dbfc9b66a204f1783cb8b9209853c2ec59f48a2a2538ea69108d68bd"},"schema_version":"1.0","source":{"id":"2605.14547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14547","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14547v1","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14547","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"OPRBCCD6PN25","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OPRBCCD6PN25UG6B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OPRBCCD6","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c5d33c81c0531e40e32e1b5401d18d5c37a374c001301218b4b45a87f8db8227","target":"graph","created_at":"2026-05-17T23:39:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We construct a class C that is Pollyanna but, for every k ≥ 1, is not k-strongly Pollyanna; in particular C is not strongly Pollyanna."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Graph classes are not required to be hereditary, allowing the construction of a non-hereditary class C that separates the Pollyanna and strongly Pollyanna properties."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A non-hereditary graph class exists that is Pollyanna but not strongly Pollyanna."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A non-hereditary graph class exists that is Pollyanna but fails to be strongly Pollyanna for every k."}],"snapshot_sha256":"be1069629c657579fa8a33693914e1876a759f121d11a05ef92a37b54e0e6f9d"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e614044c597dac5eebe73693da8fa38730294ecfa0d427d9d25948a134822316"},"paper":{"abstract_excerpt":"Chudnovsky, Cook, Davies, and Oum introduced the notion of Pollyanna graph classes: a class $\\mathcal{C}$ is Pollyanna if for every $\\chi$-bounded class $\\mathcal{F}$, the intersection $\\mathcal{C} \\cap \\mathcal{F}$ is polynomially $\\chi$-bounded. They further defined $\\mathcal{C}$ to be strongly Pollyanna if it is $k$-strongly Pollyanna for some integer $k$, meaning that $\\mathcal{C} \\cap \\mathcal{F}$ is polynomially $\\chi$-bounded for every $k$-good class $\\mathcal{F}$. They asked whether there are Pollyanna graph classes that are not strongly Pollyanna. In this note we answer this question ","authors_text":"Hongzhang Chen, Kaiyang Lan","cross_cats":[],"headline":"A non-hereditary graph class exists that is Pollyanna but fails to be strongly Pollyanna for every k.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T08:26:12Z","title":"A non-hereditary Pollyanna class that is not strongly Pollyanna"},"references":{"count":7,"internal_anchors":0,"resolved_work":7,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"M. Bria´ nski, J. Davies and B. Walczak, Separating polynomialχ-boundedness fromχ- boundedness,Combinatorica44(2024), 1–8","work_id":"0c738cc1-1933-43f0-bd4f-c329505f5503","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"M. Chudnovsky, L. Cook, J. Davies and S. Oum, Reunitingχ-boundedness with polynomial χ-boundedness,J. Combin. Theory Ser. B176(2026), 30–73. 6","work_id":"33eb6729-c40d-447a-8eb0-708ccee5d046","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Esperet, Graph colorings, flows and perfect matchings, Habilitation Thesis, Universit´ e Grenoble Alpes, 2017","work_id":"a13d5e44-c462-41c3-a4c6-a1090a8373d0","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Gy´ arfas, On Ramsey covering-numbers, in:Infinite and Finite Sets (Colloq., Keszthely, 1973; Dedicated to P","work_id":"34cdf834-856f-48f9-9f1d-7b9f8dcac34c","year":1973},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Erd˝ os, Graph theory and probability,Canad","work_id":"f15e8ca4-0a0f-400a-bc62-66d9d4925b2a","year":1959}],"snapshot_sha256":"f77cd6ff95b98e7f4c7aee9e739aa7b62588e5736e97b1f2c74dedfa20c7ab21"},"source":{"id":"2605.14547","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:23:29.888026Z","id":"288cd3e9-a257-468d-bed2-05a56aaed374","model_set":{"reader":"grok-4.3"},"one_line_summary":"A non-hereditary graph class exists that is Pollyanna but not strongly Pollyanna.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A non-hereditary graph class exists that is Pollyanna but fails to be strongly Pollyanna for every k.","strongest_claim":"We construct a class C that is Pollyanna but, for every k ≥ 1, is not k-strongly Pollyanna; in particular C is not strongly Pollyanna.","weakest_assumption":"Graph classes are not required to be hereditary, allowing the construction of a non-hereditary class C that separates the Pollyanna and strongly Pollyanna properties."}},"verdict_id":"288cd3e9-a257-468d-bed2-05a56aaed374"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae10fe110a9caa9d303106d77a6a58870523e9fad77406ffca865552b485def9","target":"record","created_at":"2026-05-17T23:39:05Z","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":"4320d4d7aec82772077299adf131750d9fa0f1fe8a14b5e99eb20d2bd8952c03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T08:26:12Z","title_canon_sha256":"b95fc928dbfc9b66a204f1783cb8b9209853c2ec59f48a2a2538ea69108d68bd"},"schema_version":"1.0","source":{"id":"2605.14547","kind":"arxiv","version":1}},"canonical_sha256":"73e211087e7b75da1bc120d7ca1786a610dae3ab7eb66269a375f98e21b6438d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73e211087e7b75da1bc120d7ca1786a610dae3ab7eb66269a375f98e21b6438d","first_computed_at":"2026-05-17T23:39:05.751126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:05.751126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xHZDgj59KnMdsCupiSdGrtqOm1YYKgWUR3Foc6gGkpSVo3FJ3BNf3tOnMChvVUU4yiuCd197iatKcD5i1pKmBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:05.751865Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae10fe110a9caa9d303106d77a6a58870523e9fad77406ffca865552b485def9","sha256:c5d33c81c0531e40e32e1b5401d18d5c37a374c001301218b4b45a87f8db8227"],"state_sha256":"d53ea095bda2e493f20525d6f99196b8bc2c1ad0ec3c2adbc0fc62b10cbdfe3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smqT8RLMsA+DbW9YkCvnYOSADgF3R1cIyOYF8ytqN/mmB19UXafP4ZdvKf2lVx78ytmA7KTuoO4jzazrri1MBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T05:07:22.745265Z","bundle_sha256":"6d9b5dd09cf52080092222fbc4ee78b13481f6384a1f21efa50cb41cf64dbf86"}}