{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CX3P4LZNAIDUDRDJ64FMFQ2IMP","short_pith_number":"pith:CX3P4LZN","schema_version":"1.0","canonical_sha256":"15f6fe2f2d020741c469f70ac2c34863c7615a12f7698e8aadb084589d889e41","source":{"kind":"arxiv","id":"2002.10350","version":1},"attestation_state":"computed","paper":{"title":"String graphs have the Erd\\H{o}s-Hajnal property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Istv\\'an Tomon","submitted_at":"2020-02-24T16:23:21Z","abstract_excerpt":"A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either a clique or an independent set of size at least $n^{c}$."},"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":"2002.10350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-24T16:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"7c1d27b141af6ef5010060dd73f1deaca10133318d53e8d913690b30e0e0675f","abstract_canon_sha256":"a343ea90a16f5e0c6104cf420ca1abc30e80d520385f2bf22c4e55bd68818fe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:16.749837Z","signature_b64":"XOgyb5xzZylRSaZNU5n7klbG7DeUAeQ4POHviAs+i09UQRagilRXJv717nd4389/cUL3kFHJXhw/Z36c5GniAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15f6fe2f2d020741c469f70ac2c34863c7615a12f7698e8aadb084589d889e41","last_reissued_at":"2026-07-05T00:43:16.749400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:16.749400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"String graphs have the Erd\\H{o}s-Hajnal property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Istv\\'an Tomon","submitted_at":"2020-02-24T16:23:21Z","abstract_excerpt":"A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either a clique or an independent set of size at least $n^{c}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10350","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/2002.10350/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":"2002.10350","created_at":"2026-07-05T00:43:16.749458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.10350v1","created_at":"2026-07-05T00:43:16.749458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10350","created_at":"2026-07-05T00:43:16.749458+00:00"},{"alias_kind":"pith_short_12","alias_value":"CX3P4LZNAIDU","created_at":"2026-07-05T00:43:16.749458+00:00"},{"alias_kind":"pith_short_16","alias_value":"CX3P4LZNAIDUDRDJ","created_at":"2026-07-05T00:43:16.749458+00:00"},{"alias_kind":"pith_short_8","alias_value":"CX3P4LZN","created_at":"2026-07-05T00:43:16.749458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2307.06455","citing_title":"Induced subgraph density. IV. New graphs with the Erd\\H{o}s-Hajnal property","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP","json":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP.json","graph_json":"https://pith.science/api/pith-number/CX3P4LZNAIDUDRDJ64FMFQ2IMP/graph.json","events_json":"https://pith.science/api/pith-number/CX3P4LZNAIDUDRDJ64FMFQ2IMP/events.json","paper":"https://pith.science/paper/CX3P4LZN"},"agent_actions":{"view_html":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP","download_json":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP.json","view_paper":"https://pith.science/paper/CX3P4LZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.10350&json=true","fetch_graph":"https://pith.science/api/pith-number/CX3P4LZNAIDUDRDJ64FMFQ2IMP/graph.json","fetch_events":"https://pith.science/api/pith-number/CX3P4LZNAIDUDRDJ64FMFQ2IMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP/action/storage_attestation","attest_author":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP/action/author_attestation","sign_citation":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP/action/citation_signature","submit_replication":"https://pith.science/pith/CX3P4LZNAIDUDRDJ64FMFQ2IMP/action/replication_record"}},"created_at":"2026-07-05T00:43:16.749458+00:00","updated_at":"2026-07-05T00:43:16.749458+00:00"}