{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NILV2P3JDZZNOGBBAKI4SUSCDH","short_pith_number":"pith:NILV2P3J","schema_version":"1.0","canonical_sha256":"6a175d3f691e72d718210291c9524219ca37fd98cc31dea7afac26f463551c31","source":{"kind":"arxiv","id":"1402.6310","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Cubicity of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Deepak Rajendraprasad, Jasine Babu, L Sunil Chandran, Manu Basavaraju, Naveen Sivadasan","submitted_at":"2014-02-25T20:42:16Z","abstract_excerpt":"Cubicity of a graph $G$ is the smallest dimension $d$, for which $G$ is a unit disc graph in ${\\mathbb{R}}^d$, under the $l^\\infty$ metric, i.e. $G$ can be represented as an intersection graph of $d$-dimensional (axis-parallel) unit hypercubes. We call such an intersection representation a $d$-dimensional cube representation of $G$. Computing cubicity is known to be inapproximable in polynomial time, within an $O(n^{1-\\epsilon})$ factor for any $\\epsilon >0$, unless NP=ZPP.\n  In this paper, we present a randomized algorithm that runs in polynomial time and computes cube representations of tree"},"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.6310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-25T20:42:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b7c3883793193ff4a3153b9c7d51dbc8a25b82ad6021bd57aff6efff53e6be79","abstract_canon_sha256":"c00729a4eafe03c05b5f66f414bb31012e3625aecc31f7bb7d2f4c7476d8e0f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.216044Z","signature_b64":"N+04WKK6SCCXFZSMnp7uLyuCfD2dMOTpkj23mTwYyp9mPBWJq1pxFS+tL5bhh6VsCKz2D8tmZJkdV0hlV633Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a175d3f691e72d718210291c9524219ca37fd98cc31dea7afac26f463551c31","last_reissued_at":"2026-05-18T02:57:51.215457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.215457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Cubicity of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Deepak Rajendraprasad, Jasine Babu, L Sunil Chandran, Manu Basavaraju, Naveen Sivadasan","submitted_at":"2014-02-25T20:42:16Z","abstract_excerpt":"Cubicity of a graph $G$ is the smallest dimension $d$, for which $G$ is a unit disc graph in ${\\mathbb{R}}^d$, under the $l^\\infty$ metric, i.e. $G$ can be represented as an intersection graph of $d$-dimensional (axis-parallel) unit hypercubes. We call such an intersection representation a $d$-dimensional cube representation of $G$. Computing cubicity is known to be inapproximable in polynomial time, within an $O(n^{1-\\epsilon})$ factor for any $\\epsilon >0$, unless NP=ZPP.\n  In this paper, we present a randomized algorithm that runs in polynomial time and computes cube representations of tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6310","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.6310","created_at":"2026-05-18T02:57:51.215563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.6310v1","created_at":"2026-05-18T02:57:51.215563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6310","created_at":"2026-05-18T02:57:51.215563+00:00"},{"alias_kind":"pith_short_12","alias_value":"NILV2P3JDZZN","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NILV2P3JDZZNOGBB","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NILV2P3J","created_at":"2026-05-18T12:28:41.024544+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/NILV2P3JDZZNOGBBAKI4SUSCDH","json":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH.json","graph_json":"https://pith.science/api/pith-number/NILV2P3JDZZNOGBBAKI4SUSCDH/graph.json","events_json":"https://pith.science/api/pith-number/NILV2P3JDZZNOGBBAKI4SUSCDH/events.json","paper":"https://pith.science/paper/NILV2P3J"},"agent_actions":{"view_html":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH","download_json":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH.json","view_paper":"https://pith.science/paper/NILV2P3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.6310&json=true","fetch_graph":"https://pith.science/api/pith-number/NILV2P3JDZZNOGBBAKI4SUSCDH/graph.json","fetch_events":"https://pith.science/api/pith-number/NILV2P3JDZZNOGBBAKI4SUSCDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/action/storage_attestation","attest_author":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/action/author_attestation","sign_citation":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/action/citation_signature","submit_replication":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/action/replication_record"}},"created_at":"2026-05-18T02:57:51.215563+00:00","updated_at":"2026-05-18T02:57:51.215563+00:00"}