{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FF4M7JKTRPPSOAT3ITXGSMJSDX","short_pith_number":"pith:FF4M7JKT","schema_version":"1.0","canonical_sha256":"2978cfa5538bdf27027b44ee6931321ddc958ba20d8403dd9e49eaeabcc9034a","source":{"kind":"arxiv","id":"1804.01060","version":2},"attestation_state":"computed","paper":{"title":"Pure pairs. II. Excluding all subdivisions of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour, Sophie Spirkl","submitted_at":"2018-04-03T16:47:20Z","abstract_excerpt":"We prove for every graph H there exists a>0 such that, for every graph G with at least two vertices, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least a|G| neighbours, or there are two disjoint sets A,B of at least a|G| vertices such that no edge joins A and B. It follows that for every graph H, there exists c>0 such that for every graph G, if no induced subgraph of G or its complement is a subdivision of H, then G has a clique or stable set of cardinality at least |G|^c. This is related to the Erdos-Hajnal conjecture."},"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":"1804.01060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-03T16:47:20Z","cross_cats_sorted":[],"title_canon_sha256":"775cd1478538c9806dab7cbb209586a37a55ea275ab5f7f402f31141661b5c06","abstract_canon_sha256":"8d7eac0ab0dfbfe96911341cb1b0a86c181247982e9c85ecd079bc2984c13eb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:23.924493Z","signature_b64":"d1kEU83UMmvfUm5/0AQH59e3ho19MLCZN9XHMjfnAzvTnpij0Fx/7d/Rs4p2NTahsA7GibQ+83Iot01o/QqHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2978cfa5538bdf27027b44ee6931321ddc958ba20d8403dd9e49eaeabcc9034a","last_reissued_at":"2026-07-05T01:07:23.924090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:23.924090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pure pairs. II. Excluding all subdivisions of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour, Sophie Spirkl","submitted_at":"2018-04-03T16:47:20Z","abstract_excerpt":"We prove for every graph H there exists a>0 such that, for every graph G with at least two vertices, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least a|G| neighbours, or there are two disjoint sets A,B of at least a|G| vertices such that no edge joins A and B. It follows that for every graph H, there exists c>0 such that for every graph G, if no induced subgraph of G or its complement is a subdivision of H, then G has a clique or stable set of cardinality at least |G|^c. This is related to the Erdos-Hajnal conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01060","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1804.01060/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":"1804.01060","created_at":"2026-07-05T01:07:23.924154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01060v2","created_at":"2026-07-05T01:07:23.924154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01060","created_at":"2026-07-05T01:07:23.924154+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF4M7JKTRPPS","created_at":"2026-07-05T01:07:23.924154+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF4M7JKTRPPSOAT3","created_at":"2026-07-05T01:07:23.924154+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF4M7JKT","created_at":"2026-07-05T01:07:23.924154+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05550","citing_title":"A sharp threshold phenomenon in string graphs","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX","json":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX.json","graph_json":"https://pith.science/api/pith-number/FF4M7JKTRPPSOAT3ITXGSMJSDX/graph.json","events_json":"https://pith.science/api/pith-number/FF4M7JKTRPPSOAT3ITXGSMJSDX/events.json","paper":"https://pith.science/paper/FF4M7JKT"},"agent_actions":{"view_html":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX","download_json":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX.json","view_paper":"https://pith.science/paper/FF4M7JKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01060&json=true","fetch_graph":"https://pith.science/api/pith-number/FF4M7JKTRPPSOAT3ITXGSMJSDX/graph.json","fetch_events":"https://pith.science/api/pith-number/FF4M7JKTRPPSOAT3ITXGSMJSDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX/action/storage_attestation","attest_author":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX/action/author_attestation","sign_citation":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX/action/citation_signature","submit_replication":"https://pith.science/pith/FF4M7JKTRPPSOAT3ITXGSMJSDX/action/replication_record"}},"created_at":"2026-07-05T01:07:23.924154+00:00","updated_at":"2026-07-05T01:07:23.924154+00:00"}