{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IK64KPJIA3IYBBVKGRUI2YDAZV","short_pith_number":"pith:IK64KPJI","schema_version":"1.0","canonical_sha256":"42bdc53d2806d18086aa34688d6060cd4e40bb1b6d37908c9d496020329bd7fe","source":{"kind":"arxiv","id":"2506.03544","version":1},"attestation_state":"computed","paper":{"title":"The Global Structure of a Typical Graph Without $H$ as an Induced Subgraph when $H$ is a Cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Reed","submitted_at":"2025-06-04T04:03:05Z","abstract_excerpt":"One way to certify that a graph does not contain an induced cycle of length six is to provide a partition of its vertex set into (i) a stable set, and (ii) a graph containing no stable set of size three and no induced matching of size two. We show that almost every graph which does not contain a cycle of length six as an induced subgraph has such a certificate. We obtain similar characterizations of the structure of almost all graphs which contain no induced cycle of length $k$ for all even $k$ exceeding six. (Similar results were obtained for $k=3$ by Erdos, Kleitman, and Rothschild in 1976, "},"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.03544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T04:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"0e6d32aa2ee97143644292631fd5faf8d683651fad16ac7f10ab981a8816641a","abstract_canon_sha256":"d826901032dc92b9bf0b17ffea6db1fd64d8784572295ddc380ccf081a8f0808"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:29.404089Z","signature_b64":"zqrNbr/G2kKvFxJ8lKV3V9bF6VHRdH1BFox0g5Th67j7KPaydkFAPgcSJTqY/o0HBtUQCpZzth+gGeY+ZNIcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42bdc53d2806d18086aa34688d6060cd4e40bb1b6d37908c9d496020329bd7fe","last_reissued_at":"2026-07-05T11:15:29.403578Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:29.403578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Global Structure of a Typical Graph Without $H$ as an Induced Subgraph when $H$ is a Cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Reed","submitted_at":"2025-06-04T04:03:05Z","abstract_excerpt":"One way to certify that a graph does not contain an induced cycle of length six is to provide a partition of its vertex set into (i) a stable set, and (ii) a graph containing no stable set of size three and no induced matching of size two. We show that almost every graph which does not contain a cycle of length six as an induced subgraph has such a certificate. We obtain similar characterizations of the structure of almost all graphs which contain no induced cycle of length $k$ for all even $k$ exceeding six. (Similar results were obtained for $k=3$ by Erdos, Kleitman, and Rothschild in 1976, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03544","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.03544/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.03544","created_at":"2026-07-05T11:15:29.403642+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03544v1","created_at":"2026-07-05T11:15:29.403642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03544","created_at":"2026-07-05T11:15:29.403642+00:00"},{"alias_kind":"pith_short_12","alias_value":"IK64KPJIA3IY","created_at":"2026-07-05T11:15:29.403642+00:00"},{"alias_kind":"pith_short_16","alias_value":"IK64KPJIA3IYBBVK","created_at":"2026-07-05T11:15:29.403642+00:00"},{"alias_kind":"pith_short_8","alias_value":"IK64KPJI","created_at":"2026-07-05T11:15:29.403642+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV","json":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV.json","graph_json":"https://pith.science/api/pith-number/IK64KPJIA3IYBBVKGRUI2YDAZV/graph.json","events_json":"https://pith.science/api/pith-number/IK64KPJIA3IYBBVKGRUI2YDAZV/events.json","paper":"https://pith.science/paper/IK64KPJI"},"agent_actions":{"view_html":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV","download_json":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV.json","view_paper":"https://pith.science/paper/IK64KPJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03544&json=true","fetch_graph":"https://pith.science/api/pith-number/IK64KPJIA3IYBBVKGRUI2YDAZV/graph.json","fetch_events":"https://pith.science/api/pith-number/IK64KPJIA3IYBBVKGRUI2YDAZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/action/storage_attestation","attest_author":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/action/author_attestation","sign_citation":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/action/citation_signature","submit_replication":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/action/replication_record"}},"created_at":"2026-07-05T11:15:29.403642+00:00","updated_at":"2026-07-05T11:15:29.403642+00:00"}