{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IK64KPJIA3IYBBVKGRUI2YDAZV","short_pith_number":"pith:IK64KPJI","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"},"canonical_sha256":"42bdc53d2806d18086aa34688d6060cd4e40bb1b6d37908c9d496020329bd7fe","source":{"kind":"arxiv","id":"2506.03544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03544","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03544v1","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03544","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"pith_short_12","alias_value":"IK64KPJIA3IY","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"pith_short_16","alias_value":"IK64KPJIA3IYBBVK","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"pith_short_8","alias_value":"IK64KPJI","created_at":"2026-07-05T11:15:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IK64KPJIA3IYBBVKGRUI2YDAZV","target":"record","payload":{"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"},"canonical_sha256":"42bdc53d2806d18086aa34688d6060cd4e40bb1b6d37908c9d496020329bd7fe","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"},"source_kind":"arxiv","source_id":"2506.03544","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:15:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xh42OJiiT4E6vI3fiqT5sZQYDbuhMv0gN/wq7AzZD4u9QjhrUFE2Kq0JKkQqYUlaXqX0tajt1ugG5F0XSIYGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:21:41.877697Z"},"content_sha256":"b461ef1f21228618985e4fd6c008a9f1ef6f8add14153dcef21eea3d395e148b","schema_version":"1.0","event_id":"sha256:b461ef1f21228618985e4fd6c008a9f1ef6f8add14153dcef21eea3d395e148b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IK64KPJIA3IYBBVKGRUI2YDAZV","target":"graph","payload":{"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"},"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:15:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/De1CVJNn3BmhK57pSGf4YcWZ8igcyklnJiwXhzu6xQDQQJ3L+WJpL4btpil15FRekKBCSIuJgdioXD5Y8oiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:21:41.878584Z"},"content_sha256":"b8e42b5ec8ee375c38938122ef2cf92f67f3dd80c4c5652bd78054a491a1ac85","schema_version":"1.0","event_id":"sha256:b8e42b5ec8ee375c38938122ef2cf92f67f3dd80c4c5652bd78054a491a1ac85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/bundle.json","state_url":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/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-08T19:21:41Z","links":{"resolver":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV","bundle":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/bundle.json","state":"https://pith.science/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IK64KPJIA3IYBBVKGRUI2YDAZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IK64KPJIA3IYBBVKGRUI2YDAZV","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":"d826901032dc92b9bf0b17ffea6db1fd64d8784572295ddc380ccf081a8f0808","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T04:03:05Z","title_canon_sha256":"0e6d32aa2ee97143644292631fd5faf8d683651fad16ac7f10ab981a8816641a"},"schema_version":"1.0","source":{"id":"2506.03544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03544","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03544v1","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03544","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"pith_short_12","alias_value":"IK64KPJIA3IY","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"pith_short_16","alias_value":"IK64KPJIA3IYBBVK","created_at":"2026-07-05T11:15:29Z"},{"alias_kind":"pith_short_8","alias_value":"IK64KPJI","created_at":"2026-07-05T11:15:29Z"}],"graph_snapshots":[{"event_id":"sha256:b8e42b5ec8ee375c38938122ef2cf92f67f3dd80c4c5652bd78054a491a1ac85","target":"graph","created_at":"2026-07-05T11:15:29Z","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.03544/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Bruce Reed","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T04:03:05Z","title":"The Global Structure of a Typical Graph Without $H$ as an Induced Subgraph when $H$ is a Cycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03544","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:b461ef1f21228618985e4fd6c008a9f1ef6f8add14153dcef21eea3d395e148b","target":"record","created_at":"2026-07-05T11:15:29Z","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":"d826901032dc92b9bf0b17ffea6db1fd64d8784572295ddc380ccf081a8f0808","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T04:03:05Z","title_canon_sha256":"0e6d32aa2ee97143644292631fd5faf8d683651fad16ac7f10ab981a8816641a"},"schema_version":"1.0","source":{"id":"2506.03544","kind":"arxiv","version":1}},"canonical_sha256":"42bdc53d2806d18086aa34688d6060cd4e40bb1b6d37908c9d496020329bd7fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42bdc53d2806d18086aa34688d6060cd4e40bb1b6d37908c9d496020329bd7fe","first_computed_at":"2026-07-05T11:15:29.403578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:29.403578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqrNbr/G2kKvFxJ8lKV3V9bF6VHRdH1BFox0g5Th67j7KPaydkFAPgcSJTqY/o0HBtUQCpZzth+gGeY+ZNIcAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:29.404089Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b461ef1f21228618985e4fd6c008a9f1ef6f8add14153dcef21eea3d395e148b","sha256:b8e42b5ec8ee375c38938122ef2cf92f67f3dd80c4c5652bd78054a491a1ac85"],"state_sha256":"0bc364c19f9e75b38ad0252385a5e7425e12e57dc5850c04e25541ef9791ce85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKE82+fpVckoGhq8mXT0zBG5CRhl+jYu5dA6JKrigMILwPs6mt8sPV4sq7ZAZhhKEV+h34cqv9Jh4ggkw2l+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:21:41.885591Z","bundle_sha256":"0f62017a680a95da41d54fb381fbb96e1c6ebb2ddd5c625bf838863c6ed9fc91"}}