{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YVRN43RX2C6SPDDCVCQPFMXNMU","short_pith_number":"pith:YVRN43RX","schema_version":"1.0","canonical_sha256":"c562de6e37d0bd278c62a8a0f2b2ed650ffd46b4311a246443d7c1726b39b313","source":{"kind":"arxiv","id":"1512.02381","version":2},"attestation_state":"computed","paper":{"title":"Box representations of embedded graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Louis Esperet","submitted_at":"2015-12-08T09:37:18Z","abstract_excerpt":"A $d$-box is the cartesian product of $d$ intervals of $\\mathbb{R}$ and a $d$-box representation of a graph $G$ is a representation of $G$ as the intersection graph of a set of $d$-boxes in $\\mathbb{R}^d$. It was proved by Thomassen in 1986 that every planar graph has a 3-box representation. In this paper we prove that every graph embedded in a fixed orientable surface, without short non-contractible cycles, has a 5-box representation. This directly implies that there is a function $f$, such that in every graph of genus $g$, a set of at most $f(g)$ vertices can be removed so that the resulting"},"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":"1512.02381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-08T09:37:18Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"d584c9fcfdb169bd94edf3b8ef92f5a2280dcf2741c3a0ec3a79673d2df12b50","abstract_canon_sha256":"99b3395fea8b72c310e234cb91970d6481beaf553839becde50135b00f1983ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:00.148116Z","signature_b64":"vB4dbRnEJp6/FrZtaENeCc9Qe8/+timmk5y82z7CZNZm+HeHWafw2nN14TJabuR5dYlZTWSjdifCkea7RhMuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c562de6e37d0bd278c62a8a0f2b2ed650ffd46b4311a246443d7c1726b39b313","last_reissued_at":"2026-05-18T00:49:00.147496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:00.147496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Box representations of embedded graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Louis Esperet","submitted_at":"2015-12-08T09:37:18Z","abstract_excerpt":"A $d$-box is the cartesian product of $d$ intervals of $\\mathbb{R}$ and a $d$-box representation of a graph $G$ is a representation of $G$ as the intersection graph of a set of $d$-boxes in $\\mathbb{R}^d$. It was proved by Thomassen in 1986 that every planar graph has a 3-box representation. In this paper we prove that every graph embedded in a fixed orientable surface, without short non-contractible cycles, has a 5-box representation. This directly implies that there is a function $f$, such that in every graph of genus $g$, a set of at most $f(g)$ vertices can be removed so that the resulting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02381","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":"1512.02381","created_at":"2026-05-18T00:49:00.147600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02381v2","created_at":"2026-05-18T00:49:00.147600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02381","created_at":"2026-05-18T00:49:00.147600+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVRN43RX2C6S","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVRN43RX2C6SPDDC","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVRN43RX","created_at":"2026-05-18T12:29:52.810259+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/YVRN43RX2C6SPDDCVCQPFMXNMU","json":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU.json","graph_json":"https://pith.science/api/pith-number/YVRN43RX2C6SPDDCVCQPFMXNMU/graph.json","events_json":"https://pith.science/api/pith-number/YVRN43RX2C6SPDDCVCQPFMXNMU/events.json","paper":"https://pith.science/paper/YVRN43RX"},"agent_actions":{"view_html":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU","download_json":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU.json","view_paper":"https://pith.science/paper/YVRN43RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02381&json=true","fetch_graph":"https://pith.science/api/pith-number/YVRN43RX2C6SPDDCVCQPFMXNMU/graph.json","fetch_events":"https://pith.science/api/pith-number/YVRN43RX2C6SPDDCVCQPFMXNMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU/action/storage_attestation","attest_author":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU/action/author_attestation","sign_citation":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU/action/citation_signature","submit_replication":"https://pith.science/pith/YVRN43RX2C6SPDDCVCQPFMXNMU/action/replication_record"}},"created_at":"2026-05-18T00:49:00.147600+00:00","updated_at":"2026-05-18T00:49:00.147600+00:00"}