{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B5IWTIYYMGBPD7VOMPQ4TSAH34","short_pith_number":"pith:B5IWTIYY","schema_version":"1.0","canonical_sha256":"0f5169a3186182f1feae63e1c9c807df1ee483155abf1db3d595877cffc76513","source":{"kind":"arxiv","id":"1311.5048","version":2},"attestation_state":"computed","paper":{"title":"String graphs and separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Ji\\v{r}\\'i Matou\\v{s}ek","submitted_at":"2013-11-20T13:23:44Z","abstract_excerpt":"String graphs, that is, intersection graphs of curves in the plane, have been studied since the 1960s. We provide an expository presentation of several results, including very recent ones: some string graphs require an exponential number of crossings in every string representation; exponential number is always sufficient; string graphs have small separators; and the current best bound on the crossing number of a graph in terms of the pair-crossing number. For the existence of small separators, unwrapping the complete proof include generally useful results on approximate flow-cut dualities."},"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":"1311.5048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-20T13:23:44Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b91c928702545b9adb73b5f0c8390452fc43b20ddba7931055cc2152b1959f5f","abstract_canon_sha256":"c1005b7bf6279df265d54c4263536f17208c532a0de460769e19756cea3c8028"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:39.892893Z","signature_b64":"optQDKhWdtzkfZ3ajLbz9hUh3FD2A9u4146iTE4lj7OsnPVXOkN2L3+9GR4AA1ulWydI0xTsD3/1mnrCSGK6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f5169a3186182f1feae63e1c9c807df1ee483155abf1db3d595877cffc76513","last_reissued_at":"2026-05-18T02:45:39.892414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:39.892414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"String graphs and separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Ji\\v{r}\\'i Matou\\v{s}ek","submitted_at":"2013-11-20T13:23:44Z","abstract_excerpt":"String graphs, that is, intersection graphs of curves in the plane, have been studied since the 1960s. We provide an expository presentation of several results, including very recent ones: some string graphs require an exponential number of crossings in every string representation; exponential number is always sufficient; string graphs have small separators; and the current best bound on the crossing number of a graph in terms of the pair-crossing number. For the existence of small separators, unwrapping the complete proof include generally useful results on approximate flow-cut dualities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5048","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.5048","created_at":"2026-05-18T02:45:39.892486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5048v2","created_at":"2026-05-18T02:45:39.892486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5048","created_at":"2026-05-18T02:45:39.892486+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5IWTIYYMGBP","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5IWTIYYMGBPD7VO","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5IWTIYY","created_at":"2026-05-18T12:27:38.830355+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/B5IWTIYYMGBPD7VOMPQ4TSAH34","json":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34.json","graph_json":"https://pith.science/api/pith-number/B5IWTIYYMGBPD7VOMPQ4TSAH34/graph.json","events_json":"https://pith.science/api/pith-number/B5IWTIYYMGBPD7VOMPQ4TSAH34/events.json","paper":"https://pith.science/paper/B5IWTIYY"},"agent_actions":{"view_html":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34","download_json":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34.json","view_paper":"https://pith.science/paper/B5IWTIYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5048&json=true","fetch_graph":"https://pith.science/api/pith-number/B5IWTIYYMGBPD7VOMPQ4TSAH34/graph.json","fetch_events":"https://pith.science/api/pith-number/B5IWTIYYMGBPD7VOMPQ4TSAH34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34/action/storage_attestation","attest_author":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34/action/author_attestation","sign_citation":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34/action/citation_signature","submit_replication":"https://pith.science/pith/B5IWTIYYMGBPD7VOMPQ4TSAH34/action/replication_record"}},"created_at":"2026-05-18T02:45:39.892486+00:00","updated_at":"2026-05-18T02:45:39.892486+00:00"}