{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HY36CBE6ILDP4CZO42RZRCSEZC","short_pith_number":"pith:HY36CBE6","schema_version":"1.0","canonical_sha256":"3e37e1049e42c6fe0b2ee6a3988a44c8808aa2882270055df6bda3da717e0e00","source":{"kind":"arxiv","id":"2506.01070","version":1},"attestation_state":"computed","paper":{"title":"The asymptotic $\\chi$-boundedness of hereditary families","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Reed, Yelena Yuditsky","submitted_at":"2025-06-01T16:19:14Z","abstract_excerpt":"A family ${\\cal F}$ of graphs is asymptotically $\\chi$-bounded with bounding function $f$ if almost every graph $G$ in the family satisfies $\\chi(G) \\le f(\\omega(G))$. A graph is $H$-free if it does not contain $H$ as an induced subgraph. We ask which hereditary families are asymptotically $\\chi$-bounded, and discuss some related questions. We show that for every tree $T$, almost all $T$-free graphs $G$ satisfy $\\chi(G)=\\omega(G)$. We show that for every cycle $C_k$ except $C_6$, almost every $C_k$-free graph $G$ satisfies $\\chi(G) = \\omega(G)$. We show that the $C_6$-free graphs are asymptoti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.01070","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T16:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"e99e087b767978ae3ed1aeae6b87c1b0c815e98f9828b84c95d7f5d525308329","abstract_canon_sha256":"9582017c1cac3a7174b43bf47ada5a90152755cca4446630c174022200a5992e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:45.444362Z","signature_b64":"6fkniTI+KM7dQrzfPvikZCW7z0twh7XbYG6Df5GL0F5AjcZmtXesbgJRO1f3FzAxUZJLVDNxVAM4OMz6JAgCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e37e1049e42c6fe0b2ee6a3988a44c8808aa2882270055df6bda3da717e0e00","last_reissued_at":"2026-07-05T11:13:45.443928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:45.443928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The asymptotic $\\chi$-boundedness of hereditary families","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Reed, Yelena Yuditsky","submitted_at":"2025-06-01T16:19:14Z","abstract_excerpt":"A family ${\\cal F}$ of graphs is asymptotically $\\chi$-bounded with bounding function $f$ if almost every graph $G$ in the family satisfies $\\chi(G) \\le f(\\omega(G))$. A graph is $H$-free if it does not contain $H$ as an induced subgraph. We ask which hereditary families are asymptotically $\\chi$-bounded, and discuss some related questions. We show that for every tree $T$, almost all $T$-free graphs $G$ satisfy $\\chi(G)=\\omega(G)$. We show that for every cycle $C_k$ except $C_6$, almost every $C_k$-free graph $G$ satisfies $\\chi(G) = \\omega(G)$. We show that the $C_6$-free graphs are asymptoti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01070","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01070/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.01070","created_at":"2026-07-05T11:13:45.443983+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01070v1","created_at":"2026-07-05T11:13:45.443983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01070","created_at":"2026-07-05T11:13:45.443983+00:00"},{"alias_kind":"pith_short_12","alias_value":"HY36CBE6ILDP","created_at":"2026-07-05T11:13:45.443983+00:00"},{"alias_kind":"pith_short_16","alias_value":"HY36CBE6ILDP4CZO","created_at":"2026-07-05T11:13:45.443983+00:00"},{"alias_kind":"pith_short_8","alias_value":"HY36CBE6","created_at":"2026-07-05T11:13:45.443983+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.21800","citing_title":"Chromatic numbers from edge ideals: Graph classes with vanishing syzygies are polynomially $\\chi$-bounded","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC","json":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC.json","graph_json":"https://pith.science/api/pith-number/HY36CBE6ILDP4CZO42RZRCSEZC/graph.json","events_json":"https://pith.science/api/pith-number/HY36CBE6ILDP4CZO42RZRCSEZC/events.json","paper":"https://pith.science/paper/HY36CBE6"},"agent_actions":{"view_html":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC","download_json":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC.json","view_paper":"https://pith.science/paper/HY36CBE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01070&json=true","fetch_graph":"https://pith.science/api/pith-number/HY36CBE6ILDP4CZO42RZRCSEZC/graph.json","fetch_events":"https://pith.science/api/pith-number/HY36CBE6ILDP4CZO42RZRCSEZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/action/storage_attestation","attest_author":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/action/author_attestation","sign_citation":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/action/citation_signature","submit_replication":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/action/replication_record"}},"created_at":"2026-07-05T11:13:45.443983+00:00","updated_at":"2026-07-05T11:13:45.443983+00:00"}