{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4I62WBICRSIQRIOROTN3GS7UJH","short_pith_number":"pith:4I62WBIC","schema_version":"1.0","canonical_sha256":"e23dab05028c9108a1d174dbb34bf449ce862d94a732b0b8c2f5425d7e6823b0","source":{"kind":"arxiv","id":"1511.02544","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.02544","created_at":"2026-05-18T01:27:29.986242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02544v1","created_at":"2026-05-18T01:27:29.986242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02544","created_at":"2026-05-18T01:27:29.986242+00:00"},{"alias_kind":"pith_short_12","alias_value":"4I62WBICRSIQ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4I62WBICRSIQRIOR","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4I62WBIC","created_at":"2026-05-18T12:29:05.191682+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/4I62WBICRSIQRIOROTN3GS7UJH","json":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH.json","graph_json":"https://pith.science/api/pith-number/4I62WBICRSIQRIOROTN3GS7UJH/graph.json","events_json":"https://pith.science/api/pith-number/4I62WBICRSIQRIOROTN3GS7UJH/events.json","paper":"https://pith.science/paper/4I62WBIC"},"agent_actions":{"view_html":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH","download_json":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH.json","view_paper":"https://pith.science/paper/4I62WBIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02544&json=true","fetch_graph":"https://pith.science/api/pith-number/4I62WBICRSIQRIOROTN3GS7UJH/graph.json","fetch_events":"https://pith.science/api/pith-number/4I62WBICRSIQRIOROTN3GS7UJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/action/storage_attestation","attest_author":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/action/author_attestation","sign_citation":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/action/citation_signature","submit_replication":"https://pith.science/pith/4I62WBICRSIQRIOROTN3GS7UJH/action/replication_record"}},"created_at":"2026-05-18T01:27:29.986242+00:00","updated_at":"2026-05-18T01:27:29.986242+00:00"}