{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AXEDBCHN7S72LCPNPTXAMYIVVH","short_pith_number":"pith:AXEDBCHN","canonical_record":{"source":{"id":"1605.01978","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T15:46:28Z","cross_cats_sorted":[],"title_canon_sha256":"ad0f509593c2b755e0e15ac8aeb8b51ceb5a8123066b6c68174237efbac2cf80","abstract_canon_sha256":"1080555c6d2fc164c30d3451de562994f5b46983a4a03f8ec691afab3e83aae4"},"schema_version":"1.0"},"canonical_sha256":"05c83088edfcbfa589ed7cee066115a9c7ab73ce3a2c85ee4531263d5b87b79e","source":{"kind":"arxiv","id":"1605.01978","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01978","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01978v4","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01978","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"AXEDBCHN7S72","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AXEDBCHN7S72LCPN","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AXEDBCHN","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AXEDBCHN7S72LCPNPTXAMYIVVH","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01978","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T15:46:28Z","cross_cats_sorted":[],"title_canon_sha256":"ad0f509593c2b755e0e15ac8aeb8b51ceb5a8123066b6c68174237efbac2cf80","abstract_canon_sha256":"1080555c6d2fc164c30d3451de562994f5b46983a4a03f8ec691afab3e83aae4"},"schema_version":"1.0"},"canonical_sha256":"05c83088edfcbfa589ed7cee066115a9c7ab73ce3a2c85ee4531263d5b87b79e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:24.705862Z","signature_b64":"pIfY0/D3epPEvVLiV0fEWG8g5qNAz95EJRCxOAcQfKfdwqF3g00ciCULP2kyfUw691sq7fhcy1DZIv7Z045kCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05c83088edfcbfa589ed7cee066115a9c7ab73ce3a2c85ee4531263d5b87b79e","last_reissued_at":"2026-05-18T00:49:24.705102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:24.705102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01978","source_version":4,"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-18T00:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rYVi+a3K5u1aRVYnPX+CJVCAzhwEZ+xegVt3q0U3a+7wtiDZJUH4bNhhhDbZjaWW+qwnaes2ZnDssrTtuLeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:03:37.085121Z"},"content_sha256":"3d1b0368591d0a1c9219561b60f298cbdbc16c3463784fa56e74346e96749245","schema_version":"1.0","event_id":"sha256:3d1b0368591d0a1c9219561b60f298cbdbc16c3463784fa56e74346e96749245"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AXEDBCHN7S72LCPNPTXAMYIVVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inertial lower bound for the chromatic number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clive Elphick, Pawel Wocjan","submitted_at":"2016-05-06T15:46:28Z","abstract_excerpt":"Let $\\chi(G$) and $\\chi_f(G)$ denote the chromatic and fractional chromatic numbers of a graph $G$, and let $(n^+ , n^0 , n^-)$ denote the inertia of $G$. We prove that:\n  \\[ 1 + \\max\\left(\\frac{n^+}{n^-} , \\frac{n^-}{n^+}\\right) \\le \\chi(G) \\mbox{ and conjecture that } 1 + \\max\\left(\\frac{n^+}{n^-} , \\frac{n^-}{n^+}\\right) \\le \\chi_f(G) \\]\n  We investigate extremal graphs for these bounds and demonstrate that this inertial bound is not a lower bound for the vector chromatic number. We conclude with a discussion of asymmetry between $n^+$ and $n^-$, including some Nordhaus-Gaddum bounds for in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01978","kind":"arxiv","version":4},"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-18T00:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ie+30HEs7TsosLpplKDF506RntcW0VjMpaKV2FG74pSUtIdIcl/ij/m9UWrmcP0lxIrFpEC7YzOmK2LxPDouDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:03:37.085781Z"},"content_sha256":"1decbc1537dcfe846bfee18189dfbef3358dff701a5d778ae2269798a0b0d1b2","schema_version":"1.0","event_id":"sha256:1decbc1537dcfe846bfee18189dfbef3358dff701a5d778ae2269798a0b0d1b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXEDBCHN7S72LCPNPTXAMYIVVH/bundle.json","state_url":"https://pith.science/pith/AXEDBCHN7S72LCPNPTXAMYIVVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXEDBCHN7S72LCPNPTXAMYIVVH/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-05-27T21:03:37Z","links":{"resolver":"https://pith.science/pith/AXEDBCHN7S72LCPNPTXAMYIVVH","bundle":"https://pith.science/pith/AXEDBCHN7S72LCPNPTXAMYIVVH/bundle.json","state":"https://pith.science/pith/AXEDBCHN7S72LCPNPTXAMYIVVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXEDBCHN7S72LCPNPTXAMYIVVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AXEDBCHN7S72LCPNPTXAMYIVVH","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":"1080555c6d2fc164c30d3451de562994f5b46983a4a03f8ec691afab3e83aae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T15:46:28Z","title_canon_sha256":"ad0f509593c2b755e0e15ac8aeb8b51ceb5a8123066b6c68174237efbac2cf80"},"schema_version":"1.0","source":{"id":"1605.01978","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01978","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01978v4","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01978","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"AXEDBCHN7S72","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AXEDBCHN7S72LCPN","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AXEDBCHN","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:1decbc1537dcfe846bfee18189dfbef3358dff701a5d778ae2269798a0b0d1b2","target":"graph","created_at":"2026-05-18T00:49:24Z","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":"Let $\\chi(G$) and $\\chi_f(G)$ denote the chromatic and fractional chromatic numbers of a graph $G$, and let $(n^+ , n^0 , n^-)$ denote the inertia of $G$. We prove that:\n  \\[ 1 + \\max\\left(\\frac{n^+}{n^-} , \\frac{n^-}{n^+}\\right) \\le \\chi(G) \\mbox{ and conjecture that } 1 + \\max\\left(\\frac{n^+}{n^-} , \\frac{n^-}{n^+}\\right) \\le \\chi_f(G) \\]\n  We investigate extremal graphs for these bounds and demonstrate that this inertial bound is not a lower bound for the vector chromatic number. We conclude with a discussion of asymmetry between $n^+$ and $n^-$, including some Nordhaus-Gaddum bounds for in","authors_text":"Clive Elphick, Pawel Wocjan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T15:46:28Z","title":"An inertial lower bound for the chromatic number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01978","kind":"arxiv","version":4},"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:3d1b0368591d0a1c9219561b60f298cbdbc16c3463784fa56e74346e96749245","target":"record","created_at":"2026-05-18T00:49:24Z","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":"1080555c6d2fc164c30d3451de562994f5b46983a4a03f8ec691afab3e83aae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T15:46:28Z","title_canon_sha256":"ad0f509593c2b755e0e15ac8aeb8b51ceb5a8123066b6c68174237efbac2cf80"},"schema_version":"1.0","source":{"id":"1605.01978","kind":"arxiv","version":4}},"canonical_sha256":"05c83088edfcbfa589ed7cee066115a9c7ab73ce3a2c85ee4531263d5b87b79e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05c83088edfcbfa589ed7cee066115a9c7ab73ce3a2c85ee4531263d5b87b79e","first_computed_at":"2026-05-18T00:49:24.705102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:24.705102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIfY0/D3epPEvVLiV0fEWG8g5qNAz95EJRCxOAcQfKfdwqF3g00ciCULP2kyfUw691sq7fhcy1DZIv7Z045kCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:24.705862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01978","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d1b0368591d0a1c9219561b60f298cbdbc16c3463784fa56e74346e96749245","sha256:1decbc1537dcfe846bfee18189dfbef3358dff701a5d778ae2269798a0b0d1b2"],"state_sha256":"dd301c7a23e286510b149dd96aadc4cc6f10345ab2d3bfc1345eba50a8b43364"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmsgfa3d+2/FTioylmw+o8mXk5bxOenuxoW4FlHcsPwQAnJ7/r/0LEafHVuB4Rt+0+T1K1WYD1mkBZr41QUgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:03:37.089469Z","bundle_sha256":"ef4c6489be05189971864a81a9d14f696069fe29d52c37a30fd611f96a0b36a7"}}