{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HY36CBE6ILDP4CZO42RZRCSEZC","short_pith_number":"pith:HY36CBE6","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"},"canonical_sha256":"3e37e1049e42c6fe0b2ee6a3988a44c8808aa2882270055df6bda3da717e0e00","source":{"kind":"arxiv","id":"2506.01070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01070","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01070v1","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01070","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"HY36CBE6ILDP","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_16","alias_value":"HY36CBE6ILDP4CZO","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_8","alias_value":"HY36CBE6","created_at":"2026-07-05T11:13:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HY36CBE6ILDP4CZO42RZRCSEZC","target":"record","payload":{"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"},"canonical_sha256":"3e37e1049e42c6fe0b2ee6a3988a44c8808aa2882270055df6bda3da717e0e00","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"},"source_kind":"arxiv","source_id":"2506.01070","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-07-05T11:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUMcjmLCk33WoJB/EHo9SoczqDGhFXIQ1HjvzMRzWALO0ho1SJkogin+tCOGAe0fvmVLoQq0SN4gwZ807qZBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:37:57.899583Z"},"content_sha256":"556026cc893446f93f1ecd831cdc313954b25023a56b33788c31f2b391f060a5","schema_version":"1.0","event_id":"sha256:556026cc893446f93f1ecd831cdc313954b25023a56b33788c31f2b391f060a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HY36CBE6ILDP4CZO42RZRCSEZC","target":"graph","payload":{"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"},"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-07-05T11:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZamngqR24Bzdh2hEtXB+MG9LNxuxlPPgU5rXCArxWx9RAmnHyICZUD7DGNsPr8w5gIPzJw6E4UkCzjsuWs3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:37:57.900115Z"},"content_sha256":"9b6a36baaf0227459bc6b927ff733cbe8f804783a7942f1168603add176b93d0","schema_version":"1.0","event_id":"sha256:9b6a36baaf0227459bc6b927ff733cbe8f804783a7942f1168603add176b93d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/bundle.json","state_url":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HY36CBE6ILDP4CZO42RZRCSEZC/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-08-08T23:37:57Z","links":{"resolver":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC","bundle":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/bundle.json","state":"https://pith.science/pith/HY36CBE6ILDP4CZO42RZRCSEZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HY36CBE6ILDP4CZO42RZRCSEZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HY36CBE6ILDP4CZO42RZRCSEZC","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":"9582017c1cac3a7174b43bf47ada5a90152755cca4446630c174022200a5992e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T16:19:14Z","title_canon_sha256":"e99e087b767978ae3ed1aeae6b87c1b0c815e98f9828b84c95d7f5d525308329"},"schema_version":"1.0","source":{"id":"2506.01070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01070","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01070v1","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01070","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"HY36CBE6ILDP","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_16","alias_value":"HY36CBE6ILDP4CZO","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_8","alias_value":"HY36CBE6","created_at":"2026-07-05T11:13:45Z"}],"graph_snapshots":[{"event_id":"sha256:9b6a36baaf0227459bc6b927ff733cbe8f804783a7942f1168603add176b93d0","target":"graph","created_at":"2026-07-05T11:13:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.01070/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bruce Reed, Yelena Yuditsky","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T16:19:14Z","title":"The asymptotic $\\chi$-boundedness of hereditary families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01070","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:556026cc893446f93f1ecd831cdc313954b25023a56b33788c31f2b391f060a5","target":"record","created_at":"2026-07-05T11:13:45Z","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":"9582017c1cac3a7174b43bf47ada5a90152755cca4446630c174022200a5992e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T16:19:14Z","title_canon_sha256":"e99e087b767978ae3ed1aeae6b87c1b0c815e98f9828b84c95d7f5d525308329"},"schema_version":"1.0","source":{"id":"2506.01070","kind":"arxiv","version":1}},"canonical_sha256":"3e37e1049e42c6fe0b2ee6a3988a44c8808aa2882270055df6bda3da717e0e00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e37e1049e42c6fe0b2ee6a3988a44c8808aa2882270055df6bda3da717e0e00","first_computed_at":"2026-07-05T11:13:45.443928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:45.443928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6fkniTI+KM7dQrzfPvikZCW7z0twh7XbYG6Df5GL0F5AjcZmtXesbgJRO1f3FzAxUZJLVDNxVAM4OMz6JAgCDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:45.444362Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:556026cc893446f93f1ecd831cdc313954b25023a56b33788c31f2b391f060a5","sha256:9b6a36baaf0227459bc6b927ff733cbe8f804783a7942f1168603add176b93d0"],"state_sha256":"4fee8ce9be8dafe6dab9b4ec48d34681a16b088b5eac633c792d87006221e47c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PELUXYSo2nCpOztlwGafMhB1j8BRDd3mbMR5E+75dabWdi6TCoeDrlUd+l2JTlwZYgVk/RNu8R/D0+CzbKNXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:37:57.903744Z","bundle_sha256":"a1336b476f0e9f0a092e4c1ad2bc95bc3cc33c36027810d94eed096b8de45a4d"}}