{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NILV2P3JDZZNOGBBAKI4SUSCDH","short_pith_number":"pith:NILV2P3J","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"},"canonical_sha256":"6a175d3f691e72d718210291c9524219ca37fd98cc31dea7afac26f463551c31","source":{"kind":"arxiv","id":"1402.6310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6310","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6310v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6310","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"NILV2P3JDZZN","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NILV2P3JDZZNOGBB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NILV2P3J","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NILV2P3JDZZNOGBBAKI4SUSCDH","target":"record","payload":{"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"},"canonical_sha256":"6a175d3f691e72d718210291c9524219ca37fd98cc31dea7afac26f463551c31","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"},"source_kind":"arxiv","source_id":"1402.6310","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vi1XRVuWGdTb3lNL8lcXlJVMQMq3lKiTKmWpGz3gRqKK658zHlFa2h/+OdrGUOBsA5/VBi53YwwRtyxlu6mpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:03:43.543962Z"},"content_sha256":"91d3ec37c7d06ed30aedad85d95192b748700749c85017434401c3fec820c544","schema_version":"1.0","event_id":"sha256:91d3ec37c7d06ed30aedad85d95192b748700749c85017434401c3fec820c544"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NILV2P3JDZZNOGBBAKI4SUSCDH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZdTbOasWkOA8uXBJic7quZ2TGxPu70azwoM0hwj2Uohj+yOkTrkiUv62L2xehQF3J8Ag3HQxI5hsXNZ3HCuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:03:43.544309Z"},"content_sha256":"1d0c1d341e1e7c1cb6341161430e596481e68377d9376daef6dcdcdabb0d7a7b","schema_version":"1.0","event_id":"sha256:1d0c1d341e1e7c1cb6341161430e596481e68377d9376daef6dcdcdabb0d7a7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/bundle.json","state_url":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T11:03:43Z","links":{"resolver":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH","bundle":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/bundle.json","state":"https://pith.science/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NILV2P3JDZZNOGBBAKI4SUSCDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NILV2P3JDZZNOGBBAKI4SUSCDH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c00729a4eafe03c05b5f66f414bb31012e3625aecc31f7bb7d2f4c7476d8e0f1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-25T20:42:16Z","title_canon_sha256":"b7c3883793193ff4a3153b9c7d51dbc8a25b82ad6021bd57aff6efff53e6be79"},"schema_version":"1.0","source":{"id":"1402.6310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6310","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6310v1","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6310","created_at":"2026-05-18T02:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"NILV2P3JDZZN","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NILV2P3JDZZNOGBB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NILV2P3J","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:1d0c1d341e1e7c1cb6341161430e596481e68377d9376daef6dcdcdabb0d7a7b","target":"graph","created_at":"2026-05-18T02:57:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Deepak Rajendraprasad, Jasine Babu, L Sunil Chandran, Manu Basavaraju, Naveen Sivadasan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-25T20:42:16Z","title":"Approximating the Cubicity of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6310","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:91d3ec37c7d06ed30aedad85d95192b748700749c85017434401c3fec820c544","target":"record","created_at":"2026-05-18T02:57:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c00729a4eafe03c05b5f66f414bb31012e3625aecc31f7bb7d2f4c7476d8e0f1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-25T20:42:16Z","title_canon_sha256":"b7c3883793193ff4a3153b9c7d51dbc8a25b82ad6021bd57aff6efff53e6be79"},"schema_version":"1.0","source":{"id":"1402.6310","kind":"arxiv","version":1}},"canonical_sha256":"6a175d3f691e72d718210291c9524219ca37fd98cc31dea7afac26f463551c31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a175d3f691e72d718210291c9524219ca37fd98cc31dea7afac26f463551c31","first_computed_at":"2026-05-18T02:57:51.215457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:51.215457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N+04WKK6SCCXFZSMnp7uLyuCfD2dMOTpkj23mTwYyp9mPBWJq1pxFS+tL5bhh6VsCKz2D8tmZJkdV0hlV633Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:51.216044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91d3ec37c7d06ed30aedad85d95192b748700749c85017434401c3fec820c544","sha256:1d0c1d341e1e7c1cb6341161430e596481e68377d9376daef6dcdcdabb0d7a7b"],"state_sha256":"20e5241f0626273f8fc4fe72f7f6ba88c4a222f35a4721622900580487db35a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvERgB7QOZJz48n9iQBmcMbMnvmmp7NvtLf9sqDJbUIaikY5BNO7NjSG3QXABW8HAXAOeYOmj1BGZqLFL5LPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:03:43.546268Z","bundle_sha256":"64acb97c3c3bb8b0c90b823a83051dbba7154e52c6fe25b59cbc549ce3ecf7f5"}}