{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:YC62AJGDBHJ3EFK7Z5U43VO2QE","short_pith_number":"pith:YC62AJGD","schema_version":"1.0","canonical_sha256":"c0bda024c309d3b2155fcf69cdd5da812fbd2b6406f8d220ded944c78ae1231c","source":{"kind":"arxiv","id":"0806.3175","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds for Boxicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan","submitted_at":"2008-06-19T11:38:18Z","abstract_excerpt":"An axis-parallel $b$-dimensional box is a Cartesian product $R_1\\times R_2\\times...\\times R_b$ where $R_i$ is a closed interval of the form $[a_i,b_i]$ on the real line. For a graph $G$, its \\emph{boxicity} box(G) is the minimum dimension $b$, such that $G$ is representable as the intersection graph of boxes in $b$-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which "},"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":"0806.3175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-06-19T11:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"53282a8385fc3b40b98c055a3bf6e49c0b10f83387e224f680eb610a037d1a56","abstract_canon_sha256":"86c5ed1e9487f3ae00c5f4cf430d181b9464704919831dba54f985fba01bf5a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:24.681095Z","signature_b64":"F8eVIh+CpYCL3EC27vG3yD+8Bf6ZuB2wue28L4rK5FQdWJyxKRCKZSOURMDU1dUAO0mCF0FxU+c4ViC74cx9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0bda024c309d3b2155fcf69cdd5da812fbd2b6406f8d220ded944c78ae1231c","last_reissued_at":"2026-05-18T03:56:24.680567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:24.680567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Boxicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan","submitted_at":"2008-06-19T11:38:18Z","abstract_excerpt":"An axis-parallel $b$-dimensional box is a Cartesian product $R_1\\times R_2\\times...\\times R_b$ where $R_i$ is a closed interval of the form $[a_i,b_i]$ on the real line. For a graph $G$, its \\emph{boxicity} box(G) is the minimum dimension $b$, such that $G$ is representable as the intersection graph of boxes in $b$-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3175","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":"0806.3175","created_at":"2026-05-18T03:56:24.680661+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.3175v2","created_at":"2026-05-18T03:56:24.680661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3175","created_at":"2026-05-18T03:56:24.680661+00:00"},{"alias_kind":"pith_short_12","alias_value":"YC62AJGDBHJ3","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"YC62AJGDBHJ3EFK7","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"YC62AJGD","created_at":"2026-05-18T12:25:58.018023+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/YC62AJGDBHJ3EFK7Z5U43VO2QE","json":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE.json","graph_json":"https://pith.science/api/pith-number/YC62AJGDBHJ3EFK7Z5U43VO2QE/graph.json","events_json":"https://pith.science/api/pith-number/YC62AJGDBHJ3EFK7Z5U43VO2QE/events.json","paper":"https://pith.science/paper/YC62AJGD"},"agent_actions":{"view_html":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE","download_json":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE.json","view_paper":"https://pith.science/paper/YC62AJGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.3175&json=true","fetch_graph":"https://pith.science/api/pith-number/YC62AJGDBHJ3EFK7Z5U43VO2QE/graph.json","fetch_events":"https://pith.science/api/pith-number/YC62AJGDBHJ3EFK7Z5U43VO2QE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE/action/storage_attestation","attest_author":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE/action/author_attestation","sign_citation":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE/action/citation_signature","submit_replication":"https://pith.science/pith/YC62AJGDBHJ3EFK7Z5U43VO2QE/action/replication_record"}},"created_at":"2026-05-18T03:56:24.680661+00:00","updated_at":"2026-05-18T03:56:24.680661+00:00"}