{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4I62WBICRSIQRIOROTN3GS7UJH","short_pith_number":"pith:4I62WBIC","canonical_record":{"source":{"id":"1511.02544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-11-09T00:23:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f08dc8beca11bd8b0487aca55468fdb48a10b40575cdbb21ee5e86bec4a95c35","abstract_canon_sha256":"5709a6767daacbc626797f5ca490cc0ef4fb8a3175d52ad14ed82edbf064c95d"},"schema_version":"1.0"},"canonical_sha256":"e23dab05028c9108a1d174dbb34bf449ce862d94a732b0b8c2f5425d7e6823b0","source":{"kind":"arxiv","id":"1511.02544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02544","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02544v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02544","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"4I62WBICRSIQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4I62WBICRSIQRIOR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4I62WBIC","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4I62WBICRSIQRIOROTN3GS7UJH","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-11-09T00:23:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f08dc8beca11bd8b0487aca55468fdb48a10b40575cdbb21ee5e86bec4a95c35","abstract_canon_sha256":"5709a6767daacbc626797f5ca490cc0ef4fb8a3175d52ad14ed82edbf064c95d"},"schema_version":"1.0"},"canonical_sha256":"e23dab05028c9108a1d174dbb34bf449ce862d94a732b0b8c2f5425d7e6823b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:29.986781Z","signature_b64":"ohl7Go3glkhSokdgabOm+9Wgh8DLxed4+4Oh8S4mTPeGu9qWP2Ob4zh1xns63bNxb1Gsf8NOmyV0A8KnMc/iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e23dab05028c9108a1d174dbb34bf449ce862d94a732b0b8c2f5425d7e6823b0","last_reissued_at":"2026-05-18T01:27:29.986162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:29.986162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02544","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-05-18T01:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fesGrc8lJZBindMiIioCO8Z7lryfoEvSOv8e63TeuMbDLMRQNd8Hgchuc2WEEFXZsEKJV5hicKBM7xw/+Hc7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:09:07.698824Z"},"content_sha256":"eaa9c48ba4ed6fe5d304d968b95859966b948da6023004682d195543613d98ee","schema_version":"1.0","event_id":"sha256:eaa9c48ba4ed6fe5d304d968b95859966b948da6023004682d195543613d98ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4I62WBICRSIQRIOROTN3GS7UJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On unavoidable induced subgraphs in large prime graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"C. Terry, M. Malliaris","submitted_at":"2015-11-09T00:23:02Z","abstract_excerpt":"Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key model-theoretic ingredient of first determining the so-called amount of stability of the graph. This approach changes the applicable Ramsey theorem, improves the bounds and offers a different structural perspective on the graphs in question. Complementing this, we give an infinitary proof which implies the finite result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02544","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":""},"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:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1duJiGkNGbESap8912V2SuVdY9MHctJjymXmSR+5V1+M0JlW3zORE53ds0T+gUiGlbN9nqP6yu9VeBEs8YMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:09:07.699172Z"},"content_sha256":"3f6ee29f22f3e04f1e5d34ec8c90b23fb9c149031e4fa11fa71a6918867506bc","schema_version":"1.0","event_id":"sha256:3f6ee29f22f3e04f1e5d34ec8c90b23fb9c149031e4fa11fa71a6918867506bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/bundle.json","state_url":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4I62WBICRSIQRIOROTN3GS7UJH/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-02T23:09:07Z","links":{"resolver":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH","bundle":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/bundle.json","state":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4I62WBICRSIQRIOROTN3GS7UJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4I62WBICRSIQRIOROTN3GS7UJH","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":"5709a6767daacbc626797f5ca490cc0ef4fb8a3175d52ad14ed82edbf064c95d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-11-09T00:23:02Z","title_canon_sha256":"f08dc8beca11bd8b0487aca55468fdb48a10b40575cdbb21ee5e86bec4a95c35"},"schema_version":"1.0","source":{"id":"1511.02544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02544","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02544v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02544","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"4I62WBICRSIQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4I62WBICRSIQRIOR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4I62WBIC","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:3f6ee29f22f3e04f1e5d34ec8c90b23fb9c149031e4fa11fa71a6918867506bc","target":"graph","created_at":"2026-05-18T01:27: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"},"paper":{"abstract_excerpt":"Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key model-theoretic ingredient of first determining the so-called amount of stability of the graph. This approach changes the applicable Ramsey theorem, improves the bounds and offers a different structural perspective on the graphs in question. Complementing this, we give an infinitary proof which implies the finite result.","authors_text":"C. Terry, M. Malliaris","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-11-09T00:23:02Z","title":"On unavoidable induced subgraphs in large prime graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02544","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:eaa9c48ba4ed6fe5d304d968b95859966b948da6023004682d195543613d98ee","target":"record","created_at":"2026-05-18T01:27: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":"5709a6767daacbc626797f5ca490cc0ef4fb8a3175d52ad14ed82edbf064c95d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-11-09T00:23:02Z","title_canon_sha256":"f08dc8beca11bd8b0487aca55468fdb48a10b40575cdbb21ee5e86bec4a95c35"},"schema_version":"1.0","source":{"id":"1511.02544","kind":"arxiv","version":1}},"canonical_sha256":"e23dab05028c9108a1d174dbb34bf449ce862d94a732b0b8c2f5425d7e6823b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e23dab05028c9108a1d174dbb34bf449ce862d94a732b0b8c2f5425d7e6823b0","first_computed_at":"2026-05-18T01:27:29.986162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:29.986162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohl7Go3glkhSokdgabOm+9Wgh8DLxed4+4Oh8S4mTPeGu9qWP2Ob4zh1xns63bNxb1Gsf8NOmyV0A8KnMc/iCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:29.986781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaa9c48ba4ed6fe5d304d968b95859966b948da6023004682d195543613d98ee","sha256:3f6ee29f22f3e04f1e5d34ec8c90b23fb9c149031e4fa11fa71a6918867506bc"],"state_sha256":"8231953ba4df19a7bbca88eedf912345423fdee840d6bdea046f5cb2c42258a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puj/3LbZydXwEhI7H979Ft4AQud+yuBxY1WvMPU526lmPFrOtQOUO/ybOskfJ6zufzKhBNneK5YX2Cs4AlveDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:09:07.701163Z","bundle_sha256":"2e44e10e19810c614a951d563c93d944f4395d9d2f35ee4b9d2e9fe6dafd3367"}}