{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6ASGKM7H3T3AEDNKUUX6IFIHMS","short_pith_number":"pith:6ASGKM7H","canonical_record":{"source":{"id":"1009.4471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-22T20:24:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8e16b469fb04a43d22850d447c5490f01b5bc7260ae67a33cc2bee0630d7562a","abstract_canon_sha256":"3a93a42b3a414879065312221f6ff8e09576ad855e4411b62774c8c1ff17b0fe"},"schema_version":"1.0"},"canonical_sha256":"f0246533e7dcf6020daaa52fe415076498fc99ecf506e50672d7da982d9aa390","source":{"kind":"arxiv","id":"1009.4471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4471","created_at":"2026-05-18T04:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4471v1","created_at":"2026-05-18T04:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4471","created_at":"2026-05-18T04:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"6ASGKM7H3T3A","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6ASGKM7H3T3AEDNK","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6ASGKM7H","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6ASGKM7H3T3AEDNKUUX6IFIHMS","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-22T20:24:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8e16b469fb04a43d22850d447c5490f01b5bc7260ae67a33cc2bee0630d7562a","abstract_canon_sha256":"3a93a42b3a414879065312221f6ff8e09576ad855e4411b62774c8c1ff17b0fe"},"schema_version":"1.0"},"canonical_sha256":"f0246533e7dcf6020daaa52fe415076498fc99ecf506e50672d7da982d9aa390","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:30.425713Z","signature_b64":"KVac/ie4zDnkl8p0bCRk6BCbdC8VHMtpoe4lDama8fma4AHzx2P6lr9Ykt0dkpFBXh+1ntQNTWeoxQBSMlcsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0246533e7dcf6020daaa52fe415076498fc99ecf506e50672d7da982d9aa390","last_reissued_at":"2026-05-18T04:40:30.424933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:30.424933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4471","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-18T04:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0EKPbIaOB+r4DTcLUd2nzWVvnsdQpIMkghcwjSrHgrJyRH4EmL7Dp1o9NdyEpPglgWdSOzuCUMP3R02Q8e2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:27:42.880556Z"},"content_sha256":"c01729c7c55456c37da5a2935a75663bcad17dea6443bb9cc45b31ee5d6c786e","schema_version":"1.0","event_id":"sha256:c01729c7c55456c37da5a2935a75663bcad17dea6443bb9cc45b31ee5d6c786e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6ASGKM7H3T3AEDNKUUX6IFIHMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boxicity of Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"L. Sunil Chandran, Naveen Sivadasan, Rogers Mathew","submitted_at":"2010-09-22T20:24:06Z","abstract_excerpt":"Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2\\Delta(\\lceil log_2(log_2(\\Delta)) \\rceil + 3) + 1, where \\Delta denotes the maximum degree of G. Since \\Delta <= 2(\\chi - 1), for any line graph G with chromatic number \\chi, box(G) = O(\\chi log_2(log_2(\\chi))). For the d-dimensional hypercube H_d, we prove that box(H_d) >= (\\lceil log_2(log_2(d)) \\rceil + 1)/2. The question of finding a non-trivial lower bound for box(H_d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4471","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-18T04:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6Z1fJyjgcEP2ihXwE06wM65vWQYrcIynphE5DfbEg44rs1nB2QUnPotk59enBbb5RQvhVzB4WOKvTdVEhmGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:27:42.880900Z"},"content_sha256":"45e392cbe13648a14db410601c4d3982153a1dce76633629761c140b4879ad3c","schema_version":"1.0","event_id":"sha256:45e392cbe13648a14db410601c4d3982153a1dce76633629761c140b4879ad3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ASGKM7H3T3AEDNKUUX6IFIHMS/bundle.json","state_url":"https://pith.science/pith/6ASGKM7H3T3AEDNKUUX6IFIHMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ASGKM7H3T3AEDNKUUX6IFIHMS/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-01T10:27:42Z","links":{"resolver":"https://pith.science/pith/6ASGKM7H3T3AEDNKUUX6IFIHMS","bundle":"https://pith.science/pith/6ASGKM7H3T3AEDNKUUX6IFIHMS/bundle.json","state":"https://pith.science/pith/6ASGKM7H3T3AEDNKUUX6IFIHMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ASGKM7H3T3AEDNKUUX6IFIHMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6ASGKM7H3T3AEDNKUUX6IFIHMS","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":"3a93a42b3a414879065312221f6ff8e09576ad855e4411b62774c8c1ff17b0fe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-22T20:24:06Z","title_canon_sha256":"8e16b469fb04a43d22850d447c5490f01b5bc7260ae67a33cc2bee0630d7562a"},"schema_version":"1.0","source":{"id":"1009.4471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4471","created_at":"2026-05-18T04:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4471v1","created_at":"2026-05-18T04:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4471","created_at":"2026-05-18T04:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"6ASGKM7H3T3A","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6ASGKM7H3T3AEDNK","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6ASGKM7H","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:45e392cbe13648a14db410601c4d3982153a1dce76633629761c140b4879ad3c","target":"graph","created_at":"2026-05-18T04:40:30Z","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":"Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2\\Delta(\\lceil log_2(log_2(\\Delta)) \\rceil + 3) + 1, where \\Delta denotes the maximum degree of G. Since \\Delta <= 2(\\chi - 1), for any line graph G with chromatic number \\chi, box(G) = O(\\chi log_2(log_2(\\chi))). For the d-dimensional hypercube H_d, we prove that box(H_d) >= (\\lceil log_2(log_2(d)) \\rceil + 1)/2. The question of finding a non-trivial lower bound for box(H_d","authors_text":"L. Sunil Chandran, Naveen Sivadasan, Rogers Mathew","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-22T20:24:06Z","title":"Boxicity of Line Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4471","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:c01729c7c55456c37da5a2935a75663bcad17dea6443bb9cc45b31ee5d6c786e","target":"record","created_at":"2026-05-18T04:40:30Z","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":"3a93a42b3a414879065312221f6ff8e09576ad855e4411b62774c8c1ff17b0fe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-22T20:24:06Z","title_canon_sha256":"8e16b469fb04a43d22850d447c5490f01b5bc7260ae67a33cc2bee0630d7562a"},"schema_version":"1.0","source":{"id":"1009.4471","kind":"arxiv","version":1}},"canonical_sha256":"f0246533e7dcf6020daaa52fe415076498fc99ecf506e50672d7da982d9aa390","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0246533e7dcf6020daaa52fe415076498fc99ecf506e50672d7da982d9aa390","first_computed_at":"2026-05-18T04:40:30.424933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:30.424933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KVac/ie4zDnkl8p0bCRk6BCbdC8VHMtpoe4lDama8fma4AHzx2P6lr9Ykt0dkpFBXh+1ntQNTWeoxQBSMlcsAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:30.425713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c01729c7c55456c37da5a2935a75663bcad17dea6443bb9cc45b31ee5d6c786e","sha256:45e392cbe13648a14db410601c4d3982153a1dce76633629761c140b4879ad3c"],"state_sha256":"063aaa7a054a27f7e81b3d36792e1daf255e391bd403319514c54873423de787"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOx3EMwQ4lqwFUZp/TmLQwINDEnIrV3o4KhwnXevJ4wpEzUdp6XJ8ha60UaaDIixuOYkAy53ApLCqkdpV4UyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:27:42.882765Z","bundle_sha256":"697ce30322b7d0ee883601378ff021aaeff2d910e473e261cee764ba82fa9bcd"}}