{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RHIJJ5FWQTU4IQSMSVA5UNK5FK","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":"759af3813a5f57e5ea09469f9a9dea9d2aaf196e26ca55aac2e2c39d221e88ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T07:20:01Z","title_canon_sha256":"3cc95fc2df553143b2f74257729a40b4ef834a251ec2fd5cac6ece5bf4b50237"},"schema_version":"1.0","source":{"id":"1404.7261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7261","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7261v1","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7261","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"RHIJJ5FWQTU4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RHIJJ5FWQTU4IQSM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RHIJJ5FW","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:2a642df2637aa1e6ed342ddba8266aedeff12bd48d14dfed4dbc78b646ad7d84","target":"graph","created_at":"2026-05-18T02:52:57Z","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":"The boxicity (respectively cubicity) of a graph $G$ is the minimum non-negative integer $k$, such that $G$ can be represented as an intersection graph of axis-parallel $k$-dimensional boxes (respectively $k$-dimensional unit cubes) and is denoted by $box(G)$ (respectively $cub(G)$). It was shown by Adiga and Chandran (Journal of Graph Theory, 65(4), 2010) that for any graph $G$, $cub(G) \\le$ box$(G) \\left \\lceil \\log_2 \\alpha \\right \\rceil$, where $\\alpha = \\alpha(G)$ is the cardinality of the maximum independent set in $G$. In this note we show that $cub(G) \\le 2 \\left \\lceil \\log_2 \\chi(G) \\","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Rogers Mathew","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T07:20:01Z","title":"Upper bound on cubicity in terms of boxicity for graphs of low chromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7261","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:0151df2d644345d549b62947af5614e7d790e065e6da372fc6a6a99e2ec6fbab","target":"record","created_at":"2026-05-18T02:52:57Z","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":"759af3813a5f57e5ea09469f9a9dea9d2aaf196e26ca55aac2e2c39d221e88ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T07:20:01Z","title_canon_sha256":"3cc95fc2df553143b2f74257729a40b4ef834a251ec2fd5cac6ece5bf4b50237"},"schema_version":"1.0","source":{"id":"1404.7261","kind":"arxiv","version":1}},"canonical_sha256":"89d094f4b684e9c4424c9541da355d2a825be72279fc60a1f3d441868e1ac157","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89d094f4b684e9c4424c9541da355d2a825be72279fc60a1f3d441868e1ac157","first_computed_at":"2026-05-18T02:52:57.091233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:57.091233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YozJVoMnAed8jZdzMXmOozzdClifW7n8IgNoUBF9l63emXA0y8bYtuAunKigAYvsEjXZWIk75sR4qv/D+4j1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:57.091818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0151df2d644345d549b62947af5614e7d790e065e6da372fc6a6a99e2ec6fbab","sha256:2a642df2637aa1e6ed342ddba8266aedeff12bd48d14dfed4dbc78b646ad7d84"],"state_sha256":"08c88723f30bdd703fa65eccd77ac2cfe4921c40524044a30b3727c98bdabb34"}