{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD","short_pith_number":"pith:KK2MGNZ5","schema_version":"1.0","canonical_sha256":"52b4c3373d43fd5f00ccfe58d9277998e4383691f53398ed94809dc039ee62af","source":{"kind":"arxiv","id":"1812.02613","version":3},"attestation_state":"computed","paper":{"title":"More Tales of Hoffman: bounds for the vector 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, David Anekstein, Pawel Wocjan","submitted_at":"2018-12-06T15:43:17Z","abstract_excerpt":"Let $\\chi(G)$ denote the chromatic number of a graph and $\\chi_v(G)$ denote the vector chromatic number. For all graphs $\\chi_v(G) \\le \\chi(G)$ and for some graphs $\\chi_v(G) \\ll \\chi(G)$. Galtman proved that Hoffman's well-known lower bound for $\\chi(G)$ is in fact a lower bound for $\\chi_v(G)$. We prove that two more spectral lower bounds for $\\chi(G)$ are also lower bounds for $\\chi_v(G)$. We then use one of these bounds to derive a new characterization of $\\chi_v(G)$."},"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":"1812.02613","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-06T15:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"2d3ba4b7f56cba95d2616db2afc3dd943f6cc213c029c2ac514cd4bdb77a0e5a","abstract_canon_sha256":"f2c96e16f54cad43aec3080cce02659fdce5bf2667f31e7823fb145da40d1a13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:55.790003Z","signature_b64":"fMgTc46W6m14SxoDoS3bKpp8M6TUVcjNOCz59DVBiVNU7UsPXNls/BU0b5ERWELbwi/Fwg5Ka3VTsbk9y6viAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b4c3373d43fd5f00ccfe58d9277998e4383691f53398ed94809dc039ee62af","last_reissued_at":"2026-07-05T00:47:55.789620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:55.789620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More Tales of Hoffman: bounds for the vector 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, David Anekstein, Pawel Wocjan","submitted_at":"2018-12-06T15:43:17Z","abstract_excerpt":"Let $\\chi(G)$ denote the chromatic number of a graph and $\\chi_v(G)$ denote the vector chromatic number. For all graphs $\\chi_v(G) \\le \\chi(G)$ and for some graphs $\\chi_v(G) \\ll \\chi(G)$. Galtman proved that Hoffman's well-known lower bound for $\\chi(G)$ is in fact a lower bound for $\\chi_v(G)$. We prove that two more spectral lower bounds for $\\chi(G)$ are also lower bounds for $\\chi_v(G)$. We then use one of these bounds to derive a new characterization of $\\chi_v(G)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02613","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1812.02613/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1812.02613","created_at":"2026-07-05T00:47:55.789669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02613v3","created_at":"2026-07-05T00:47:55.789669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02613","created_at":"2026-07-05T00:47:55.789669+00:00"},{"alias_kind":"pith_short_12","alias_value":"KK2MGNZ5IP6V","created_at":"2026-07-05T00:47:55.789669+00:00"},{"alias_kind":"pith_short_16","alias_value":"KK2MGNZ5IP6V6AGM","created_at":"2026-07-05T00:47:55.789669+00:00"},{"alias_kind":"pith_short_8","alias_value":"KK2MGNZ5","created_at":"2026-07-05T00:47:55.789669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08184","citing_title":"Conic programming to understand sums of squares of eigenvalues of graphs","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD","json":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD.json","graph_json":"https://pith.science/api/pith-number/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/graph.json","events_json":"https://pith.science/api/pith-number/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/events.json","paper":"https://pith.science/paper/KK2MGNZ5"},"agent_actions":{"view_html":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD","download_json":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD.json","view_paper":"https://pith.science/paper/KK2MGNZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02613&json=true","fetch_graph":"https://pith.science/api/pith-number/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/graph.json","fetch_events":"https://pith.science/api/pith-number/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/action/storage_attestation","attest_author":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/action/author_attestation","sign_citation":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/action/citation_signature","submit_replication":"https://pith.science/pith/KK2MGNZ5IP6V6AGM7ZMNSJ3ZTD/action/replication_record"}},"created_at":"2026-07-05T00:47:55.789669+00:00","updated_at":"2026-07-05T00:47:55.789669+00:00"}