{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:27XRVP332NEMMBRXHITZYQI7WA","short_pith_number":"pith:27XRVP33","schema_version":"1.0","canonical_sha256":"d7ef1abf7bd348c606373a279c411fb007c0d36070f2e63de51ffafd060ebb4f","source":{"kind":"arxiv","id":"1503.05765","version":2},"attestation_state":"computed","paper":{"title":"Boxicity and topological invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Esperet","submitted_at":"2015-03-19T13:50:31Z","abstract_excerpt":"The boxicity of a graph $G=(V,E)$ is the smallest integer $k$ for which there exist $k$ interval graphs $G_i=(V,E_i)$, $1 \\le i \\le k$, such that $E=E_1 \\cap \\cdots \\cap E_k$. In the first part of this note, we prove that every graph on $m$ edges has boxicity $O(\\sqrt{m \\log m})$, which is asymptotically best possible. We use this result to study the connection between the boxicity of graphs and their Colin de Verdi\\`ere invariant, which share many similarities. Known results concerning the two parameters suggest that for any graph $G$, the boxicity of $G$ is at most the Colin de Verdi\\`ere in"},"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":"1503.05765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-19T13:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"683e4b87db8d0120329f11b6a0566f2878f61e9c35619a2187d992e392eb1a46","abstract_canon_sha256":"f5bea9684f178ed04e837e6aa01bcf079bb8b89875c2c4ef5eba1c50efe6319a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:34.950816Z","signature_b64":"wTLJfwi9hA/b8x+xreIqohfiyvLPcZYUTQHZtpJkltQ+MZsH5AtaRmIOyizIzHx1G1lNU2W/67WYd2n9tM7/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7ef1abf7bd348c606373a279c411fb007c0d36070f2e63de51ffafd060ebb4f","last_reissued_at":"2026-05-18T01:34:34.950179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:34.950179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boxicity and topological invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Esperet","submitted_at":"2015-03-19T13:50:31Z","abstract_excerpt":"The boxicity of a graph $G=(V,E)$ is the smallest integer $k$ for which there exist $k$ interval graphs $G_i=(V,E_i)$, $1 \\le i \\le k$, such that $E=E_1 \\cap \\cdots \\cap E_k$. In the first part of this note, we prove that every graph on $m$ edges has boxicity $O(\\sqrt{m \\log m})$, which is asymptotically best possible. We use this result to study the connection between the boxicity of graphs and their Colin de Verdi\\`ere invariant, which share many similarities. Known results concerning the two parameters suggest that for any graph $G$, the boxicity of $G$ is at most the Colin de Verdi\\`ere in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05765","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":"1503.05765","created_at":"2026-05-18T01:34:34.950284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05765v2","created_at":"2026-05-18T01:34:34.950284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05765","created_at":"2026-05-18T01:34:34.950284+00:00"},{"alias_kind":"pith_short_12","alias_value":"27XRVP332NEM","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"27XRVP332NEMMBRX","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"27XRVP33","created_at":"2026-05-18T12:28:59.999130+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/27XRVP332NEMMBRXHITZYQI7WA","json":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA.json","graph_json":"https://pith.science/api/pith-number/27XRVP332NEMMBRXHITZYQI7WA/graph.json","events_json":"https://pith.science/api/pith-number/27XRVP332NEMMBRXHITZYQI7WA/events.json","paper":"https://pith.science/paper/27XRVP33"},"agent_actions":{"view_html":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA","download_json":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA.json","view_paper":"https://pith.science/paper/27XRVP33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05765&json=true","fetch_graph":"https://pith.science/api/pith-number/27XRVP332NEMMBRXHITZYQI7WA/graph.json","fetch_events":"https://pith.science/api/pith-number/27XRVP332NEMMBRXHITZYQI7WA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA/action/storage_attestation","attest_author":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA/action/author_attestation","sign_citation":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA/action/citation_signature","submit_replication":"https://pith.science/pith/27XRVP332NEMMBRXHITZYQI7WA/action/replication_record"}},"created_at":"2026-05-18T01:34:34.950284+00:00","updated_at":"2026-05-18T01:34:34.950284+00:00"}