{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Q3YQHM4RCIP3S6KGZVDKYFVTGS","short_pith_number":"pith:Q3YQHM4R","schema_version":"1.0","canonical_sha256":"86f103b391121fb97946cd46ac16b334bd4cff475a42dd5ec1e18eb4375a5495","source":{"kind":"arxiv","id":"1402.4992","version":1},"attestation_state":"computed","paper":{"title":"Structural parameterizations for boxicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Henning Bruhn, Morgan Chopin, Oliver Schaudt","submitted_at":"2014-02-20T13:18:00Z","abstract_excerpt":"The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$-dimensional boxes. Boxicity, the problem of deciding whether a given graph $G$ has boxicity at most $d$, is NP-complete for every fixed $d \\ge 2$. We show that boxicity is fixed-parameter tractable when parameterized by the cluster vertex deletion number of the input graph. This generalizes the result of Adiga et al., that boxicity is fixed-parameter tractable in the vertex cover number.\n  Moreover, we show that boxicity admits an additive $1$-approximation when parameterized by the"},"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":"1402.4992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-20T13:18:00Z","cross_cats_sorted":[],"title_canon_sha256":"abb19d07705d48c8cfad548a8b47936b4815161933791f7d526815b8572d80ef","abstract_canon_sha256":"033fac7f782f0df19cddc837fff3f42957c27101181e7b6dd3b39a4e1867c8ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:31.433950Z","signature_b64":"L0SejDkWEh0s7VwA7bQkMMn3Cz9aNfyIO4pidZYdN9dr93hM8onL2HT9RG/a+0DN9io3Fn6eMwWrsEGd68oLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86f103b391121fb97946cd46ac16b334bd4cff475a42dd5ec1e18eb4375a5495","last_reissued_at":"2026-05-18T02:58:31.433379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:31.433379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural parameterizations for boxicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Henning Bruhn, Morgan Chopin, Oliver Schaudt","submitted_at":"2014-02-20T13:18:00Z","abstract_excerpt":"The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$-dimensional boxes. Boxicity, the problem of deciding whether a given graph $G$ has boxicity at most $d$, is NP-complete for every fixed $d \\ge 2$. We show that boxicity is fixed-parameter tractable when parameterized by the cluster vertex deletion number of the input graph. This generalizes the result of Adiga et al., that boxicity is fixed-parameter tractable in the vertex cover number.\n  Moreover, we show that boxicity admits an additive $1$-approximation when parameterized by the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4992","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":""},"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":"1402.4992","created_at":"2026-05-18T02:58:31.433466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4992v1","created_at":"2026-05-18T02:58:31.433466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4992","created_at":"2026-05-18T02:58:31.433466+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3YQHM4RCIP3","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3YQHM4RCIP3S6KG","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3YQHM4R","created_at":"2026-05-18T12:28:43.426989+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/Q3YQHM4RCIP3S6KGZVDKYFVTGS","json":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS.json","graph_json":"https://pith.science/api/pith-number/Q3YQHM4RCIP3S6KGZVDKYFVTGS/graph.json","events_json":"https://pith.science/api/pith-number/Q3YQHM4RCIP3S6KGZVDKYFVTGS/events.json","paper":"https://pith.science/paper/Q3YQHM4R"},"agent_actions":{"view_html":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS","download_json":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS.json","view_paper":"https://pith.science/paper/Q3YQHM4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4992&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3YQHM4RCIP3S6KGZVDKYFVTGS/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3YQHM4RCIP3S6KGZVDKYFVTGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS/action/storage_attestation","attest_author":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS/action/author_attestation","sign_citation":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS/action/citation_signature","submit_replication":"https://pith.science/pith/Q3YQHM4RCIP3S6KGZVDKYFVTGS/action/replication_record"}},"created_at":"2026-05-18T02:58:31.433466+00:00","updated_at":"2026-05-18T02:58:31.433466+00:00"}