{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RCQQEAGQ4YAUOOEKL73KW4ZHR3","short_pith_number":"pith:RCQQEAGQ","canonical_record":{"source":{"id":"1504.05322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-21T07:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"b0a72e04b3f6cb9c320765ee7a881639a1941d9e43b2c055f4a4dffcdf57f496","abstract_canon_sha256":"42b124dc1e432fe55c88b4541476417020f74c7d7ec5652390044b0c05cf19d7"},"schema_version":"1.0"},"canonical_sha256":"88a10200d0e60147388a5ff6ab73278ec25fe9f0d06abb78ba22c3e4f978c975","source":{"kind":"arxiv","id":"1504.05322","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05322","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05322v2","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05322","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"RCQQEAGQ4YAU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCQQEAGQ4YAUOOEK","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCQQEAGQ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RCQQEAGQ4YAUOOEKL73KW4ZHR3","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-21T07:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"b0a72e04b3f6cb9c320765ee7a881639a1941d9e43b2c055f4a4dffcdf57f496","abstract_canon_sha256":"42b124dc1e432fe55c88b4541476417020f74c7d7ec5652390044b0c05cf19d7"},"schema_version":"1.0"},"canonical_sha256":"88a10200d0e60147388a5ff6ab73278ec25fe9f0d06abb78ba22c3e4f978c975","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:38.621484Z","signature_b64":"wGavfhX5bbUqoh5CU0QXfUNMksddz/oIFUCT4QM8w6StaERRqeKp2al4qKdDV3QMSR9Irqg293mswVi1tyvPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a10200d0e60147388a5ff6ab73278ec25fe9f0d06abb78ba22c3e4f978c975","last_reissued_at":"2026-05-18T01:10:38.620967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:38.620967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05322","source_version":2,"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-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKI/KVpMoagjPScBnMsF6AnsmAwLTITFyM8lTXKlL6/3XWGEacp4TAYyNgbsWfd2MQSeQxZ3KK4rORtnq4zACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:37:53.851986Z"},"content_sha256":"14c18aafe061c7776b335b4d8c2ae6e665a5f5c086b43c5bdd5b95dfa17ee3dc","schema_version":"1.0","event_id":"sha256:14c18aafe061c7776b335b4d8c2ae6e665a5f5c086b43c5bdd5b95dfa17ee3dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RCQQEAGQ4YAUOOEKL73KW4ZHR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unavoidable induced subgraphs in large graphs with no homogeneous sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Paul Seymour, Ringi Kim, Sang-il Oum","submitted_at":"2015-04-21T07:13:31Z","abstract_excerpt":"A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\\le |X|\\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set. A chain of length $t$ is a sequence of $t+1$ vertices such that for every vertex in the sequence except the first one, its immediate predecessor is its unique neighbor or its unique non-neighbor among all of its predecessors. We prove that for all $n$, there exists $N$ such that every prime graph with at least $N$ vertices contains one of the following graphs or their complements "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05322","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKOvC0WxyGLRjXsiiU4e87EdiRA/3PIWKzETV/4PBTRx5h/j3YUaLwAba/xXrcCuxJkSXWbQPCmfLhhBNXxKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:37:53.852347Z"},"content_sha256":"873bd5bc6406468a772805377a805f8da9d66a784b9ef5983bc0707e1456ac7f","schema_version":"1.0","event_id":"sha256:873bd5bc6406468a772805377a805f8da9d66a784b9ef5983bc0707e1456ac7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCQQEAGQ4YAUOOEKL73KW4ZHR3/bundle.json","state_url":"https://pith.science/pith/RCQQEAGQ4YAUOOEKL73KW4ZHR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCQQEAGQ4YAUOOEKL73KW4ZHR3/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-06-02T08:37:53Z","links":{"resolver":"https://pith.science/pith/RCQQEAGQ4YAUOOEKL73KW4ZHR3","bundle":"https://pith.science/pith/RCQQEAGQ4YAUOOEKL73KW4ZHR3/bundle.json","state":"https://pith.science/pith/RCQQEAGQ4YAUOOEKL73KW4ZHR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCQQEAGQ4YAUOOEKL73KW4ZHR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RCQQEAGQ4YAUOOEKL73KW4ZHR3","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":"42b124dc1e432fe55c88b4541476417020f74c7d7ec5652390044b0c05cf19d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-21T07:13:31Z","title_canon_sha256":"b0a72e04b3f6cb9c320765ee7a881639a1941d9e43b2c055f4a4dffcdf57f496"},"schema_version":"1.0","source":{"id":"1504.05322","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05322","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05322v2","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05322","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"RCQQEAGQ4YAU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCQQEAGQ4YAUOOEK","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCQQEAGQ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:873bd5bc6406468a772805377a805f8da9d66a784b9ef5983bc0707e1456ac7f","target":"graph","created_at":"2026-05-18T01:10:38Z","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"},"paper":{"abstract_excerpt":"A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\\le |X|\\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set. A chain of length $t$ is a sequence of $t+1$ vertices such that for every vertex in the sequence except the first one, its immediate predecessor is its unique neighbor or its unique non-neighbor among all of its predecessors. We prove that for all $n$, there exists $N$ such that every prime graph with at least $N$ vertices contains one of the following graphs or their complements ","authors_text":"Maria Chudnovsky, Paul Seymour, Ringi Kim, Sang-il Oum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-21T07:13:31Z","title":"Unavoidable induced subgraphs in large graphs with no homogeneous sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05322","kind":"arxiv","version":2},"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:14c18aafe061c7776b335b4d8c2ae6e665a5f5c086b43c5bdd5b95dfa17ee3dc","target":"record","created_at":"2026-05-18T01:10:38Z","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":"42b124dc1e432fe55c88b4541476417020f74c7d7ec5652390044b0c05cf19d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-21T07:13:31Z","title_canon_sha256":"b0a72e04b3f6cb9c320765ee7a881639a1941d9e43b2c055f4a4dffcdf57f496"},"schema_version":"1.0","source":{"id":"1504.05322","kind":"arxiv","version":2}},"canonical_sha256":"88a10200d0e60147388a5ff6ab73278ec25fe9f0d06abb78ba22c3e4f978c975","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88a10200d0e60147388a5ff6ab73278ec25fe9f0d06abb78ba22c3e4f978c975","first_computed_at":"2026-05-18T01:10:38.620967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:38.620967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wGavfhX5bbUqoh5CU0QXfUNMksddz/oIFUCT4QM8w6StaERRqeKp2al4qKdDV3QMSR9Irqg293mswVi1tyvPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:38.621484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05322","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14c18aafe061c7776b335b4d8c2ae6e665a5f5c086b43c5bdd5b95dfa17ee3dc","sha256:873bd5bc6406468a772805377a805f8da9d66a784b9ef5983bc0707e1456ac7f"],"state_sha256":"92cda21815eb37dd25567771594c4a6f1209183ff0168c09dbd5a0cf7f81dac6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65ac/N9S9NY+dozS+yBKE5WM2T9TxEtbVz36pWv7UOfCwNNpvvCWsZkXZIKbYGABnTKm3o8zIsPxHhmiLk8UCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:37:53.854285Z","bundle_sha256":"559c9e85348a99fe688f328cee1838cc1d53fe06245791c43aa02965fcfe9c23"}}